The DOI matches its Crossref record; 29 of the 29 references it cites were found in a registry or an index.
On Private Scalar Product Computation for Privacy-Preserving Data Mining
Open accessOverview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Lecture Notes in Computer Science 1205
(1999) · Industrial Robot: An International Journal · doi:10.1108/ir.1999.04926fae.001 · Cited by 38,662
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
Data mining and knowledge discovery: making sense out of data
Feyyad, U. M. (1996) · IEEE Expert · doi:10.1109/64.539013 · Cited by 4,612
Fast discovery of association rules
Agrawal, R., Mannila, H., Srikant, R., Toivonen, H. T. T., & Verkamo, A. I. (1996) · Knowledge Discovery and Data Mining · Cited by 2,376
Goldreich, O. (2001) · Cambridge University Press eBooks · doi:10.1017/cbo9780511546891 · Cited by 2,181
Goldreich, O. (2004) · Cambridge University Press eBooks · doi:10.1017/cbo9780511721656 · Cited by 1,805
Foundations of Cryptography: Volume 2, Basic Applications
Goldreich, O. (2004) · Cited by 1,592
Kiayias, A., Tsiounis, Y., & Yung, M. M. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-24676-3_34 · Cited by 1,267
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
Damgård, I., & Jurik, M. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44586-2_9 · Cited by 1,063
Privacy preserving association rule mining in vertically partitioned data
Vaidya, J., & Clifton, C. (2002) · Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/775047.775142 · Cited by 1,001
(2005) · Codes · doi:10.1201/9781420035087-10 · Cited by 913
Advances in Cryptology — EUROCRYPT ’99
(1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48910-x · Cited by 902
CLOSET : An Efficient Algorithm for Mining Frequent Closed Itemsets
Pei, J. (2000) · Cited by 824
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
(2022) · Lecture notes in computer science · doi:10.1007/978-3-031-07085-3 · Cited by 613
Advances in Cryptology — EUROCRYPT ’97
Fumy, W. (1997) · Lecture notes in computer science · doi:10.1007/3-540-69053-0 · Cited by 599
Cryptographic techniques for privacy-preserving data mining
Pinkas, B. (2002) · ACM SIGKDD Explorations Newsletter · doi:10.1145/772862.772865 · Cited by 430
Priced Oblivious Transfer: How to Sell Digital Goods
Aiello, B., Ishai, Y., & Reingold, O. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44987-6_8 · Cited by 400
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
Advances in Cryptology – ASIACRYPT 2020
Bullens, W., Katsumata, S., & Pintore, F. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-64834-3 · Cited by 318
Privacy-preserving cooperative statistical analysis
Du, W., & Atallah, M. J. (2005) · Seventeenth Annual Computer Security Applications Conference · doi:10.1109/acsac.2001.991526 · Cited by 279
Free-Sets: A Condensed Representation of Boolean Data for the Approximation of Frequency Queries
Boulicaut, J., Bykowski, A., & Rigotti, C. (2003) · Data Mining and Knowledge Discovery · doi:10.1023/a:1021571501451 · Cited by 267
Privacy-preserving Bayesian network structure computation on distributed heterogeneous data
Wright, R., & Yang, Z. (2004) · Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1014052.1014145 · Cited by 219
Secure Vickrey Auctions without Threshold Trust
Lipmaa, H., Asokan, N., & Niemi, V. (2003) · Lecture notes in computer science · doi:10.1007/3-540-36504-4_7 · Cited by 174
Self-citationOn Diophantine Complexity and Statistical Zero-Knowledge Arguments
Lipmaa, H. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-40061-5_26 · Cited by 162
Self-citationProtocols for Secure Remote Database Access with Approximate Matching
Du, W. K., & Atallah, M. J. (2001) · Advances in information security · doi:10.1007/978-1-4615-1467-1_6 · Cited by 140
A practical approach to solve Secure Multi-party Computation problems
Du, W. K., & Zhan, Z. (2002) · New Security Paradigms Workshop · doi:10.1145/844102.844125 · Cited by 137
Frequent Closures as a Concise Representation for Binary Data Mining
Boulicaut, J., & Bykowski, A. (2000) · Lecture notes in computer science · doi:10.1007/3-540-45571-x_9 · Cited by 87
Cited by
Machine Learning Classification over Encrypted Data
Bost, R., Popa, R. A., Tu, S., & Goldwasser, S. (2015) · Proceedings 2015 Network and Distributed System Security Symposium · doi:10.14722/ndss.2015.23241 · Cited by 674
Privacy-Preserving Face Recognition
Erkin, Z., Franz, M., Guajardo, J., Katzenbeisser, S., Lagendijk, I., & Toft, T. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-03168-7_14 · Cited by 583
Privacy-preserving distributed k-means clustering over arbitrarily partitioned data
Jagannathan, G., & Wright, R. N. (2005) · Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining · doi:10.1145/1081870.1081942 · Cited by 420
Lagendijk, R. L., & Barni, M. (2013) · IEEE Signal Processing Magazine · doi:10.1109/msp.2012.2219653 · Cited by 336
Privacy-Preserving Data Mining: Methods, Metrics, and Applications
Mendes, R., & Vilela, J. P. (2017) · IEEE Access · doi:10.1109/access.2017.2706947 · Cited by 294
Metadata
- Authors
- Goethals, B., Laur, S., Lipmaa, H., & Mielikäinen, T.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2005
- Pages
- 104-120
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1871114411
- Cited by
- 370
- References
- 29
- FWCI
- 19.79
- Type
- conference paper
- Language
- en
- Open access
- green
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.