Service interruption on Monday 11 July from 12:30 to 13:00: all the sites of the CCSD (HAL, EpiSciences, SciencesConf, AureHAL) will be inaccessible (network hardware connection).
Skip to Main content Skip to Navigation
Conference papers

Privacy-Preserving Subgraph Discovery

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.
Document type :
Conference papers
Complete list of metadata
Contributor : Hal Ifip Connect in order to contact the contributor
Submitted on : Thursday, June 8, 2017 - 11:06:28 AM
Last modification on : Thursday, June 8, 2017 - 11:09:27 AM
Long-term archiving on: : Saturday, September 9, 2017 - 12:34:37 PM


Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License



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⟩



Record views


Files downloads