MPC-Friendly Symmetric Key Primitives

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

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

22 Citations (Scopus)

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 languageEnglish
Title of host publicationACM Conference on Computer and Communications Security - CCS 2016
PublisherAssociation for Computing Machinery (ACM)
Pages430-443
Number of pages14
VolumeOctober 2016
ISBN (Print)9781450341394
DOIs
Publication statusPublished - 24 Oct 2016

Cite this