Round-optimal black-box commit-and-prove with succinct communication

DOI10.1007/978-3-030-56880-1_19MaRDI QIDQ2096539zbMATH OpenOpenAlexFDO

Authors Susumu Kiyoshima

Publication date 9 November 2022

Full work available at URL https://doi.org/10.1007/978-3-030-56880-1_19

zbMATH Keywords

sub-exponentially hard collision-resistant hash functionstwo-round OTstwo-round PIRs

Mathematics Subject Classification ID

Communication theory (94A05) Cryptography (94A60)

Recommendations

• Round optimal black-box ``commit-and-prove
• Black-box anonymous commit-and-prove
• Black-box non-black-box zero knowledge
• Probabilistically checkable proofs of proximity with zero-knowledge
• Constant-round black-box construction of composable multi-party computation protocol

Cites work

• 3-message zero knowledge against human ignorance
• A full proof of the BGW protocol for perfectly secure multiparty computation
• Black-box constructions of composable protocols without set-up
• Black-Box Constructions of Two-Party Protocols from One-Way Functions
• Black-box non-black-box zero knowledge
• Delegating computation: interactive proofs for muggles
• Delegating RAM Computations
• How to delegate computations
• Non-interactive delegation and batch NP verification from standard computational assumptions
• Non-interactive verifiable computing: outsourcing computation to untrusted workers
• On the Composition of Zero-Knowledge Proof Systems
• On the Power of Secure Two-Party Computation
• Probabilistically checkable proofs of proximity with zero-knowledge
• Round optimal black-box ``commit-and-prove
• Round-optimal fully black-box zero-knowledge arguments from one-way permutations
• Succinct delegation for low-space non-deterministic computation
• Succinct non-interactive secure computation
• The Knowledge Complexity of Interactive Proof Systems
• Universally composable two-party and multi-party secure computation
• Witness indistinguishability for any single-round argument with applications to access control
• Zero-knowledge proofs from secure multiparty computation

Cited in

(10)

• Round optimal black-box ``commit-and-prove
• Towards a unified approach to black-box constructions of zero-knowledge proofs
• Bounds on the efficiency of black-box commitment schemes
• Round-Optimal Black-Box Statistically Binding Selective-Opening Secure Commitments
• Black-box non-black-box zero knowledge
• 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
• Black-box timed commitments from time-lock puzzles
• Verifiable encryption from MPC-in-the-head

This page was built for publication: Round-optimal black-box commit-and-prove with succinct communication

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