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

SPIE Three-Dimensional Imaging, Visualization, and Display

Optical zero-knowledge proof: an overview for scalable anonymous authentication

Youhyun Kim, Inkyu Moon

Published Apr 22, 2026• 0 citations
Publisher
DOI
10.1117/12.3094411

Related papers

Bidirectional quantum identity authentication with zero-knowledge proof

Luo-Jia Ma, Chao-Wen Li, Luo Yi-Zhen +4 more

Physical Review Applied•Jun 8, 2026•0 citations

A Password-Based Mutual Authentication Protocol via Zero-Knowledge Proof Solution

Mostefa Kara, Konstantinos Κarampidis, Zaoui Sayah +3 more

Lecture notes in networks and systems•Jan 1, 2023•27 citations

Conjugate coding based designated verifier quantum zero knowledge proof for user authentication

Jorge Garcia-Diaz, Daniel Escánez-Expósito, Pino Caballero‐Gil +1 more

Zero Knowledge Proofs based on computational hardness assumptions are fundamental primitives for secure user authentication. This paper proposes a novel Designated Verifier Zero Knowledge Proof that leverages the inherent randomness of quantum bits. Unlike traditional constructions relying on computationally intractable NP problems, the proposed protocol derives its security from the physical layer, specifically the uncertainty principle of quantum state projections in misaligned measurement bases. A rigorous formal mathematical analysis establishes the completeness, soundness and zero knowledge properties of the scheme. Furthermore, the protocol’s performance is evaluated via a quantum simulator under realistic error-prone conditions. The results demonstrate that the construction is robust against dishonest parties while remaining feasible under constrained quantum resources, offering a scalable approach for secure quantum authentication.

Cryptography and Communications•Apr 10, 2026•2 citations

Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer

Yehuda Lindell, Hila Zarosim

Journal of Cryptology•Jul 27, 2010•19 citations

Practical Post-Quantum Quorum Privacy via Structured Threshold Ring Signatures

Nikai Jagganath

Threshold ring signatures allow a quorum of eligible users to jointly authenticate a message while hiding the identities of the participating signers. Although this combines threshold authenticity with signer-set anonymity, a general T -out-of- N construction may require an expensive zero-knowledge proof to show that any undisclosed T -subset participated. This research investigates whether public structure can be used to reduce the cost of this anonymity statement and whether the resulting construction principle can be generalised across different multi-signature schemes. The first completed contribution introduces structured threshold ring signatures (sTRS), in which the admissible signing sets are defined by a public structure. By representing each complete valid quorum as one candidate set, the anonymity problem is reduced from proving knowledge of an arbitrary hidden T -subset to proving selection of one admissible set among N candidates. This idea is instantiated in LoTRS (CCS'26), our post-quantum sTRS that carefully combines a lattice-based multi-signature derived from DualMS (Crypto'23) with an Esgin et al.-style one-out-of-many proof (IEEE S&P'22). The current research builds on this idea by developing a generic sTRS compiler in which a suitable multi-signature authenticates a hidden admissible signer set, while an extractable one-out-of-many proof hides which set was selected. The subsequent objective investigates a non-interactive sTRS for settings in which additional communication rounds are undesirable.

ACM SIGSAC Conference on Computer and Communications Security (CCS)•Nov 12, 2026•0 citations

Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer

Yehuda Lindell, Hila Zarosim

Lecture notes in computer science•Jan 1, 2009•19 citations
Zero Knowledge Proofs based on computational hardness assumptions are fundamental primitives for secure user authentication. This paper proposes a novel Designated Verifier Zero Knowledge Proof that leverages the inherent randomness of quantum bits. Unlike traditional constructions relying on computationally intractable NP problems, the proposed protocol derives its security from the physical layer, specifically the uncertainty principle of quantum state projections in misaligned measurement bases. A rigorous formal mathematical analysis establishes the completeness, soundness and zero knowledge properties of the scheme. Furthermore, the protocol’s performance is evaluated via a quantum simulator under realistic error-prone conditions. The results demonstrate that the construction is robust against dishonest parties while remaining feasible under constrained quantum resources, offering a scalable approach for secure quantum authentication.
Threshold ring signatures allow a quorum of eligible users to jointly authenticate a message while hiding the identities of the participating signers. Although this combines threshold authenticity with signer-set anonymity, a general T -out-of- N construction may require an expensive zero-knowledge proof to show that any undisclosed T -subset participated. This research investigates whether public structure can be used to reduce the cost of this anonymity statement and whether the resulting construction principle can be generalised across different multi-signature schemes. The first completed contribution introduces structured threshold ring signatures (sTRS), in which the admissible signing sets are defined by a public structure. By representing each complete valid quorum as one candidate set, the anonymity problem is reduced from proving knowledge of an arbitrary hidden T -subset to proving selection of one admissible set among N candidates. This idea is instantiated in LoTRS (CCS'26), our post-quantum sTRS that carefully combines a lattice-based multi-signature derived from DualMS (Crypto'23) with an Esgin et al.-style one-out-of-many proof (IEEE S&P'22). The current research builds on this idea by developing a generic sTRS compiler in which a suitable multi-signature authenticates a hidden admissible signer set, while an extractable one-out-of-many proof hides which set was selected. The subsequent objective investigates a non-interactive sTRS for settings in which additional communication rounds are undesirable.