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

On Zero-Knowledge Proofs over the Quantum Internet

Mark Carney

Published Dec 6, 2022• 1 citation
arXivHTMLPDF

Abstract

This paper presents a new method for quantum identity authentication (QIA) protocols. The logic of classical zero-knowledge proofs (ZKPs) due to Schnorr is applied in quantum circuits and algorithms. This novel approach gives an exact way with which a prover $P$ can prove they know some secret by encapsulating it in a quantum state before sending to a verifier $V$ by means of a quantum channel - allowing for a ZKP wherein an eavesdropper or manipulation can be detected with a fail-safe design. This is achieved by moving away from the hardness of the Discrete Logarithm Problem towards the hardness of estimating quantum states. This paper presents a method with which this can be achieved and some bounds for the security of the protocol provided. With the anticipated advent of a `quantum internet', such protocols and ideas may soon have utility and execution in the real world.

DOI
10.48550/arxiv.2212.03027

Related papers

Quantum Security of Zero Knowledge Protocols

Morcos Doueihy, Jean-Paul

A Zero-Knowledge Proof basically is a protocol between two parties, the Prover and the Verifier, that allows the Prover to convince the Verifier about the truthness of a non trivial statement without revealing any additional information. Zero Knowledge Proofs have found a lot of practical applications covering most of the protocols concerning about data privacy and protocol verification. Examples of that are anonymous cash or electronic voting. The possibility to have real quantum computers with a reasonable size in a near future is forcing the cryptographic community to devise new methods to provide security that resist quantum attacks. Most of the zero-knowledge protocols used nowadays are based on computational problems like the discrete logarithm problem that can no longer be considered hard, since there are known efficient ways to solve them with quantum algorithms. Cryptographic research about the quantum security of zero knowledge proofs started nearly 20 years ago in a very theoretical approach, but not many papers on that topic appeared since then. The goal of this thesis is writing a survey including the main concepts about quantum secure zero-knowledge protocols, the state-of-the-art both from the theoretical and practical approaches, and an exploration of their potential application areas. The survey will be a good starting document for further students willing to do research in this topic.

•Sep 10, 2024•0 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•14 citations

Zero-Knowledge Proofs for Quantum State Transfer

Jincheng Zhang

This paper explores the application of zero-knowledge proofs (ZKPs) to facilitate quantum state transfer. The core idea is to leverage ZKPs to verify the correct reception of a quantum state without revealing the state itself. Traditional quantum communication methods are susceptible to information leakage, and distance limitations restrict effective transmission. This research proposes a novel quantum communication protocol incorporating ZKPs, offering a potential solution to these challenges. The protocol utilizes a series of measurements and cryptographic proofs to guarantee the receiver accurately interprets the intended quantum state. We present a formal mathematical framework for this protocol, detailing the key components and their relationships. The resulting system significantly reduces the risk of information compromise while potentially expanding the practical range of quantum communication. The primary contribution lies in the innovative combination of quantum communication principles with the robust security guarantees provided by ZKPs. We analyze the protocol's performance and discuss its implications for secure quantum networks. ---

•Sep 6, 2026•0 citations

Quantumization of Zero-Knowledge Proofs and Verifiable Computation Circuits

Jincheng Zhang

This paper explores the quantumization of zero-knowledge proofs (ZKPs) and verifiable computation circuits (VCCs), presenting a novel approach to achieving secure and verifiable execution of quantum computation programs. The core idea involves leveraging quantum circuit hashing techniques to construct ZKP protocols that demonstrate the correctness of a VCC without revealing its underlying structure. This approach addresses a critical need within the burgeoning field of quantum computing – the provision of robust and trustworthy execution validation mechanisms. We outline the theoretical framework, detailing the key components of the system including the circuit hashing algorithm, the ZKP protocol design, and the associated mathematical formalization. The work contributes to the development of a new paradigm for quantum program verification, offering a potential pathway towards building more reliable and secure quantum computing systems. The presented methodology aims to bridge the gap between the theoretical promise of quantum computation and the practical challenges of ensuring its trustworthiness. ---

•Sep 1, 2026•0 citations

A Post-Quantum Zero-Knowledge Identification Scheme

Maryam Rezaei Kashi, Mojtaba Bahramian

‎In this paper‎, ‎we introduce a zero-knowledge identification protocol designed for authentication within the supersingular isogeny Diffie-Hellman (SIDH) key exchange framework‎. ‎The protocol allows both parties to participate as either the prover or the verifier‎, ‎with the goal of proving that they know their private information‎. ‎We show the completeness and soundness of the protocol by showing that the privacy of both the prover and the verifier depends on the difficulty of solving the extended isogeny logarithm problem‎. ‎A new authentication protocol for SIDH is presented in this paper‎, ‎that is secure against attacks from eavesdroppers‎.

•Dec 1, 2025•0 citations

Post-Quantum Zero-Knowledge Proofs and Applications

Ron Steinfeld

Lattice-based cryptography is one of the most promising candidates for designing post-quantum cryptographic algorithms that resist emerging quantum computing attacks. The recent NIST PQC standardization process is nearing its completion, with practical lattice-based algorithms for basic cryptographic functionalities (namely digital signature and public-key encryption) selected for standardization in the near future. However, practical lattice-based solutions for more advanced privacy-preserving protocols, in particular, Zero-Knowledge Proofs (ZKPs), have only emerged recently and are an active area of research. We discuss some recent developments in design and analysis of practical lattice-based post-quantum ZKPs and their applications. In particular, we review some challenges that arise in designing ZKPs in the lattice setting and some recent progress on efficient lattice-based Schnorr-like proofs for important relations, such as binary/range proofs, one-out-of-many proofs and rounding proofs [1, 2, 4]. We discuss applications and optimization of such proof systems as building blocks for practical advanced cryptographic protocols such as ring signatures and balance proofs for privacy-preserving cryptocurrency payment protocols [2, 3]. We also discuss our recent work on succinct designated-verifier ZKPs (DV-ZKSNARKS) for verifying correctness of general delegated computations [5].

ACM ASIA Public-Key Cryptography Workshop (APKC)•Jun 20, 2023•5 citations
This paper presents a new method for quantum identity authentication (QIA) protocols. The logic of classical zero-knowledge proofs (ZKPs) due to Schnorr is applied in quantum circuits and algorithms. This novel approach gives an exact way with which a prover PPP can prove they know some secret by encapsulating it in a quantum state before sending to a verifier VVV by means of a quantum channel - allowing for a ZKP wherein an eavesdropper or manipulation can be detected with a fail-safe design. This is achieved by moving away from the hardness of the Discrete Logarithm Problem towards the hardness of estimating quantum states. This paper presents a method with which this can be achieved and some bounds for the security of the protocol provided. With the anticipated advent of a `quantum internet', such protocols and ideas may soon have utility and execution in the real world.
A Zero-Knowledge Proof basically is a protocol between two parties, the Prover and the Verifier, that allows the Prover to convince the Verifier about the truthness of a non trivial statement without revealing any additional information. Zero Knowledge Proofs have found a lot of practical applications covering most of the protocols concerning about data privacy and protocol verification. Examples of that are anonymous cash or electronic voting. The possibility to have real quantum computers with a reasonable size in a near future is forcing the cryptographic community to devise new methods to provide security that resist quantum attacks. Most of the zero-knowledge protocols used nowadays are based on computational problems like the discrete logarithm problem that can no longer be considered hard, since there are known efficient ways to solve them with quantum algorithms. Cryptographic research about the quantum security of zero knowledge proofs started nearly 20 years ago in a very theoretical approach, but not many papers on that topic appeared since then. The goal of this thesis is writing a survey including the main concepts about quantum secure zero-knowledge protocols, the state-of-the-art both from the theoretical and practical approaches, and an exploration of their potential application areas. The survey will be a good starting document for further students willing to do research in this topic.
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 paper explores the application of zero-knowledge proofs (ZKPs) to facilitate quantum state transfer. The core idea is to leverage ZKPs to verify the correct reception of a quantum state without revealing the state itself. Traditional quantum communication methods are susceptible to information leakage, and distance limitations restrict effective transmission. This research proposes a novel quantum communication protocol incorporating ZKPs, offering a potential solution to these challenges. The protocol utilizes a series of measurements and cryptographic proofs to guarantee the receiver accurately interprets the intended quantum state. We present a formal mathematical framework for this protocol, detailing the key components and their relationships. The resulting system significantly reduces the risk of information compromise while potentially expanding the practical range of quantum communication. The primary contribution lies in the innovative combination of quantum communication principles with the robust security guarantees provided by ZKPs. We analyze the protocol's performance and discuss its implications for secure quantum networks. ---
This paper explores the quantumization of zero-knowledge proofs (ZKPs) and verifiable computation circuits (VCCs), presenting a novel approach to achieving secure and verifiable execution of quantum computation programs. The core idea involves leveraging quantum circuit hashing techniques to construct ZKP protocols that demonstrate the correctness of a VCC without revealing its underlying structure. This approach addresses a critical need within the burgeoning field of quantum computing – the provision of robust and trustworthy execution validation mechanisms. We outline the theoretical framework, detailing the key components of the system including the circuit hashing algorithm, the ZKP protocol design, and the associated mathematical formalization. The work contributes to the development of a new paradigm for quantum program verification, offering a potential pathway towards building more reliable and secure quantum computing systems. The presented methodology aims to bridge the gap between the theoretical promise of quantum computation and the practical challenges of ensuring its trustworthiness. ---
‎In this paper‎, ‎we introduce a zero-knowledge identification protocol designed for authentication within the supersingular isogeny Diffie-Hellman (SIDH) key exchange framework‎. ‎The protocol allows both parties to participate as either the prover or the verifier‎, ‎with the goal of proving that they know their private information‎. ‎We show the completeness and soundness of the protocol by showing that the privacy of both the prover and the verifier depends on the difficulty of solving the extended isogeny logarithm problem‎. ‎A new authentication protocol for SIDH is presented in this paper‎, ‎that is secure against attacks from eavesdroppers‎.
Lattice-based cryptography is one of the most promising candidates for designing post-quantum cryptographic algorithms that resist emerging quantum computing attacks. The recent NIST PQC standardization process is nearing its completion, with practical lattice-based algorithms for basic cryptographic functionalities (namely digital signature and public-key encryption) selected for standardization in the near future. However, practical lattice-based solutions for more advanced privacy-preserving protocols, in particular, Zero-Knowledge Proofs (ZKPs), have only emerged recently and are an active area of research. We discuss some recent developments in design and analysis of practical lattice-based post-quantum ZKPs and their applications. In particular, we review some challenges that arise in designing ZKPs in the lattice setting and some recent progress on efficient lattice-based Schnorr-like proofs for important relations, such as binary/range proofs, one-out-of-many proofs and rounding proofs [1, 2, 4]. We discuss applications and optimization of such proof systems as building blocks for practical advanced cryptographic protocols such as ring signatures and balance proofs for privacy-preserving cryptocurrency payment protocols [2, 3]. We also discuss our recent work on succinct designated-verifier ZKPs (DV-ZKSNARKS) for verifying correctness of general delegated computations [5].