Multipartite entanglement verification resistant against dishonest parties.

@article{Pappa2012MultipartiteEV,
  title={Multipartite entanglement verification resistant against dishonest parties.},
  author={Anna Pappa and Andr{\'e} Chailloux and Stephanie Wehner and Eleni Diamanti and Iordanis Kerenidis},
  journal={Physical review letters},
  year={2012},
  volume={108 26},
  pages={
          260502
        }
}
Future quantum information networks will consist of quantum and classical agents, who have the ability to communicate in a variety of ways with trusted and untrusted parties and securely delegate computational tasks to untrusted large-scale quantum computing servers. Multipartite quantum entanglement is a fundamental resource for such a network and, hence, it is imperative to study the possibility of verifying a multipartite entanglement source in a way that is efficient and provides strong… 

Composable security for multipartite entanglement verification

The protocol is improved to make it more suitable for practical use in a quantum network and its security is studied in the Abstract Cryptography framework to highlight composability issues and avoid hidden assumptions.

Sharing Classical Secrets with Continuous-Variable Entanglement: Composable Security and Network Coding Advantage

This work establishes security in a composable framework and identifies a network topology, specifically a bottleneck network of lossy channels, and parameter regimes within the reach of present day experiments for which a multi-partite scheme outperforms the corresponding QKD based method in the asymptotic and finite-size setting.

Experimental verification of multipartite entanglement in quantum networks

A protocol is designed and experimentally demonstrated that allows any party in a network to check if a source is distributing a genuinely multipartite entangled state, even in the presence of untrusted parties, and remains secure against dishonest behaviour of the source and other parties.

Securing quantum networking tasks with multipartite Einstein-Podolsky-Rosen steering

This work shows that when one part of a quantum multidimensional system composed of a two-colorable graph state is attacked by an eavesdropper using a universal cloning machine, only one of the copy subsystems can exhibit multipartite EPR steering but not both, and secures both state sources and channels against cloning-based attacks for generic quantum networking tasks.

Quantum cryptographic primitives in realistic conditions

  • Anna Pappa
  • Computer Science
  • 2014
This thesis shows how to efficiently check whether a physical source can create multi-party entangled states and share them with many parties, some of which are dishonest and work with the source, which could prove essential for quantum computation between suspicious parties and could also facilitate the secure delegation of tasks to powerful untrusted quantum servers.

Practical secure quantum communications

  • E. Diamanti
  • Computer Science
    Europe Optics + Optoelectronics
  • 2015
Practical implementations of two central protocols for quantum network applications, namely key distribution and coin flipping, are reviewed, demonstrating the protocols with provable security over record long distances in optical fibers and assessing the performance of the systems as well as their limitations.

Anonymous and secret communication in quantum networks

It is demonstrated that quantum physics allows parties—besides communicating securely over a network—to also keep their identities secret, and an anonymous quantum conference key agreement is implemented by sharing multipartite entangled states in a quantum network.

Entanglement verification protocols for distributed systems based on the Quantum Recursive Network Architecture

This work defines and analyze two entanglement verification protocols based on teleportation (denoted as AC1 and AC2), characterized by increasing efficiency in terms of intrusion detection probability versus sacrificed quantum resources.

Anonymous Quantum Conference Key Agreement

A definition of anonymity for general protocols is provided and a CKA protocol that is provably anonymous under realistic adversarial scenarios is presented that is based on shared Greenberger-Horne-Zeilinger states.

Anonymous Conference Key Agreement in Quantum Networks

This paper provides the first protocol for Anonymous Quantum Conference Key Agreement and demonstrates it using four-photon Greenberger-Horne-Zeilinger ($\mathrm{GHZ}$) states.
...

References

SHOWING 1-10 OF 19 REFERENCES

I and i

There is, I think, something ethereal about i —the square root of minus one, which seems an odd beast at that time—an intruder hovering on the edge of reality.

A and V

Bell's theorem

This chapter discusses the result which has come to be known as ‘Bell’s Theorem’ but which Bell himself instead referred to as the ‘locality inequality theorem’.

Phys

  • Rev. Lett. 65, 1838
  • 1990

and G

  • J. Pryde, eprint: arXiv:1111.0739v1 [quant-ph]
  • 2011

Phys

  • Rev. A 77, 052327
  • 2008

Phys

  • Rev. A 76, 052116
  • 2007

Phys

  • Rev. Lett. 106, 250404
  • 2011

Physica D (Amsterdam) 120

  • 177
  • 1998

Phys

  • Rev. Lett. 86, 5188
  • 2001