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

ded abstract of this paper appears in 13th International Conference on Practice and Theory in Public Key Cryptography (PKC) 2010, Lecture Notes in Computer Science Vol. ?, P. Nguyen and D. Pointcheval eds., Springer-Verlag, 2010. This is the full version. Simple and Efficient Public-Key Encryption from Computational Diffie-Hellman in the Standard Model Kristiyan Haralambiev1 Tibor Jager2 Eike Kiltz3 Victor Shoup4 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.

• Type: Conference
• Year: 2010
• Where: PKC
• Authors: Kristiyan Haralambiev, Tibor Jager, Eike Kiltz, Victor Shoup
• Keywords: Computational Diffie-hellman, Cryptology, Efficient Public-Key Encryption, PKC 2010, Public-key Encryption