Public-Key Cryptosystems Based on Composite Degree Residuosity Classes

Pascal Paillier

doi:https://doi.org/10.1007/3-540-48910-x_16

Public-Key Cryptosystems Based on Composite Degree Residuosity Classes

2007 · Lecture notes in computer science · 7,277 citations · 5 from inside this corpus

No abstract in the source record.

10 of 10 neighbouring works in this corpus. Blue is what this paper cites; orange is what cites it, and a dashed line is one neighbour citing another. Only the largest labels are drawn — every node carries its full title on hover.

this paper works it cites works citing it node size = global citations · hover for the full title

Citation edge evidence

Each row is directed from the citing work to the cited work. Source status remains readable without the interactive graph.

Fully homomorphic encryption using ideal lattices→Public-Key Cryptosystems Based on Composite Degree Residuosity ClassesLegacy edge — source detail unavailable
SecureML: A System for Scalable Privacy-Preserving Machine Learning→Public-Key Cryptosystems Based on Composite Degree Residuosity ClassesLegacy edge — source detail unavailable
Evaluating 2-DNF Formulas on Ciphertexts→Public-Key Cryptosystems Based on Composite Degree Residuosity ClassesLegacy edge — source detail unavailable
Privacy-Preserving Deep Learning via Additively Homomorphic Encryption→Public-Key Cryptosystems Based on Composite Degree Residuosity ClassesLegacy edge — source detail unavailable
Efficient Fully Homomorphic Encryption from (Standard) LWE→Public-Key Cryptosystems Based on Composite Degree Residuosity ClassesLegacy edge — source detail unavailable
Public-Key Cryptosystems Based on Composite Degree Residuosity Classes→A method for obtaining digital signatures and public-key cryptosystemsLegacy edge — source detail unavailable
Public-Key Cryptosystems Based on Composite Degree Residuosity Classes→A method for obtaining digital signatures and public-key cryptosystemsLegacy edge — source detail unavailable
Public-Key Cryptosystems Based on Composite Degree Residuosity Classes→A public key cryptosystem and a signature scheme based on discrete logarithmsLegacy edge — source detail unavailable
Public-Key Cryptosystems Based on Composite Degree Residuosity Classes→Random oracles are practicalLegacy edge — source detail unavailable
Public-Key Cryptosystems Based on Composite Degree Residuosity Classes→A Public-Key Cryptosystem Based On Algebraic Coding TheoryLegacy edge — source detail unavailable
Evaluating 2-DNF Formulas on Ciphertexts→A public key cryptosystem and a signature scheme based on discrete logarithmsLegacy edge — source detail unavailable
Efficient Fully Homomorphic Encryption from (Standard) LWE→Evaluating 2-DNF Formulas on CiphertextsLegacy edge — source detail unavailable
Efficient Fully Homomorphic Encryption from (Standard) LWE→Fully homomorphic encryption using ideal latticesLegacy edge — source detail unavailable
Fully homomorphic encryption using ideal lattices→Evaluating 2-DNF Formulas on CiphertextsLegacy edge — source detail unavailable
Fully homomorphic encryption using ideal lattices→A method for obtaining digital signatures and public-key cryptosystemsLegacy edge — source detail unavailable
Fully homomorphic encryption using ideal lattices→A public key cryptosystem and a signature scheme based on discrete logarithmsLegacy edge — source detail unavailable
Fully homomorphic encryption using ideal lattices→A method for obtaining digital signatures and public-key cryptosystemsLegacy edge — source detail unavailable
Random oracles are practical→A method for obtaining digital signatures and public-key cryptosystemsLegacy edge — source detail unavailable
Random oracles are practical→A method for obtaining digital signatures and public-key cryptosystemsLegacy edge — source detail unavailable
A public key cryptosystem and a signature scheme based on discrete logarithms→A method for obtaining digital signatures and public-key cryptosystemsLegacy edge — source detail unavailable
A public key cryptosystem and a signature scheme based on discrete logarithms→A method for obtaining digital signatures and public-key cryptosystemsLegacy edge — source detail unavailable
Privacy-Preserving Deep Learning via Additively Homomorphic Encryption→SecureML: A System for Scalable Privacy-Preserving Machine LearningLegacy edge — source detail unavailable

What this paper cites, inside the corpus

Paper	Year	Cited
A method for obtaining digital signatures and public-key cryptosystems	1978	13,242
A method for obtaining digital signatures and public-key cryptosystems	1983	13,151
A public key cryptosystem and a signature scheme based on discrete logarithms	1985	8,086
Random oracles are practical	1993	4,733
A Public-Key Cryptosystem Based On Algebraic Coding Theory	1978	1,555

What cites it, inside the corpus

Paper	Year	Cited
Fully homomorphic encryption using ideal lattices	2009	6,701
SecureML: A System for Scalable Privacy-Preserving Machine Learning	2017	1,899
Evaluating 2-DNF Formulas on Ciphertexts	2005	1,696
Privacy-Preserving Deep Learning via Additively Homomorphic Encryption	2017	1,665
Efficient Fully Homomorphic Encryption from (Standard) LWE	2011	1,472

Links

Download BibTeX · Download RIS · DOI · OpenAlex record

Topics

Cryptography and Data Security	Computer Science
Coding theory and cryptography	Computer Science
Complexity and Algorithms in Graphs	Computer Science

Is this record sound?

complete

Nothing in this record contradicts itself and no field we check is missing.

supports1 author record(s) attached.
supports33 reference(s) recorded.
neutralThe DOI carries no year to check against.
supportsA title is present.

Provenance

Everything above was read from one stored OpenAlex payload, fetched 2026-09-04T03:58:43+00:00.

sha256 5cad55ac5d4d41e1…