• Corpus ID: 220546497

Anonymous Conference Key Agreement in Quantum Networks

@article{Hahn2020AnonymousCK,
  title={Anonymous Conference Key Agreement in Quantum Networks},
  author={Frederik Hahn and Jarn de Jong and Christoph Thalacker and B{\"u}lent Demirel and Stefanie Barz and Anna Pappa},
  journal={arXiv: Quantum Physics},
  year={2020}
}
  • F. Hahn, Jarn de Jong, Anna Pappa
  • Published 15 July 2020
  • Computer Science
  • arXiv: Quantum Physics
Quantum Conference Key Agreement (CKA) is a cryptographic effort of multiple parties to establish a shared secret key. While bipartite quantum key distribution protocols are also useful in the context of CKA, multipartite protocols allow for a more efficient generation of the necessary correlations and are therefore viewed favorably in the context of quantum networks. In future quantum networks, generating secret keys in an anonymous way is of tremendous importance for parties that do not only… 

Figures and Tables from this paper

Experimental implementation of secure anonymous protocols on an eight-user quantum key distribution network

TLDR
Five information-theoretically secure anonymity protocols are experimentally demonstrated on an eight user city-wide quantum network using polarisation entangled photon pairs to enhance the functionality of any fully-connected Quantum Key Distribution network without trusted nodes.

Entropy Bounds for Multiparty Device-Independent Cryptography

An analytical procedure to certify secret randomness, occurring when measurement outcomes are non-locally correlated, is developed for networks consisting of three or more parties.

References

SHOWING 1-10 OF 19 REFERENCES

Quantum Conference Key Agreement: A Review

TLDR
The existing quantum CKA protocols based on multipartite entanglement are reviewed, both in the device‐dependent and the device-independent scenario.

Experimental quantum conference key agreement

TLDR
This work demonstrates quantum conference key agreement, a cryptography protocol leveraging multipartite entanglement to efficiently create identical keys between N users with up to N-1 rate advantage in constrained networks, and highlights a previously unexplored protocol tailored for multinode networks leveraging low-noise, long-distance transmission of GHZ states.

Multi-partite entanglement can speed up quantum key distribution in networks

TLDR
This work analyzes the security of a protocol for establishing a common secret key between N parties (i.e. a conference key), using resource states with genuine N-partite entanglement, regarding the required resources, achievable secret key rates and threshold qubit error rates.

Multipartite entanglement verification resistant against dishonest parties.

TLDR
This Letter shows how an agent of a quantum network can perform a distributed verification of a source creating multipartite Greenberger-Horne-Zeilinger states with minimal resources, which is, nevertheless, resistant against any number of dishonest parties.

Experimental verification of multipartite entanglement in quantum networks

TLDR
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.

Quantum cryptography: Public key distribution and coin tossing

Anonymous transmission in a noisy quantum network using the W state

TLDR
This work presents a protocol that accomplishes this task using the W state and analyzes its performance in a quantum network where some form of noise is present, and proves the security of the protocol in a semiactive adversary scenario.

Quantum network routing and local complementation

TLDR
This paper proposes a more general method for establishing EPR pairs in arbitrary networks that uses a graph state instead of maximally entangled pairs to achieve long-distance simultaneous communication, and demonstrates how graph-theoretic tools, and specifically local complementation, help decrease the number of required measurements compared to usual methods applied in repeater schemes.

Unconditional Byzantine Agreement and Multi-party Computation Secure against Dishonest Minorities from Scratch

TLDR
This paper shows that this bound can be improved - at the sole price that the adversary can prevent successful completion of the protocol, but in which case all players will have agreement about this fact.

Anonymity for Practical Quantum Networks.

TLDR
This work provides the first practical protocol for anonymous communication in realistic quantum networks, guaranteeing the anonymity of a sender and a receiver when a message is transmitted through the network, even in the presence of malicious parties.