Skip to main navigation Skip to search Skip to main content

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

Research output: Contribution to book/anthology/report/conference proceeding › Article in proceeding › Research › peer-review

Abstract

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.
Original languageEnglish
Title of host publicationTheory of Cryptography Conference - 18th International Conference, TCC 2020
Volume12551
PublisherSpringer
Publication date9 Dec 2020
Pages652-682
ISBN (Electronic)978-3-030-64378-2
DOIs
Publication statusPublished - 9 Dec 2020
EventTheory of Cryptography Conference 2020 - Virtuel
Duration: 16 Nov 2020 → 19 Nov 2020
Conference number: 18th
https://tcc.iacr.org/2020/

Conference

ConferenceTheory of Cryptography Conference 2020
Number18th
LocationVirtuel
Period16/11/2020 → 19/11/2020
Internet address
SeriesLecture Notes in Computer Science
Volume12551
ISSN0302-9743

Fingerprint

Dive into the research topics of 'A Secret-Sharing Based MPC Protocol for Boolean Circuits with Good Amortized Complexity'. Together they form a unique fingerprint.

Cite this