aqora

An Improved Conference-Key Agreement Protocol with Forward Secrecy

TsengYuh-Min

Recently, Tzeng proposed a provably secure and fault-tolerant conference-key agreement protocol. It requires only a constant number of rounds to establish a conference key among all honest particip...

Apr 1, 20050 citations

Secure Anonymous Conferencing in Quantum Networks

Federico Grasselli, Gláucia Murta, Jarn de Jong +4 more

A security framework for anonymous conference key agreement with different levels of anonymity is introduced, suggesting that multipartite entanglement is a better option for cryptographic tasks involving several users.

arXiv:2111.05363PRX QuantumOct 13, 202233 citations

Anonymous Quantum Conference Key Agreement

Frederik Hahn, Jarn de Jong, Anna Pappa

Conference key agreement (CKA) is a cryptographic effort of multiple parties to establish a shared secret key.In future quantum networks, generating secret keys in an anonymous way is of tremendous importance for parties that want to keep their shared key secret and at the same time protect their own identity.We provide a definition of anonymity for general protocols and present a CKA protocol that is provably anonymous under realistic adversarial scenarios.We base our protocol on shared Greenberger-Horne-Zeilinger states, which have been proposed as more efficient resources for CKA protocols, compared to bipartite entangled resources.The existence of secure and anonymous protocols based on multipartite entangled states provides a new insight on their potential as resources and paves the way for further applications.Conference key agreement (CKA) is a cryptographic effort of multiple parties to establish a shared secret key.In future quantum networks, generating secret keys in an anonymous way is of tremendous importance for parties that want to keep their shared key secret and at the same time protect their own identity.We provide a definition of anonymity for general protocols and present a CKA protocol that is provably anonymous under realistic adversarial scenarios.We base our protocol on shared Greenberger-Horne-Zeilinger states, which have been proposed as more efficient resources for CKA protocols, compared to bipartite entangled resources.The existence of secure and anonymous protocols based on multipartite entangled states provides a new insight on their potential as resources and paves the way for further applications.

arXiv:2010.04534PRX QuantumDec 22, 202066 citations

Experimental verification of genuine multipartite entanglement without shared reference frames

Zhao Wang, Chao Zhang, Yun‐Feng Huang +3 more

中国科学通报：英文版Apr 15, 201626 citations

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

Michael Epping, Hermann Kampermann, Chiara Macchiavello +1 more

The laws of quantum mechanics allow for the distribution of a secret random key between two parties.Here we analyse 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.We compare this protocol to conference key distribution via bipartite entanglement, regarding the required resources, achievable secret key rates and threshold qubit error rates.Furthermore we discuss quantum networks with bottlenecks for which our multipartite entanglement-based protocol can benefit from network coding, while the bipartite protocol cannot.It is shown how this advantage leads to a higher secret key rate. Multipartite QKD: protocol and security analysisThe entanglement-based Ekert protocol [7] can be generalised to N parties as follows, see also [31,34].The parties A and B 1 , B 2 , ..., B N 1 -share an N-partite entangled state and perform local projective measurements.TheThe laws of quantum mechanics allow for the distribution of a secret random key between two parties.Here we analyse 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.We compare this protocol to conference key distribution via bipartite entanglement, regarding the required resources, achievable secret key rates and threshold qubit error rates.Furthermore we discuss quantum networks with bottlenecks for which our multipartite entanglement-based protocol can benefit from network coding, while the bipartite protocol cannot.It is shown how this advantage leads to a higher secret key rate. Multipartite QKD: protocol and security analysisThe entanglement-based Ekert protocol [7] can be generalised to N parties as follows, see also [31,34].The parties A and B 1 , B 2 , ..., B N 1 -share an N-partite entangled state and perform local projective measurements.The

arXiv:1612.05585New Journal of PhysicsSep 14, 2017206 citations

Criteria of Genuine Multipartite Entanglement Based on Correlation Tensors

Naihuan Jing, Meiming Zhang

arXiv:2301.06463International Journal of Theoretical PhysicsDec 6, 20224 citations

Genuine multipartite entanglement is not a precondition for secure conference key agreement

Abstract

Related papers

Genuine multipartite entanglement is not a precondition for secure conference key agreement

Abstract

Related papers