## CryptoDB

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

Authors: Hovav Shacham URL: http://eprint.iacr.org/2007/074 Search ePrint Search Google 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.
##### BibTeX
@misc{eprint-2007-13356,
title={A Cramer-Shoup Encryption Scheme from the Linear Assumption and from Progressively Weaker Linear Variants},
booktitle={IACR Eprint archive},
keywords={public-key cryptography / Cramer-Shoup, Canetti-Halevi-Katz, CCA encryption, bilinear groups, generic groups},
url={http://eprint.iacr.org/2007/074},
note={ hovav.shacham@weizmann.ac.il 13569 received 25 Feb 2007},
author={Hovav Shacham},
year=2007
}