Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Overview of Key Agreement Protocols.

Ratna Dutta, Rana Barua

Published Jan 1, 2005• 44 citations
OpenAlex

Related papers

An Overview of Quantum Key Agreement Protocols

Youssouf Achouri, Rima Djellab, Khaled Hamouid

Information systems engineering and management•Jan 1, 2024•0 citations

Key Agreement Protocols

Colin Boyd, Anish Mathuria, Douglas Stebila

Information security and cryptography•Nov 6, 2019•1 citation

Key Agreement Protocols

Colin Boyd, Anish Mathuria

Information security and cryptography•Jan 1, 2003•7 citations

A study on the key aspects of the BB84 protocol

Pedro Juan Roig, Salvador Alcaraz, Katja Gilly +2 more

This article presents an overview of the BB84 quantum key distribution protocol, grounded in basic concepts from geometry, linear algebra, and probability theory. The fundamental operating principles of BB84 are described, including state preparation, measurement, basis reconciliation, and post-processing. An analytical performance analysis is carried out to evaluate the impact of intercept–resend attacks, deriving probabilities for detection, interception and precision. Furthermore, a Pauli error model is used to calculate the QBER. Additionally, key length estimation and practical considerations for modern BB84 implementations are discussed, along with a brief overview of quantum key agreement protocols.

International Conference on Integrated Intelligence and Cognitive Engineering (ICIICE)•Apr 18, 2026•0 citations

Certificateless Two Party Key Agreement Protocol

Wenhao Liu, Chunxiang Xu, Jian Feng Xu

Certificateless cryptography aims at combining the advantages of identity based and public key cryptography in order to avoid the key escrow problem inherent in the identity based cryptography and cumbersome certificate management in the traditional public key infrastructure. The provably secure certificateless key agreement protocol is proposed by Lippold et al. in 2009, but their protocol suffers from computation burden. Owing to the above-mentioned situations, a new certificateless two party key agreement protocol (CL-KA) is proposed and the security attributes are analyzed in the extended Canetti-Krawzcyk(eCK) security model. Our protocol only requires each entity to compute two pairings, up to now, it turns out to be the most efficient one of all the previously known security CL-KA schemes.

International Conference on Multimedia Information Networking and Security•Jan 1, 2010•2 citations

Key agreement via protocols

Bill Roscoe

•Jan 1, 2019•0 citations
This article presents an overview of the BB84 quantum key distribution protocol, grounded in basic concepts from geometry, linear algebra, and probability theory. The fundamental operating principles of BB84 are described, including state preparation, measurement, basis reconciliation, and post-processing. An analytical performance analysis is carried out to evaluate the impact of intercept–resend attacks, deriving probabilities for detection, interception and precision. Furthermore, a Pauli error model is used to calculate the QBER. Additionally, key length estimation and practical considerations for modern BB84 implementations are discussed, along with a brief overview of quantum key agreement protocols.
Certificateless cryptography aims at combining the advantages of identity based and public key cryptography in order to avoid the key escrow problem inherent in the identity based cryptography and cumbersome certificate management in the traditional public key infrastructure. The provably secure certificateless key agreement protocol is proposed by Lippold et al. in 2009, but their protocol suffers from computation burden. Owing to the above-mentioned situations, a new certificateless two party key agreement protocol (CL-KA) is proposed and the security attributes are analyzed in the extended Canetti-Krawzcyk(eCK) security model. Our protocol only requires each entity to compute two pairings, up to now, it turns out to be the most efficient one of all the previously known security CL-KA schemes.