Adaptive zero-knowledge proofs and adaptively secure oblivious transfer

DOI10.1007/S00145-010-9072-ZzbMATH Open1251.94034OpenAlexW1981281205MaRDI QIDQ656920FDOQ656920

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

Recommendations

Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer
scientific article; zbMATH DE number 1302802
Doubly adaptive zero-knowledge proofs
Efficient and round-optimal oblivious transfer and commitment with adaptive security
scientific article; zbMATH DE number 1256783
Efficient adaptively secure zero-knowledge from garbled circuits
Practical adaptive oblivious transfer from simple assumptions
Publication:4941880
Constant-round adaptive zero-knowledge proofs for NP

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

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (14)

Adaptively secure computation for RAM programs
Efficient adaptively secure zero-knowledge from garbled circuits
Trading Static for Adaptive Security in Universally Composable Zero-Knowledge
Constant-round leakage-resilient zero-knowledge from collision resistance
On the feasibility of extending oblivious transfer
Constant round adaptively secure protocols in the tamper-proof hardware model
On the Power of Secure Two-Party Computation
Composable Adaptive Secure Protocols Without Setup Under Polytime Assumptions
Adaptively secure MPC with sublinear communication complexity
Title not available (Why is that?)
On the power of secure two-party computation
Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer
Constant-round adaptive zero-knowledge proofs for NP
Doubly adaptive zero-knowledge proofs

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

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