Adaptive zero-knowledge proofs and adaptively secure oblivious transfer

DOI10.1007/s00145-010-9072-zzbMath1251.94034MaRDI QIDQ656920

Yehuda Lindell, Hila Zarosim

Publication date: 13 January 2012

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00145-010-9072-z

zbMATH Keywords

zero-knowledge proofs; oblivious transfer; adaptive security; secure computation; black-box separation; static security; trapdoor permutations

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

94A60: Cryptography

68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)

Related Items

Constant Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model, Adaptively secure MPC with sublinear communication complexity, Doubly adaptive zero-knowledge proofs, Constant-round adaptive zero-knowledge proofs for NP, Constant-round leakage-resilient zero-knowledge from collision resistance, Adaptively secure computation for RAM programs, On the power of secure two-party computation, On the feasibility of extending oblivious transfer, On the Power of Secure Two-Party Computation, Composable Adaptive Secure Protocols Without Setup Under Polytime Assumptions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A language-dependent cryptographic primitive
• Bit commitment using pseudorandomness
• Efficient secure two-party protocols. Techniques and constructions
• How to construct constant-round zero-knowledge proof systems for NP
• Security and composition of multiparty cryptographic protocols
• Zero knowledge with efficient provers
• Universally composable two-party and multi-party secure computation
• Towards a Separation of Semantic and CCA Security for Public Key Encryption
• The Random Oracle Model and the Ideal Cipher Model Are Equivalent
• How to Construct Pseudorandom Permutations from Pseudorandom Functions
• Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
• On the Impossibilities of Basing One-Way Permutations on Central Cryptographic Primitives
• Foundations of Cryptography
• Advances in Cryptology - CRYPTO 2003
• A Characterization of Non-interactive Instance-Dependent Commitment-Schemes (NIC)
• An Equivalence Between Zero Knowledge and Commitments
• Bounds on the Efficiency of Generic Cryptographic Constructions
• Theory of Cryptography
• Theory of Cryptography