Welcome to the resource topic for 2003/157
Title:
Some RSA-based Encryption Schemes with Tight Security Reduction
Authors: Kaoru Kurosawa, 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.
ePrint: https://eprint.iacr.org/2003/157
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .