A simpler construction of CCA2-secure public-key encryption under general assumptions

Yehuda Lindell

doi:10.1007/3-540-39200-9_15

A simpler construction of CCA2-secure public-key encryption under general assumptions

Yehuda Lindell

IBM

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

54 Scopus citations

Abstract

In this paper we present a simpler construction of a public-key encryption scheme that achieves adaptive chosen ciphertext security (CCA2), assuming the existence of trapdoor permutations. We build on previous works of Sahai and De Santis et al. and construct a scheme that we believe is the easiest to understand to date. In particular, it is only slightly more involved than the Naor-Yung encryption scheme that is secure against passive chosen-ciphertext attacks (CCA1). We stress that the focus of this paper is on simplicity only.

Original language	English
Title of host publication	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Editors	Eli Biham
Publisher	Springer Verlag
Pages	241-254
Number of pages	14
ISBN (Print)	3540140395, 9783540140399
DOIs	https://doi.org/10.1007/3-540-39200-9_15
State	Published - 2003
Externally published	Yes

Publication series

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

Access to Document

10.1007/3-540-39200-9_15

Cite this

Lindell, Y. (2003). A simpler construction of CCA2-secure public-key encryption under general assumptions. In E. Biham (Ed.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (pp. 241-254). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2656). Springer Verlag. https://doi.org/10.1007/3-540-39200-9_15

Lindell, Yehuda. / A simpler construction of CCA2-secure public-key encryption under general assumptions. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). editor / Eli Biham. Springer Verlag, 2003. pp. 241-254 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inbook{ce7ef474b71c4cffa0240eeb2878f2ea,

title = "A simpler construction of CCA2-secure public-key encryption under general assumptions",

abstract = "In this paper we present a simpler construction of a public-key encryption scheme that achieves adaptive chosen ciphertext security (CCA2), assuming the existence of trapdoor permutations. We build on previous works of Sahai and De Santis et al. and construct a scheme that we believe is the easiest to understand to date. In particular, it is only slightly more involved than the Naor-Yung encryption scheme that is secure against passive chosen-ciphertext attacks (CCA1). We stress that the focus of this paper is on simplicity only.",

author = "Yehuda Lindell",

year = "2003",

doi = "10.1007/3-540-39200-9_15",

language = "אנגלית",

isbn = "3540140395",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "241--254",

editor = "Eli Biham",

booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

address = "גרמניה",

}

Lindell, Y 2003, A simpler construction of CCA2-secure public-key encryption under general assumptions. in E Biham (ed.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2656, Springer Verlag, pp. 241-254. https://doi.org/10.1007/3-540-39200-9_15

A simpler construction of CCA2-secure public-key encryption under general assumptions. / Lindell, Yehuda.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). ed. / Eli Biham. Springer Verlag, 2003. p. 241-254 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2656).

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

TY - CHAP

T1 - A simpler construction of CCA2-secure public-key encryption under general assumptions

AU - Lindell, Yehuda

PY - 2003

Y1 - 2003

N2 - In this paper we present a simpler construction of a public-key encryption scheme that achieves adaptive chosen ciphertext security (CCA2), assuming the existence of trapdoor permutations. We build on previous works of Sahai and De Santis et al. and construct a scheme that we believe is the easiest to understand to date. In particular, it is only slightly more involved than the Naor-Yung encryption scheme that is secure against passive chosen-ciphertext attacks (CCA1). We stress that the focus of this paper is on simplicity only.

AB - In this paper we present a simpler construction of a public-key encryption scheme that achieves adaptive chosen ciphertext security (CCA2), assuming the existence of trapdoor permutations. We build on previous works of Sahai and De Santis et al. and construct a scheme that we believe is the easiest to understand to date. In particular, it is only slightly more involved than the Naor-Yung encryption scheme that is secure against passive chosen-ciphertext attacks (CCA1). We stress that the focus of this paper is on simplicity only.

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

U2 - 10.1007/3-540-39200-9_15

DO - 10.1007/3-540-39200-9_15

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.chapter???

AN - SCOPUS:35248840513

SN - 3540140395

SN - 9783540140399

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

SP - 241

EP - 254

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

A2 - Biham, Eli

PB - Springer Verlag

ER -

Lindell Y. A simpler construction of CCA2-secure public-key encryption under general assumptions. In Biham E, editor, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer Verlag. 2003. p. 241-254. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-39200-9_15

A simpler construction of CCA2-secure public-key encryption under general assumptions

Abstract

Publication series

Access to Document

Other files and links

Fingerprint

Cite this