1. MPC-Friendly Symmetric Key Primitives
- Author
-
Dragos Rotaru, Christian Rechberger, Lorenzo Grassi, Peter Scholl, and Nigel P. Smart
- Subjects
Theoretical computer science ,Computer science ,business.industry ,0102 computer and information sciences ,02 engineering and technology ,Legendre symbol ,01 natural sciences ,symbols.namesake ,Symmetric-key algorithm ,010201 computation theory & mathematics ,0202 electrical engineering, electronic engineering, information engineering ,symbols ,Benchmark (computing) ,020201 artificial intelligence & image processing ,business ,Block cipher - 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.
- Published
- 2016
- Full Text
- View/download PDF