Cryptology ePrint Archive: Report 2010/033

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

Kristiyan Haralambiev and Tibor Jager and Eike Kiltz and Victor Shoup

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.

Category / Keywords: public-key cryptography /

Date: received 21 Jan 2010, last revised 12 Mar 2010

Contact author: kiltz at cwi nl

Available formats: PDF | BibTeX Citation

Version: 20100312:141252 (All versions of this report)

Discussion forum: Show discussion | Start new discussion