A Secret-Sharing Based MPC Protocol for Boolean Circuits with Good Amortized Complexity

Ignacio Cascudo, Jaron Skovsted Gundersen*

*Kontaktforfatter

Publikation: Bidrag til bog/antologi/rapport/konference proceedingKonferenceartikel i proceedingForskningpeer review

Abstrakt

We present a new secure multiparty computation protocol in the preprocessing model that allows for the evaluation of a number of instances of a boolean circuit in parallel, with a small online communication complexity per instance of 10 bits per party and multiplication gate. Our protocol is secure against an active dishonest majority, and can also be transformed, via existing techniques, into a protocol for the evaluation of a single "well-formed" boolean circuit with the same complexity per multiplication gate at the cost of some overhead that depends on the topology of the circuit.
OriginalsprogEngelsk
TitelTheory of Cryptography Conference - 18th International Conference, TCC 2020
Vol/bind12551
ForlagSpringer
Publikationsdato9 dec. 2020
Sider652-682
ISBN (Elektronisk)978-3-030-64378-2
DOI
StatusUdgivet - 9 dec. 2020
BegivenhedTheory of Cryptography Conference 2020 - Virtuel
Varighed: 16 nov. 202019 nov. 2020
Konferencens nummer: 18th
https://tcc.iacr.org/2020/

Konference

KonferenceTheory of Cryptography Conference 2020
Nummer18th
LokationVirtuel
Periode16/11/202019/11/2020
Internetadresse
NavnLecture Notes in Computer Science
Vol/bind12551
ISSN0302-9743

Fingeraftryk Dyk ned i forskningsemnerne om 'A Secret-Sharing Based MPC Protocol for Boolean Circuits with Good Amortized Complexity'. Sammen danner de et unikt fingeraftryk.

Citationsformater