Reducing Communication Channels in MPC

Marcel Keller, Dragos Rotaru, Nigel Smart, Tim Wood

Research output: Chapter in Book/Report/Conference proceedingConference Contribution (Conference Proceeding)

4 Citations (Scopus)

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.
Original languageEnglish
Title of host publicationSecurity and Cryptography for Networks - SCN 2018
EditorsDario Catalano, Roberto de Prisco
PublisherSpringer Berlin Heidelberg
Pages181-199
Number of pages19
ISBN (Electronic)9783319981130
ISBN (Print)9783319981123
DOIs
Publication statusPublished - Sep 2018

Publication series

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

Fingerprint Dive into the research topics of 'Reducing Communication Channels in MPC'. Together they form a unique fingerprint.

  • Projects

    TIPS Fellowship

    Smart, N. P.

    1/10/1630/09/21

    Project: Research

    UK-Israel MPC

    Smart, N. P.

    1/08/1531/12/17

    Project: Research

    Cite this

    Keller, M., Rotaru, D., Smart, N., & Wood, T. (2018). Reducing Communication Channels in MPC. In D. Catalano, & R. de Prisco (Eds.), Security and Cryptography for Networks - SCN 2018 (pp. 181-199). (Lecture Notes in Computer Science). Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-319-98113-0_10