Paper 2007/074

A Cramer-Shoup Encryption Scheme from the Linear Assumption and from Progressively Weaker Linear Variants

Hovav Shacham

Abstract

We describe a CCA-secure public-key encryption scheme, in the Cramer-Shoup paradigm, based on the Linear assumption of Boneh, Boyen, and Shacham. Through a comparison to the Kiltz tag-encryption scheme from TCC 2006, our scheme gives evidence that the Cramer-Shoup paradigm yields CCA encryption with shorter ciphertexts than the Canetti-Halevi-Katz paradigm. We present a generalization of the Linear assumption into a family of progressively weaker assumptions and show how to instantiate our Linear Cramer-Shoup encryption using the progressively weaker members of this family.

Metadata
Available format(s)
PDF
Category
Public-key cryptography
Publication info
Published elsewhere. Unknown where it was published
Keywords
Cramer-ShoupCanetti-Halevi-KatzCCA encryptionbilinear groupsgeneric groups
Contact author(s)
hovav shacham @ weizmann ac il
History
2009-04-23: revised
2007-02-28: received
See all versions
Short URL
https://ia.cr/2007/074
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2007/074,
      author = {Hovav Shacham},
      title = {A Cramer-Shoup Encryption Scheme from the Linear Assumption and from Progressively Weaker Linear Variants},
      howpublished = {Cryptology ePrint Archive, Paper 2007/074},
      year = {2007},
      note = {\url{https://eprint.iacr.org/2007/074}},
      url = {https://eprint.iacr.org/2007/074}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.