Cited by 7,250Cryptography and Data SecurityCryptography and Residue ArithmeticCoding theory and cryptography

Public-Key Cryptosystems Based on Composite Degree Residuosity Classes

Paillier, Pascal·2007·Lecture Notes in Computer Science

Integrity signals

Registry

Crossref · 10.1007/3-540-48910-x_16

Cites

32 of 32 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Poisoning attacks can be broadly classified into untargeted poisoning attacks and targeted poisoning attacks.

    “Depending on the attacker's objective, poisoning attacks can be broadly classified into two categories: 1) untargeted poisoning attacks [123], [124], [125], [70], [67]; and 2) targeted poisoning attacks [126], [127], [35], [36], [128], [129], [130], [131].”

Cites

Flagged first, then by citations

1 of the 33 references couldn’t be matched to a known paper.

Cited by

Sorted by citations

Authors
Paillier, P.
Affiliations
Télécom Paris (FR)
Corresponding author
Paillier, Pascal
Venue
Lecture Notes in Computer Science
Published
2007-10-10
Pages
223-238
OpenAlex
W2132172731
Cited by
7,250
References
33
Citations by year
2026: 199 · 2025: 370 · 2024: 434 · 2023: 429 · 2022: 445 · 2021: 493 · 2020: 476 · 2019: 469 · 2018: 493 · 2017: 447 · 2016: 398 · 2015: 363 · 2014: 336 · 2013: 344 · 2012: 263
FWCI
147.26
Type
conference paper
Language
en
Open access
closed
Locations
Springer eBooks (publishedVersion)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Cryptography and Data Security
  • Physical Sciences › Computer Science › Information Systems › Cryptography and Residue Arithmetic
  • Physical Sciences › Computer Science › Artificial Intelligence › Coding theory and cryptography
Keywords
public-key cryptography, trapdoor permutations, homomorphic encryption, probabilistic encryption, modular arithmetic, standard model security

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review