%0 Conference Proceedings
%T Privacy-Preserving Subgraph Discovery
%+ Lahore University of Management Sciences (LUMS)
%+ Center for Information Management, Integration and Connectivity (Rutgers University) (CIMIC)
%A Mehmood, Danish
%A Shafiq, Basit
%A Vaidya, Jaideep
%A Hong, Yuan
%A Adam, Nabil
%A Atluri, Vijayalakshmi
%Z Part 5: Privacy-Preserving Technologies
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 26th Conference on Data and Applications Security and Privacy (DBSec)
%C Paris, France
%Y Nora Cuppens-Boulahia
%Y Frédéric Cuppens
%Y Joaquin Garcia-Alfaro
%I Springer
%3 Data and Applications Security and Privacy XXVI
%V LNCS-7371
%P 161-176
%8 2012-07-11
%D 2012
%R 10.1007/978-3-642-31540-4_13
%Z Computer Science [cs]Conference papers
%X 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.
%G English
%Z TC 11
%Z WG 11.3
%2 https://inria.hal.science/hal-01534763/document
%2 https://inria.hal.science/hal-01534763/file/978-3-642-31540-4_13_Chapter.pdf
%L hal-01534763
%U https://inria.hal.science/hal-01534763
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-WG
%~ IFIP-TC11
%~ IFIP-WG11-3
%~ IFIP-DBSEC
%~ IFIP-LNCS-7371