Simple and Efficient Public-Key Encryption from Computational Diffie-Hellman in the Standard Model.
Kristiyan Haralambiev, Tibor Jager, Eike Kiltz, Victor Shoup · 2010
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 √ n group elements, where n is the security parameter. 1