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

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

Explore a 21-minute conference talk presented at PKC 2010 that delves into a novel approach for public-key encryption based on the Computational Diffie-Hellman assumption in the standard model. Learn about the research conducted by Kristiyan Haralambiev, Tibor Jager, Eike Kiltz, and Victor Shoup, which proposes a simple and efficient encryption method. Gain insights into the technical aspects of their work and understand how it contributes to the field of cryptography.