MPC-Friendly Symmetric Key Primitives

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

Paper 2016/542 Original: eprint.iacr.org/2016/542 ↗

MPC-Friendly Symmetric Key Primitives

Lorenzo Grassi

Christian Rechberger

Dragos Rotaru

Peter Scholl

Nigel P. Smart

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.

Metadata

Available format(s): PDF
Category: Secret-key cryptography
Publication info: Preprint.
History: 2016-08-05: last updated; 2016-05-31: published
Short URL: https://ia.cr/2016/542
License: https://creativecommons.org/licenses/by/4.0/

BibTeX

@misc{cryptoeprint:2016/542,
      author = {Lorenzo Grassi and Christian Rechberger and Dragos Rotaru and Peter Scholl and Nigel P.  Smart},
      title = {MPC-Friendly Symmetric Key Primitives},
      howpublished = {Cryptology {ePrint} Archive, Paper 2016/542},
      year = {2016},
      url = {https://eprint.iacr.org/2016/542}
}