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_17zbMath1498.68111OpenAlexW3204406621MaRDI QIDQ2148762

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

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

Uses Software

• Ligero
• ZKBoo
• Libra

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Using TopGear in overdrive: a more efficient ZKPoK for SPDZ
• Polymorphic arrays: A novel VLSI layout for systolic computers
• Efficient constant-round MPC with identifiable abort and public verifiability
• Advances in cryptology -- CRYPTO 2019. 39th annual international cryptology conference, Santa Barbara, CA, USA, August 18--22, 2019. Proceedings. Part III
• Covert security with public verifiability: faster, leaner, and simpler
• Zero-knowledge proofs on secret-shared data via fully linear PCPs
• Libra: succinct zero-knowledge proofs with optimal prover computation
• Efficient fully secure computation via distributed zero-knowledge proofs
• Universally Verifiable Multiparty Computation from Threshold Homomorphic Cryptosystems
• Public Verifiability in the Covert Model (Almost) for Free
• Publicly Auditable Secure Multi-Party Computation
• Short Pairing-Based Non-interactive Zero-Knowledge Arguments
• Interactive Oracle Proofs
• Founding Cryptography on Oblivious Transfer – Efficiently
• 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
• Calling Out Cheaters: Covert Security with Public Verifiability
• Quadratic Span Programs and Succinct NIZKs without PCPs
• How to Simulate It – A Tutorial on the Simulation Proof Technique
• Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting

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)