Skip to content

Reducing Communication Channels in MPC

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Original languageEnglish
Title of host publicationSecurity and Cryptography for Networks - SCN 2018
EditorsDario Catalano, Roberto de Prisco
Publisher or commissioning bodySpringer Berlin Heidelberg
Pages181-199
Number of pages19
ISBN (Electronic)9783319981130
ISBN (Print)9783319981123
DOIs
DateAccepted/In press - 8 Jun 2018
DateE-pub ahead of print - 3 Aug 2018
DatePublished (current) - Sep 2018

Publication series

NameLecture Notes in Computer Science
ISSN (Print)0302-9743

Abstract

We show that the recent, highly efficient, three-party honest-majority computationally-secure MPC protocol of Araki et al. can be generalised to an arbitrary Qaccess structure. Part of the performance of the Araki et al. protocol is from the fact it does not use a complete communication network for the most costly part of the computation. Our generalisation also preserves this property. We present both passively- and actively-secure (with abort) variants of our protocol. In all cases we require fewer communication channels for secure multiplication than Maurer’s “MPC-Made-Simple” protocol for
Q2 structures, at the expense of requiring pre-shared secret keys for Pseudo-Random Functions.

Documents

Links

DOI

View research connections

Related faculties, schools or groups