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

Kristiyan Haralambiev; Tibor Jager; Eike Kiltz; Victor Shoup

doi:10.1007/978-3-642-13013-7_1

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

Kristiyan Haralambiev, Tibor Jager, Eike Kiltz, Victor Shoup

Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference 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 language	English (US)
Title of host publication	Public Key Cryptography, PKC 2010 - 13th International Conference on Practice and Theory in Public Key Cryptography, Proceedings
Pages	1-18
Number of pages	18
DOIs	https://doi.org/10.1007/978-3-642-13013-7_1
State	Published - 2010
Event	13th International Conference on Practice and Theory in Public Key Cryptography, PKC 2010 - Paris, France Duration: May 26 2010 → May 28 2010

Publication series

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

Other

Other	13th International Conference on Practice and Theory in Public Key Cryptography, PKC 2010
Country/Territory	France
City	Paris
Period	5/26/10 → 5/28/10

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Access to Document

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

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 (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 et al.

Public Key Cryptography, PKC 2010 - 13th International Conference on Practice and Theory in Public Key Cryptography, Proceedings. 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 proceeding › Conference 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. 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. 2010. p. 1-18. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-642-13013-7_1

Haralambiev, Kristiyan ; Jager, Tibor ; Kiltz, Eike et al. / 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. 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}̂{\v s}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",

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",

note = "13th International Conference on Practice and Theory in Public Key Cryptography, PKC 2010 ; Conference date: 26-05-2010 Through 28-05-2010",

}

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

AN - SCOPUS:79955548922

SN - 3642130127

SN - 9783642130120

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

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

Y2 - 26 May 2010 through 28 May 2010

ER -

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

Abstract

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this