Proving Computational Ability

DOI10.1007/978-3-642-22670-0_2zbMath1343.94041OpenAlexW124642110MaRDI QIDQ3088170

Oded Goldreich, Mihir Bellare

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_2

zbMATH Keywords

cryptographic protocolszero-knowledgeproofs of knowledge

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60)

Related Items (1)

The Turing Test as Interactive Proof

Cites Work

• Zero-knowledge proofs of identity
• The Knowledge Complexity of Interactive Proof Systems
• Unnamed Item
• Unnamed Item

This page was built for publication: Proving Computational Ability