The DOI matches its Crossref record; 18 of the 19 references it cites were found in a registry or an index.
Tools for privacy preserving distributed data mining
Abstract
Privacy preserving mining of distributed data has numerous applications. Each application poses different constraints: What is meant by privacy, what are the desired results, how is the data distributed, what are the constraints on collaboration and cooperative computing, etc. We suggest that the solution to this is a toolkit of components that can be combined for specific privacy-preserving data mining applications. This paper presents some components of such a toolkit, and shows how they can be used to solve several privacy-preserving data mining problems.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
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?
In the citing paper
“Clifton et al. [117] describe a toolkit for various privacypreserving SMC-based data mining operations including secure sum computation using a secret random number.”
From A Survey of Self-Sovereign Identity Ecosystem (2021) · cites this paper as [117]
In the citing paper
“However, in this protocol, two adjacent parties can collude to compute the random number.”
From A Survey of Self-Sovereign Identity Ecosystem (2021) · cites this paper as [117]
Citations
Cites
Fast algorithms for mining association rules
Agrawal, R., & Srikant, R. (1998) · Cited by 11,362
Fast Algorithms for Mining Association Rules in Large Databases
Agrawal, R., & Srikant, R. (1994) · Very Large Data Bases · Cited by 9,454
Goldreich, O., Micali, S., & Wigderson, A. (1987) · Proceedings of the nineteenth annual ACM conference on Theory of computing - STOC '87 · doi:10.1145/28395.28420 · Cited by 3,590
Privacy-preserving data mining
Agrawal, R., & Srikant, R. (2000) · ACM SIGMOD Record · doi:10.1145/335191.335438 · Cited by 3,009
How to generate and exchange secrets
Yao, A. (1986) · 27th Annual Symposium on Foundations of Computer Science (sfcs 1986) · doi:10.1109/sfcs.1986.25 · Cited by 2,281
Privacy-preserving data mining
Agrawal, R., & Srikant, R. (2000) · Proceedings of the 2000 ACM SIGMOD international conference on Management of data · doi:10.1145/342009.335438 · Cited by 1,719
Pohlig, S., & Hellman, M. (1978) · IEEE Transactions on Information Theory · doi:10.1109/tit.1978.1055817 · Cited by 1,199
Privacy Preserving Data Mining
Lindell, Y., & Pinkas, B. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-44598-6_3 · Cited by 1,077
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
Self-citationPrivacy-preserving distributed mining of association rules on horizontally partitioned data
Clifton, C., Kantarcioglu, M., Clifton, C., & Member, S. (2010) · Cited by 888
Self-citationAdvances in Cryptology — CRYPTO 2000
Bellare, M. (2000) · Lecture notes in computer science · doi:10.1007/3-540-44598-6 · Cited by 779
A fast distributed algorithm for mining association rules
Cheung, D. W.-L., Han, J., Ng, V., Fu, A. W.-C., & Fu, Y. (2002) · International Conference on Parallel and Distributed Information Systems · doi:10.1109/pdis.1996.568665 · Cited by 434
Cryptographic techniques for privacy-preserving data mining
Benny Pinkas, B. (2002) · ACM SIGKDD Explorations Newsletter · doi:10.1145/772862.772865 · Cited by 428
Secure Multi-party Computational Geometry
Atallah, M. J., & Du, W. K. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44634-6_16 · Cited by 237
Privacy-preserving cooperative scientific computations
Du, W. K., & Atallah, M. J. (2005) · IEEE Computer Security Foundations Workshop (CSFW) · doi:10.1109/csfw.2001.930152 · Cited by 165
Randomization in privacy preserving data mining
Evfimievski, A. (2002) · ACM SIGKDD Explorations Newsletter · doi:10.1145/772862.772869 · Cited by 164
Defining Privacy for Data Mining
Clifton, C., Kantarcıoğlu, M., & Vaidya, J. S. (2002) · Cited by 125
Self-citationA secure protocol for computing dot-products in clustered and distributed environments
Ioannidis, I., Grama, A. Y., & Atallah, M. J. (2003) · Proceedings of the International Conference on Parallel Processing · doi:10.1109/icpp.2002.1040894 · Cited by 118
Flagged first, then by citations
1 of the 19 references couldn’t be matched to a known paper.
Research works printed but not linked: 7
- 10.5555/645920.672836 · DOI
- 10.5555/645933.756665 · DOI
- 10.5555/382006.383194 · DOI
- A. Eisenberg . With false numbers, data crunchers try to mine the truth . New York Times , July 18 2002 .]] A. Eisenberg. With false numbers, data crunchers try to mine the truth. New York Times, July 18 2002.]]
- M. Hamblen . Privacy algorithms : Technology-based protections could make personal data impersonal . Computerworld , Oct. 14 2002 .]] M. Hamblen. Privacy algorithms: Technology-based protections could make personal data impersonal. Computerworld, Oct. 14 2002.]]
- 10.5555/850943.853036 · DOI
- B. Schneier. Applied Cryptography. John Wiley & Sons , 2 nd edition, 1995 .]] B. Schneier. Applied Cryptography. John Wiley & Sons, 2nd edition, 1995.]]
Cited by
Sorted by citations
L -diversity: Privacy beyond k -anonymity
Machanavajjhala, A., Kifer, D., Gehrke, J., & Venkitasubramaniam, M. (2007) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/1217299.1217302 · Cited by 3,617
L-diversity: privacy beyond k-anonymity
Machanavajjhala, A., Gehrke, J. E., Kifer, D., & Venkitasubramaniam, M. (2006) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde.2006.1 · Cited by 2,436
Privacy-preserving data publishing: A survey of recent developments
Fung, B. C. M., Wang, K., Chen, R., & Yu, P. S. (2010) · ACM Computing Surveys · doi:10.1145/1749603.1749605 · Cited by 1,704
Smooth sensitivity and sampling in private data analysis
Kobbi Nissim, B., Raskhodnikova, S., & Smith, A. (2007) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1250790.1250803 · Cited by 1,038
State-of-the-art in privacy preserving data mining
Verykios, V. S., Bertino, E., Fovino, I. N., Provenza, L. P., Saygın, Y., & Theodoridis, Y. (2004) · ACM SIGMOD Record · doi:10.1145/974121.974131 · Cited by 820
Metadata
- Authors
- Clifton, C., Kantarcioglu, M., Vaidya, J., Lin, X., & Zhu, M. Y.
- Affiliations
- Purdue University West Lafayette (US)
- Purdue University, West Lafayette, IN
- Venue
- ACM SIGKDD Explorations Newsletter
- Published
- 2002-12
- Volume
- 4
- Issue
- 2
- Pages
- 28-34
- ISSN
- 1931-0145 (ISSN-L)
- 1931-0153
- OpenAlex
- W2002352982
- Cited by
- 890
- References
- 19
- Citations by year
- 2026: 7 · 2025: 6 · 2024: 12 · 2023: 14 · 2022: 27 · 2021: 38 · 2020: 31 · 2019: 40 · 2018: 46 · 2017: 41 · 2016: 51 · 2015: 57 · 2014: 70 · 2013: 68 · 2012: 50
- FWCI
- 14.20
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- ACM SIGKDD Explorations Newsletter (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Privacy-Preserving Technologies in Data
- Physical Sciences › Computer Science › Computer Networks and Communications › Cryptography and Data Security
- Physical Sciences › Computer Science › Information Systems › Cloud Data Security Solutions
- Keywords
- privacy-preserving data mining, distributed data mining, privacy definitions, collaborative computing, privacy-preserving association rule mining, privacy-preserving clustering
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
