Privacy-preserving subgraph discovery

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7371 LNCS, Issue , 2012, Pages 161-176

  Mehmood, Danish ^a   Shafiq, Basit ^a,b   Vaidya, Jaideep ^b   Hong, Yuan ^b   Adam, Nabil ^b   Atluri, Vijayalakshmi ^b  

^a LAHORE UNIVERSITY OF MANAGEMENT SCIENCES   (Pakistan)

^b RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHIC PRIMITIVES; DISCOVERY ALGORITHM; DRUG DISCOVERY; EXPERIMENTAL EVALUATION; FREQUENT SUBGRAPHS; GRAPH STRUCTURED DATA; PRIVACY PRESERVING; SINGLE SITES; SUBGRAPHS;

ALGORITHMS;

PROBLEM SOLVING;

EID: 84864372044     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-31540-4_13     Document Type: Conference Paper

References (25)

1. Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Proceedings of the 20th International Conference on Very Large Data Bases, September 12-15, pp. 487-499. VLDB, Santiago (1994), http://www.vldb.org/dblp/ db/conf/vldb/vldb94-487.html
2. Agrawal, R., Srikant, R.: Privacy-preserving data mining. In: Proceedings of the 2000 ACM SIGMOD Conference on Management of Data, May 14-19, pp. 439-450. ACM, Dallas (2000), http://doi.acm.org/10.1145/342009.335438
3. Chittimoori, R.N., Holder, L.B., Cook, D.J.: Applying the subdue substructure discovery system to the chemical toxicity domain. In: Proceedings of the Twelfth International Florida Artificial Intelligence Research Society Conference, pp. 90-94. AAAI Press (1999), http://dl.acm.org/citation.cfm?id= 646812.707494
4. Du, W., Zhan, Z.: Building decision tree classifier on private data. In: Clifton, C., Estivill- Castro, V. (eds.) IEEE International Conference on Data Mining Workshop on Privacy, Security, and Data Mining, December 9, vol. 14, pp. 1-8. Australian Computer Society, Maebashi City (2002), http://crpit.com/Vol14. html
5. Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game - a completeness theorem for protocols with honest majority. In: Proceedings of the 19th ACM Symposium on the Theory of Computing, pp. 218-229. ACM, New York (1987), http://doi.acm.org/10.1145/28395.28420
6. Gudes, E., Shimony, S.E., Vanetik, N.: Discovering frequent graph patterns using disjoint paths. IEEE Trans. on Knowl. and Data Eng. 18, 1441-1456 (2006), http://dx.doi.org/10.1109/TKDE.2006.173
7. Inokuchi, A., Washio, T., Motoda, H.: Complete mining of frequent patterns from graphs: Mining graph data. Mach. Learn. 50, 321-354 (2003), http://dl.acm.org/citation.cfm?id=608108.608123
8. Jagannathan, G., Wright, R.N.: Privacy-preserving distributed k-means clustering over arbitrarily partitioned data. In: Proceedings of the 2005 ACM SIGKDD International Conference on Knowledge Discovery and DataMining, August 21-24, pp. 593-599. ACM, Chicago (2005)
9. Karr, A.F., Lin, X., Sanil, A.P., Reiter, J.P.: Secure regressions on distributed databases. Journal of Computational and Graphical Statistics 14, 263-279 (2005)
10. Kuramochi, M., Karypis, G.: Frequent subgraph discovery. In: Cercone, N., Lin, T.Y., Wu, X. (eds.) ICDM, pp. 313-320. IEEE Computer Society (2001)
11. Lindell, Y., Pinkas, B.: Privacy preserving data mining. Journal of Cryptology 15(3), 177-206 (2002)
12. Mukherjee, M.: Graph-based data mining for social network analysis. In: Proceedings of the ACM KDD Workshop on Link Analysis and Group Detection (2004)
13. Paillier, P.: Public-Key Cryptosystems Based on Composite Degree Residuosity Classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 223-238. Springer, Heidelberg (1999)
14. Pohlig, S.C., Hellman, M.E.: An improved algorithm for computing logarithms over GF(p) and its cryptographic significance. IEEE Transactions on Information Theory IT-24, 106-110 (1978)
15. Rakhshan, A., Holder, L.B., Cook, D.J.: Structural web search engine. International Journal on Artificial Intelligence Tools 13(1), 27-44 (2004)
16. Sanil, A.P., Karr, A.F., Lin, X., Reiter, J.P.: Privacy preserving regression modelling via distributed computation. In: KDD 2004: Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 677-682. ACMPress, New York (2004)
17. Su, S., Cook, D.J., Holder, L.B.: Application of knowledge discovery to molecular biology: Identifying structural regularities in proteins. In: Pacific Symposium on Biocomputing, pp. 190-201 (1999)
18. Vaidya, J., Clifton, C.: Privacy-preserving k-means clustering over vertically partitioned data. In: The Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, August 24-27, pp. 206-215. ACM, Washington, DC (2003), http://doi.acm.org/10.1145/956750.956776
19. Vaidya, J., Clifton, C.: Privacy preserving naïve bayes classifier for vertically partitioned data. In: 2004 SIAM International Conference on Data Mining, April 22-24, pp. 522-526. SIAM, Philadelphia (2004)
20. Vaidya, J., Clifton, C.: Privacy-preserving outlier detection. In: Proceedings of the Fourth IEEE International Conference on Data Mining (ICDM 2004), November 1-4, pp. 233-240. IEEE Computer Society Press, Los Alamitos (2004)
21. Vaidya, J., Clifton, C.: Secure set intersection cardinality with application to association rule mining. Journal of Computer Security 13(4), 593-622 (2005)
22. Vaidya, J., Clifton, C., Kantarcioglu, M., Patterson, A.S.: Privacy-preserving decision trees over vertically partitioned data. ACM Trans. Knowl. Discov. Data 2(3), 1-27 (2008)
23. Yan, X., Han, J.: gspan: Graph-based substructure pattern mining. In: ICDM, pp. 721-724 (2002)
24. Yao, A.C.: How to generate and exchange secrets. In: Proceedings of the 27th IEEE Symposium on Foundations of Computer Science, pp. 162-167. IEEE Computer Society, Los Alamitos (1986)
25. Zhu, Y., Liu, L.: Optimal randomization for privacy preserving data mining. In: KDD 2004: Proceedings of the Tenth ACMSIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 761-766. ACM Press, New York (2004)