Limbo: Efficient Zero-knowledge MPCitH-based Arguments
Cyprien Delpech de Saint Guilhem, Emmanuela Orsini, Titouan Tanguy
Abstract
This work introduces a new interactive oracle proof system based on the MPC-in-the-Head paradigm. To improve concrete efficiency and offer flexibility between computation time and communication size, a generic proof construction based on multi-round MPC protocols is proposed, instantiated with a specific protocol and implemented and compared to similar proof systems. Performance gains over previous work derive from a multi-party multiplication check optimized for the multi-round and MPC-in-the-Head settings. Of most interest among implementation optimizations is the use of identical randomness across repeated MPC protocol executions in order to accelerate computation without excessive cost to the soundness error. The new system creates proofs of SHA-256 pre-images of 43KB in 53ms with 16 MPC parties, or 23KB in 188ms for 128 parties. As a signature scheme, the non-interactive variant produces signatures, based on the AES-128 circuit, of 18KB in about 4ms; this is 20% faster and 32% larger than the Picnic3 scheme (13kB in 5.3ms for 16 parties) which is based on the 90% smaller LowMC circuit.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Cited by top-tier papers6
- Publicly Verifiable Zero-Knowledge and Post-Quantum Signatures from VOLE-in-the-HeadCarsten Baum, Lennart Braun, Cyprien Delpech de Saint Guilhem, Michael Klooß et al.CRYPTO 2023 · 75 citations
- Zombie: Middleboxes that Don't SnoopCollin Zhang, Zachary DeStefano, Arasu Arun, Joseph Bonneau et al.NSDI 2024 · 26 citations
- Two Shuffles Make a RAM: Improved Constant Overhead Zero Knowledge RAMYibin Yang, David HeathUSENIX Security 2024 · 14 citations
- Proof-of-Possession for KEM Certificates using Verifiable GenerationTim Güneysu, Philip W. Hodges, Georg Land, Mike Ounsworth et al.CCS 2022 · 7 citations
- ZEE200: Zero Knowledge for Everything and Everyone @ 200 KHzSunghyeon Jo, Vladimir Kolesnikov, Yibin YangCCS 2026
Builds on9
- Ligero: Lightweight Sublinear Arguments Without a Trusted SetupScott Ames, Carmit Hazay, Yuval Ishai, Muthuramakrishnan VenkitasubramaniamCCS 2017 · 338 citations
- Post-Quantum Zero-Knowledge and Signatures from Symmetric-Key PrimitivesMelissa Chase, David Derler, Steven Goldfeder, Claudio Orlandi et al.CCS 2017 · 316 citations
- ZKBoo: Faster Zero-Knowledge for Boolean CircuitsIrene Giacomelli, Jesper Madsen, Claudio OrlandiUSENIX Security 2016 · 287 citations
- Improved Non-Interactive Zero Knowledge with Applications to Post-Quantum SignaturesJonathan Katz, Vladimir Kolesnikov, Xiao WangCCS 2018 · 257 citations
- Wolverine: Fast, Scalable, and Communication-Efficient Zero-Knowledge Proofs for Boolean and Arithmetic CircuitsChenkai Weng, Kang Yang, Jonathan Katz, Xiao WangS&P 2021 · 205 citations
Related papers
- Shorter Signatures Based on Tailor-Made Minimalist Symmetric-Key CryptoChristoph Dobraunig, Daniel Kales, Christian Rechberger, Markus Schofnegger et al.CCS 2022 · 36 citations
- Short Signatures from Regular Syndrome Decoding in the HeadEliana Carozza, Geoffroy Couteau, Antoine JouxEUROCRYPT 2023 · 25 citations
- Global-Scale Secure Multiparty ComputationXiao Wang, Samuel Ranellucci, Jonathan KatzCCS 2017 · 220 citations
- Preprocessing for Life: Dishonest-Majority MPC with a Trusted or Untrusted DealerElette Boyle, Niv Gilboa, Matan Hamilis, Yuval Ishai et al.S&P 2025
- Improved Alternating-Moduli PRFs and Post-quantum SignaturesNavid Alamati, Guru-Vamsi Policharla, Srinivasan Raghuraman, Peter RindalCRYPTO 2024 · 16 citations
