Towards a unified approach to black-box constructions of zero-knowledge proofs
From MaRDI portal
Publication:2139627
DOI10.1007/978-3-030-84259-8_2zbMath1489.94103OpenAlexW3185396169MaRDI QIDQ2139627
Publication date: 18 May 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-84259-8_2
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Round-optimal fully black-box zero-knowledge arguments from one-way permutations
- Round optimal black-box ``commit-and-prove
- A new approach to black-box concurrent secure computation
- Round-optimal black-box commit-and-prove with succinct communication
- Black-box constructions of bounded-concurrent secure computation
- Merkle's key agreement protocol is optimal: an \(O(n^2)\) attack on any key agreement from random oracles
- On the Power of Secure Two-Party Computation
- Round-Efficient Black-Box Construction of Composable Multi-Party Computation
- Must You Know the Code of f to Securely Compute f?
- Black-Box Constructions of Composable Protocols without Set-Up
- Black-box constructions for secure computation
- Secure Multiparty RAM Computation in Constant Rounds
- Founding Cryptography on Oblivious Transfer – Efficiently
- Black-Box Constructions of Two-Party Protocols from One-Way Functions
- Foundations of Cryptography
- The Wire-Tap Channel
- A Pseudorandom Generator from any One-way Function
- Foundations of Cryptography
- The knowledge complexity of interactive proof-systems
- Reducibility among Combinatorial Problems
- Black-box non-black-box zero knowledge
- Constant round non-malleable protocols using one way functions
- Semi-honest to Malicious Oblivious Transfer—The Black-Box Way
- Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator
- The complexity of theorem-proving procedures
- Theory of Cryptography
- Theory of Cryptography
This page was built for publication: Towards a unified approach to black-box constructions of zero-knowledge proofs
