Paper 2003/157 Original: eprint.iacr.org/2003/157 ↗
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 {\it general} $n=pq$ (not factoring Blum integers). Our reductions of one-wayness are very tight because they require only one decryption-oracle query.
Metadata
- Available format(s)
PDF- Category
- Public-key cryptography
- Publication info
- Preprint.
- History
- 2003-08-07: last updated
- 2003-08-07: published
- Short URL
- https://ia.cr/2003/157
- License
- https://creativecommons.org/licenses/by/4.0/
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}
}