[PR07] Rerandomizable RCCA Encryption

Authors: Manoj Prabhakaran, Mike Rosulek | Venue: CRYPTO 2007 | Source

Abstract

We give the first perfectly rerandomizable, Replayable-CCA (RCCA) secure encryption scheme, positively answering an open problem of Canetti et al. [CRYPTO 2003]. Our encryption scheme, which we call the Double-strand Cramer-Shoup scheme, is a non-trivial extension of the popular Cramer-Shoup encryption. Its security is based on the standard DDH assumption. To justify our definitions, we define a powerful “Replayable Message Posting” functionality in the Universally Composable (UC) framework, and show that any encryption scheme that satisfies our definitions of rerandomizability and RCCA security is a UC-secure implementation of this functionality. Finally, we enhance the notion of rerandomizable RCCA security by adding a receiver-anonymity (or key-privacy) requirement, and show that it results in a correspondingly enhanced UC functionality. We leave open the problem of constructing a scheme that achieves this enhancement.

BibTeX

@Inproceedings{C:PraRos07,
  author = {Manoj Prabhakaran and Mike Rosulek},
  title = {Rerandomizable {RCCA} Encryption},
  pages = {517--534},
  editor = {Alfred Menezes},
  booktitle = {Advances in Cryptology -- {CRYPTO}~2007},
  volume = {4622},
  series = {Lecture Notes in Computer Science},
  address = {Santa Barbara, CA, USA},
  month = {aug~19--23},
  publisher = {Springer Berlin Heidelberg, Germany},
  year = {2007},
  doi = {10.1007/978-3-540-74143-5_29},
}