See this document in CiteSeerX!

Paillier's Trapdoor Function Hides up to O(n) bits (2002)  (Make Corrections)  (1 citation)
Dario Catalano, Rosario Gennaro, Nick Howgrave-Graham



  Home/Search   Context   Related

 
View or download:
ibm.com/security/paibits.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  ibm.com/security/publ (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: At EuroCrypt'99 Paillier proposed a new encryption scheme based on higher residuosity classes. The new scheme was proven to be one-way under the assumption that computing N-residuosity classes in Z 2 is hard. Similarly the scheme can be proven to be semantically secure under a much stronger decisional assumption: given w 2 Z 2 it is impossible to decide if w is an N-residue or not. (Update)

Cited by:   More
Single Database Private Information Retrieval with Logarithmic.. - Chang (2004)   (Correct)

Active bibliography (related documents):   More   All
0.3:   Pseudorandom Function Tribe Ensembles Based on One-Way.. - Fischlin (1999)   (Correct)
0.3:   An Improved Pseudo-Random Generator Based on the Discrete.. - Gennaro (2000)   (Correct)
0.2:   New Semantically Secure Public-Key Cryptosystems from the.. - Sakurai, Takagi (2001)   (Correct)

Similar documents based on text:   More   All
0.6:   Paillier's Cryptosystem Revisited - Dario Catalano Rosario   (Correct)
0.5:   The Hardness of Hensel Lifting: The Case of RSA and.. - Catalano, Nguyen, Stern (2002)   (Correct)
0.4:   Computing Inverses Over a Shared Secret Modulus - Catalano, Gennaro, Halevi (2000)   (Correct)

BibTeX entry:   (Update)

D. Catalano, R. Gennaro, and N. H.-Graham, "Paillier's trapdoor function hides up to O(n) bits," Journal of Cryptology, 15(4): pp. 251--269, 2002. http://citeseer.ist.psu.edu/catalano02pailliers.html   More

@misc{ catalano02pailliers,
  author = "D. Catalano and R. Gennaro and N. -Graham",
  title = "Paillier's trapdoor function hides up to O(n) bits",
  text = "D. Catalano, R. Gennaro, and N. H.-Graham, Paillier's trapdoor function
    hides up to O(n) bits, Journal of Cryptology, 15(4): pp. 251--269, 2002.",
  year = "2002",
  url = "citeseer.ist.psu.edu/catalano02pailliers.html" }
Citations (may not include all citations):
1529   A Method for Obtaining Digital Signature and Public Key Cryp.. - Rivest, Shamir et al. - 1978
339   Theory and Applications of Trapdoor Functions (context) - Yao - 1982
334   How to Generate Cryptographically Strong Sequences of Pseudo.. (context) - Blum, Micali - 1984
278   Probabilistic Encryption (context) - Goldwasser, Micali - 1984
162   Public-Key Cryptosystems Based on Composite Degree Residuosi.. - Paillier - 1997
109   A New Public-Key Cryptosystem as Secure as Factoring In Adva.. (context) - Okamoto, Uchiyama - 1997
63   An efficient probabilistic public-key encryption scheme whic.. (context) - Blum, Goldwasser
62   RSA and Rabin Functions: Certain Parts are as Hard as the Wh.. (context) - Alexi, Chor et al. - 1988
53   Verifiable Secret-Ballot Elections (context) - Benaloh - 1988
32   Lecture notes in Cryptography - Goldwasser, Bellare
24   The Discrete Logarithm Modulo a Composite Hides O (context) - Hastad, Schrift et al. - 1993
23   Stronger Security Proofs for RSA and Rabin Bits (context) - Fischlin, Schnorr - 2000
22   Paillier's Cryptosystem Revisited - Catalano, Gennaro et al. - 2001
13   Digital Signatures and Public Key Encryptions as Intractable.. (context) - Rabin - 1979
9   The Bit Security of Paillier's Encryption Scheme and its App.. (context) - Catalano, Gennaro et al. - 2045
5   An Efficient Discrete Log Pseudo Random Generator (context) - Patel, Sundaram - 1998
3   Levin A hard-core predicate for all one-way functions (context) - Goldreich - 1989

Documents on the same site (http://www.research.ibm.com/security/publ.html):   More
Securing Threshold Cryptosystems against Chosen Ciphertext Attack - Shoup, Gennaro (1999)   (Correct)
UMAC: Fast and Secure Message Authentication - Black, Halevi, Krawczyk.. (1999)   (Correct)
Efficient Commitment Schemes with Bounded Sender and Unbounded.. - Halevi (1996)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC