One-Wayness Equivalent to General Factoring
This paper shows the first practical semantically secure public-key encryption scheme such that its one-wayness is equivalent to general factoring in the standard model [in the sense of indistinguishability against chosen-plaintext attack (IND-CPA)]. Next our proof technique is applied to the Rabin-Paillier encryption scheme and a variant of the RSA-Paillier encryption scheme to prove their one-wayness under the factoring assumption via tight security reductions.