Secure Computation with Low Communication from Cross-Checking
| Autor: | S. Dov Gordon, Xiao Wang, Samuel Ranellucci |
|---|---|
| Rok vydání: | 2018 |
| Předmět: |
0301 basic medicine
business.industry Computer science Computation Boolean circuit Binary number 0102 computer and information sciences 01 natural sciences 03 medical and health sciences 030104 developmental biology 010201 computation theory & mathematics Secure multi-party computation Special case business Computer network |
| Zdroj: | Lecture Notes in Computer Science ISBN: 9783030033316 ASIACRYPT (3) |
| Popis: | We construct new four-party protocols for secure computation that are secure against a single malicious corruption. Our protocols can perform computations over a binary ring, and require sending just 1.5 ring elements per party, per gate. In the special case of Boolean circuits, this amounts to sending 1.5 bits per party, per gate. One of our protocols is robust, yet requires almost no additional communication. Our key technique can be viewed as a variant of the “dual execution” approach, but, because we rely on four parties instead of two, we can avoid any leakage, achieving the standard notion of security. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|