From Oblivious AES to Efficient and Secure Database Join in the Multiparty Setting

  • Sven Laur
  • Riivo Talviste
  • Jan Willemson
Conference paper

DOI: 10.1007/978-3-642-38980-1_6

Part of the Lecture Notes in Computer Science book series (LNCS, volume 7954)
Cite this paper as:
Laur S., Talviste R., Willemson J. (2013) From Oblivious AES to Efficient and Secure Database Join in the Multiparty Setting. In: Jacobson M., Locasto M., Mohassel P., Safavi-Naini R. (eds) Applied Cryptography and Network Security. ACNS 2013. Lecture Notes in Computer Science, vol 7954. Springer, Berlin, Heidelberg

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Sven Laur
    • 2
    • 3
  • Riivo Talviste
    • 1
    • 2
  • Jan Willemson
    • 1
    • 3
  1. 1.CyberneticaTartuEstonia
  2. 2.Institute of Computer ScienceUniversity of TartuTartuEstonia
  3. 3.Software Technology and Applications Competence CenterTartuEstonia

Personalised recommendations