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

arXiv:1802.05099 · Quantum Information Processing

Unconditional security of a K-state quantum key distribution protocol

Dariusz Kurzyk, Łukasz Pawela, Zbigniew Puchała

Published Jul 26, 2018• 1 citation
arXivHTMLPDF

Abstract

Quantum key distribution protocols constitute an important part of quantum cryptography, where the security of sensitive information arises from the laws of physics. In this paper, we introduce a family of key distribution protocols which generalize the PBC00 protcol. We compare its key with the well-known protocols such as BB84, PBC00 and generation rate to the well-known protocols such as BB84, PBC0 and R04. We also state the security analysis of these protocols based on the entanglement distillation and CSS codes techniques.

DOI
10.1007/s11128-018-1998-3

Related papers

Unconditional security of relativistic quantum key distribution protocol

Sushuai Zhuang Zhuang, Li Yang

Relativistic quantum key distribution (QKD) protocol is a kind of modified BB84 QKD protocol based on the principles of not only quantum mechanics but also special relativity. Its advantage compared with BB84 protocol is that all of the qubits could be used for key generation, and Alice and Bob are able to select any measuring bases. We prove its unconditional security against coherent attack via the method based on CSS codes: begin with a modified EPR based protocol which can be proved unconditionally secure, then reduce the protocol to a CSS codes based protocol. Finally, the CSS codes based protocol is demonstrated equivalent to the relativistic QKD protocol, and we arrived at the conclusion of the unconditional security of the final key.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Oct 8, 2010•1 citation

Analysis of Various Attacks over BB84 Quantum Key Distribution Protocol

Rahul Aggarwal, Heeren Sharma, Deepak Kumar Gupta

Quantum Key Distribution (QKD) networks are the best application of quantum cryptography in which we use the principles of quantum mechanics with classical cryptographic techniques to provide the unconditional security.This paper discusses the various attack strategies over BB84 quantum key distribution protocol and the analysis of these attacks.

International Journal of Computer Applications•Apr 30, 2011•19 citations

Security of entanglement based version of BB84 protocol for Quantum Cryptography

Anand Sharma, Vibha Ojha, Saroj Kumar Lenka

As the quantum cryptography is the ultimate solution for information security. Quantum cryptography describes the ultimate way for key distribution. Unlike many of the classical cryptosystems in use today, whose security often draws on unproven assumptions about the computational complexity of mathematical problems, the security of quantum cryptography is based on the laws of physics. The Quantum Key Distribution follows some protocols for key distribution. In this paper we describe the BB84 protocol which is used in Quantum Cryptography and the security aspect of entanglement based version of BB84.

•Jul 1, 2010•14 citations

Unconditional Security of a Three State Quantum Key Distribution Protocol

Jean-Christian Boileau, Kiyoshi Tamaki, Jamie Batuwantudawe +2 more

Quantum key distribution (QKD) protocols are cryptographic techniques with security based only on the laws of quantum mechanics. Two prominent QKD schemes are the Bennett-Brassard 1984 and Bennett 1992 protocols that use four and two quantum states, respectively. In 2000, Phoenix et al. proposed a new family of three-state protocols that offers advantages over the previous schemes. Until now, an error rate threshold for security of the symmetric trine spherical code QKD protocol has been shown only for the trivial intercept-resend eavesdropping strategy. In this Letter, we prove the unconditional security of the trine spherical code QKD protocol, demonstrating its security up to a bit error rate of 9.81%. We also discuss how this proof applies to a version of the trine spherical code QKD protocol where the error rate is evaluated from the number of inconclusive events.

arXiv:quant-ph/0408085•Physical Review Letters•Jan 31, 2005•84 citations

Composable Security of Generalized BB84 Protocols Against General Attacks

Michel Boyer, Rotem Liss, Tal Mor

Quantum key distribution (QKD) protocols make it possible for two parties to generate a secret shared key. One of the most important QKD protocols, BB84, was suggested by Bennett and Brassard in 1984. Various proofs of unconditional security for BB84 have been suggested, but the first security proofs were not composable. Here we improve a security proof of BB84 given by [Biham, Boyer, Boykin, Mor, and Roychowdhury, J. Cryptology, 19(4):381-439, 2006] to be composable and match the state-of-the-art results for BB84, and we extend it to prove unconditional security of several variants of the BB84 protocol. Our composable security proof for BB84 and its variants is mostly self-contained, algebraic, and relatively simple, and it gives tight finite-key bounds.

arXiv:2208.12154•Aug 25, 2022•2 citations

Quantum Key Distribution (QKD) for Symmetric Key Transfer

Asoke Nath, Shreya Maity, Soham Banerjee +1 more

Classical cryptographic systems are increasingly challenged by advances in computing power and new algorithmic techniques, particularly with the rise of quantum computing, which threatens the security of current encryption methods. This has spurred interest in quantum-resistant cryptography, aimed at creating algorithms that can withstand attacks from quantum computers. Traditionally, secure key transport over alternate channels has been a significant challenge, but quantum mechanics offers a solution. Quantum Key Distribution (QKD) is a revolutionary method for secure communication that leverages quantum principles. Unlike traditional methods, QKD provides unconditional security, with key security ensured by the laws of physics rather than computational difficulty. The BB84 protocol, introduced in 1984 by Bennett and Brassard, is a leading QKD scheme known for its simplicity and effectiveness in generating eavesdropping-resistant cryptographic keys. It facilitates secure key transport over alternate channels. This documentation aims to advance QKD security by practically implementing and analyzing the BB84 protocol. Through detailed theoretical analysis, simulation studies, and experimental validation, the practical impacts, and limitations of BB84-based QKD systems are examined. Additionally, a practical implementation of quantum key distribution using a sudoku key demonstrates the process's simplicity and effectiveness. These findings are expected to pave new paths in the field of cryptanalysis in the emerging Quantum Age.

International Journal of Scientific Research in Computer Science Engineering and Information Technology•May 15, 2024•2 citations
Quantum key distribution protocols constitute an important part of quantum cryptography, where the security of sensitive information arises from the laws of physics. In this paper, we introduce a family of key distribution protocols which generalize the PBC00 protcol. We compare its key with the well-known protocols such as BB84, PBC00 and generation rate to the well-known protocols such as BB84, PBC0 and R04. We also state the security analysis of these protocols based on the entanglement distillation and CSS codes techniques.
Relativistic quantum key distribution (QKD) protocol is a kind of modified BB84 QKD protocol based on the principles of not only quantum mechanics but also special relativity. Its advantage compared with BB84 protocol is that all of the qubits could be used for key generation, and Alice and Bob are able to select any measuring bases. We prove its unconditional security against coherent attack via the method based on CSS codes: begin with a modified EPR based protocol which can be proved unconditionally secure, then reduce the protocol to a CSS codes based protocol. Finally, the CSS codes based protocol is demonstrated equivalent to the relativistic QKD protocol, and we arrived at the conclusion of the unconditional security of the final key.
As the quantum cryptography is the ultimate solution for information security. Quantum cryptography describes the ultimate way for key distribution. Unlike many of the classical cryptosystems in use today, whose security often draws on unproven assumptions about the computational complexity of mathematical problems, the security of quantum cryptography is based on the laws of physics. The Quantum Key Distribution follows some protocols for key distribution. In this paper we describe the BB84 protocol which is used in Quantum Cryptography and the security aspect of entanglement based version of BB84.
Quantum key distribution (QKD) protocols are cryptographic techniques with security based only on the laws of quantum mechanics. Two prominent QKD schemes are the Bennett-Brassard 1984 and Bennett 1992 protocols that use four and two quantum states, respectively. In 2000, Phoenix et al. proposed a new family of three-state protocols that offers advantages over the previous schemes. Until now, an error rate threshold for security of the symmetric trine spherical code QKD protocol has been shown only for the trivial intercept-resend eavesdropping strategy. In this Letter, we prove the unconditional security of the trine spherical code QKD protocol, demonstrating its security up to a bit error rate of 9.81%. We also discuss how this proof applies to a version of the trine spherical code QKD protocol where the error rate is evaluated from the number of inconclusive events.
Quantum key distribution (QKD) protocols make it possible for two parties to generate a secret shared key. One of the most important QKD protocols, BB84, was suggested by Bennett and Brassard in 1984. Various proofs of unconditional security for BB84 have been suggested, but the first security proofs were not composable. Here we improve a security proof of BB84 given by [Biham, Boyer, Boykin, Mor, and Roychowdhury, J. Cryptology, 19(4):381-439, 2006] to be composable and match the state-of-the-art results for BB84, and we extend it to prove unconditional security of several variants of the BB84 protocol. Our composable security proof for BB84 and its variants is mostly self-contained, algebraic, and relatively simple, and it gives tight finite-key bounds.
Classical cryptographic systems are increasingly challenged by advances in computing power and new algorithmic techniques, particularly with the rise of quantum computing, which threatens the security of current encryption methods. This has spurred interest in quantum-resistant cryptography, aimed at creating algorithms that can withstand attacks from quantum computers. Traditionally, secure key transport over alternate channels has been a significant challenge, but quantum mechanics offers a solution. Quantum Key Distribution (QKD) is a revolutionary method for secure communication that leverages quantum principles. Unlike traditional methods, QKD provides unconditional security, with key security ensured by the laws of physics rather than computational difficulty. The BB84 protocol, introduced in 1984 by Bennett and Brassard, is a leading QKD scheme known for its simplicity and effectiveness in generating eavesdropping-resistant cryptographic keys. It facilitates secure key transport over alternate channels. This documentation aims to advance QKD security by practically implementing and analyzing the BB84 protocol. Through detailed theoretical analysis, simulation studies, and experimental validation, the practical impacts, and limitations of BB84-based QKD systems are examined. Additionally, a practical implementation of quantum key distribution using a sudoku key demonstrates the process's simplicity and effectiveness. These findings are expected to pave new paths in the field of cryptanalysis in the emerging Quantum Age.