MPC-Friendly Symmetric Key Primitives

Lorenzo Grassi; Christian Rechberger; Dragos Rotaru; Peter Scholl; Nigel P. Smart

doi:10.1145/2976749.2978332

MPC-Friendly Symmetric Key Primitives

Lorenzo Grassi, Christian Rechberger, Dragos Rotaru, Peter Scholl, Nigel P. Smart

Institute of Applied Information Processing and Communications (7050)

Research output: Chapter in Book/Report/Conference proceeding › Conference paper › peer-review

Abstract

We discuss the design of symmetric primitives, in particular Pseudo-Random Functions (PRFs) which are suitable for use in a secret-sharing based MPC system. We consider three different PRFs: the Naor-Reingold PRF, a PRF based on the Legendre symbol, and a specialized block cipher design called MiMC. We present protocols for implementing these PRFs within a secret-sharing based MPC system, and discuss possible applications. We then compare the performance of our protocols. Depending on the application, different PRFs may offer different optimizations and advantages over the classic AES benchmark. Thus, we cannot conclude that there is one optimal PRF to be used in all situations.

Original language	English
Title of host publication	Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security
Pages	430-443
Number of pages	14
Volume	Volume 24-28-October-2016
DOIs	https://doi.org/10.1145/2976749.2978332
Publication status	Published - 2016
Event	23rd ACM Conference on Computer and Communications Security: CCS 2016 - Vienna, Austria Duration: 24 Oct 2016 → 28 Oct 2016

Conference

Conference	23rd ACM Conference on Computer and Communications Security
Country/Territory	Austria
City	Vienna
Period	24/10/16 → 28/10/16

Access to Document

10.1145/2976749.2978332

Cite this

@inproceedings{e6d86b5f82f3441aafb932c0618e4917,

title = "MPC-Friendly Symmetric Key Primitives",

abstract = "We discuss the design of symmetric primitives, in particular Pseudo-Random Functions (PRFs) which are suitable for use in a secret-sharing based MPC system. We consider three different PRFs: the Naor-Reingold PRF, a PRF based on the Legendre symbol, and a specialized block cipher design called MiMC. We present protocols for implementing these PRFs within a secret-sharing based MPC system, and discuss possible applications. We then compare the performance of our protocols. Depending on the application, different PRFs may offer different optimizations and advantages over the classic AES benchmark. Thus, we cannot conclude that there is one optimal PRF to be used in all situations.",

author = "Lorenzo Grassi and Christian Rechberger and Dragos Rotaru and Peter Scholl and Smart, {Nigel P.}",

year = "2016",

doi = "10.1145/2976749.2978332",

language = "English",

volume = "Volume 24-28-October-2016",

pages = "430--443",

booktitle = "Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security",

note = "23rd ACM Conference on Computer and Communications Security : CCS 2016 ; Conference date: 24-10-2016 Through 28-10-2016",

}

TY - GEN

T1 - MPC-Friendly Symmetric Key Primitives

AU - Grassi, Lorenzo

AU - Rechberger, Christian

AU - Rotaru, Dragos

AU - Scholl, Peter

AU - Smart, Nigel P.

PY - 2016

Y1 - 2016

N2 - We discuss the design of symmetric primitives, in particular Pseudo-Random Functions (PRFs) which are suitable for use in a secret-sharing based MPC system. We consider three different PRFs: the Naor-Reingold PRF, a PRF based on the Legendre symbol, and a specialized block cipher design called MiMC. We present protocols for implementing these PRFs within a secret-sharing based MPC system, and discuss possible applications. We then compare the performance of our protocols. Depending on the application, different PRFs may offer different optimizations and advantages over the classic AES benchmark. Thus, we cannot conclude that there is one optimal PRF to be used in all situations.

AB - We discuss the design of symmetric primitives, in particular Pseudo-Random Functions (PRFs) which are suitable for use in a secret-sharing based MPC system. We consider three different PRFs: the Naor-Reingold PRF, a PRF based on the Legendre symbol, and a specialized block cipher design called MiMC. We present protocols for implementing these PRFs within a secret-sharing based MPC system, and discuss possible applications. We then compare the performance of our protocols. Depending on the application, different PRFs may offer different optimizations and advantages over the classic AES benchmark. Thus, we cannot conclude that there is one optimal PRF to be used in all situations.

U2 - 10.1145/2976749.2978332

DO - 10.1145/2976749.2978332

M3 - Conference paper

VL - Volume 24-28-October-2016

SP - 430

EP - 443

BT - Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security

T2 - 23rd ACM Conference on Computer and Communications Security

Y2 - 24 October 2016 through 28 October 2016

ER -