International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Paper: Simple and Efficient Public-Key Encryption from Computational Diffie-Hellman in the Standard Model

Authors:
Kristiyan Haralambiev
Tibor Jager
Eike Kiltz
Victor Shoup
Download:
URL: http://eprint.iacr.org/2010/033
Search ePrint
Search Google
Abstract: This paper proposes practical chosen-ciphertext secure public-key encryption systems that are provably secure under the computational Diffie-Hellman assumption, in the standard model. Our schemes are conceptually simpler and more efficient than previous constructions. We also show that in bilinear groups the size of the public-key can be shrunk from n to 2\sqrt{n} group elements, where n is the security parameter.
BibTeX
@misc{eprint-2010-22934,
  title={Simple and Efficient Public-Key Encryption from Computational Diffie-Hellman in the Standard Model},
  booktitle={IACR Eprint archive},
  keywords={public-key cryptography /},
  url={http://eprint.iacr.org/2010/033},
  note={ kiltz@cwi.nl 14680 received 21 Jan 2010, last revised 12 Mar 2010},
  author={Kristiyan Haralambiev and Tibor Jager and Eike Kiltz and Victor Shoup},
  year=2010
}