Paper 2016/542

MPC-Friendly Symmetric Key Primitives

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


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.

Note: modified contact emails

Available format(s)
Secret-key cryptography
Publication info
Published elsewhere. ACM CCS 2016
Contact author(s)
nigel @ cs bris ac uk
Peter Scholl @ bristol ac uk
dragos rotaru @ bristol ac uk
lorenzo grassi @ iaik tugraz at
Christian Rechberger @ iaik tugraz at
2016-08-05: last of 3 revisions
2016-05-31: received
See all versions
Short URL
Creative Commons Attribution


      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},
      doi = {10.1145/2976749.2978332},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.