Cryptology ePrint Archive: Report 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.

Category / Keywords: secret-key cryptography /

Original Publication (in the same form): ACM CCS 2016
DOI:
10.1145/2976749.2978332

Date: received 31 May 2016, last revised 5 Aug 2016

Contact author: nigel at cs bris ac uk,Peter Scholl@bristol ac uk,dragos rotaru@bristol ac uk,lorenzo grassi@iaik tugraz at,Christian Rechberger@iaik tugraz at

Available format(s): PDF | BibTeX Citation

Note: modified contact emails

Version: 20160805:070401 (All versions of this report)

Short URL: ia.cr/2016/542

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]