Limbo: Efficient Zero-knowledge MPCitH-based Arguments

42Citations
Citations of this article
15Readers
Mendeley users who have this article in their library.

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.

Cite

CITATION STYLE

APA

Delpech De Saint Guilhem, C., Orsini, E., & Tanguy, T. (2021). Limbo: Efficient Zero-knowledge MPCitH-based Arguments. In Proceedings of the ACM Conference on Computer and Communications Security (pp. 3022–3036). Association for Computing Machinery. https://doi.org/10.1145/3460120.3484595

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free