메뉴 건너뛰기




Volumn , Issue , 2014, Pages 911-920

Differentially private network data release via structural inference

Author keywords

differential privacy; network data; structural inference

Indexed keywords


EID: 84907033666     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2623330.2623642     Document Type: Conference Paper
Times cited : (165)

References (28)
  • 1
    • 84873384215 scopus 로고    scopus 로고
    • Differentially private data analysis of social networks via restricted sensitivity
    • J. Blocki, A. Blum, A. Datta, and O. Sheffet. Differentially private data analysis of social networks via restricted sensitivity. In ITCS, 2013.
    • (2013) ITCS
    • Blocki, J.1    Blum, A.2    Datta, A.3    Sheffet, O.4
  • 3
    • 84979657443 scopus 로고    scopus 로고
    • Correlated network data publication via differential privacy
    • in press
    • R. Chen, B. C. M. Fung, P. S. Yu, and B. C. Desai. Correlated network data publication via differential privacy. VLDBJ, in press.
    • VLDBJ
    • Chen, R.1    Fung, B.C.M.2    Yu, P.S.3    Desai, B.C.4
  • 4
    • 84880566095 scopus 로고    scopus 로고
    • Recursive mechanism: Towards node differential privacy and unrestricted joins
    • S. Chen and S. Zhou. Recursive mechanism: towards node differential privacy and unrestricted joins. In SIGMOD, 2013.
    • (2013) SIGMOD
    • Chen, S.1    Zhou, S.2
  • 5
    • 77954728128 scopus 로고    scopus 로고
    • K-isomorphism: Privacy preserving network publication against structural attacks
    • J. Cheng, A. W. C. Fu, and J. Liu. K-isomorphism: privacy preserving network publication against structural attacks. In SIGMOD, 2010.
    • (2010) SIGMOD
    • Cheng, J.1    Fu, A.W.C.2    Liu, J.3
  • 7
    • 43049151837 scopus 로고    scopus 로고
    • Hierarchical structure and the prediction of missing links in networks
    • A. Clauset, C. Moore, and M. E. J. Newman. Hierarchical structure and the prediction of missing links in networks. Nature, 453:98-101, 2008.
    • (2008) Nature , vol.453 , pp. 98-101
    • Clauset, A.1    Moore, C.2    Newman, M.E.J.3
  • 8
    • 72749109110 scopus 로고    scopus 로고
    • Anonymizing bipartite graph data using safe groupings
    • G. Cormode, D. Srivastava, T. Yu, and Q. Zhang. Anonymizing bipartite graph data using safe groupings. PVLDB, 1(1):833-844, 2008.
    • (2008) PVLDB , vol.1 , Issue.1 , pp. 833-844
    • Cormode, G.1    Srivastava, D.2    Yu, T.3    Zhang, Q.4
  • 9
    • 33746086554 scopus 로고    scopus 로고
    • Calibrating noise to sensitivity in private data analysis
    • C. Dwork, F. McSherry, K. Nissim, and A. Smith. Calibrating noise to sensitivity in private data analysis. In TCC, 2006.
    • (2006) TCC
    • Dwork, C.1    McSherry, F.2    Nissim, K.3    Smith, A.4
  • 10
    • 84876039577 scopus 로고    scopus 로고
    • Iterative constructions and private data release
    • A. Gupta, A. Roth, and J. Ullman. Iterative constructions and private data release. In TCC, 2012.
    • (2012) TCC
    • Gupta, A.1    Roth, A.2    Ullman, J.3
  • 11
    • 84862594279 scopus 로고    scopus 로고
    • Beating randomized response on incoherent matrices
    • M. Hardt and A. Roth. Beating randomized response on incoherent matrices. In STOC, 2012.
    • (2012) STOC
    • Hardt, M.1    Roth, A.2
  • 12
    • 77951192010 scopus 로고    scopus 로고
    • Accurate estimation of the degree distribution of private networks
    • M. Hay, C. Li, G. Miklau, and D. Jensen. Accurate estimation of the degree distribution of private networks. In ICDM, 2009.
    • (2009) ICDM
    • Hay, M.1    Li, C.2    Miklau, G.3    Jensen, D.4
  • 13
    • 84859194833 scopus 로고    scopus 로고
    • Resisting structural re-identification in anonymized social networks
    • M. Hay, G. Miklau, D. Jensen, D. F. Towsley, and P. Weis. Resisting structural re-identification in anonymized social networks. PVLDB, 1(1):102-114, 2008.
    • (2008) PVLDB , vol.1 , Issue.1 , pp. 102-114
    • Hay, M.1    Miklau, G.2    Jensen, D.3    Towsley, D.F.4    Weis, P.5
  • 16
    • 57149126815 scopus 로고    scopus 로고
    • Towards identity anonymization on graphs
    • K. Liu and E. Terzi. Towards identity anonymization on graphs. In SIGMOD, 2008.
    • (2008) SIGMOD
    • Liu, K.1    Terzi, E.2
  • 17
    • 77956293777 scopus 로고    scopus 로고
    • Privacy integrated queries: An extensible platform for privacy-preserving data analysis
    • F. McSherry. Privacy integrated queries: an extensible platform for privacy-preserving data analysis. Commun. ACM, 53(9), 2010.
    • (2010) Commun. ACM , vol.53 , Issue.9
    • McSherry, F.1
  • 18
    • 46749128577 scopus 로고    scopus 로고
    • Mechanism design via differential privacy
    • F. McSherry and K. Talwar. Mechanism design via differential privacy. In FOCS, 2007.
    • (2007) FOCS
    • McSherry, F.1    Talwar, K.2
  • 19
    • 25844516325 scopus 로고    scopus 로고
    • Phylogenetic MCMC algorithms are misleading on mixtures of trees
    • E. Mossel and E. Vigoda. Phylogenetic MCMC algorithms are misleading on mixtures of trees. Science, 309(5744):2207-2209, 2005.
    • (2005) Science , vol.309 , Issue.5744 , pp. 2207-2209
    • Mossel, E.1    Vigoda, E.2
  • 20
    • 84866615978 scopus 로고    scopus 로고
    • A workflow for differentially-private graph synthesis
    • D. Proserpio, S. Goldberg, and F. McSherry. A workflow for differentially-private graph synthesis. In WOSN, 2012.
    • (2012) WOSN
    • Proserpio, D.1    Goldberg, S.2    McSherry, F.3
  • 21
    • 82955196835 scopus 로고    scopus 로고
    • Sharing graphs using differentially private graph models
    • A. Sala, X. Zhao, C. Wilson, H. Zheng, and B. Y. Zhao. Sharing graphs using differentially private graph models. In IMC, 2011.
    • (2011) IMC
    • Sala, A.1    Zhao, X.2    Wilson, C.3    Zheng, H.4    Zhao, B.Y.5
  • 22
    • 0035517699 scopus 로고    scopus 로고
    • Protecting respondents' identities in microdata release
    • P. Samarati. Protecting respondents' identities in microdata release. TKDE, 13(6):1010-1027, 2001.
    • (2001) TKDE , vol.13 , Issue.6 , pp. 1010-1027
    • Samarati, P.1
  • 23
    • 84989250474 scopus 로고    scopus 로고
    • Mining frequent graph patterns with differential privacy
    • E. Shen and T. Yu. Mining frequent graph patterns with differential privacy. In SIGKDD, 2013.
    • (2013) SIGKDD
    • Shen, E.1    Yu, T.2
  • 24
    • 84881628005 scopus 로고    scopus 로고
    • Preserving differential privacy in degree-correlation based graph generation
    • Y. Wang and X. Wu. Preserving differential privacy in degree-correlation based graph generation. TDP, 6(2), 2013.
    • TDP , vol.6 , Issue.2 , pp. 2013
    • Wang, Y.1    Wu, X.2
  • 25
    • 84881648510 scopus 로고    scopus 로고
    • Differential privacy preserving spectral graph analysis
    • Y. Wang, X. Wu, and L. Wu. Differential privacy preserving spectral graph analysis. In PAKDD, 2013.
    • (2013) PAKDD
    • Wang, Y.1    Wu, X.2    Wu, L.3
  • 26
    • 84867050871 scopus 로고    scopus 로고
    • Line orthogonality in adjacency eigenspace with application to community partition
    • L. Wu, X. Ying, X. Wu, and Z.-H. Zhou. Line orthogonality in adjacency eigenspace with application to community partition. In IJCAI, 2011.
    • (2011) IJCAI
    • Wu, L.1    Ying, X.2    Wu, X.3    Zhou, Z.-H.4
  • 27
    • 52649120205 scopus 로고    scopus 로고
    • Preserving privacy in social networks against neighborhood attacks
    • B. Zhou and J. Pei. Preserving privacy in social networks against neighborhood attacks. In ICDE, 2008.
    • (2008) ICDE
    • Zhou, B.1    Pei, J.2
  • 28
    • 84865065669 scopus 로고    scopus 로고
    • K-automorphism: A general framework for privacy preserving network publication
    • L. Zou, L. Chen, and M. T. Ozsu. K-automorphism: a general framework for privacy preserving network publication. PVLDB, 2(1):946-957, 2009.
    • (2009) PVLDB , vol.2 , Issue.1 , pp. 946-957
    • Zou, L.1    Chen, L.2    Ozsu, M.T.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.