conference paper Open access
The Bit Security of Paillier’s Encryption Scheme and Its Applications
Dario Catalanoa, Rosario Gennarob, Nick Howgrave-Grahamb
- aDipartimento di Matematica e Informatica, Universitá di Catania, Viale A. Doria 6, 95125, Catania
- bIBM T.J.Watson Research Center, PO Box 704, Yorktown Heights, New York, 10598, USA
Lecture notes in computer scienceSpringer Science+Business Media2001-01-01 51 citations18 references
Looking for the full paper…
Papers open inside SciRah from the original publisher or repository; SciRah never hosts them.
Abstract
No abstract is available from our sources. Use “Read paper” to view it.
TL;DRIt is proved that, if computing residuosity classes is hard, then given a random w it is impossible to predict the least significant bit of its class significantly better than at random, which immediately yields a way to obtain semantic security without relying on the decisional assumption. (Semantic Scholar)