Data mining can extract important knowledge from large data collections – but sometimes these collections are split among various parties. Privacy concerns may prevent the parties from directly sharing the data, and some types of information about the data. This paper addresses secure mining of association rules over horizontally partitioned data. The methods incorporate cryptographic techniques to minimize the information shared, while adding little overhead to the mining task.

1. R. Agrawal and R. Srikant, “Fast algorithms for mining association rules,” in Proceedings of the 20th International Conference on VeryLarge Data Bases. Santiago, Chile: VLDB, Sept. 12-15 1994, pp.487–499. [Online]. Available: http://www.vldb.org/dblp/db/conf/vldb/vldb94-487.html
2. D. W.-L. Cheung, J. Han, V. Ng, A. W.-C. Fu, and Y. Fu, “A fast distributed algorithm for mining association rules,” in Proceedings of the 1996 International Conference on Parallel and Distributed Information Systems (PDIS’96). Miami Beach, Florida, USA: IEEE, Dec. 1996,pp. 31–42.
3. D. W.-L. Cheung, V. Ng, A. W.-C. Fu, and Y. Fu, “Efficient mining of association rules in distributed databases,” IEEE Trans. Knowledge Data Eng., vol. 8, no. 6, pp. 911–922, Dec. 1996.
4. R. Agrawal and R. Srikant, “Privacy-preserving data mining,” in Proceedings of the 2000 ACM SIGMOD Conference on Management of Data. Dallas, TX: ACM, May 14-19 2000, pp. 439–450. [Online]. Available: http://doi.acm.org/10.1145/342009.335438.
5. D. Agrawal and C. C. Aggarwal, “On the design and quantification of privacy preserving data mining algorithms,” in Proceedings of the Twentieth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems. Santa Barbara, California, USA:ACM, May 21-23 2001, pp. 247–255. [Online]. Available: http://doi.acm.org/ 10.1145/375551.375602.
6. A. Evfimievski, R. Srikant, R. Agrawal, and J. Gehrke, “Privacy preserving mining of association rules,” in The Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Edmonton, Alberta, Canada, July 23-26 2002, pp. 217–228. [Online]. Available: http://doi.acm.org/10.1145/775047.775080
7. S. J. Rizvi and J. R. Haritsa, “Maintaining data privacy in association rule mining,” in Proceedings of 28th International Conference on Very Large Data Bases. Hong Kong: VLDB, Aug. 20-23 2002, pp. 682–693. [Online]. Available: http://www.vldb.org/conf/2002/S19P03.pdf
8. Y. Lindell and B. Pinkas, “Privacy preserving data mining,” in Advances in Cryptology – CRYPTO 2000. Springer-Verlag, Aug. 20-24 2000, pp. 36–54. [Online]. Available: http://link.springer.de/link/ service/series/ 0558 /bibs/ 1880/18800036.htm
9. O. Goldreich, “Secure multi-party computation,” Sept. 1998, (working draft). [Online]. Available: http://www.wisdom.weizmann.ac.il/_oded/pp.html
10. J. Vaidya and C. Clifton, “Privacy preserving association rule mining in vertically partitioned data,” in The Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Edmonton, Alberta, Canada, July 23-26 2002, pp. 639–644. [Online]. Available: http://doi.acm.org/10.1145/775047.775142
11. A. C. Yao, “How to generate and exchange secrets,” in Proceedings of the 27th IEEE Symposium on Foundations of Computer Science. IEEE,1986, pp. 162–167.
12. I. Ioannidis and A. Grama, “An efficient protocol for yao’s millionaires’ problem,” in Hawaii International Conference on System Sciences(HICSS-36), Waikoloa Village, Hawaii, Jan. 6-9 2003.
13. O. Goldreich, “Encryption schemes,” Mar. 2003, (working draft). [Online]. Available: http://www.wisdom.weizmann.ac.il/_oded/ PSBookFrag/enc.ps
14. R. L. Rivest, A. Shamir, and L. Adleman, “A method for obtaining digital signatures and public-key cryptosystems,” Communications of the ACM, vol. 21, no. 2, pp. 120–126, 1978. [Online]. Available: http://doi.acm.org/10.1145/359340.359342.

DES Algorithm Data mining