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

Kristiyan Haralambiev, Tibor Jager, Eike Kiltz, Victor Shoup

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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â̂šn group elements, where n is the security parameter.

Original languageEnglish (US)
Title of host publicationPublic Key Cryptography, PKC 2010 - 13th International Conference on Practice and Theory in Public Key Cryptography, Proceedings
Pages1-18
Number of pages18
DOIs
StatePublished - 2010
Event13th International Conference on Practice and Theory in Public Key Cryptography, PKC 2010 - Paris, France
Duration: May 26 2010May 28 2010

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6056 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other13th International Conference on Practice and Theory in Public Key Cryptography, PKC 2010
CountryFrance
CityParis
Period5/26/105/28/10

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Simple and efficient public-key encryption from computational diffie-hellman in the standard model'. Together they form a unique fingerprint.

Cite this