Cryptology ePrint Archive: Report 2021/195

Compilation of Function Representations for Secure Computing Paradigms

Karim Baghery and Cyprien Delpech de Saint Guilhem and Emmanuela Orsini and Nigel P. Smart and Titouan Tanguy

Abstract: This paper introduces M-Circuits, a program representation which generalizes arithmetic and binary circuits. This new representation is motivated by the way modern multi-party computation (MPC) systems based on linear secret sharing schemes actually operate. We then show how this representation also allows one to construct zero knowledge proof (ZKP) systems based on the MPC-in-the-head paradigm. The use of the M-Circuit program abstraction then allows for a number of program-specific optimizations to be applied generically. It also allows to separate complexity and security optimizations for program compilation from those for application protocols (MPC or ZKP).

Category / Keywords: cryptographic protocols /

Original Publication (with major differences): CT-RSA 2021

Date: received 23 Feb 2021

Contact author: karim baghery at kuleuven be, cyprien delpechdesaintguilhem@kuleuven be, emmanuela orsini@kuleuven be, nigel smart@kuleuven be, titouan tanguy@kuleuven be

Available format(s): PDF | BibTeX Citation

Version: 20210224:145445 (All versions of this report)

Short URL: ia.cr/2021/195


[ Cryptology ePrint archive ]