Composition of Zero-Knowledge Proofs with Efficient Provers

DOI10.1007/978-3-642-11799-2_34zbMath1274.94042OpenAlexW2145621178MaRDI QIDQ3408217

Eleanor Birrell, Salil P. Vadhan

Publication date: 24 February 2010

Published in: Theory of Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-11799-2_34

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (1)

Composition of Zero-Knowledge Proofs with Efficient Provers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A uniform-complexity treatment of encryption and zero-knowledge
• Definitions and properties of zero-knowledge proof systems
• How to construct constant-round zero-knowledge proof systems for NP
• Lower bounds for non-black-box zero knowledge
• Composition of Zero-Knowledge Proofs with Efficient Provers
• On the (Im)Possibility of Arthur-Merlin Witness Hiding Protocols
• The Knowledge Complexity of Interactive Proof Systems
• New directions in cryptography
• Sparse pseudorandom distributions
• Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
• Foundations of Cryptography
• The knowledge complexity of interactive proof-systems
• On the Composition of Zero-Knowledge Proof Systems

This page was built for publication: Composition of Zero-Knowledge Proofs with Efficient Provers