Adaptive zero-knowledge proofs and adaptively secure oblivious transfer
From MaRDI portal
Publication:656920
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
- scientific article; zbMATH DE number 1418318
- Constant-round adaptive zero-knowledge proofs for NP
Cites work
- scientific article; zbMATH DE number 4191106 (Why is no real title available?)
- scientific article; zbMATH DE number 4195166 (Why is no real title available?)
- scientific article; zbMATH DE number 4101089 (Why is no real title available?)
- scientific article; zbMATH DE number 176554 (Why is no real title available?)
- scientific article; zbMATH DE number 1256783 (Why is no real title available?)
- scientific article; zbMATH DE number 1256784 (Why is no real title available?)
- scientific article; zbMATH DE number 1302802 (Why is no real title available?)
- scientific article; zbMATH DE number 1303133 (Why is no real title available?)
- scientific article; zbMATH DE number 1024048 (Why is no real title available?)
- scientific article; zbMATH DE number 1088227 (Why is no real title available?)
- scientific article; zbMATH DE number 2079922 (Why is no real title available?)
- scientific article; zbMATH DE number 1759794 (Why is no real title available?)
- scientific article; zbMATH DE number 1842484 (Why is no real title available?)
- scientific article; zbMATH DE number 4185033 (Why is no real title available?)
- A Characterization of Non-interactive Instance-Dependent Commitment-Schemes (NIC)
- A language-dependent cryptographic primitive
- Advances in Cryptology - CRYPTO 2003
- An Equivalence Between Zero Knowledge and Commitments
- Bit commitment using pseudorandomness
- Bounds on the Efficiency of Generic Cryptographic Constructions
- Efficient secure two-party protocols. Techniques and constructions
- Foundations of Cryptography
- How to Construct Pseudorandom Permutations from Pseudorandom Functions
- How to construct constant-round zero-knowledge proof systems for NP
- On the Impossibilities of Basing One-Way Permutations on Central Cryptographic Primitives
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
- Security and composition of multiparty cryptographic protocols
- The Random Oracle Model and the Ideal Cipher Model Are Equivalent
- Theory of Cryptography
- Theory of Cryptography
- Towards a Separation of Semantic and CCA Security for Public Key Encryption
- Universally composable two-party and multi-party secure computation
- Zero knowledge with efficient provers
Cited in
(14)- On the feasibility of extending oblivious transfer
- Composable Adaptive Secure Protocols Without Setup Under Polytime Assumptions
- Adaptively secure computation for RAM programs
- Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer
- scientific article; zbMATH DE number 1302802 (Why is no real title available?)
- On the Power of Secure Two-Party Computation
- Constant-round leakage-resilient zero-knowledge from collision resistance
- Constant-round adaptive zero-knowledge proofs for NP
- Trading Static for Adaptive Security in Universally Composable Zero-Knowledge
- Constant round adaptively secure protocols in the tamper-proof hardware model
- Adaptively secure MPC with sublinear communication complexity
- On the power of secure two-party computation
- Doubly adaptive zero-knowledge proofs
- Efficient adaptively secure zero-knowledge from garbled circuits
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)
