Efficient Compiler to Covert Security with Public Verifiability for Honest Majority MPC

Thomas Attema, Vincent Dunning*, Maarten Everts, Peter Langenkamp

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

24 Downloads (Pure)

Abstract

We present a novel compiler for transforming arbitrary, passively secure MPC protocols into efficient protocols with covert security and public verifiability in the honest majority setting. Our compiler works for protocols with any number of parties > 2 and treats the passively secure protocol in a black-box manner. In multi-party computation (MPC), covert security provides an attractive trade-off between the security of actively secure protocols and the efficiency of passively secure protocols. In this security notion, honest parties are only required to detect an active attack with some constant probability, referred to as the deterrence rate. Extending covert security with public verifiability additionally ensures that any party, even an external one not participating in the protocol, is able to identify the cheaters if an active attack has been detected. Recently, Faust et al. (EUROCRYPT 2021) and Scholl et al. (Pre-print 2021) introduced similar covert security compilers based on computationally expensive time-lock puzzles. At the cost of requiring an honest majority, our work avoids the use of time-lock puzzles completely. Instead, we adopt a much more efficient publicly verifiable secret sharing scheme to achieve a similar functionality. This obviates the need for a trusted setup and a general-purpose actively secure MPC protocol. We show that our computation and communication costs are orders of magnitude lower while achieving the same deterrence rate.

Original languageEnglish
Title of host publicationApplied Cryptography and Network Security - 20th International Conference, ACNS 2022, Proceedings
EditorsGiuseppe Ateniese, Daniele Venturi
PublisherSpringer
Pages663-683
Number of pages21
ISBN (Print)9783031092336
DOIs
Publication statusPublished - 18 Jun 2022
Event20th International Conference on Applied Cryptography and Network Security, ACNS 2022 - Rome, Italy
Duration: 20 Jun 202223 Jun 2022
Conference number: 20

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume13269 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference20th International Conference on Applied Cryptography and Network Security, ACNS 2022
Abbreviated titleACNS
Country/TerritoryItaly
CityRome
Period20/06/2223/06/22

Keywords

  • Compiler
  • Covert Security
  • Honest Majority
  • Multi-Party Computation
  • 2023 OA procedure

Fingerprint

Dive into the research topics of 'Efficient Compiler to Covert Security with Public Verifiability for Honest Majority MPC'. Together they form a unique fingerprint.

Cite this