Compilation of Function Representations for Secure Computing Paradigms
| Autor: | Nigel P. Smart, Cyprien Delpech de Saint Guilhem, Karim Baghery, Emmanuela Orsini, Titouan Tanguy |
|---|---|
| Rok vydání: | 2021 |
| Předmět: |
SECURE MULTIPARTY COMPUTATION
Theoretical computer science ZERO-KNOWLEDGE PROOF SECURE MULTIPARTY COMPUTATION CRYPTOGRAPHY CRYPTOGRAPHY Computer science Computation Binary number Construct (python library) Function (mathematics) Secret sharing ZERO-KNOWLEDGE PROOF Computer Science::Programming Languages Zero-knowledge proof Representation (mathematics) Abstraction (linguistics) |
| Zdroj: | Topics in Cryptology-CT-RSA 2021 Topics in Cryptology – CT-RSA 2021 ISBN: 9783030755386 CT-RSA Lecture Notes in Computer Science Lecture Notes in Computer Science-Topics in Cryptology – CT-RSA 2021 |
| ISSN: | 0302-9743 1611-3349 |
| DOI: | 10.1007/978-3-030-75539-3_2 |
| Popis: | 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). |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|