Some RSA-Based Encryption Schemes with Tight Security Reduction

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.

• Type: Conference
• Year: 2003
• Where: ASIACRYPT
• Authors: Kaoru Kurosawa, Tsuyoshi Takagi
• Keywords: ASIACRYPT 2003, Blum Integers, Cryptology, Encryption Scheme, first Ind-cpa Scheme