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

Multimedia Tools and Applications

An efficient quantum non-interactive zero knowledge proof for confidential transaction and quantum range proof

B. Sriman, S. Ganesh Kumar

Published Feb 8, 2024• 5 citations
Publisher
DOI
10.1007/s11042-023-17882-6

Related papers

Efficient non-interactive zero-knowledge proofs for quantum range verification in blockchain

B. Sriman, S. Ganesh Kumar

Peer-to-Peer Networking and Applications•Jun 1, 2024•2 citations

Non-Interactive Zero-Knowledge Proofs in the Quantum Random Oracle Model

Dominique Unruh

Lecture notes in computer science•Jan 1, 2015•162 citations

A Simple Post-Quantum Non-interactive Zero-Knowledge Proof from Garbled Circuits

Hongrui Cui, Kaiyi Zhang

Lecture notes in computer science•Jan 1, 2021•4 citations

ID-based non-interactive zero-knowledge proof system based on one-out-of-two non-interactive oblivious transfer

Yung‐Hsiang Chen, Tzonelih Hwang

Computer Communications•Dec 1, 1995•3 citations

Efficient Fully Secure Computation via Distributed Zero-Knowledge Proofs

Elette Boyle, Niv Gilboa, Yuval Ishai +1 more

Lecture notes in computer science•Jan 1, 2020•46 citations

Certified-Everlasting Quantum NIZK Proofs

Nikhil Pappu

We study non-interactive zero-knowledge proofs (NIZKs) for NP satisfying: 1) statistical soundness, 2) computational zero-knowledge (ZK) and 3) certified-everlasting zero-knowledge (CE-ZK). The CE-ZK property allows a verifier of a quantum proof to revoke the proof in a way that can be checked (certified) by the prover. Conditioned on successful certification, the verifier's state can be efficiently simulated with only the statement, in a statistically indistinguishable way. Our contributions regarding these certified-everlasting NIZKs (CE-NIZKs) are as follows: - We identify a barrier to obtaining CE-NIZKs in the CRS model via generalizations of known interactive ZK proofs that satisfy CE-ZK. - We circumvent this by constructing CE-NIZK using non-black-box use of NIZK for NP satisfying certain properties, along with OWFs. As a result, we obtain CE-NIZKs for NP in the CRS model, based on polynomial hardness of the learning with errors (LWE) assumption. - In addition, we observe that the aforementioned barrier does not apply to the shared EPR model. We leverage this to construct CE-NIZK for NP in this model based on any statistical binding hidden bits generator, which is known from LWE. The only quantum computation here involves single-qubit measurements of the EPR pairs.

quant-pharXiv:2512.13628•Dec 16, 2025•0 citations
We study non-interactive zero-knowledge proofs (NIZKs) for NP satisfying: 1) statistical soundness, 2) computational zero-knowledge (ZK) and 3) certified-everlasting zero-knowledge (CE-ZK). The CE-ZK property allows a verifier of a quantum proof to revoke the proof in a way that can be checked (certified) by the prover. Conditioned on successful certification, the verifier's state can be efficiently simulated with only the statement, in a statistically indistinguishable way. Our contributions regarding these certified-everlasting NIZKs (CE-NIZKs) are as follows: - We identify a barrier to obtaining CE-NIZKs in the CRS model via generalizations of known interactive ZK proofs that satisfy CE-ZK. - We circumvent this by constructing CE-NIZK using non-black-box use of NIZK for NP satisfying certain properties, along with OWFs. As a result, we obtain CE-NIZKs for NP in the CRS model, based on polynomial hardness of the learning with errors (LWE) assumption. - In addition, we observe that the aforementioned barrier does not apply to the shared EPR model. We leverage this to construct CE-NIZK for NP in this model based on any statistical binding hidden bits generator, which is known from LWE. The only quantum computation here involves single-qubit measurements of the EPR pairs.