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:0801.0696

Quantum Zero-Knowledge Protocol Using Quantum Bit Commitment without Quantum Memory

Rubens Viana Ramos, José Cláudio do Nascimento

Published Jan 4, 2008• 0 citations
arXivHTMLPDF

Abstract

Zero-knowledge proof system is an important protocol that can be used as a basic block for construction of other more complex cryptographic protocols. Quantum zero-knowledge protocols have been proposed but, since their implementation requires advanced quantum technology devices, experimental implementation of zero-knowledge protocols have not being reported. In this work, we present a quantum zero-knowledge protocol based on a quantum bit commitment protocol that can be implemented with today technology. Hence, our quantum zero-knowledge protocol can be readily implemented.

DOI
10.48550/arxiv.0801.0696

Related papers

Quantum bit commitment protocol without quantum memory

Rubens Viana Ramos, Fábio Alencar Mendonça

Quantum protocols for bit commitment have been proposed and it is largely accepted that unconditionally secure quantum bit commitment is not possible; however, it can be more secure than classical bit commitment. In despite of its usefulness, quantum bit commitment protocols have not been experimentally implemented. The main reason is the fact that all proposed quantum bit commitment protocols require quantum memory. In this work, we show a quantum bit commitment protocol that does not require quantum memory and can be implemented with present technology.

arXiv:0801.0690•Jan 4, 2008•3 citations

Quantum protocols for transference of proof of zero-knowledge systems

José Cláudio do Nascimento, Rubens Viana

Zero-knowledge proof system is an important protocol that can be used as a basic block for construction of other more complex cryptographic protocols.An intrinsic characteristic of a zeroknowledge systems is the assumption that is impossible for the verifier to show to a third part that he has interacted with the prover.However, it has been shown that using quantum correlations the impossibility of transferring proofs can be successfully attacked.In this work we show two new protocols for proof transference, being the first one based on teleportation and the second one without using entangled states. 1

arXiv:0705.2580•Anais de XXXV Simpósio Brasileiro de Telecomunicações e Processamento de Sinais•Jan 1, 2007•0 citations

A brief review on quantum bit commitment

Álvaro J. Almeida, Ricardo Loura, Nikola Paunković +5 more

In classical cryptography, the bit commitment scheme is one of the most important primitives. We review the state of the art of bit commitment protocols, emphasizing its main achievements and applications. Next, we present a practical quantum bit commitment scheme, whose security relies on current technological limitations, such as the lack of long-term stable quantum memories. We demonstrate the feasibility of our practical quantum bit commitment protocol and that it can be securely implemented with nowadays technology.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Aug 22, 2014•8 citations

Experimental implementation of a quantum zero-knowledge proof for user authentication

Marta Irene García Cid, Dileepsai Bodanapu, Alberto Gatto +3 more

A new interactive quantum zero-knowledge protocol for identity authentication implementable in currently available quantum cryptographic devices is proposed and demonstrated. The protocol design involves a verifier and a prover knowing a pre-shared secret, and the acceptance or rejection of the proof is determined by the quantum bit error rate. It has been implemented in modified Quantum Key Distribution devices executing two fundamental cases. In the first case, all players are honest, while in the second case, one of the users is a malicious player. We demonstrate an increase of the quantum bit error rate around 25% in the latter case compared to the case of honesty. The protocol has also been validated for distances from a back-to-back setup to more than 60 km between verifier and prover. The security and robustness of the protocol has been analysed, demonstrating its completeness, soundness and zero-knowledge properties.

arXiv:2401.09521•Optics Express•Feb 22, 2024•11 citations

Quantum zero-knowledge protocol for identity authentication

Marta Irene García Cid, Dileepsai Bodanapu, Rodrigo Martín Sánchez-Ledesma +5 more

This work presents a new scheme based on a quantum zero-knowledge proof for identity authentication. The novelty of this research is the migration of the classical concept Zero-knowledge into the quantum cryptographic framework that, to the best of our knowledge, has never been explored. This approach allows us to take advantage of the principles of quantum mechanics to build a protocol, which is secure against quantum computer attacks, for authenticating several users having access to the same network node. The protocol has been designed, its security analysed and implemented in modified Quantum Key Distribution devices. Two scenarios have been analysed experimentally, the first being both the prover and the verifier honest players, and the second case being the prover a malicious player, the latter demonstrating a notable increase in the quantum bit error rate that prevents a fraudulent authentication.

IET conference proceedings.•Dec 18, 2023•1 citation

Quantum Bit Commitment with Application in Quantum Zero-Knowledge Proof.

Dongdai Lin, Yu-Juan Quan, Jian Weng +1 more

Watrous (STOC 2006) proved that plugging classical bit commitment scheme that is secure against quantum attack into the GMW-type construction of zero-knowledge gives a classical zero-knowledge proof that is secure against quantum attack. In this paper, we showed that plugging quantum bit commitment scheme (allowing quantum computation and communication) into the GMW-type construction also gives a quantum zero-knowledge proof, as one expects. However, since the binding condition of quantum bit commitment scheme is inherently different from its classical counterpart, compared with Watrous ’ security proof, here we encounter new difficulty in soundness analysis. To overcome the difficulty, we take a geometric approach, managing to reduce quantum soundness analysis to classical soundness analysis. We also propose a formalization of non-interactive quantum bit commitment scheme, which may come in handy in other places. Moreover, inspired by our formalization, we generalize Naor’s construction of bit commitment scheme to the quantum setting, achieving non-interactive commit stage. We hope quantum bit commitment scheme can find more applications in quantum cryptog-raphy. 1

•Jan 1, 2014•1 citation
Zero-knowledge proof system is an important protocol that can be used as a basic block for construction of other more complex cryptographic protocols. Quantum zero-knowledge protocols have been proposed but, since their implementation requires advanced quantum technology devices, experimental implementation of zero-knowledge protocols have not being reported. In this work, we present a quantum zero-knowledge protocol based on a quantum bit commitment protocol that can be implemented with today technology. Hence, our quantum zero-knowledge protocol can be readily implemented.
Quantum protocols for bit commitment have been proposed and it is largely accepted that unconditionally secure quantum bit commitment is not possible; however, it can be more secure than classical bit commitment. In despite of its usefulness, quantum bit commitment protocols have not been experimentally implemented. The main reason is the fact that all proposed quantum bit commitment protocols require quantum memory. In this work, we show a quantum bit commitment protocol that does not require quantum memory and can be implemented with present technology.
Zero-knowledge proof system is an important protocol that can be used as a basic block for construction of other more complex cryptographic protocols.An intrinsic characteristic of a zeroknowledge systems is the assumption that is impossible for the verifier to show to a third part that he has interacted with the prover.However, it has been shown that using quantum correlations the impossibility of transferring proofs can be successfully attacked.In this work we show two new protocols for proof transference, being the first one based on teleportation and the second one without using entangled states. 1
In classical cryptography, the bit commitment scheme is one of the most important primitives. We review the state of the art of bit commitment protocols, emphasizing its main achievements and applications. Next, we present a practical quantum bit commitment scheme, whose security relies on current technological limitations, such as the lack of long-term stable quantum memories. We demonstrate the feasibility of our practical quantum bit commitment protocol and that it can be securely implemented with nowadays technology.
A new interactive quantum zero-knowledge protocol for identity authentication implementable in currently available quantum cryptographic devices is proposed and demonstrated. The protocol design involves a verifier and a prover knowing a pre-shared secret, and the acceptance or rejection of the proof is determined by the quantum bit error rate. It has been implemented in modified Quantum Key Distribution devices executing two fundamental cases. In the first case, all players are honest, while in the second case, one of the users is a malicious player. We demonstrate an increase of the quantum bit error rate around 25% in the latter case compared to the case of honesty. The protocol has also been validated for distances from a back-to-back setup to more than 60 km between verifier and prover. The security and robustness of the protocol has been analysed, demonstrating its completeness, soundness and zero-knowledge properties.
This work presents a new scheme based on a quantum zero-knowledge proof for identity authentication. The novelty of this research is the migration of the classical concept Zero-knowledge into the quantum cryptographic framework that, to the best of our knowledge, has never been explored. This approach allows us to take advantage of the principles of quantum mechanics to build a protocol, which is secure against quantum computer attacks, for authenticating several users having access to the same network node. The protocol has been designed, its security analysed and implemented in modified Quantum Key Distribution devices. Two scenarios have been analysed experimentally, the first being both the prover and the verifier honest players, and the second case being the prover a malicious player, the latter demonstrating a notable increase in the quantum bit error rate that prevents a fraudulent authentication.
Watrous (STOC 2006) proved that plugging classical bit commitment scheme that is secure against quantum attack into the GMW-type construction of zero-knowledge gives a classical zero-knowledge proof that is secure against quantum attack. In this paper, we showed that plugging quantum bit commitment scheme (allowing quantum computation and communication) into the GMW-type construction also gives a quantum zero-knowledge proof, as one expects. However, since the binding condition of quantum bit commitment scheme is inherently different from its classical counterpart, compared with Watrous ’ security proof, here we encounter new difficulty in soundness analysis. To overcome the difficulty, we take a geometric approach, managing to reduce quantum soundness analysis to classical soundness analysis. We also propose a formalization of non-interactive quantum bit commitment scheme, which may come in handy in other places. Moreover, inspired by our formalization, we generalize Naor’s construction of bit commitment scheme to the quantum setting, achieving non-interactive commit stage. We hope quantum bit commitment scheme can find more applications in quantum cryptog-raphy. 1