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. © 2008 Springer Berlin Heidelberg.
CITATION STYLE
Prabhakaran, M., & Rosulek, M. (2008). Towards robust computation on encrypted data. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5350 LNCS, pp. 216–233). https://doi.org/10.1007/978-3-540-89255-7_14
Mendeley helps you to discover research relevant for your work.