Privacy-Preserving Subgraph Discovery - Data and Applications Security and Privacy XXVI Access content directly
Conference Papers Year : 2012

Privacy-Preserving Subgraph Discovery


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.
Fichier principal
Vignette du fichier
978-3-642-31540-4_13_Chapter.pdf (217.16 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01534763 , version 1 (08-06-2017)





Danish Mehmood, Basit Shafiq, Jaideep Vaidya, Yuan Hong, Nabil Adam, et al.. Privacy-Preserving Subgraph Discovery. 26th Conference on Data and Applications Security and Privacy (DBSec), Jul 2012, Paris, France. pp.161-176, ⟨10.1007/978-3-642-31540-4_13⟩. ⟨hal-01534763⟩
72 View
55 Download



Gmail Facebook X LinkedIn More