Paillier's Cryptosystem Revisited (2001)
| Venue: | IN ACM CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY 2001 |
| Citations: | 27 - 4 self |
BibTeX
@INPROCEEDINGS{Catalano01paillier'scryptosystem,
author = {Dario Catalano and Rosario Gennaro and Nick Howgrave-Graham and Phong Q. Nguyen},
title = {Paillier's Cryptosystem Revisited},
booktitle = {IN ACM CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY 2001},
year = {2001},
pages = {206--214},
publisher = {ACM Press}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We re-examine Paillier's cryptosystem, and show that by choosing a particular discrete log base g, and by introducing an alternative decryption procedure, we can extend the scheme to allow an arbitrary exponent e instead of N. The use of low exponents substantially increases the eciency of the scheme. The semantic security is now based on a new decisional assumption, namely the hardness of deciding whether an element is a "small" e-th residue modulo N². We also
