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

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

Mathematics Subject Classification ID

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

Cites Work

• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
• The knowledge complexity of interactive proof-systems
• Founding Cryptography on Oblivious Transfer – Efficiently
• Polymorphic arrays: A novel VLSI layout for systolic computers
• Short pairing-based non-interactive zero-knowledge arguments
• Title not available (Why is that?)
• Quadratic span programs and succinct NIZKs without PCPs
• Title not available (Why is that?)
• Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting
• Using TopGear in overdrive: a more efficient ZKPoK for SPDZ
• Title not available (Why is that?)
• Libra: succinct zero-knowledge proofs with optimal prover computation
• Interactive Oracle Proofs
• Advances in cryptology -- CRYPTO 2019. 39th annual international cryptology conference, Santa Barbara, CA, USA, August 18--22, 2019. Proceedings. Part III
• How to Simulate It – A Tutorial on the Simulation Proof Technique
• Efficient constant-round MPC with identifiable abort and public verifiability
• Covert security with public verifiability: faster, leaner, and simpler
• Zero-knowledge proofs on secret-shared data via fully linear PCPs
• Efficient fully secure computation via distributed zero-knowledge proofs
• Public Verifiability in the Covert Model (Almost) for Free
• Calling out cheaters: covert security with public verifiability
• Universally Verifiable Multiparty Computation from Threshold Homomorphic Cryptosystems
• Publicly Auditable Secure Multi-Party Computation

Cited In (2)

• Zero-knowledge protocols for the subset sum problem from MPC-in-the-head with rejection
• Sometimes you can't distribute random-oracle-based proofs

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)