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

Computational Complexity

Randomness in interactive proofs

Mihir Bellare Y, Oded Goldreich, Shafi Goldwasser

Published Dec 1, 1993• 55 citations
Publisher
DOI
10.1007/bf01275487

Related papers

Interactive Proofs for Quantum Computation

Andrew Chi-Chih Yao

Lecture notes in computer science•Jan 1, 2003•15 citations

Interactive Proofs with Approximately Commuting Provers

Matthew Coudron, Thomas Vidick

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

Interactive Proof Systems

Daniele Micciancio, Shafi Goldwasser

Springer eBooks•Jan 1, 2002•4 citations

Non-interactive Proofs for Integer Multiplication

Ivan Damgård, Rune Thorbek

Lecture notes in computer science•Jan 1, 2007•41 citations

Interactive proofs with quantum finite automata

Harumichi Nishimura, Tomoyuki Yamakami

arXiv:1401.2929•Theoretical Computer Science•Dec 6, 2014•9 citations

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

Dominique Unruh

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