Beyond MPC-in-the-head: black-box constructions of short zero-knowledge proofs

DOI10.1007/978-3-031-48615-9_1zbMATH Open1544.94249MaRDI QIDQ6581781

Carmit Hazay, Muthuramakrishnan Venkitasubramaniam, Mor Weiss

Publication date: 1 August 2024

secure Multi-Party Computation protocols.

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Network protocols (68M12)

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Bit commitment using pseudorandomness
Using fully homomorphic hybrid encryption to minimize non-interative zero-knowledge proofs
Round-optimal fully black-box zero-knowledge arguments from one-way permutations
Round optimal black-box ``commit-and-prove
Zero knowledge protocols from succinct constraint detection
Linear-time zero-knowledge proofs for arithmetic circuit satisfiability
The rise of Paillier: homomorphic secret sharing and public-key silent OT
The price of active security in cryptographic protocols
Large message homomorphic secret sharing from DCR and applications
Incompressible cryptography
Zero-knowledge IOPs with linear-time prover and polylogarithmic-time verifier
Aurora: transparent succinct arguments for R1CS
Scalable zero knowledge with no trusted setup
Libra: succinct zero-knowledge proofs with optimal prover computation
Quasi-Linear Size Zero Knowledge from Linear-Algebraic PCPs
A minimal model for secure computation (extended abstract)
On the Power of Secure Two-Party Computation
Secure Protocol Transformations
Breaking the Circuit Size Barrier for Secure Computation Under DDH
Lattice-based FHE as secure as PKE
Functional Encryption: Definitions and Challenges
Efficient Non-interactive Secure Computation
Proof verification and the hardness of approximation problems
Delegating Computation
Binary AMD Circuits from Secure Multiparty Computation
Interactive Oracle Proofs
Interactive PCP
Universally composable two-party and multi-party secure computation
Founding Cryptography on Oblivious Transfer – Efficiently
Secure Arithmetic Computation with No Honest Majority
The Knowledge Complexity of Interactive Proof Systems
Probabilistic checking of proofs
Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
The knowledge complexity of interactive proof-systems
Constant-Round Interactive Proof Systems for AC0[2] and NC1
Fully homomorphic encryption using ideal lattices
Black-box non-black-box zero knowledge
Resettably Sound Zero-Knowledge Arguments from OWFs - The (Semi) Black-Box Way
Constant-round interactive proofs for delegating computation
OT-Combiners via Secure Computation
Secure Computation of Constant-Depth Circuits with Applications to Database Search Problems
Probabilistically Checkable Proofs of Proximity with Zero-Knowledge
Scalable Secure Multiparty Computation
Cryptography in $NC^0$
Ligero: lightweight sublinear arguments without a trusted setup
Quantum garbled circuits
Succinct interactive oracle proofs: applications and limitations

This page was built for publication: Beyond MPC-in-the-head: black-box constructions of short zero-knowledge proofs

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