The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
A Generalisation, a Simplification and Some Applications of Paillier's Probabilistic Public-Key System
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
Paillier, P. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48910-x_16 · Cited by 7,250
Practical Threshold Signatures
Shoup, V. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-45539-6_15 · Cited by 874
A secure and optimally efficient multi‐authority election scheme
Cramer, R., Gennaro, R., & Schoenmakers, B. (1997) · European Transactions on Telecommunications · doi:10.1002/ett.4460080506 · Cited by 784
Efficient Receipt-Free Voting Based on Homomorphic Encryption
Hirt, M., & Sako, K. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-45539-6_38 · Cited by 483
A Secure and Optimally Efficient Multi-Authority Election Scheme
Cramer, R., Gennaro, R., & Schoenmakers, B. (1997) · Lecture Notes in Computer Science · doi:10.1007/3-540-69053-0_9 · Cited by 357
Sharing Decryption in the Context of Voting or Lotteries
Fouque, P.-A., Poupard, G., & Stern, J. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45472-1_7 · Cited by 312
Practical multi-candidate election system
Baudron, O., Fouque, P.-A., Pointcheval, D., Stern, J., & Poupard, G. (2001) · Proceedings of the twentieth annual ACM symposium on Principles of distributed computing · doi:10.1145/383962.384044 · Cited by 301
Non-cryptographic fault-tolerant computing in constant number of rounds of interaction
Bar-Ilan, J., & Beaver, D. (1989) · Proceedings of the eighth annual ACM Symposium on Principles of distributed computing - PODC '89 · doi:10.1145/72981.72995 · Cited by 266
Efficient Multiparty Computations Secure Against an Adaptive Adversary
Cramer, R., Damgård, I., Dziembowski, S., Hirt, M., & Rabin, T. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48910-x_22 · Cited by 220
Self-citationRobust efficient distributed RSA-key generation
Frankel, Y., MACKENZIE, P. D., & Yung, M. M. (1998) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/276698.276882 · Cited by 131
Cited by
Evaluating 2-DNF Formulas on Ciphertexts
Boneh, D., Goh, E.-J., & Nissim, K. (2005) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30576-7_18 · Cited by 1,692
A Survey on Homomorphic Encryption Schemes: Theory and Implementation
Acar, A., Aksu, H., Uluagac, A. S., & Conti, M. (2019) · ACM Computing Surveys · doi:10.1145/3214303 · Cited by 1,397
Efficient Private Matching and Set Intersection
Freedman, M. J., Nissim, K., & Pinkas, B. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24676-3_1 · Cited by 1,266
A Hybrid Approach to Privacy-Preserving Federated Learning
Truex, S., Baracaldo, N., Anwar, A., Steinke, T., Ludwig, H., Zhang, R., & Zhou, Y. (2019) · Proceedings of the 12th ACM Workshop on Artificial Intelligence and Security · doi:10.1145/3338501.3357370 · Cited by 1,029
ABY - A Framework for Efficient Mixed-Protocol Secure Two-Party Computation
Demmler, D., Schneider, T., & Zohner, M. (2015) · Proceedings 2015 Network and Distributed System Security Symposium · doi:10.14722/ndss.2015.23113 · Cited by 827
Metadata
- Authors
- Damgård, I., & Jurik, M.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2001
- Pages
- 119-136
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1544327602
- Cited by
- 1,063
- References
- 10
- FWCI
- 12.06
- Type
- conference paper
- Language
- en
- Open access
- closed
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
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.