Towards Robust Computation on Encrypted Data

  • Manoj Prabhakaran
  • Mike Rosulek
Conference paper

DOI: 10.1007/978-3-540-89255-7_14

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5350)
Cite this paper as:
Prabhakaran M., Rosulek M. (2008) Towards Robust Computation on Encrypted Data. In: Pieprzyk J. (eds) Advances in Cryptology - ASIACRYPT 2008. ASIACRYPT 2008. Lecture Notes in Computer Science, vol 5350. Springer, Berlin, Heidelberg

Abstract

Encryption schemes that support computation on encrypted data are useful in constructing efficient and intuitively simple cryptographic protocols. However, the approach was previously limited to stand-alone and/or honest-but-curious security. In this work, we apply recent results on “non-malleable homomorphic encryption” to construct new protocols with Universally Composable security against active corruption, for certain interesting tasks. Also, we use our techniques to develop non-malleable homomorphic encryption that can handle homomorphic operations involving more than one ciphertext.

Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Manoj Prabhakaran
    • 1
  • Mike Rosulek
    • 1
  1. 1.University of IllinoisUrbana-ChampaignUSA

Personalised recommendations