MPC-in-multi-heads: a multi-prover zero-knowledge proof system (or: how to jointly prove any NP statements in ZK)

DOI10.1007/978-3-030-88428-4_17zbMATH Open1498.68111OpenAlexW3204406621MaRDI QIDQ2148762FDOQ2148762

Authors Yanyan Li

Publication date 24 June 2022

Full work available at URL https://doi.org/10.1007/978-3-030-88428-4_17

Mathematics Subject Classification ID

Cryptography (94A60) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Recommendations

• Zero-knowledge proofs from secure multiparty computation
• Non-interactive zero-knowledge proofs to multiple verifiers
• Zero-knowledge proofs on secret-shared data via fully linear PCPs
• Theory of Cryptography
• scientific article; zbMATH DE number 7706038

Cites work

• scientific article; zbMATH DE number 5485433 (Why is no real title available?)
• scientific article; zbMATH DE number 5485522 (Why is no real title available?)
• scientific article; zbMATH DE number 2086726 (Why is no real title available?)
• Advances in cryptology -- CRYPTO 2019. 39th annual international cryptology conference, Santa Barbara, CA, USA, August 18--22, 2019. Proceedings. Part III
• Calling out cheaters: covert security with public verifiability
• Covert security with public verifiability: faster, leaner, and simpler
• Efficient constant-round MPC with identifiable abort and public verifiability
• Efficient fully secure computation via distributed zero-knowledge proofs
• Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting
• Founding Cryptography on Oblivious Transfer – Efficiently
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• How to simulate it -- a tutorial on the simulation proof technique
• Interactive oracle proofs
• Libra: succinct zero-knowledge proofs with optimal prover computation
• Polymorphic arrays: A novel VLSI layout for systolic computers
• Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
• Public verifiability in the covert model (almost) for free
• Publicly auditable secure multi-party computation
• Quadratic span programs and succinct NIZKs without PCPs
• Short pairing-based non-interactive zero-knowledge arguments
• The knowledge complexity of interactive proof-systems
• Universally verifiable multiparty computation from threshold homomorphic cryptosystems
• Using TopGear in overdrive: a more efficient ZKPoK for SPDZ
• Zero-knowledge proofs on secret-shared data via fully linear PCPs

Cited in

(4)

• Sometimes you can't distribute random-oracle-based proofs
• Your reputation's safe with me: framing-free distributed zero-knowledge proofs
• Cluster computing in zero knowledge
• Zero-knowledge protocols for the subset sum problem from MPC-in-the-head with rejection

Describes a project that uses

Uses Software

• Ligero
• ZKBoo
• Libra

This page was built for publication: MPC-in-multi-heads: a multi-prover zero-knowledge proof system (or: how to jointly prove any NP statements in ZK)

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