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

International Computer Conference on Wavelet Active Media Technology and Information Processing (ICCWAMTIP)

The formal study of quantum cryptography protocols

Fan Yang, Yu‐Jie Hao

Published Dec 1, 2013• 3 citations
Publisher

Abstract

The unconditional security is the most important identity of quantum cryptography protocols. Although has been proved, but the process is so complicated to realize. The formal verification method provides an effective way to analyze the security of the protocols, and also achieve the computer automated analysis.
DOI
10.1109/iccwamtip.2013.6716594

Related papers

Security Analysis of Electronic Payment Protocols Based on Quantum Cryptography

Yi Liu, Xingtong Liu, Jian Wang +2 more

Electronic payment protocols play a vital role in electronic commerce to ensure the security of transaction process. Current electronic payment protocols based on complex mathematical problems will be vulnerable facing a quantum computer. In order to enhance the security against quantum computers, quantum cryptography is introduced into electronic payment protocols. Although the quantum cryptography is claimed to be unconditionally secure, Logical defects are still likely to cause serious problems. We introduced formal analysis to verify the security of electronic payment protocols based on quantum cryptography. Formal analysis methods can discover the vulnerabilities of protocols and help to improve the security of protocols. In this paper, we analyze an electronic payment protocol based on quantum cryptography and the result shows that the protocol is not secure even adopting unconditionally secure quantum cryptography. We found that both the accountability and fairness of the original protocol are not satisfied. Then we proposed an improved protocol to meet the requirement of accountability and fairness and verified it through formal analysis method.

International Conference on Information Science and Control Engineering•Jul 1, 2017•3 citations

An enhanced quantum key distribution protocol for security authentication

Ankit Kumar, Pankaj Dadheech, Vijander Singh +2 more

Quantum Cryptography is revolutionary discovery in the field of network security. Quantum cryptography promises to provide sophisticated functionality for security issues but it also leads to unbelievable increment in computational parallelism which is helpful for potential cryptanalytic attacks. Some of the associated properties of Quantum Key Distribution protocol that provide security that is deficient for the shared key to be transmitted securely. The identity verification process attempts to maximize success in interpreting the EPR protocol for distribution of Quantum.

Journal of Discrete Mathematical Sciences and Cryptography•May 19, 2019•78 citations

Finite Key Analysis in Quantum Cryptography

Tim Meyer

In view of experimental realization of quantum key distribution schemes, the study of their efficiency becomes as important as the proof of their security. The latter is the subject of most of the theoretical work about quantum key distribution, and many important results such as the proof of unconditional security have been obtained. The

•Jan 1, 2007•2 citations

Unconditionally secure cryptosystem based on quantum cryptography

Yu‐Fang Chung, Zhen Yu Wu, Feipei Lai +1 more

Most cryptographic works these days have employed mathematical concepts to design cryptosystems and algorithms.Therefore, mathematical concepts have become critical in the designing of cryptosystems, and are generally used to analyze cryptosystems and protocols, supporting the allegation that the intended cryptosystem is secure.In earlier cryptosystems, most algorithms were based on either factorization or discrete logarithm problem.This system has an overtly simple mathematical background and so, requires extensive secondary index computation.Therefore, a securer method must be developed to protect system security and to optimize system efficiency.Quantum cryptography detects intrusion and wiretapping.In quantum mechanics, a wiretap is not external or passive, but the opposite-changing its entity according to the internal component of the system.The status of the system changes once a wiretap is detected.Therefore, only the designer of the system can determine the quantum status of the system; eavesdroppers can neither determine the quantum status nor duplicate the system.Since quantum cryptosystem can reach unconditional security, it actually guarantees secure communication.Accordingly, this study examines quantum cryptography and contributes to secure quantum cryptography.

Advances in intelligent systems research/Advances in Intelligent Systems Research•Jan 1, 2006•1 citation

Assumptions in Quantum Cryptography

Normand J. Beaudry

Quantum cryptography uses techniques and ideas from physics and computer science. The combination of these ideas makes the security proofs of quantum cryptography a complicated task. To prove that a quantum-cryptography protocol is secure, assumptions are made about the protocol and its devices. If these assumptions are not justified in an implementation then an eavesdropper may break the security of the protocol. Therefore, security is crucially dependent on which assumptions are made and how justified the assumptions are in an implementation of the protocol. This thesis is primarily a review that analyzes and clarifies the connection between the security proofs of quantum-cryptography protocols and their experimental implementations. In particular, we focus on quantum key distribution: the task of distributing a secret random key between two parties. We provide a comprehensive introduction to several concepts: quantum mechanics using the density operator formalism, quantum cryptography, and quantum key distribution. We define security for quantum key distribution and outline several mathematical techniques that can either be used to prove security or simplify security proofs. In addition, we analyze the assumptions made in quantum cryptography and how they may or may not be justified in implementations. Along with the review, we propose a framework that decomposes quantum-key-distribution protocols and their assumptions into several classes. Protocol classes can be used to clarify which proof techniques apply to which kinds of protocols. Assumption classes can be used to specify which assumptions are justified in implementations and which could be exploited by an eavesdropper. Two contributions of the author are discussed: the security proofs of two two-way quantum-key-distribution protocols and an intuitive proof of the data-processing inequality.

arXiv:1505.02792•Jan 1, 2014•7 citations

Quantum cryptography: Approaching communication security from a quantum perspective

A. Porzio

Quantum cryptography aims at solving the everlasting problem of unconditional security in private communication. Every time we send personal information over a telecom channel a sophisticate algorithm protect our privacy making our data unintelligible to unauthorized receivers. These protocols resulted from the long history of cryptography. The security of modern cryptographic systems is guaranteed by complexity: the computational power that would be needed for gaining info on the code key largely exceed available one. Security of actual crypto systems is not “by principle” but “practical”. On the contrary, quantum technology promises to make possible to realize provably secure protocols. Quantum cryptology exploits paradigmatic aspects of quantum mechanics, like superposition principle and uncertainty relations. In this contribution, after a brief historical introduction, we aim at giving a survey on the physical principles underlying the quantum approach to cryptography. Then, we analyze a possible continuous variable protocol.

Italian National Conference on Photonic Technologies (Fotonica)•May 1, 2014•7 citations
Electronic payment protocols play a vital role in electronic commerce to ensure the security of transaction process. Current electronic payment protocols based on complex mathematical problems will be vulnerable facing a quantum computer. In order to enhance the security against quantum computers, quantum cryptography is introduced into electronic payment protocols. Although the quantum cryptography is claimed to be unconditionally secure, Logical defects are still likely to cause serious problems. We introduced formal analysis to verify the security of electronic payment protocols based on quantum cryptography. Formal analysis methods can discover the vulnerabilities of protocols and help to improve the security of protocols. In this paper, we analyze an electronic payment protocol based on quantum cryptography and the result shows that the protocol is not secure even adopting unconditionally secure quantum cryptography. We found that both the accountability and fairness of the original protocol are not satisfied. Then we proposed an improved protocol to meet the requirement of accountability and fairness and verified it through formal analysis method.
Quantum Cryptography is revolutionary discovery in the field of network security. Quantum cryptography promises to provide sophisticated functionality for security issues but it also leads to unbelievable increment in computational parallelism which is helpful for potential cryptanalytic attacks. Some of the associated properties of Quantum Key Distribution protocol that provide security that is deficient for the shared key to be transmitted securely. The identity verification process attempts to maximize success in interpreting the EPR protocol for distribution of Quantum.
Most cryptographic works these days have employed mathematical concepts to design cryptosystems and algorithms.Therefore, mathematical concepts have become critical in the designing of cryptosystems, and are generally used to analyze cryptosystems and protocols, supporting the allegation that the intended cryptosystem is secure.In earlier cryptosystems, most algorithms were based on either factorization or discrete logarithm problem.This system has an overtly simple mathematical background and so, requires extensive secondary index computation.Therefore, a securer method must be developed to protect system security and to optimize system efficiency.Quantum cryptography detects intrusion and wiretapping.In quantum mechanics, a wiretap is not external or passive, but the opposite-changing its entity according to the internal component of the system.The status of the system changes once a wiretap is detected.Therefore, only the designer of the system can determine the quantum status of the system; eavesdroppers can neither determine the quantum status nor duplicate the system.Since quantum cryptosystem can reach unconditional security, it actually guarantees secure communication.Accordingly, this study examines quantum cryptography and contributes to secure quantum cryptography.
Quantum cryptography uses techniques and ideas from physics and computer science. The combination of these ideas makes the security proofs of quantum cryptography a complicated task. To prove that a quantum-cryptography protocol is secure, assumptions are made about the protocol and its devices. If these assumptions are not justified in an implementation then an eavesdropper may break the security of the protocol. Therefore, security is crucially dependent on which assumptions are made and how justified the assumptions are in an implementation of the protocol. This thesis is primarily a review that analyzes and clarifies the connection between the security proofs of quantum-cryptography protocols and their experimental implementations. In particular, we focus on quantum key distribution: the task of distributing a secret random key between two parties. We provide a comprehensive introduction to several concepts: quantum mechanics using the density operator formalism, quantum cryptography, and quantum key distribution. We define security for quantum key distribution and outline several mathematical techniques that can either be used to prove security or simplify security proofs. In addition, we analyze the assumptions made in quantum cryptography and how they may or may not be justified in implementations. Along with the review, we propose a framework that decomposes quantum-key-distribution protocols and their assumptions into several classes. Protocol classes can be used to clarify which proof techniques apply to which kinds of protocols. Assumption classes can be used to specify which assumptions are justified in implementations and which could be exploited by an eavesdropper. Two contributions of the author are discussed: the security proofs of two two-way quantum-key-distribution protocols and an intuitive proof of the data-processing inequality.
Quantum cryptography aims at solving the everlasting problem of unconditional security in private communication. Every time we send personal information over a telecom channel a sophisticate algorithm protect our privacy making our data unintelligible to unauthorized receivers. These protocols resulted from the long history of cryptography. The security of modern cryptographic systems is guaranteed by complexity: the computational power that would be needed for gaining info on the code key largely exceed available one. Security of actual crypto systems is not “by principle” but “practical”. On the contrary, quantum technology promises to make possible to realize provably secure protocols. Quantum cryptology exploits paradigmatic aspects of quantum mechanics, like superposition principle and uncertainty relations. In this contribution, after a brief historical introduction, we aim at giving a survey on the physical principles underlying the quantum approach to cryptography. Then, we analyze a possible continuous variable protocol.