| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 427582 | Information Processing Letters | 2012 | 4 Pages |
Abstract
This paper proposes a provably secure transformation of Paillier cryptosystem into an IND-CCA2 secure one in random oracle model. Our construction exploits the randomness extractability of Paillier cryptosystem for achieving efficiency. Lastly, we compare this conversion with other generic and specific IND-CCA2 conversions in terms of computational overhead and efficiency.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
