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

}