Strong Proofs of Knowledge

DOI10.1007/978-3-642-22670-0_7zbMath1343.94051OpenAlexW35569685MaRDI QIDQ3088175

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_7

zbMATH Keywords

proof of knowledgezero-knowledge proof

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Zero-knowledge proofs of identity
• On expected probabilistic polynomial-time adversaries: a suggestion for restricted definitions and their benefits
• Lower bounds for non-black-box zero knowledge
• The Knowledge Complexity of Interactive Proof Systems
• Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
• Foundations of Cryptography
• Strict Polynomial-Time in Simulation and Extraction
• Foundations of Cryptography

This page was built for publication: Strong Proofs of Knowledge