Abstract
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.
Original language | English |
---|---|
Pages (from-to) | 4249-4262 |
Number of pages | 14 |
Journal | IEEE Transactions on Information Theory |
Volume | 55 |
Issue number | 9 |
DOIs | |
Publication status | Published - 2009 |
Externally published | Yes |
All Science Journal Classification (ASJC) codes
- Information Systems
- Computer Science Applications
- Library and Information Sciences