Paper 2013/203

From oblivious AES to efficient and secure database join in the multiparty setting

Sven Laur, Riivo Talviste, and Jan Willemson

Abstract

AES block cipher is an important cryptographic primitive with many applications. In this work, we describe how to efficiently implement the AES-128 block cipher in the multiparty setting where the key and the plaintext are both in a secret-shared form. In particular, we study several approaches for AES S-box substitution based on oblivious table lookup and circuit evaluation. Given this secure AES implementation, we build a universally composable database join operation for secret shared tables. The resulting protocol scales almost linearly with the database size and can join medium sized databases with 100,000 rows in few minutes, which makes many privacy-preserving data mining algorithms feasible in practice. All the practical implementations and performance measurements are done on the Sharemind secure multi-party computation platform.

Metadata
Available format(s)
PDF
Category
Cryptographic protocols
Publication info
Published elsewhere. This is an extended version of the paper presented at ACNS'13.
Keywords
AESsecure database joinsecure multi-party computationimplementation
Contact author(s)
riivo talviste @ cyber ee
History
2013-04-14: received
Short URL
https://ia.cr/2013/203
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2013/203,
      author = {Sven Laur and Riivo Talviste and Jan Willemson},
      title = {From oblivious AES to efficient and secure database join in the multiparty setting},
      howpublished = {Cryptology ePrint Archive, Paper 2013/203},
      year = {2013},
      note = {\url{https://eprint.iacr.org/2013/203}},
      url = {https://eprint.iacr.org/2013/203}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.