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
Volume6056 LNCS
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)03029743
ISSN (Electronic)16113349

Other

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

Fingerprint

Public Key Encryption
Diffie-Hellman
Cryptography
Standard Model
Public key

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Haralambiev, K., Jager, T., Kiltz, E., & Shoup, V. (2010). Simple and efficient public-key encryption from computational diffie-hellman in the standard model. In Public Key Cryptography, PKC 2010 - 13th International Conference on Practice and Theory in Public Key Cryptography, Proceedings (Vol. 6056 LNCS, pp. 1-18). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6056 LNCS). https://doi.org/10.1007/978-3-642-13013-7_1

Simple and efficient public-key encryption from computational diffie-hellman in the standard model. / Haralambiev, Kristiyan; Jager, Tibor; Kiltz, Eike; Shoup, Victor.

Public Key Cryptography, PKC 2010 - 13th International Conference on Practice and Theory in Public Key Cryptography, Proceedings. Vol. 6056 LNCS 2010. p. 1-18 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6056 LNCS).

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

Haralambiev, K, Jager, T, Kiltz, E & Shoup, V 2010, Simple and efficient public-key encryption from computational diffie-hellman in the standard model. in Public Key Cryptography, PKC 2010 - 13th International Conference on Practice and Theory in Public Key Cryptography, Proceedings. vol. 6056 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6056 LNCS, pp. 1-18, 13th International Conference on Practice and Theory in Public Key Cryptography, PKC 2010, Paris, France, 5/26/10. https://doi.org/10.1007/978-3-642-13013-7_1
Haralambiev K, Jager T, Kiltz E, Shoup V. Simple and efficient public-key encryption from computational diffie-hellman in the standard model. In Public Key Cryptography, PKC 2010 - 13th International Conference on Practice and Theory in Public Key Cryptography, Proceedings. Vol. 6056 LNCS. 2010. p. 1-18. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-13013-7_1
Haralambiev, Kristiyan ; Jager, Tibor ; Kiltz, Eike ; Shoup, Victor. / Simple and efficient public-key encryption from computational diffie-hellman in the standard model. Public Key Cryptography, PKC 2010 - 13th International Conference on Practice and Theory in Public Key Cryptography, Proceedings. Vol. 6056 LNCS 2010. pp. 1-18 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{54866616c39a4131baa33eb31dcc67d2,
title = "Simple and efficient public-key encryption from computational diffie-hellman in the standard model",
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{\^a}̂šn group elements, where n is the security parameter.",
author = "Kristiyan Haralambiev and Tibor Jager and Eike Kiltz and Victor Shoup",
year = "2010",
doi = "10.1007/978-3-642-13013-7_1",
language = "English (US)",
isbn = "3642130127",
volume = "6056 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "1--18",
booktitle = "Public Key Cryptography, PKC 2010 - 13th International Conference on Practice and Theory in Public Key Cryptography, Proceedings",

}

TY - GEN

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

AU - Haralambiev, Kristiyan

AU - Jager, Tibor

AU - Kiltz, Eike

AU - Shoup, Victor

PY - 2010

Y1 - 2010

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=79955548922&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79955548922&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-13013-7_1

DO - 10.1007/978-3-642-13013-7_1

M3 - Conference contribution

SN - 3642130127

SN - 9783642130120

VL - 6056 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 1

EP - 18

BT - Public Key Cryptography, PKC 2010 - 13th International Conference on Practice and Theory in Public Key Cryptography, Proceedings

ER -