Public-key Cryptosystems Based on Composite Degree Residuosity Classes. Paillier, P. 1999.
Public-key Cryptosystems Based on Composite Degree Residuosity Classes [link]Paper  abstract   bibtex   
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.
@conference {1999,
	title = {Public-key Cryptosystems Based on Composite Degree Residuosity Classes},
	booktitle = {Proceedings of the 17th International Conference on Theory and Application of Cryptographic Techniques},
	year = {1999},
	publisher = {Springer-Verlag},
	organization = {Springer-Verlag},
	address = {Berlin, Heidelberg},
	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.},
	isbn = {3-540-65889-0},
	url = {http://dl.acm.org/citation.cfm?id=1756123.1756146},
	author = {Paillier, Pascal}
}

Downloads: 0