CryptoDB
Some RSA-based Encryption Schemes with Tight Security Reduction
Authors: | |
---|---|
Download: | |
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. |
BibTeX
@misc{eprint-2003-11871, title={Some RSA-based Encryption Schemes with Tight Security Reduction}, booktitle={IACR Eprint archive}, keywords={public-key cryptography / public-key cryptography, factoring}, url={http://eprint.iacr.org/2003/157}, note={accepted by Asiacrypt'2003 kurosawa@cis.ibaraki.ac.jp 12271 received 7 Aug 2003}, author={Kaoru Kurosawa and Tsuyoshi Takagi}, year=2003 }