Composition of zero-knowledge proofs with efficient provers

DOI10.1007/978-3-642-11799-2_34MaRDI QIDQ3408217zbMATH OpenOpenAlexFDO

Authors Eleanor Birrell, Salil 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)

Recommendations

• On the Composition of Zero-Knowledge Proof Systems
• An Unconditional Study of Computational Zero Knowledge
• scientific article; zbMATH DE number 177820
• On relationships between statistical zero-knowledge proofs
• Zero knowledge with efficient provers

Cites work

• scientific article; zbMATH DE number 4191106 (Why is no real title available?)
• scientific article; zbMATH DE number 3960854 (Why is no real title available?)
• scientific article; zbMATH DE number 4101089 (Why is no real title available?)
• scientific article; zbMATH DE number 708820 (Why is no real title available?)
• scientific article; zbMATH DE number 4185024 (Why is no real title available?)
• A uniform-complexity treatment of encryption and zero-knowledge
• Composition of zero-knowledge proofs with efficient provers
• Definitions and properties of zero-knowledge proof systems
• Foundations of Cryptography
• How to construct constant-round zero-knowledge proof systems for NP
• Lower bounds for non-black-box zero knowledge
• New directions in cryptography
• On the (Im)Possibility of Arthur-Merlin Witness Hiding Protocols
• On the Composition of Zero-Knowledge Proof Systems
• Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
• Sparse pseudorandom distributions
• The Knowledge Complexity of Interactive Proof Systems
• The knowledge complexity of interactive proof-systems

Cited in

(11)

• Zero knowledge with efficient provers
• On the Composition of Zero-Knowledge Proof Systems
• scientific article; zbMATH DE number 1952907 (Why is no real title available?)
• Zero-knowledge proofs for committed symmetric Boolean functions
• scientific article; zbMATH DE number 1559565 (Why is no real title available?)
• Efficient Delegation of Zero-Knowledge Proofs of Knowledge in a Pairing-Friendly Setting
• Zero knowledge in the random oracle model, revisited
• Non-interactive zero-knowledge proofs for composite statements
• scientific article; zbMATH DE number 177820 (Why is no real title available?)
• Composition of zero-knowledge proofs with efficient provers
• Efficient Constructions of Composable Commitments and Zero-Knowledge Proofs

This page was built for publication: Composition of zero-knowledge proofs with efficient provers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3408217)