Paper 2010/033 Original: eprint.iacr.org/2010/033 ↗
Simple and Efficient Public-Key Encryption from Computational Diffie-Hellman in the Standard Model
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.
Metadata
- Available format(s)
PDF- Category
- Public-key cryptography
- Publication info
- Preprint.
- History
- 2010-03-12: last updated
- 2010-01-22: published
- Short URL
- https://ia.cr/2010/033
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2010/033,
author = {Kristiyan Haralambiev and Tibor Jager and Eike Kiltz and Victor Shoup},
title = {Simple and Efficient Public-Key Encryption from Computational Diffie-Hellman in the Standard Model},
howpublished = {Cryptology {ePrint} Archive, Paper 2010/033},
year = {2010},
url = {https://eprint.iacr.org/2010/033}
}