Simple and efficient public-key encryption from computational diffie-hellman in the standard model

  • Authors:
  • Kristiyan Haralambiev;Tibor Jager;Eike Kiltz;Victor Shoup

  • Affiliations:
  • Dept. of Computer Science, New York University, Courant Institute, New York;Horst Görtz Institute for IT Security, Ruhr-University Bochum, Germany;Cryptology & Information Security Group, CWI, Amsterdam, The Netherlands;Dept. of Computer Science, New York University, Courant Institute, New York

  • Venue:
  • PKC'10 Proceedings of the 13th international conference on Practice and Theory in Public Key Cryptography
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

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.