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

Ignacio Cascudo; Jaron Skovsted Gundersen

doi:10.1007/978-3-030-64378-2_23

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 proceeding › Konferenceartikel i proceeding › Forskning › peer review

2 Citationer (Scopus)

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.

Originalsprog	Engelsk
Titel	Theory of Cryptography Conference - 18th International Conference, TCC 2020
Vol/bind	12551
Forlag	Springer
Publikationsdato	9 dec. 2020
Sider	652-682
ISBN (Elektronisk)	978-3-030-64378-2
DOI	https://doi.org/10.1007/978-3-030-64378-2_23
Status	Udgivet - 9 dec. 2020
Begivenhed	Theory of Cryptography Conference 2020 - Virtuel Varighed: 16 nov. 2020 → 19 nov. 2020 Konferencens nummer: 18th https://tcc.iacr.org/2020/

Konference

Konference	Theory of Cryptography Conference 2020
Nummer	18th
Lokation	Virtuel
Periode	16/11/2020 → 19/11/2020
Internetadresse	https://tcc.iacr.org/2020/

Navn	Lecture Notes in Computer Science
Vol/bind	12551
ISSN	0302-9743

Adgang til dokumentet

10.1007/978-3-030-64378-2_23

https://eprint.iacr.org/2020/162

AUB Link

Søg efter materialet i Aalborg Universitetsbiblioteks søgemaskine

1 Afsluttet

SECURE: Secure Estimation and Control Using Recursion and Encryption
Wisniewski, R., Christensen, M. G., Andersen, A. O., Mannov, A., Geil, O. & Jessen, J. F.
01/04/2018 → 30/11/2021
Projekter: Projekt › Forskning

2 Citationer
1 Ph.d.-afhandling

On the Interaction Between Linear Codes, Secret Sharing, and Multiparty Computation
Gundersen, J. S., 2020, Aalborg Universitetsforlag. 136 s.
Publikation: Ph.d.-afhandling

Åben adgang
Fil

Citationsformater

@inproceedings{368daf5f08be41818511b4ac9936b272,

title = "A Secret-Sharing Based MPC Protocol for Boolean Circuits with Good Amortized Complexity",

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.",

author = "Ignacio Cascudo and Gundersen, {Jaron Skovsted}",

year = "2020",

month = dec,

day = "9",

doi = "10.1007/978-3-030-64378-2_23",

language = "English",

volume = "12551",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "652--682",

booktitle = "Theory of Cryptography Conference - 18th International Conference, TCC 2020",

address = "Germany",

note = "Theory of Cryptography Conference 2020 ; Conference date: 16-11-2020 Through 19-11-2020",

url = "https://tcc.iacr.org/2020/",

}

Cascudo, I & Gundersen, JS 2020, A Secret-Sharing Based MPC Protocol for Boolean Circuits with Good Amortized Complexity. i Theory of Cryptography Conference - 18th International Conference, TCC 2020. bind 12551, Springer, Lecture Notes in Computer Science, bind 12551, s. 652-682, Theory of Cryptography Conference 2020, 16/11/2020. https://doi.org/10.1007/978-3-030-64378-2_23

A Secret-Sharing Based MPC Protocol for Boolean Circuits with Good Amortized Complexity. / Cascudo, Ignacio; Gundersen, Jaron Skovsted.
Theory of Cryptography Conference - 18th International Conference, TCC 2020. Bind 12551 Springer, 2020. s. 652-682 (Lecture Notes in Computer Science, Bind 12551).

Publikation: Bidrag til bog/antologi/rapport/konference proceeding › Konferenceartikel i proceeding › Forskning › peer review

TY - GEN

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

AU - Cascudo, Ignacio

AU - Gundersen, Jaron Skovsted

N1 - Conference code: 18th

PY - 2020/12/9

Y1 - 2020/12/9

N2 - 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.

AB - 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.

U2 - 10.1007/978-3-030-64378-2_23

DO - 10.1007/978-3-030-64378-2_23

M3 - Article in proceeding

VL - 12551

T3 - Lecture Notes in Computer Science

SP - 652

EP - 682

BT - Theory of Cryptography Conference - 18th International Conference, TCC 2020

PB - Springer

T2 - Theory of Cryptography Conference 2020

Y2 - 16 November 2020 through 19 November 2020

ER -

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

Abstract

Konference

Adgang til dokumentet

AUB Link

Fingeraftryk

Projekter

SECURE: Secure Estimation and Control Using Recursion and Encryption

Publikation

On the Interaction Between Linear Codes, Secret Sharing, and Multiparty Computation

Citationsformater