Compilation of Function Representations for Secure Computing Paradigms

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

Paper 2021/195

Compilation of Function Representations for Secure Computing Paradigms

Karim Baghery, Cyprien Delpech de Saint Guilhem, Emmanuela Orsini, 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).

Metadata

Available format(s): PDF
Category: Cryptographic protocols
Publication info: Published elsewhere. Major revision. CT-RSA 2021
Contact author(s): karim baghery @ kuleuven be
cyprien delpechdesaintguilhem @ kuleuven be
emmanuela orsini @ kuleuven be
nigel smart @ kuleuven be
titouan tanguy @ kuleuven be
History: 2021-02-24: received
Short URL: https://ia.cr/2021/195
License: CC BY

BibTeX

@misc{cryptoeprint:2021/195,
      author = {Karim Baghery and Cyprien Delpech de Saint Guilhem and Emmanuela Orsini and Nigel P.  Smart and Titouan Tanguy},
      title = {Compilation of Function Representations for Secure Computing Paradigms},
      howpublished = {Cryptology ePrint Archive, Paper 2021/195},
      year = {2021},
      note = {\url{https://eprint.iacr.org/2021/195}},
      url = {https://eprint.iacr.org/2021/195}
}