Rerandomizable RCCA Encryption

@article{Prabhakaran2007RerandomizableRE,
  title={Rerandomizable RCCA Encryption},
  author={Manoj Prabhakaran and Mike Rosulek},
  journal={IACR Cryptology ePrint Archive},
  year={2007},
  volume={2007},
  pages={119}
}
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… CONTINUE READING
Highly Cited
This paper has 55 citations. REVIEW CITATIONS

Citations

Publications citing this paper.

55 Citations

0510'09'12'15'18
Citations per Year
Semantic Scholar estimates that this publication has 55 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 27 references

Anonymous rerandomizable rcca encryption

  • M. Prabhakaran, M. Rosulek
  • Cryptology ePrint Archive, Report 2007/119,
  • 2007
2 Excerpts

Cunningham chain

  • J. K. Andersen, E. W. Weisstein
  • FromMathWorld – AWolfram Web Resource
  • 2005

Personal communication

  • M. Lad
  • 2005
1 Excerpt

Similar Papers

Loading similar papers…