MPC-Friendly Symmetric Key Primitives

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

Research output: Chapter in Book/Report/Conference proceedingConference paperpeer-review


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 languageEnglish
Title of host publicationProceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security
Number of pages14
VolumeVolume 24-28-October-2016
Publication statusPublished - 2016
Event23rd ACM Conference on Computer and Communications Security: CCS 2016 - Vienna, Austria
Duration: 24 Oct 201628 Oct 2016


Conference23rd ACM Conference on Computer and Communications Security

Cite this