메뉴 건너뛰기




Volumn 2016-July, Issue , 2016, Pages

Graph-based privacy-preserving data publication

Author keywords

Data publication; Graph partition; Privacy preservation

Indexed keywords

GRAPHIC METHODS;

EID: 84983261952     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFOCOM.2016.7524584     Document Type: Conference Paper
Times cited : (45)

References (37)
  • 1
    • 77951201056 scopus 로고    scopus 로고
    • Privacy-preserving data publishing: A survey of recent developments
    • B. Fung, K. Wang, R. Chen, and P. S. Yu, "Privacy-preserving data publishing: A survey of recent developments," ACM Computing Surveys (CSUR), vol. 42, no. 4, p. 14, 2010.
    • (2010) ACM Computing Surveys (CSUR) , vol.42 , Issue.4 , pp. 14
    • Fung, B.1    Wang, K.2    Chen, R.3    Yu, P.S.4
  • 4
    • 0034827009 scopus 로고    scopus 로고
    • On the design and quantification of privacy preserving data mining algorithms
    • D. Agrawal and C. C. Aggarwal, "On the design and quantification of privacy preserving data mining algorithms," in ACM PODS. ACM, 2001, pp. 247-255.
    • (2001) ACM PODS. ACM , pp. 247-255
    • Agrawal, D.1    Aggarwal, C.C.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. ACM, 2010, pp. 459-470.
    • (2010) SIGMOD. ACM , pp. 459-470
    • Cheng, J.1    Fu, A.W.-C.2    Liu, J.3
  • 7
    • 0000072558 scopus 로고
    • Finding a needle in a haystack-or identifying anonymous census record
    • T. Dalenius, "Finding a needle in a haystack-or identifying anonymous census record," Journal of official statistics, vol. 2, no. 3, pp. 329-336, 1986.
    • (1986) Journal of Official Statistics , vol.2 , Issue.3 , pp. 329-336
    • Dalenius, T.1
  • 8
    • 84856191070 scopus 로고    scopus 로고
    • A survey of privacy-preservation of graphs and social networks
    • Springer
    • X. Wu, X. Ying, K. Liu, and L. Chen, "A survey of privacy-preservation of graphs and social networks," in Managing and mining graph data. Springer, 2010, pp. 421-453.
    • (2010) Managing and Mining Graph Data , pp. 421-453
    • Wu, X.1    Ying, X.2    Liu, K.3    Chen, L.4
  • 13
    • 84983364700 scopus 로고    scopus 로고
    • De-anonymizing social networks and inferring private attributes using knowledge graphs
    • J. Qian, X.-Y. Li, C. Zhang, and l. Chen, "De-anonymizing social networks and inferring private attributes using knowledge graphs," in INFOCOM. IEEE, 2016.
    • (2016) INFOCOM. IEEE
    • Qian, J.1    Li, X.-Y.2    Zhang, C.3    Chen, L.4
  • 15
    • 0035789644 scopus 로고    scopus 로고
    • Co-clustering documents and words using bipartite spectral graph partitioning
    • I. S. Dhillon, "Co-clustering documents and words using bipartite spectral graph partitioning," in SIGKDD. ACM, 2001, pp. 269-274.
    • (2001) SIGKDD. ACM , pp. 269-274
    • Dhillon, I.S.1
  • 16
    • 33846251992 scopus 로고    scopus 로고
    • Spectral partitioning works: Planar graphs and finite element meshes
    • D. A. Spielman and S.-H. Teng, "Spectral partitioning works: Planar graphs and finite element meshes," Linear Algebra and its Applications, vol. 421, no. 2, pp. 284-305, 2007.
    • (2007) Linear Algebra and Its Applications , vol.421 , Issue.2 , pp. 284-305
    • Spielman, D.A.1    Teng, S.-H.2
  • 19
    • 80052648113 scopus 로고    scopus 로고
    • Friendship and mobility: User movement in location-based social networks
    • E. Cho, S. A. Myers, and J. Leskovec, "Friendship and mobility: user movement in location-based social networks," in SIGKDD. ACM, 2011, pp. 1082-1090.
    • (2011) SIGKDD. ACM , pp. 1082-1090
    • Cho, E.1    Myers, S.A.2    Leskovec, J.3
  • 21
    • 84983290830 scopus 로고    scopus 로고
    • Theory and practical applications for statistical agencies
    • J. Domingo-Ferrer and V. Torra, "Theory and practical applications for statistical agencies," North-Holland: Amsterdam, pp. 113-134, 2002.
    • (2002) North-Holland: Amsterdam , pp. 113-134
    • Domingo-Ferrer, J.1    Torra, V.2
  • 22
    • 33745599656 scopus 로고    scopus 로고
    • Checking for k-anonymity violation by views
    • C. Yao, X. S. Wang, and S. Jajodia, "Checking for k-anonymity violation by views," in VLDB. VLDB Endowment, 2005, pp. 910-921.
    • (2005) VLDB. VLDB Endowment , pp. 910-921
    • Yao, C.1    Wang, X.S.2    Jajodia, S.3
  • 24
    • 84865065669 scopus 로고    scopus 로고
    • K-automorphism: A general framework for privacy preserving network publication
    • L. Zou, L. Chen, and M. T. Özsu, "K-automorphism: A general framework for privacy preserving network publication," Proceedings of the VLDB Endowment, vol. 2, no. 1, pp. 946-957, 2009.
    • (2009) Proceedings of the VLDB Endowment , vol.2 , Issue.1 , pp. 946-957
    • Zou, L.1    Chen, L.2    Özsu, M.T.3
  • 25
    • 84904352532 scopus 로고    scopus 로고
    • Blowfish privacy: Tuning privacy-utility trade-offs using policies
    • X. He, A. Machanavajjhala, and B. Ding, "Blowfish privacy: Tuning privacy-utility trade-offs using policies," in SIGMOD. ACM, 2014, pp. 1447-1458.
    • (2014) SIGMOD. ACM , pp. 1447-1458
    • He, X.1    Machanavajjhala, A.2    Ding, B.3
  • 26
    • 34250673244 scopus 로고    scopus 로고
    • Injecting utility into anonymized datasets
    • D. Kifer and J. Gehrke, "Injecting utility into anonymized datasets," in SIGMOD. ACM, 2006, pp. 217-228.
    • (2006) SIGMOD. ACM , pp. 217-228
    • Kifer, D.1    Gehrke, J.2
  • 28
    • 77955045035 scopus 로고    scopus 로고
    • Graph clustering based on struc-tural/attribute similarities
    • Y. Zhou, H. Cheng, and J. X. Yu, "Graph clustering based on struc-tural/attribute similarities," Proceedings of the VLDB Endowment, vol. 2, no. 1, pp. 718-729, 2009.
    • (2009) Proceedings of the VLDB Endowment , vol.2 , Issue.1 , pp. 718-729
    • Zhou, Y.1    Cheng, H.2    Yu, J.X.3
  • 29
    • 84978707769 scopus 로고    scopus 로고
    • Membership privacy: A unifying framework for privacy definitions
    • N. Li, W. H. Qardaji, D. Su, and Y. W. andWeining Yang, "Membership privacy: a unifying framework for privacy definitions," in ACM CCS.
    • ACM CCS
    • Li, N.1    Qardaji, W.H.2    Su, D.3    Yang, Y.W.W.4
  • 30
    • 28444434728 scopus 로고    scopus 로고
    • A framework for high-accuracy privacy-preserving mining
    • S. Agrawal and J. R. Haritsa, "A framework for high-accuracy privacy-preserving mining," in ICDE. IEEE, 2005, pp. 193-204.
    • (2005) ICDE. IEEE , pp. 193-204
    • Agrawal, S.1    Haritsa, J.R.2
  • 31
    • 84904305482 scopus 로고    scopus 로고
    • Hydra: Large-scale social identity linkage via heterogeneous behavior modeling
    • S. Liu, S. Wang, F. Zhu, J. Zhang, and R. Krishnan, "Hydra: Large-scale social identity linkage via heterogeneous behavior modeling," in SIGMOD. ACM, 2014, pp. 51-62.
    • (2014) SIGMOD. ACM , pp. 51-62
    • Liu, S.1    Wang, S.2    Zhu, F.3    Zhang, J.4    Krishnan, R.5
  • 34
    • 84947255651 scopus 로고    scopus 로고
    • A framework for optimization in big data: Privacy-preserving multi-agent greedy algorithm
    • Springer
    • T. Jung, X.-Y. Li, and J. Han, "A framework for optimization in big data: Privacy-preserving multi-agent greedy algorithm," in Big Data Computing and Communications. Springer, 2015, pp. 88-102.
    • (2015) Big Data Computing and Communications , pp. 88-102
    • Jung, T.1    Li, X.-Y.2    Han, J.3
  • 36
    • 33746335051 scopus 로고    scopus 로고
    • Differential privacy
    • C. Dwork, "Differential privacy," in ICALP, 2006, pp. 1-12.
    • (2006) ICALP , pp. 1-12
    • Dwork, C.1
  • 37
    • 84904437773 scopus 로고    scopus 로고
    • Achieving differential privacy of data disclosure in the smart grid
    • J. Zhao, T. Jung, Y. Wang, and X. Li, "Achieving differential privacy of data disclosure in the smart grid," in INFOCOM, 2014 Proceedings IEEE. IEEE, 2014, pp. 504-512.
    • (2014) INFOCOM, 2014 Proceedings IEEE. IEEE , pp. 504-512
    • Zhao, J.1    Jung, T.2    Wang, Y.3    Li, X.4


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