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

Lecture notes in computer science

Interactive Zero-Knowledge with Restricted Random Oracles

Moti M. Yung, Yunlei Zhao

Published Jan 1, 2006• 14 citations
Publisher
DOI
10.1007/11681878_2

Related papers

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

Dominique Unruh

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

Oracle separations between quantum and non-interactive zero-knowledge classes

Benjamin Morrison, Adam Groce

arXiv:1907.03205•Information Processing Letters•Oct 22, 2019•2 citations

Unclonable Non-interactive Zero-Knowledge

Ruta Jawale, Dakshita Khurana

arXiv:2310.07118•Lecture notes in computer science•Dec 8, 2024•8 citations

Universally composable zero-knowledge sets

Haixia Xu, Hongda Li, Bao Li

We define and construct universally composable (UC) Zero-Knowledge Set (ZKS) protocols. A ZKS protocol allows a prover to commit to a secret set S and prove statements of the form x ∈ S or x ∉ S without revealing any other information about S. The universal composability framework initiated by Canetti is very useful as it ensures stronger security such as concurrent composition, adaptive security and non-malleability. In this paper, we propose a UC ZKS protocol and prove its security in the random oracle model. Simultaneously, we give the negative result that a UC ZKS cannot exist in the standard model (without a random oracle). The negative result shows that the random oracle has both compression and extraction, which is a pair of paradoxical properties. To our knowledge, this is the first time this kind of property has been considered.

International Journal of Grid and Utility Computing•Jan 1, 2012•5 citations

Limits on the Usefulness of Random Oracles

Iftach Haitner, Eran Omri, Hila Zarosim

Lecture notes in computer science•Jan 1, 2013•16 citations

Oracle Separations for Quantum Statistical Zero-Knowledge

Sanketh Menda, John Watrous

This paper investigates the power of quantum statistical zero knowledge interactive proof systems in the relativized setting. We prove the existence of an oracle relative to which quantum statistical zero-knowledge does not contain UP intersect coUP, and we prove that quantum statistical zero knowledge does not contain UP relative to a random oracle with probability 1. Our proofs of these statements rely on a bound on output state discrimination for relativized quantum circuits based on the quantum adversary method of Ambainis, following a technique similar to one used by Ben-David and Kothari to prove limitations on a query complexity variant of quantum statistical zero-knowledge.

arXiv:1801.08967•Jan 26, 2018•15 citations
We define and construct universally composable (UC) Zero-Knowledge Set (ZKS) protocols. A ZKS protocol allows a prover to commit to a secret set S and prove statements of the form x ∈ S or x ∉ S without revealing any other information about S. The universal composability framework initiated by Canetti is very useful as it ensures stronger security such as concurrent composition, adaptive security and non-malleability. In this paper, we propose a UC ZKS protocol and prove its security in the random oracle model. Simultaneously, we give the negative result that a UC ZKS cannot exist in the standard model (without a random oracle). The negative result shows that the random oracle has both compression and extraction, which is a pair of paradoxical properties. To our knowledge, this is the first time this kind of property has been considered.
This paper investigates the power of quantum statistical zero knowledge interactive proof systems in the relativized setting. We prove the existence of an oracle relative to which quantum statistical zero-knowledge does not contain UP intersect coUP, and we prove that quantum statistical zero knowledge does not contain UP relative to a random oracle with probability 1. Our proofs of these statements rely on a bound on output state discrimination for relativized quantum circuits based on the quantum adversary method of Ambainis, following a technique similar to one used by Ben-David and Kothari to prove limitations on a query complexity variant of quantum statistical zero-knowledge.