Paper 2003/157
Some RSA-based Encryption Schemes with Tight Security Reduction
Kaoru Kurosawa and Tsuyoshi Takagi
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 {\it general} $n=pq$ (not factoring Blum integers). Our reductions of one-wayness are very tight because they require only one decryption-oracle query.
Note: This is a long version.
Metadata
- Available format(s)
- PS
- Category
- Public-key cryptography
- Publication info
- Published elsewhere. accepted by Asiacrypt'2003
- Keywords
- public-key cryptographyfactoring
- Contact author(s)
- kurosawa @ cis ibaraki ac jp
- History
- 2003-08-07: received
- Short URL
- https://ia.cr/2003/157
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2003/157, author = {Kaoru Kurosawa and Tsuyoshi Takagi}, title = {Some {RSA}-based Encryption Schemes with Tight Security Reduction}, howpublished = {Cryptology {ePrint} Archive, Paper 2003/157}, year = {2003}, url = {https://eprint.iacr.org/2003/157} }