On Probabilistic versus Deterministic Provers in the Definition of Proofs of Knowledge

DOI10.1007/978-3-642-22670-0_14zbMath1343.94042OpenAlexW2159793929MaRDI QIDQ3088182

Mihir Bellare, Oded Goldreich

Publication date: 19 August 2011

Published in: Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22670-0_14

zbMATH Keywords

proof of knowledgeexpected running timeprobabilistic proof systemsprobabilism versus determinism

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (6)

Concurrent knowledge extraction in public-key models ⋮ On Non-Black-Box Simulation and the Impossibility of Approximate Obfuscation ⋮ Constant-round zero-knowledge proofs of knowledge with strict polynomial-time extractors for NP ⋮ The Knowledge Complexity of Interactive Proof Systems ⋮ Accountable authority identity-based broadcast encryption with constant-size private keys and ciphertexts ⋮ On the amortized complexity of zero-knowledge protocols

Cites Work

• The Knowledge Complexity of Interactive Proof Systems
• Foundations of Cryptography
• Foundations of Cryptography
• Unnamed Item

This page was built for publication: On Probabilistic versus Deterministic Provers in the Definition of Proofs of Knowledge