Adaptive zero-knowledge proofs and adaptively secure oblivious transfer

DOI10.1007/s00145-010-9072-zzbMath1251.94034OpenAlexW1981281205MaRDI 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 proofsoblivious transferadaptive securitysecure computationblack-box separationstatic securitytrapdoor permutations

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (10)

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

Cites Work

• 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
• 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

This page was built for publication: Adaptive zero-knowledge proofs and adaptively secure oblivious transfer