[Resource Topic] 2010/033: Simple and Efficient Public-Key Encryption from Computational Diffie-Hellman in the Standard Model

Resource Public-key cryptography
#1

Welcome to the resource topic for 2010/033

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

Authors: Kristiyan Haralambiev, Tibor Jager, Eike Kiltz, 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.

ePrint: https://eprint.iacr.org/2010/033

Talk: https://www.youtube.com/watch?v=ePeeJN7T4Wk

Slides: http://www.iacr.org/workshops/pkc2010/01_simple_and_efficient_public-key_encryption_from_computational_diffie-hellman_in_the_standard_model/

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .