Round-optimal black-box commit-and-prove with succinct communication
From MaRDI portal
Publication:2096539
DOI10.1007/978-3-030-56880-1_19zbMath1504.94162OpenAlexW3046817100MaRDI QIDQ2096539
Publication date: 9 November 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-56880-1_19
Related Items (4)
Towards a unified approach to black-box constructions of zero-knowledge proofs ⋮ Post-quantum simulatable extraction with minimal assumptions: black-box and constant-round ⋮ Black-box anonymous commit-and-prove ⋮ Round-optimal black-box MPC in the plain model
Cites Work
- A full proof of the BGW protocol for perfectly secure multiparty computation
- Round-optimal fully black-box zero-knowledge arguments from one-way permutations
- Round optimal black-box ``commit-and-prove
- Witness indistinguishability for any single-round argument with applications to access control
- Succinct non-interactive secure computation
- On the Power of Secure Two-Party Computation
- Black-Box Constructions of Composable Protocols without Set-Up
- Delegating Computation
- 3-Message Zero Knowledge Against Human Ignorance
- Delegating RAM Computations
- Zero-Knowledge Proofs from Secure Multiparty Computation
- Universally composable two-party and multi-party secure computation
- Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers
- Black-Box Constructions of Two-Party Protocols from One-Way Functions
- The Knowledge Complexity of Interactive Proof Systems
- On the Composition of Zero-Knowledge Proof Systems
- Non-interactive delegation and batch NP verification from standard computational assumptions
- Succinct delegation for low-space non-deterministic computation
- How to delegate computations
- Black-box non-black-box zero knowledge
- Probabilistically Checkable Proofs of Proximity with Zero-Knowledge
This page was built for publication: Round-optimal black-box commit-and-prove with succinct communication
