Round optimal black-box ``commit-and-prove
From MaRDI portal
Publication:1629413
DOI10.1007/978-3-030-03807-6_11zbMath1443.94067OpenAlexW2798595079MaRDI QIDQ1629413
Akshayaram Srinivasan, Dakshita Khurana, Rafail Ostrovsky
Publication date: 11 December 2018
Full work available at URL: https://doi.org/10.1007/978-3-030-03807-6_11
Related Items (8)
Towards a unified approach to black-box constructions of zero-knowledge proofs ⋮ On black-box extension of a non-interactive zero-knowledge proof system for secret equality ⋮ Post-quantum simulatable extraction with minimal assumptions: black-box and constant-round ⋮ Four-round black-box non-malleable schemes from one-way permutations ⋮ List oblivious transfer and applications to round-optimal black-box multiparty coin tossing ⋮ Secure computation with shared EPR pairs (or: how to teleport in zero-knowledge) ⋮ Which languages have 4-round fully black-box zero-knowledge arguments from one-way functions? ⋮ Round-optimal black-box commit-and-prove with succinct communication
Cites Work
- Unnamed Item
- Efficient secure two-party protocols. Techniques and constructions
- How to construct constant-round zero-knowledge proof systems for NP
- Secure two-party computation via cut-and-choose oblivious transfer
- Computationally private randomizing polynomials and their applications
- On the Power of Secure Two-Party Computation
- Fast Cut-and-Choose Based Protocols for Malicious and Covert Adversaries
- Efficient Secure Two-Party Computation Using Symmetric Cut-and-Choose
- Amortizing Garbled Circuits
- Must You Know the Code of f to Securely Compute f?
- Black-box constructions for secure computation
- How to Efficiently Evaluate RAM Programs with Malicious Security
- Two-Output Secure Computation with Malicious Adversaries
- Efficient Non-interactive Secure Computation
- Round-Optimal Black-Box Two-Party Computation
- Universally composable two-party and multi-party secure computation
- Founding Cryptography on Oblivious Transfer – Efficiently
- LEGO for Two-Party Secure Computation
- Simple, Black-Box Constructions of Adaptively Secure Protocols
- Black-Box Constructions of Two-Party Protocols from One-Way Functions
- Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
- The knowledge complexity of interactive proof-systems
- On the Composition of Zero-Knowledge Proof Systems
- Black-box non-black-box zero knowledge
- Resettably Sound Zero-Knowledge Arguments from OWFs - The (Semi) Black-Box Way
- Advances in Cryptology – CRYPTO 2004
- Textbook non-malleable commitments
- Constant round non-malleable protocols using one way functions
- An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
- Revisiting the Efficiency of Malicious Two-Party Computation
- Semi-honest to Malicious Oblivious Transfer—The Black-Box Way
- The Exact Round Complexity of Secure Computation
- Theory of Cryptography
This page was built for publication: Round optimal black-box ``commit-and-prove