Large Scale, Actively Secure Computation from LPN and Free-XOR Garbled Circuits
| Autor: | Kelong Cong, Nigel P. Smart, Eduardo Soria-Vazquez, Aner Ben-Efraim, Eran Omri, Emmanuela Orsini |
|---|---|
| Přispěvatelé: | Canteaut, Anne, Standaert, François-Xavier |
| Rok vydání: | 2021 |
| Předmět: |
SECURE MULTIPARTY COMPUTATION
Computer science business.industry SECURE MULTIPARTY COMPUTATION GARBLED CIRCUITS LPN ASSUMPTION LPN ASSUMPTION Value (computer science) Scale (descriptive set theory) Encryption GARBLED CIRCUITS Secure multi-party computation Preprocessor business Communication complexity Protocol (object-oriented programming) Electronic circuit Computer network |
| Zdroj: | Advances in Cryptology-EUROCRYPT 2021 Lecture Notes in Computer Science Lecture Notes in Computer Science-Advances in Cryptology – EUROCRYPT 2021 Lecture Notes in Computer Science ISBN: 9783030778828 EUROCRYPT (3) |
| ISSN: | 0302-9743 1611-3349 |
| Popis: | We (MPC) protocol based on garbled circuits which is both actively secure and supports the free-XOR technique, and which has communication complexity O(n) per party. This improves on a protocol of Ben-Efraim, Lindell and Omri which only achieved passive security, without support for free-XOR. Our construction is based on a new variant of LPN-based encryption, but has the drawback of requiring a rather expensive garbling phase. To address this issue we present a second protocol that assumes at least n/c of the parties are honest (for an arbitrary fixed value c). This second protocol allows for a significantly lighter preprocessing, at the cost of a small sacrifice in online efficiency. We demonstrate the practicality of our evaluation phase with an implementation. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|