Skip to main content

Paillier Encryption and Signature Schemes

  • Reference work entry
Encyclopedia of Cryptography and Security
  • 364 Accesses

In the spirit of earlier encryption schemes suggested by Goldwasser–Micali, Benaloh, Naccache–Stern, and Okamoto–Uchiyama, Paillier proposed in 1999 a public-key cryptosystem [4] (see publickey cryptograhy) based on the properties of nth powers modulo n2 where n is an RSA modulus (see modular arithmetic and RSA public key encryption). The original observation is that the function ε(x, y)=g x y n mod n 2 is a one-way trapdoor permutation (see trapdoor one-way function) over the group \(\mathbb{Z}_n\times\mathbb{Z}^{\ast}_n\simeq \mathbb{Z}^{\ast}_{n^2}\) where the trapdoor information is the factorization of n. The group \(\mathbb{Z}^{\ast}_{n^2}\) is of order nϕ where \(\phi = \phi(n)\) is Euler's totient function of n and the base \(g\in\mathbb{Z}^{\ast}_{n^2}\) is an element of order α · n for some divisor α of ϕ (for instance n + 1 for which α = 1). Noting \(L(u)=(u-1)/n\) when u = 1 mod n, x is recovered from \(w = \mathcal{E}(x, y)\) as \(x = L(w^ \phi \bmod{n^2}) /L(g^ \phi...

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

References

  1. Catalano, Dario, Rosario Gennaro, and Nick Howgrave-Grahlam (2001). “The bit security of paillier's encryption schemes and its applications.” Advances in Cryptology—EUROCRYPT 2001, Lecutre Notes in Computer Science, vol. 2045, ed. B. Pfitzmann, Springer-Verlag, Berlin, 229–243.

    Google Scholar 

  2. Catalano, Dario, Rosario Gennaro, Nick Howgrave-Graham, and Phong Q. Nguyen (2001). “Paillier's cryptosystem revisited.” Proceedings of the 8th ACM conference on Computer and Communications Security ACM Press, New York, 206–214.

    Google Scholar 

  3. Galbraith, Steven D. (2002). “Elliptic curve paillier schemes.” Journal of Cryptology, 15 (2), 129–138.

    MATH  MathSciNet  Google Scholar 

  4. Paillier, Pascal (1999). “Public-key cryptosystems based on composite-degree residuosity classes.” Advances in Cryptology—EUROCRYPT'99, Lecture Notes in Computer Science, vol. 1592, ed. J. Stern. Springer-Verlag, Berlin, 223–238.

    Google Scholar 

  5. Damgård, Ivan and Mads Jurik (2001). “A generalization, a simplification and some applications of paillier's probabilistic public-key system.” Public Key Cryptography—PKC 2001, Lecture Notes in Computer Science, vol. 1992, ed. K. Kim. Springer-Verlag, Berlin, 119–136.

    Google Scholar 

Download references

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 International Federation for Information Processing

About this entry

Cite this entry

Paillier, P. (2005). Paillier Encryption and Signature Schemes. In: van Tilborg, H.C.A. (eds) Encyclopedia of Cryptography and Security. Springer, Boston, MA . https://doi.org/10.1007/0-387-23483-7_293

Download citation

Publish with us

Policies and ethics