Towards robust computation on encrypted data

Manoj Prabhakaran, Mike Rosulek

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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.

Original languageEnglish (US)
Title of host publicationAdvances in Cryptology - ASIACRYPT 2008 - 14th International Conference on the Theory and Application of Cryptology and Information Security, Proceedings
Pages216-233
Number of pages18
DOIs
StatePublished - 2008
Event14th International Conference on the Theory and Application of Cryptology and Information Security, ASIACRYPT 2008 - Melbourne, VIC, Australia
Duration: Dec 7 2008Dec 11 2008

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5350 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other14th International Conference on the Theory and Application of Cryptology and Information Security, ASIACRYPT 2008
CountryAustralia
CityMelbourne, VIC
Period12/7/0812/11/08

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Towards robust computation on encrypted data'. Together they form a unique fingerprint.

Cite this