Skip to main content

Advertisement

SpringerLink
Log in
Menu
Find a journal Publish with us
Search
Cart
Book cover

IFIP Annual Conference on Data and Applications Security and Privacy

DBSec 2012: Data and Applications Security and Privacy XXVI pp 161–176Cite as

  1. Home
  2. Data and Applications Security and Privacy XXVI
  3. Conference paper
Privacy-Preserving Subgraph Discovery

Privacy-Preserving Subgraph Discovery

  • Danish Mehmood17,
  • Basit Shafiq17,18,
  • Jaideep Vaidya18,
  • Yuan Hong18,
  • Nabil Adam18 &
  • …
  • Vijayalakshmi Atluri18 
  • Conference paper
  • 2056 Accesses

  • 6 Citations

Part of the Lecture Notes in Computer Science book series (LNISA,volume 7371)

Abstract

Graph structured data can be found in many domains and applications. Analysis of such data can give valuable insights. Frequent subgraph discovery, the problem of finding the set of subgraphs that is frequent among the underlying database of graphs, has attracted a lot of recent attention. Many algorithms have been proposed to solve this problem. However, all assume that the entire set of graphs is centralized at a single site, which is not true in a lot of cases. Furthermore, in a lot of interesting applications, the data is sensitive (for example, drug discovery, clique detection, etc). In this paper, we address the problem of privacy-preserving subgraph discovery. We propose a flexible approach that can utilize any underlying frequent subgraph discovery algorithm and uses cryptographic primitives to preserve privacy. The comprehensive experimental evaluation validates the feasibility of our approach.

Keywords

  • Local Candidate
  • Support Threshold
  • Homomorphic Encryption
  • Global Threshold
  • Local Threshold

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Download conference paper PDF

References

  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

    Google Scholar 

  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

    CrossRef  Google Scholar 

  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

    Google Scholar 

  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

    Google Scholar 

  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

    CrossRef  MATH  Google Scholar 

  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

    CrossRef  MATH  Google Scholar 

  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 Data Mining, August 21-24, pp. 593–599. ACM, Chicago (2005)

    Google Scholar 

  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)

    CrossRef  MathSciNet  Google Scholar 

  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)

    Google Scholar 

  11. Lindell, Y., Pinkas, B.: Privacy preserving data mining. Journal of Cryptology 15(3), 177–206 (2002)

    CrossRef  MathSciNet  MATH  Google Scholar 

  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)

    Google Scholar 

  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)

    CrossRef  Google Scholar 

  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)

    CrossRef  MathSciNet  MATH  Google Scholar 

  15. Rakhshan, A., Holder, L.B., Cook, D.J.: Structural web search engine. International Journal on Artificial Intelligence Tools 13(1), 27–44 (2004)

    CrossRef  Google Scholar 

  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. ACM Press, New York (2004)

    CrossRef  Google Scholar 

  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)

    Google Scholar 

  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

    CrossRef  Google Scholar 

  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)

    CrossRef  Google Scholar 

  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)

    CrossRef  Google Scholar 

  21. Vaidya, J., Clifton, C.: Secure set intersection cardinality with application to association rule mining. Journal of Computer Security 13(4), 593–622 (2005)

    CrossRef  Google Scholar 

  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)

    CrossRef  Google Scholar 

  23. Yan, X., Han, J.: gspan: Graph-based substructure pattern mining. In: ICDM, pp. 721–724 (2002)

    Google Scholar 

  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)

    Google Scholar 

  25. Zhu, Y., Liu, L.: Optimal randomization for privacy preserving data mining. In: KDD 2004: Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 761–766. ACM Press, New York (2004)

    CrossRef  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Lahore University of Management Sciences, Pakistan

    Danish Mehmood & Basit Shafiq

  2. CIMIC, Rutgers University, USA

    Basit Shafiq, Jaideep Vaidya, Yuan Hong, Nabil Adam & Vijayalakshmi Atluri

Authors
  1. Danish Mehmood
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Basit Shafiq
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jaideep Vaidya
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Yuan Hong
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Nabil Adam
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Vijayalakshmi Atluri
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Télécom Bretagne, Campus de Rennes 2, rue de la Châtaigneraie, 35512, Cesson Sévigné Cedex, France

    Nora Cuppens-Boulahia, Frédéric Cuppens & Joaquin Garcia-Alfaro,  & 

Rights and permissions

Reprints and Permissions

Copyright information

© 2012 IFIP International Federation for Information Processing

About this paper

Cite this paper

Mehmood, D., Shafiq, B., Vaidya, J., Hong, Y., Adam, N., Atluri, V. (2012). Privacy-Preserving Subgraph Discovery. In: Cuppens-Boulahia, N., Cuppens, F., Garcia-Alfaro, J. (eds) Data and Applications Security and Privacy XXVI. DBSec 2012. Lecture Notes in Computer Science, vol 7371. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31540-4_13

Download citation

  • .RIS
  • .ENW
  • .BIB
  • DOI: https://doi.org/10.1007/978-3-642-31540-4_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-31539-8

  • Online ISBN: 978-3-642-31540-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Share this paper

Anyone you share the following link with will be able to read this content:

Sorry, a shareable link is not currently available for this article.

Provided by the Springer Nature SharedIt content-sharing initiative

Search

Navigation

  • Find a journal
  • Publish with us

Discover content

  • Journals A-Z
  • Books A-Z

Publish with us

  • Publish your research
  • Open access publishing

Products and services

  • Our products
  • Librarians
  • Societies
  • Partners and advertisers

Our imprints

  • Springer
  • Nature Portfolio
  • BMC
  • Palgrave Macmillan
  • Apress
  • Your US state privacy rights
  • Accessibility statement
  • Terms and conditions
  • Privacy policy
  • Help and support

167.114.118.210

Not affiliated

Springer Nature

© 2023 Springer Nature