Privacy-preserving distributed association rule mining via semi-trusted mixer

Data and Knowledge Engineering

Volumn 63, Issue 2, 2007, Pages 550-567

  Yi, Xun ^a   Zhang, Yanchun ^a  

^a VICTORIA UNIVERSITY   (Australia)

Author keywords

Data security; Privacy preserving distributed data mining

Indexed keywords

DATA SITES; DISTRIBUTED ASSOCIATION RULE MINING PROTOCOLS; PRIVACY-PRESERVING DISTRIBUTED DATA MINING; SEMI-TRUSTED MIXER MODELS;

DATA MINING; DATA PRIVACY; DATA STRUCTURES; LOGIC PROGRAMMING; PARALLEL ALGORITHMS;

ASSOCIATION RULES;

EID: 34447285506     PISSN: 0169023X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.datak.2007.04.001     Document Type: Article

References (38)

1. D. Struck, Don't store my data, Japanese tell government, in: International Herald Tribune, 25 Aug. 2002.
2. Vaidya J., and Clifton C. Privacy-preserving data mining: why, how and when. IEEE Security and Privacy 2 6 (2004) 19-27
3. Kargupta H., and Chan P. Advances in Distributed and Parallel Knowledge Discovery (2000), MIT/AAAI Press
4. Sweeney L. K-anonymity: a model for protecting privacy, International Journal on Uncertainty. Fuzziness and Knowledge-based Systems 10 5 (2002) 557-570
5. R. Agrawal, R. Srikant, Privacy-preserving data mining, in: Proceedings of ACM SIGMOD International Conference on Management of Data, 2000, pp. 439-450.
6. Lindell Y., and Pinkas B. Privacy preserving data mining. Journal of Cryptology 15 3 (2002) 177-206
7. Evfimievski A., Ramakrishnan S., Agrawal R., and Gehrke J. Privacy-preserving mining of association rules. Proc. 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (2002), ACM Press 217-228
8. Kantarcioglu M., and Clifton C. Privacy-preserving distributed mining of association rules on horizontally partitioned data. IEEE Trans. Knowledge and Data Engineering 16 9 (2004) 1026-1037
9. Vaidya J., and Clifton C. Privacy-preserving association rule mining in vertically partitioned data. Proc. 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (2002), ACM Press 639-644
10. Verykios V.S., Elmagarmid A.K., Bertino E., Saygin Y., and Dasseni E. Association rule hiding. IEEE Trans. on Knowledge and Data Engineering 16 4 (2004) 434-447
11. Rizvi S.J., and Haritsa J.R. Maintaining data privacy in association rule mining. Proc. 28th Int'l Conf. Very Large Data Bases (2002) 682-693
12. Clifton C., Kantarcioglou M., Lin X., and Zhu M.Y. Tools for privacy preserving distributed data mining. SIGKDD Exploration 4 2 (2002) 1-7
13. Vaidya J., and Clifton C. Privacy-preserving k-means clustering over vertically partitioned data. Proc. 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (2003), ACM Press 206-215
14. M. Kantarcioglu, J. Vaidya, Privacy-preserving naive Bayes classifier for horizontally partitioned data, in: Proc. IEEE Workshop on Privacy Preserving Data Mining, 2003, pp. 3-9.
15. J. Vaidya, C. Clifton, Privacy preserving naive Bayes classifier on vertically partitioned data, in: Proc. 2004 SIAM International Conference on Data Mining, 2004.
16. R. Wright, Z. Yang, Privacy-preserving Baysian network structure computation on distributed heterogeneous data, in: Proc. KDD'04, 2004, pp. 713-718.
17. Z. Yang, S. Zhong, R. Wright, Privacy-preserving classification of customer data without loss of accuracy, in: 5th SIAM International Conference on Data Mining, 2005.
18. H. Kargupta, S. Datta, Q. Wang, K. Sivakumar, On the privacy preserving properties of random data perturbation techniques, in: Proc. 3rd Int'l Conf. on Data Mining, 2003, 99-106.
19. A.C. Yao, How to generate and exchange secrets, in: Proc. 27th IEEE Symposium on Foundations of Computer Science, 1986, pp. 162-167.
20. O. Goldreich, S. Micali, A. Wigderson, How to play any mental game - a completeness theorem for protocols with honest majority, in: Proc. 19th ACM Symposium on the Theory of Computing, 1987, pp. 218-229.
21. D. Chaum, C. Crepeau, I. Damgard, Multiparty unconditionally secure protocols, in: Proc. 20th ACM Symposium on the Theory of Computing, 1988, pp. 11-19.
22. D.W.-L. Cheung, J. Han, V. Ng, A.W.-C. Fu, Y. Fu, A fast distributed algorithm for mining association rules, in: Proc. 1996 Int'l Conf. Parallel and Distributed Information Systems (PDIS'96), 1996, pp. 31-42.
23. J.C. Benaloh, Secret sharing homomorphisms: Keeping shares of a secret, in: Proc. Crypto'86, 1986 pp. 251-260.
24. Chor B., and Kushilevitz E. A communication-privacy tradeoff for modular addition. Information Processing Letters 45 4 (1993) 205-210
25. ElGamal T. A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans. Inform. Theory IT-31 (1985) 469-472
26. R. Agrawal, R. Srikant, Fast algorithms for mining association rules, in: Proc. 20th Int'l Conf. Very Large Data Bases, 1994, pp. 487-499.
27. Han J., and Kamber M. Data Mining: Concepts and Techniques (2000), Morgan Kaufmann
28. P. Paillier, Public-key cryptosystems based on composite degree residuosity classes, in: Proc. Eurocrypt'99, 1999, pp. 223-238.
29. Lenstra A.K. Integer factoring, Design, Code and Cryptography 19 2/3 (2000) 101-128
30. M.K. Franklin, M.K. Reiter, Fair exchange with a semi-trusted party, in: Proc. CCS'97, 1997.
31. Yi X. Identity-based fault-tolerant conference key agreement. IEEE Trans. Dependable and Secure Computing 1 3 (2004) 170-178
32. NBS FIPS PUB 46, Data Encryption Standard (National Bureau of Standards, US Department of ommerce, 1977).
33. FIPS PUB 197, Advanced Encryption Standard (Federal Information Processing Standards Publications, US Department of Commerce/N.I.S.T., National Technical Information Service, 2001).
34. Tzeng W.G. A secure fault-tolerant conference key agreement protocol. IEEE Trans. Computers 51 4 (2002) 373-379
35. Pohlig S.C., and Hellman M.E. An improved algorithm for computing logarithm over GF(p) and its cryptographic significance. IEEE Trans. Information Theory IT-24 (1978) 106-110
36. Agrawal R., and Shafer J.C. Parallel mining of association rules. IEEE Trans. Knowledge and Data Engineering 8 6 (1996) 962-969
37. H. Lipmaa, AES candidates, A survey of implementation .
38. M. Scott, Comparison of methods for modular exponentiation on 32-bit Intel 80x86 processors .