Public-Key Cryptosystems Based on Composite Degree Residuosity Classes

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.

[1]  Whitfield Diffie,et al.  New Directions in Cryptography , 1976, IEEE Trans. Inf. Theory.

[2]  Robert J. McEliece,et al.  A public key cryptosystem based on algebraic coding theory , 1978 .

[3]  Adi Shamir,et al.  A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.

[4]  Martin E. Hellman,et al.  Hiding information and signatures in trapdoor knapsacks , 1978, IEEE Trans. Inf. Theory.

[5]  Hugh C. Williams,et al.  Some Public Key Crypto-Functions as Intractable as Factorization , 1985, CRYPTO.

[6]  T. Elgamal.  A public key cryptosystem and a signature scheme based on discrete logarithms , 1984, CRYPTO 1984.

[7]  Josh Benaloh.  Verifiable secret-ballot elections , 1987 .

[8]  Hideki Imai,et al.  Public Quadratic Polynominal-Tuples for Efficient Signature-Verification and Message-Encryption , 1988, EUROCRYPT.

[9]  Joan Feigenbaum,et al.  Locally Random Reductions in Interactive Complexity Theory , 1990, Advances In Computational Complexity Theory.

[10]  Saad M. KALlPHA,et al.  New public-key cryptosystem , 1990 .

[11]  Tatsuaki Okamoto,et al.  New Public-Key Schemes Based on Elliptic Curves over the Ring Zn , 1991, CRYPTO.

[12]  Dongho Won,et al.  A Generalization of Public Key Residue Cryptosystem , 1993 .

[13]  Mihir Bellare,et al.  Random oracles are practical: a paradigm for designing efficient protocols , 1993, CCS '93.

[14]  A. Salomaa,et al.  Chinese remainder theorem: applications in computing, coding, cryptography , 1996 .

[15]  C. Ding.  Chinese remainder theorem , 1996 .

[16]  U. Maurer,et al.  On the complexity of breaking the Diffie-Hellman protocol , 1996 .

[17]  E. Okamoto,et al.  Faster factoring of integers of a special form , 1996 .

[18]  Louis Goubin,et al.  Trapdoor one-way permutations and multivariate polynominals , 1997, ICICS.

[19]  Ronald Cramer,et al.  A Secure and Optimally Efficient Multi-Authority Election Scheme ( 1 ) , 2000 .

[20]  Jacques Stern,et al.  A New Public-Key Cryptosystem , 1997, EUROCRYPT.

[21]  Scott A. Vanstone,et al.  Elliptic curve cryptosystems using curves of smooth order over the ring Zn , 1997, IEEE Trans. Inf. Theory.

[22]  Tatsuaki Okamoto,et al.  A New Public-Key Cryptosystem as Secure as Factoring , 1998, EUROCRYPT.

[23]  Christian F. Tschudin,et al.  On Software Protection via Function Hiding , 1998, Information Hiding.

[24]  Jacques Stern,et al.  Cryptanalysis of the Ajtai-Dwork Cryptosystem , 1998, CRYPTO.

[25]  Jacques Stern,et al.  A new public key cryptosystem based on higher residues , 1998, CCS '98.

[26]  Jennifer Seberry,et al.  Public Key Cryptography , 2000, Lecture Notes in Computer Science.