@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}
}

{"_id":"5mhijP8kLQMynQr3L","bibbaseid":"paillier-publickeycryptosystemsbasedoncompositedegreeresiduosityclasses-1999","downloads":0,"creationDate":"2016-04-30T08:54:38.222Z","title":"Public-key Cryptosystems Based on Composite Degree Residuosity Classes","author_short":["Paillier, P."],"year":1999,"bibtype":"conference","biburl":"https://gnunet.org/bibliography/export/bibtex","bibdata":{"bibtype":"conference","type":"conference","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":[{"propositions":[],"lastnames":["Paillier"],"firstnames":["Pascal"],"suffixes":[]}],"bibtex":"@conference {1999,\n\ttitle = {Public-key Cryptosystems Based on Composite Degree Residuosity Classes},\n\tbooktitle = {Proceedings of the 17th International Conference on Theory and Application of Cryptographic Techniques},\n\tyear = {1999},\n\tpublisher = {Springer-Verlag},\n\torganization = {Springer-Verlag},\n\taddress = {Berlin, Heidelberg},\n\tabstract = {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.},\n\tisbn = {3-540-65889-0},\n\turl = {http://dl.acm.org/citation.cfm?id=1756123.1756146},\n\tauthor = {Paillier, Pascal}\n}\n","author_short":["Paillier, P."],"key":"1999","id":"1999","bibbaseid":"paillier-publickeycryptosystemsbasedoncompositedegreeresiduosityclasses-1999","role":"author","urls":{"Paper":"http://dl.acm.org/citation.cfm?id=1756123.1756146"},"downloads":0},"search_terms":["public","key","cryptosystems","based","composite","degree","residuosity","classes","paillier"],"keywords":[],"authorIDs":[],"dataSources":["FWsPTwsmjtrBtRS3B"]}