Faster secure multi-party computation of AES and DES using lookup tables

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

doi:10.1007/978-3-319-61204-1_12

Faster secure multi-party computation of AES and DES using lookup tables

Marcel Keller
, Emmanuela Orsini
, Dragos Rotaru^*
, Peter Scholl
, Eduardo Soria-Vazquez
, Srinivas Vivek

^*Corresponding author for this work

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

29 Citations (Scopus)

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 Damgård 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.

Original language	English
Title of host publication	Applied Cryptography and Network Security
Subtitle of host publication	15th International Conference, ACNS 2017, Kanazawa, Japan, July 10-12, 2017, Proceedings
Publisher	Springer, Cham
Pages	229-249
Number of pages	21
ISBN (Print)	9783319612034
DOIs	https://doi.org/10.1007/978-3-319-61204-1_12
Publication status	Published - 26 Jun 2017
Event	15th International Conference on Applied Cryptography and Network Security, ACNS 2017 - Kanazawa, Japan Duration: 10 Jul 2017 → 12 Jul 2017

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	10355
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	15th International Conference on Applied Cryptography and Network Security, ACNS 2017
Country/Territory	Japan
City	Kanazawa
Period	10/07/17 → 12/07/17

Keywords

Block cipher
Implementation
Multi-party computation

Access to Document

10.1007/978-3-319-61204-1_12

https://eprint.iacr.org/2017/378Licence: CC BY

Handle.net

Persistent link

Cite this

Keller, M., Orsini, E., Rotaru, D., Scholl, P., Soria-Vazquez, E., & Vivek, S. (2017). Faster secure multi-party computation of AES and DES using lookup tables. In Applied Cryptography and Network Security: 15th International Conference, ACNS 2017, Kanazawa, Japan, July 10-12, 2017, Proceedings (pp. 229-249). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10355). Springer, Cham. https://doi.org/10.1007/978-3-319-61204-1_12

Keller, Marcel ; Orsini, Emmanuela ; Rotaru, Dragos et al. / Faster secure multi-party computation of AES and DES using lookup tables. Applied Cryptography and Network Security: 15th International Conference, ACNS 2017, Kanazawa, Japan, July 10-12, 2017, Proceedings. Springer, Cham, 2017. pp. 229-249 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{f6b2571125264393ae3780552d26778e,

title = "Faster secure multi-party computation of AES and DES using lookup tables",

abstract = "We present an actively secure protocol for secure multi-party computation based on lookup tables, by extending the recent, two-party {\textquoteleft}TinyTable{\textquoteright} protocol of Damg{\aa}rd 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.",

keywords = "Block cipher, Implementation, Multi-party computation",

author = "Marcel Keller and Emmanuela Orsini and Dragos Rotaru and Peter Scholl and Eduardo Soria-Vazquez and Srinivas Vivek",

year = "2017",

month = jun,

day = "26",

doi = "10.1007/978-3-319-61204-1\_12",

language = "English",

isbn = "9783319612034",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer, Cham",

pages = "229--249",

booktitle = "Applied Cryptography and Network Security",

address = "Switzerland",

note = "15th International Conference on Applied Cryptography and Network Security, ACNS 2017 ; Conference date: 10-07-2017 Through 12-07-2017",

}

Keller, M, Orsini, E, Rotaru, D, Scholl, P, Soria-Vazquez, E & Vivek, S 2017, Faster secure multi-party computation of AES and DES using lookup tables. in Applied Cryptography and Network Security: 15th International Conference, ACNS 2017, Kanazawa, Japan, July 10-12, 2017, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 10355, Springer, Cham, pp. 229-249, 15th International Conference on Applied Cryptography and Network Security, ACNS 2017, Kanazawa, Japan, 10/07/17. https://doi.org/10.1007/978-3-319-61204-1_12

Faster secure multi-party computation of AES and DES using lookup tables. / Keller, Marcel; Orsini, Emmanuela; Rotaru, Dragos et al.
Applied Cryptography and Network Security: 15th International Conference, ACNS 2017, Kanazawa, Japan, July 10-12, 2017, Proceedings. Springer, Cham, 2017. p. 229-249 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10355).

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

TY - GEN

T1 - Faster secure multi-party computation of AES and DES using lookup tables

AU - Keller, Marcel

AU - Orsini, Emmanuela

AU - Rotaru, Dragos

AU - Scholl, Peter

AU - Soria-Vazquez, Eduardo

AU - Vivek, Srinivas

PY - 2017/6/26

Y1 - 2017/6/26

N2 - We present an actively secure protocol for secure multi-party computation based on lookup tables, by extending the recent, two-party ‘TinyTable’ protocol of Damgård 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.

AB - We present an actively secure protocol for secure multi-party computation based on lookup tables, by extending the recent, two-party ‘TinyTable’ protocol of Damgård 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.

KW - Block cipher

KW - Implementation

KW - Multi-party computation

UR - https://www.scopus.com/pages/publications/85022324204

U2 - 10.1007/978-3-319-61204-1_12

DO - 10.1007/978-3-319-61204-1_12

M3 - Conference Contribution (Conference Proceeding)

AN - SCOPUS:85022324204

SN - 9783319612034

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 229

EP - 249

BT - Applied Cryptography and Network Security

PB - Springer, Cham

T2 - 15th International Conference on Applied Cryptography and Network Security, ACNS 2017

Y2 - 10 July 2017 through 12 July 2017

ER -

Keller M, Orsini E, Rotaru D, Scholl P, Soria-Vazquez E, Vivek S. Faster secure multi-party computation of AES and DES using lookup tables. In Applied Cryptography and Network Security: 15th International Conference, ACNS 2017, Kanazawa, Japan, July 10-12, 2017, Proceedings. Springer, Cham. 2017. p. 229-249. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-319-61204-1_12

Faster secure multi-party computation of AES and DES using lookup tables

Abstract

Publication series

Conference

Keywords

Access to Document

Handle.net

Other files and links

Fingerprint

TIPS Fellowship

Cite this

Faster secure multi-party computation of AES and DES using lookup tables

Abstract

Publication series

Conference

Keywords

Access to Document

Handle.net

Other files and links

Fingerprint

Projects

TIPS Fellowship

Cite this