Cryptology ePrint Archive: Report 2017/378

Faster Secure Multi-Party Computation of AES and DES Using Lookup Tables

Marcel Keller and Emmanuela Orsini and Dragos Rotaru and Peter Scholl and Eduardo Soria-Vazquez and Srinivas Vivek

Abstract: We present an actively secure protocol for secure multi-party computation based on lookup tables, by extending the recent, two-party `TinyTable' protocol of Damgard et al. (ePrint 2016). Like TinyTable, an attractive feature of our protocol is a very fast and simple online evaluation phase. We also give a new method for efficiently implementing the preprocessing material required for the online phase using arithmetic circuits over characteristic two fields. This improves over the suggested method from TinyTable by at least a factor of 50.

As an application of our protocol, we consider secure computation of the Triple DES and the AES block ciphers, computing the S-boxes via lookup tables. Additionally, we adapt a technique for evaluating (Triple) DES based on a polynomial representation of its S-boxes that was recently proposed in the side-channel countermeasures community. We compare the above two approaches with an implementation. The table lookup method leads to a very fast online time of over 230,000 blocks per second for AES and 45,000 for Triple DES. The preprocessing cost is not much more than previous methods that have a much slower online time.

Category / Keywords: multi-party computation, block cipher, implementation

Original Publication (with minor differences): ACNS 2017

Date: received 28 Apr 2017, last revised 1 May 2017

Contact author: dragos rotaru at bristol ac uk

Available format(s): PDF | BibTeX Citation

Note: modified abstract

Version: 20170501:134527 (All versions of this report)

Short URL: ia.cr/2017/378

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]