Reducing Communication Channels in MPC

Marcel Keller; Dragos Rotaru; Nigel Smart; Tim Wood

doi:10.1007/978-3-319-98113-0_10

Reducing Communication Channels in MPC

Marcel Keller, Dragos Rotaru, Nigel Smart, Tim Wood

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

9 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 Q₂access 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
Q₂ structures, at the expense of requiring pre-shared secret keys for Pseudo-Random Functions.

Original language	English
Title of host publication	Security and Cryptography for Networks - SCN 2018
Editors	Dario Catalano, Roberto de Prisco
Publisher	Springer Berlin Heidelberg
Pages	181-199
Number of pages	19
ISBN (Electronic)	9783319981130
ISBN (Print)	9783319981123
DOIs	https://doi.org/10.1007/978-3-319-98113-0_10
Publication status	Published - Sept 2018

Publication series

Name	Lecture Notes in Computer Science
ISSN (Print)	0302-9743

Access to Document

10.1007/978-3-319-98113-0_10

https://eprint.iacr.org/2017/492Licence: CC BY

Handle.net

Persistent link

Embargoed Document

Full-text PDF (accepted author manuscript)
Accepted author manuscript, 391 KB

TIPS Fellowship
Smart, N. P.
1/10/16 → 30/09/21
Project: Research
UK-Israel MPC
Smart, N. P.
1/08/15 → 31/12/17
Project: Research

Cite this

@inproceedings{89a14bc754cb4a45914b861258e1b2c6,

title = "Reducing Communication Channels in MPC",

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 Q2 access 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{\textquoteright}s “MPC-Made-Simple” protocol for Q2 structures, at the expense of requiring pre-shared secret keys for Pseudo-Random Functions.",

author = "Marcel Keller and Dragos Rotaru and Nigel Smart and Tim Wood",

year = "2018",

month = sep,

doi = "10.1007/978-3-319-98113-0_10",

language = "English",

isbn = "9783319981123",

series = "Lecture Notes in Computer Science",

publisher = "Springer Berlin Heidelberg",

pages = "181--199",

editor = "Dario Catalano and {de Prisco}, Roberto",

booktitle = "Security and Cryptography for Networks - SCN 2018",

address = "Germany",

}

Reducing Communication Channels in MPC. / Keller, Marcel; Rotaru, Dragos; Smart, Nigel et al.
Security and Cryptography for Networks - SCN 2018. ed. / Dario Catalano; Roberto de Prisco. Springer Berlin Heidelberg, 2018. p. 181-199 (Lecture Notes in Computer Science).

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

TY - GEN

T1 - Reducing Communication Channels in MPC

AU - Keller, Marcel

AU - Rotaru, Dragos

AU - Smart, Nigel

AU - Wood, Tim

PY - 2018/9

Y1 - 2018/9

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

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

U2 - 10.1007/978-3-319-98113-0_10

DO - 10.1007/978-3-319-98113-0_10

M3 - Conference Contribution (Conference Proceeding)

SN - 9783319981123

T3 - Lecture Notes in Computer Science

SP - 181

EP - 199

BT - Security and Cryptography for Networks - SCN 2018

A2 - Catalano, Dario

A2 - de Prisco, Roberto

PB - Springer Berlin Heidelberg

ER -

Reducing Communication Channels in MPC

Abstract

Publication series

Access to Document

Handle.net

Embargoed Document

Fingerprint

Projects

TIPS Fellowship

UK-Israel MPC

Cite this