Paper 2016/542
MPC-Friendly Symmetric Key Primitives
Lorenzo Grassi and Christian Rechberger and Dragos Rotaru and Peter Scholl and 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.
Note: modified contact emails
Metadata
- Available format(s)
- Category
- Secret-key cryptography
- Publication info
- Published elsewhere. ACM CCS 2016
- DOI
- 10.1145/2976749.2978332
- 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
- History
- 2016-08-05: last of 3 revisions
- 2016-05-31: received
- See all versions
- Short URL
- https://ia.cr/2016/542
- License
-
CC BY