MPC with Low Bottleneck-Complexity: Information-Theoretic Security and More

Hannah Keller*, Claudio Orlandi*, Anat Paskin-Cherniavsky*, Divya Ravi*

*Corresponding author af dette arbejde

Publikation: Bidrag til bog/antologi/rapport/proceedingKonferencebidrag i proceedingsForskningpeer review

Abstract

The bottleneck-complexity (BC) of secure multiparty computation (MPC) protocols is a measure of the maximum number of bits which are sent and received by any party in protocol. As the name suggests, the goal of studying BC-efficient protocols is to increase overall efficiency by making sure that the workload in the protocol is somehow “amortized” by the protocol participants. Orlandi et al. [28] initiated the study of BC-efficient protocols from simple assumptions in the correlated randomness model and for semi-honest adversaries. In this work, we extend the study of [28] in two primary directions: (a) to a larger and more general class of functions and (b) to the information-theoretic setting. In particular, we offer semi-honest secure protocols for the useful function classes of abelian programs, “read-k” non-abelian programs, and “read-k” generalized formulas. Our constructions use a novel abstraction, called incremental function secret-sharing (IFSS), that can be instantiated with unconditional security or from one-way functions (with different efficiency trade-offs).

OriginalsprogEngelsk
Titel4th Conference on Information-Theoretic Cryptography, ITC 2023
RedaktørerKai-Min Chung
UdgivelsesstedWadern
ForlagSchloss Dagstuhl--Leibniz-Zentrum für Informatik
Publikationsdatojul. 2023
Sider11:1-11:22
Artikelnummer11
ISBN (Elektronisk)9783959772716
DOI
StatusUdgivet - jul. 2023
Begivenhed4th Conference on Information-Theoretic Cryptography, ITC 2023 - Aarhus, Danmark
Varighed: 6 jun. 20238 jun. 2023

Konference

Konference4th Conference on Information-Theoretic Cryptography, ITC 2023
Land/OmrådeDanmark
ByAarhus
Periode06/06/202308/06/2023
NavnLeibniz International Proceedings in Informatics, LIPIcs
Vol/bind267
ISSN1868-8969

Fingeraftryk

Dyk ned i forskningsemnerne om 'MPC with Low Bottleneck-Complexity: Information-Theoretic Security and More'. Sammen danner de et unikt fingeraftryk.

Citationsformater