Pascal Paillier  Home/Search
Context Related
| gemplus.com/smart/r_d/pub...Pai99pai.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: gemplus.com/smart/r_d/pub...index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This paper investigates a novel computational problem, namely the Composite Residuosity Class Problem, and its applications to public-key cryptography. We propose a new trapdoor mechanism and derive from this technique three encryption schemes: a trapdoor permutation and two homomorphic probabilistic encryption schemes computationally comparable to RSA. Our cryptosystems, based on usual modular arithmetics, are provably secure under appropriate assumptions in the standard model. (Update)
Cited by: More
A Latency-Free Election Scheme - Gjøsteen (2006) (Correct)
A Generic Construction of CCA-Secure Cryptosystems without .. - Goichiro Hanaoka And (Correct)
Invisible Designated Confirmer Signatures without Random Oracles - Wei (2006) (Correct)
Active bibliography (related documents): More All
1.5: Public-Key Cryptosystems Based on Composite - Degree Residuosity Classes (Correct)
1.5: Public-Key Cryptosystems Based on Composite Degree Residuosity.. - Paillier (1999) (Correct)
0.3: EPOC: Efficient Probabilistic Public-Key Encryption - Fujisaki, Kobayashi.. (Correct)
Similar documents based on text: More All
0.3: Efficiency and Security of Cryptosystems Based on Number Theory - Bleichenbacher (1996) (Correct)
0.3: Efficiency and Security of Cryptosystems based on Number Theory - Bleichenbacher (1996) (Correct)
0.3: Paillier's Trapdoor Function Hides up to O(n) bits - Catalano, Gennaro.. (2002) (Correct)
Related documents from co-citation: More All
28: A New Public Key Cryptosystem as Secure as Factoring (context) - Okamoto, Uchiyama - 1998
26: Random Oracles are Practical: a Paradigm for Designing Efficient Protocols - Bellare, Rogaway - 1993
23: Journal of Computer and System Sciences (context) - Goldwasser, Micali - 1984
BibTeX entry: (Update)
P. Paillier. Public-Key Cryptosystems Based on Composite Degree Residuosity Classes. In Eurocrypt '99, LNCS 1592, pages 223--238. Springer-Verlag, 1999. http://citeseer.ist.psu.edu/paillier99publickey.html More
@article{ paillier99publickey,
author = "Pascal Paillier",
title = "Public-Key Cryptosystems Based on Composite Degree Residuosity Classes",
journal = "Lecture Notes in Computer Science",
volume = "1592",
pages = "223--??",
year = "1999",
url = "citeseer.ist.psu.edu/paillier99publickey.html" }
Citations (may not include all citations):1529 A Method for Obtaining Digital Signatures and Public-Key Cry.. - Rivest, Shamir et al. - 1978
659 Random Oracles are Practical: a Paradigm for Designing E#cie.. - Bellare, Rogaway - 1993
428 IEEE Transaction on Information Theory (context) - Di and, Hellman et al. - 1995
278 Probabilistic Encryption (context) - Goldwasser, Micali - 1984
109 A New Public-Key Cryptosystem as secure as Factoring (context) - Okamoto, Uchiyama - 1998
70 Hiding Information and Signatures in Trapdoor Knapsacks (context) - Merkle, Hellman - 1978
63 A Public-Key Cryptosystem Based on Algebraic Coding Theory (context) - McEliece - 1978
54 New Public-Key Schemes based on Elliptic Curves over the rin.. - Koyama, Maurer et al. - 1992
53 Verifiable Secret-Ballot Elections (context) - Benaloh - 1988
48 A Key Distribution System Equivalent to Factoring (context) - McCurley - 1988
42 A Secure And Optimally E#- cient Multi-Authority Election Sc.. - Cramer, Gennaro et al. - 1997
33 A New Public-Key Cryptosystem Based on Higher Residues - Naccache, Stern - 1998
26 Faster Factoring of Integers of a Special Form - Peralta, Okamoto - 1996
26 A New Public-Key Cryptosystem - Naccache, Stern - 1997
25 On Software Protection Via Function Hiding - Sander, Tschudin - 1998
22 Locally Random Reductions in Interactive Complexity Theory - Feigenbaum - 1993
20 Trapdoor One-Way Permutations and Multivariate Polynomials - Patarin, Goubin - 1997
19 Provable Security of Cryptosystems: A Survey (context) - Angluin, Lichtenstein - 1983
18 Cryptanalysis of the Ajtai-Dwork Cryptosystem - N'Guyen, Stern - 1998
18 Public-Key Cryptography (context) - Salomaa - 1990
18 Public Quadratic Polynomial-Tuples for E#cient Signature-Ver.. (context) - Matsumoto, Imai - 1988
17 Some Public-Key Crypto-Functions as Intractable as Factoriza.. (context) - Williams - 1985
17 Elliptic Curve Cryptosystem Using Curves of Smooth Order Ove.. (context) - Vanstone, Zuccherato - 1997
16 Chinese Remainder Theorem - Applications in Computing (context) - Ding, Pei et al. - 1996
13 Digital Signatures and Public-Key Encryptions as Intractable.. (context) - Rabin - 1979
13 Cryptanalysis of the Chor-Rivest Cryptosystem (context) - Vaudenay - 1998
11 A Generalization of Public-Key Residue Cryptosystem (context) - Park, Won - 1993
8 presented at the Dagstuhl Workshop on Cryptography (context) - Patarin, Oil et al. - 1997
5 A Public-Key Cryptosystem an a Signature Scheme Based on Dis.. (context) - ElGamal - 1985
5 the Complexity of Breaking the Di#e-Hellman Protocol (context) - Maurer, Wolf
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.gemplus.com/smart/r_d/publications/index.html): More
Formal Implementation of a Verification Algorithm using the B.. - Casset (2001) (Correct)
Formal Development of an Embedded Verifier for Java Card.. - Casset, Burdy, Requet (2002) (Correct)
Construction Correcte de Logiciels pour Carte a Puce - Casset (2002) (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