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

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE

Interactive identification protocol based on a quantum public-key cryptosystem

Chenmiao Wu, Li Yang

Published Nov 18, 2014• 1 citation
Publisher

Abstract

We propose two interactive identification protocols based on a general construction of quantum public-key cryptosystem. Basic protocol contains set-up phase and authentication phase. Participants do operation with quantum computing of Boolean function in two-round transmission of authentication phase. Basic one only ensures completeness and soundness, but leaks information about private-key. We modify basic protocol with random string and random Boolean permutation. After modification, both transmitted states in two-round transmission can be proved to be ultimate mixed states. No participant or attacker will get useful information about private-key by measuring such states. Modified protocol achieves property of zero-knowledge.

DOI
10.1117/12.2067755

Related papers

Quantum no-key protocol for secure communication of classical message

Li Yang

We propose a class of quantum no-key protocols for private communication of classical message based on quantum computing of random Boolean permutations, and demonstrate that they are information-theoretic secure. These protocols are designed to resist middleman attack for two parties preshared authentication key, and achieve perfect mutual data origin authentication which ensures the permanent reusing of authentication key. Finally, we simplify the protocol to a 4-round one, and show that any protocol with 3 or less rounds cannot achieve perfect security without consuming preshared key.

arXiv:1306.3388•Jun 14, 2013•2 citations

Practical Quantum No-key Protocol with Identification

Yang Wu, Li Yang

Quantum no-key protocol is a quantum realization of Shamir's idea of no-key cryptosystem, which can be used to transport quantum and classical message secretly. It is beyond computational security. We give a practical quantum no-key protocol with mutual identification. In order to prevent MIM (man-in-the-middle) attack, we realize secure information transmission and identification by utilizing a short pre-shared secret bit sequence. And we use pseudo-random sequences to mix the photons which are used for information transmission and the photons which are used for identification. Pseudo-random sequence partly protects the secret sequence and makes our protocol more practical while do not weaken the security. We post a schematic diagram of the experimental set-up which is based on fiber communication system. Our protocol does not need entanglement, multi-qubit operation or classical communication.

International Conference on Information Assurance and Security (IAS)•Jan 1, 2009•4 citations

A public-key cryptosystem for quantum message transmission

Li Yang

We present a quantum public-key cryptography protocol for quantum message transmission. The private key of this protocol includes three classical matrices: a generator matrix of a Goppa code, an invertible matrix and a permutation matrix. The public key is product of these three matrices. The encryption and decryption algorithms are merely quantum computations related with the transformations between bases of the quantum registers. The security of this protocol is based on the hypothesis that there is no effective algorithm of NP-complete problem.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Jan 11, 2005•10 citations

Quantum no-key protocol for direct and secure transmission of quantum and classical messages

Li Yang

We present a quantum no-key protocol for direct and secure transmission of quantum and classical messages based on simple Boolean function computation with several quantum gates and Shamir's interactive idea of classical message encryption. This protocol has inherent personal identification and message authentication. It probably is the first quantum protocol that can resist the man-in-the-middle attack by itself.

arXiv:quant-ph/0309200•Sep 28, 2003•6 citations

Quantum Election Protocol Based on Quantum Public Key Cryptosystem

Wenhua Gao, Li Yang

There is no quantum election protocol that can fulfil the eight requirements of an electronic election protocol, i.e., completeness, robustness, privacy, legality, unreusability, fairness, verifiability, and receipt-freeness. To address this issue, we employ the general construction of quantum digital signature and quantum public key encryption, in conjunction with classic public key encryption, to develop and instantiate a general construction of quantum election protocol. The proposed protocol exhibits the following advantages: (i) no pre-shared key between any two participants is required, and no trusted third party or anonymous channels are required. The protocol is suitable for large-scale elections with numerous candidates and voters and accommodates the situation in which multiple voters vote simultaneously. (ii) It is the first protocol that dismantles the contradiction between verifiability and receipt-freeness in a quantum election protocol. It satisfies all eight requirements stated earlier under the physical assumptions that there exists a one-way untappable channel from the administrator to the voter and that there is no collusion between any of the three parties in the protocol. Compared with current election protocols with verifiability and receipt-freeness, this protocol relies upon fewer physical assumptions. (iii) This construction is flexible and can be instantiated into an election scheme having post-quantum security by applying cryptographic algorithms conveying post-quantum security. Moreover, utilizing quantum digital signature and public key encryption yields a good result: the transmitted ballots are in quantum states, so owing to the no-cloning theorem, ballot privacy is less likely to be compromised, even if private keys of the signature and public key encryption are leaked after the election. However, in existing election protocols employing classic digital signatures and public key encryption, ballot privacy can be easily violated if attackers obtain private keys. Thus, our construction enhances privacy.

Security and Communication Networks•Apr 13, 2021•10 citations

Quantum identification system

Miloslav Dušek, Ondřej Haderka, Martin Hendrych +1 more

A secure quantum identification system combining a classical identification procedure and quantum key distribution is proposed. Each identification sequence is always used just once and sequences are ``refueled'' from a shared provably secret key transferred through the quantum channel. Two identification protocols are devised. The first protocol can be applied when legitimate users have an unjammable public channel at their disposal. The deception probability is derived for the case of a noisy quantum channel. The second protocol employs unconditionally secure authentication of information sent over the public channel, and thus can be applied even in the case when an adversary is allowed to modify public communications. An experimental realization of a quantum identification system is described.

arXiv:quant-ph/9809024•Physical Review A•Jul 1, 1999•179 citations
We propose two interactive identification protocols based on a general construction of quantum public-key cryptosystem. Basic protocol contains set-up phase and authentication phase. Participants do operation with quantum computing of Boolean function in two-round transmission of authentication phase. Basic one only ensures completeness and soundness, but leaks information about private-key. We modify basic protocol with random string and random Boolean permutation. After modification, both transmitted states in two-round transmission can be proved to be ultimate mixed states. No participant or attacker will get useful information about private-key by measuring such states. Modified protocol achieves property of zero-knowledge.
We propose a class of quantum no-key protocols for private communication of classical message based on quantum computing of random Boolean permutations, and demonstrate that they are information-theoretic secure. These protocols are designed to resist middleman attack for two parties preshared authentication key, and achieve perfect mutual data origin authentication which ensures the permanent reusing of authentication key. Finally, we simplify the protocol to a 4-round one, and show that any protocol with 3 or less rounds cannot achieve perfect security without consuming preshared key.
Quantum no-key protocol is a quantum realization of Shamir's idea of no-key cryptosystem, which can be used to transport quantum and classical message secretly. It is beyond computational security. We give a practical quantum no-key protocol with mutual identification. In order to prevent MIM (man-in-the-middle) attack, we realize secure information transmission and identification by utilizing a short pre-shared secret bit sequence. And we use pseudo-random sequences to mix the photons which are used for information transmission and the photons which are used for identification. Pseudo-random sequence partly protects the secret sequence and makes our protocol more practical while do not weaken the security. We post a schematic diagram of the experimental set-up which is based on fiber communication system. Our protocol does not need entanglement, multi-qubit operation or classical communication.
We present a quantum public-key cryptography protocol for quantum message transmission. The private key of this protocol includes three classical matrices: a generator matrix of a Goppa code, an invertible matrix and a permutation matrix. The public key is product of these three matrices. The encryption and decryption algorithms are merely quantum computations related with the transformations between bases of the quantum registers. The security of this protocol is based on the hypothesis that there is no effective algorithm of NP-complete problem.
There is no quantum election protocol that can fulfil the eight requirements of an electronic election protocol, i.e., completeness, robustness, privacy, legality, unreusability, fairness, verifiability, and receipt-freeness. To address this issue, we employ the general construction of quantum digital signature and quantum public key encryption, in conjunction with classic public key encryption, to develop and instantiate a general construction of quantum election protocol. The proposed protocol exhibits the following advantages: (i) no pre-shared key between any two participants is required, and no trusted third party or anonymous channels are required. The protocol is suitable for large-scale elections with numerous candidates and voters and accommodates the situation in which multiple voters vote simultaneously. (ii) It is the first protocol that dismantles the contradiction between verifiability and receipt-freeness in a quantum election protocol. It satisfies all eight requirements stated earlier under the physical assumptions that there exists a one-way untappable channel from the administrator to the voter and that there is no collusion between any of the three parties in the protocol. Compared with current election protocols with verifiability and receipt-freeness, this protocol relies upon fewer physical assumptions. (iii) This construction is flexible and can be instantiated into an election scheme having post-quantum security by applying cryptographic algorithms conveying post-quantum security. Moreover, utilizing quantum digital signature and public key encryption yields a good result: the transmitted ballots are in quantum states, so owing to the no-cloning theorem, ballot privacy is less likely to be compromised, even if private keys of the signature and public key encryption are leaked after the election. However, in existing election protocols employing classic digital signatures and public key encryption, ballot privacy can be easily violated if attackers obtain private keys. Thus, our construction enhances privacy.
A secure quantum identification system combining a classical identification procedure and quantum key distribution is proposed. Each identification sequence is always used just once and sequences are ``refueled'' from a shared provably secret key transferred through the quantum channel. Two identification protocols are devised. The first protocol can be applied when legitimate users have an unjammable public channel at their disposal. The deception probability is derived for the case of a noisy quantum channel. The second protocol employs unconditionally secure authentication of information sent over the public channel, and thus can be applied even in the case when an adversary is allowed to modify public communications. An experimental realization of a quantum identification system is described.