Database Reference
In-Depth Information
13. D. Cheung, J. Han, V. Ng, A. Fu, and Y. Fu. A fast distributed algorithm for mining associa-
tion rules. In
Proceedings of the IEEE International Conference on Parallel and Distributed
Information Systems
, volume 1, pages 31-43, 1996.
14. C. Clifton and D. Marks. Security and privacy implications of data mining. In
ACM SIGMOD
Workshop on Research Issues on Data Mining and Knowledge Discovery
, pages 15-19, 1996.
15. E. Dasseni, V. Verykios, A. Elmagarmid, and E. Bertino. Hiding association rules by using
confidence and support. In
Proceedings of the 4th International Workshop on Information
Hiding
, IHW, pages 369-383, 2001.
16. D. Denning.
Cryptography and Data Security
. Addison-Wesley, 1982.
17. A. Evfimievski, J. Gehrke, and R. Srikant. Limiting privacy breaches in privacy preserving data
mining. In
Proceedings of the 22nd ACM SIGMOD-SIGACT-SIGART Symposium on Principles
of Database Systems
, PODS, pages 211-222, 2003.
18. A. Evfimievski, R. Srikant, R. Agrawal, and J. Gehrke. Privacy preserving mining of association
rules. In
Proceedings of the 2002 ACM SIGKDD Conference on Knowledge Discovery and Data
Mining
, KDD, pages 217-228, 2002.
19. C. Farkas and S. Jajodia. The inference problem: A survey.
ACM SIGKDD Explorations
,
4(2):6-11, Dec. 2002.
20. A. Gkoulalas-Divanis and G. Loukides. Revisiting sequential pattern hiding to enhance utility.
In
Proceedings of the 2011 ACM SIGKDD Conference on Knowledge Discovery and Data
Mining
, pages 1316-1324, 2011.
21. A. Gkoulalas-Divanis and V. Verykios. An integer programming approach for frequent item-
set hiding. In
Proceedings of the 15th ACM International Conference on Information and
Knowledge Management
, CIKM, pages 748-757, 2006.
22. A. Gkoulalas-Divanis and V. Verykios. Exact knowledge hiding through database extension.
IEEE Transactions on Knowledge and Data Engineering
, 21(5):699-713, 2009.
23. A. Gkoulalas-Divanis and V. Verykios. Hiding sensitive knowledge without side effects.
Knowledge and Information Systems
, 20(3):263-299, 2009.
24. O. Goldreich. Secure multi-party computation.
www.wisdom.weizmann.ac.il/
∼
oded/pp.html,
1998.
25. I. Ioannidis, A. Grama, and M. Atallah. A secure protocol for computing dot-products in
clustered and distributed environments. In
International Conference on Parallel Processing
,
pages 379-384, 2002.
26. M. Kantarcioglu and C. Clifton. Privacy-preserving distributed mining of association rules
on horizontally partitioned data.
IEEE Transactions on Knowledge and Data Engineering
,
16(9):1026-1037, Sept. 2004.
27. M. Kantarcioglu, R. Nix, and J. Vaidya. An efficient approximate protocol for privacy-
preserving association rule mining. In
PAKDD
, pages 515-524, 2009.
28. M. Kantarcioglu, W. Jiang, Y. Liu, and B. Malin. A cryptographic approach to securely share
and query genomic sequences.
IEEE Transactions on Information Technology in Biomedicine
,
12(5):606-617, 2008.
29. H. Kargupta, S. Datta, Q. Wang, and K. Sivakumar. On the privacy preserving properties of
random data perturbation techniques. In
Proceedings of the 3rd IEEE International Conference
on Data Mining
, ICDM, pages 99-106, 2003.
30. G. Lee, C.-Y. Chang, and A. Chen. Hiding sensitive patterns in association rules mining. In
Pro-
ceedings of the 28th IEEE International Conference on Computer Software and Applications
,
COMPSAC, pages 424-429, 2004.
31. H. Mannila and H. Toivonen. Levelwise search and borders of theories in knowledge discovery.
Data Mining and Knowledge Discovery
, 1(3):241-258, 1997.
32. S. Menon, S. Sarkar, and S. Mukherjee. Maximizing accuracy of shared databases when
concealing sensitive patterns.
Information Systems Research
, 16(3):256-270, Sept. 2005.
33. T. Mielikainen. On inverse frequent set mining. In
Proceedings of the 2nd Workshop on Privacy
Preserving Data Mining
, pages 18-23, 2003.
34. G. Moustakides and V. Verykios. A max-min approach for hiding frequent itemsets. In
Proceedings of the 6th IEEE Conference on Data Mining Workshops
,
pages 502-506,
Dec. 2006.
