Some RSA-based encryption schemes with tight security reduction

Kaoru Kurosawa; Tsuyoshi Takagi

doi:10.1007/978-3-540-40061-5_2

Some RSA-based encryption schemes with tight security reduction

Kaoru Kurosawa, Tsuyoshi Takagi

Research output: Chapter in Book/Report/Conference proceeding › Chapter

7 Citations (Scopus)

Abstract

In this paper, we study some RSA-based semantically secure encryption schemes (IND-CPA) in the standard model. We first derive the exactly tight one-wayness of Rabin-Paillier encryption scheme which assumes that factoring Blum integers is hard. We next propose the first IND-CPA scheme whose one-wayness is equivalent to factoring general n = pq (not factoring Blum integers). Our reductions of one-wayness are very tight because they require only one decryption-oracle query.

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	Chi Sung Laih
Publisher	Springer Verlag
Pages	19-36
Number of pages	18
ISBN (Print)	3540205926
DOIs	https://doi.org/10.1007/978-3-540-40061-5_2
Publication status	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	2894
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/978-3-540-40061-5_2

Cite this

Kurosawa, K., & Takagi, T. (2003). Some RSA-based encryption schemes with tight security reduction. In C. S. Laih (Ed.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (pp. 19-36). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2894). Springer Verlag. https://doi.org/10.1007/978-3-540-40061-5_2

Some RSA-based encryption schemes with tight security reduction. / Kurosawa, Kaoru; Takagi, Tsuyoshi.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). ed. / Chi Sung Laih. Springer Verlag, 2003. p. 19-36 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2894).

Research output: Chapter in Book/Report/Conference proceeding › Chapter

Kurosawa, K & Takagi, T 2003, Some RSA-based encryption schemes with tight security reduction. in CS Laih (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. 2894, Springer Verlag, pp. 19-36. https://doi.org/10.1007/978-3-540-40061-5_2

Kurosawa K, Takagi T. Some RSA-based encryption schemes with tight security reduction. In Laih CS, editor, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer Verlag. 2003. p. 19-36. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-540-40061-5_2

Kurosawa, Kaoru ; Takagi, Tsuyoshi. / Some RSA-based encryption schemes with tight security reduction. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). editor / Chi Sung Laih. Springer Verlag, 2003. pp. 19-36 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inbook{be6ade2aa06a43318813990f2ab50531,

title = "Some RSA-based encryption schemes with tight security reduction",

abstract = "In this paper, we study some RSA-based semantically secure encryption schemes (IND-CPA) in the standard model. We first derive the exactly tight one-wayness of Rabin-Paillier encryption scheme which assumes that factoring Blum integers is hard. We next propose the first IND-CPA scheme whose one-wayness is equivalent to factoring general n = pq (not factoring Blum integers). Our reductions of one-wayness are very tight because they require only one decryption-oracle query.",

author = "Kaoru Kurosawa and Tsuyoshi Takagi",

year = "2003",

doi = "10.1007/978-3-540-40061-5_2",

language = "English",

isbn = "3540205926",

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

publisher = "Springer Verlag",

pages = "19--36",

editor = "Laih, {Chi Sung}",

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

address = "Germany",

}

TY - CHAP

T1 - Some RSA-based encryption schemes with tight security reduction

AU - Kurosawa, Kaoru

AU - Takagi, Tsuyoshi

PY - 2003

Y1 - 2003

N2 - In this paper, we study some RSA-based semantically secure encryption schemes (IND-CPA) in the standard model. We first derive the exactly tight one-wayness of Rabin-Paillier encryption scheme which assumes that factoring Blum integers is hard. We next propose the first IND-CPA scheme whose one-wayness is equivalent to factoring general n = pq (not factoring Blum integers). Our reductions of one-wayness are very tight because they require only one decryption-oracle query.

AB - In this paper, we study some RSA-based semantically secure encryption schemes (IND-CPA) in the standard model. We first derive the exactly tight one-wayness of Rabin-Paillier encryption scheme which assumes that factoring Blum integers is hard. We next propose the first IND-CPA scheme whose one-wayness is equivalent to factoring general n = pq (not factoring Blum integers). Our reductions of one-wayness are very tight because they require only one decryption-oracle query.

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

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

U2 - 10.1007/978-3-540-40061-5_2

DO - 10.1007/978-3-540-40061-5_2

M3 - Chapter

AN - SCOPUS:0345490615

SN - 3540205926

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

SP - 19

EP - 36

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

A2 - Laih, Chi Sung

PB - Springer Verlag

ER -

Some RSA-based encryption schemes with tight security reduction

Abstract

Publication series

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this