skip to main content
10.1145/3290480.3290503acmotherconferencesArticle/Chapter ViewAbstractPublication PagesiccnsConference Proceedingsconference-collections
research-article

A Two-Phase Algorithm for Generating Synthetic Graph Under Local Differential Privacy

Authors Info & Claims
Published:02 November 2018Publication History

ABSTRACT

With the rapid development of big data technology, the issue of preserving personal privacy has attracted more and more attention. It has been shown that protecting the published graph with the differential privacy can ensure not only the quantitative privacy, but also the data usability. In this paper, we first put forward an optimized randomized response algorithm for generating synthetic graph, which dose not depend on a trusted third party in charge of collecting data. Furthermore, based on multi-party computation clustering, we propose a generated graph model under local differential privacy (LDPGM). The experiment indicates that LDPGM can effectively control the density of the synthetic graph so that significantly reduce the error between the synthetic graph and the original graph. Therefore, it maintains the properties of the original graph well and ensures high usability.

References

  1. Dwork, C. 2006. "Differential privacy," in International Colloquium on Automata, Languages, and Programming, pp. 1--12. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Kasiviswanathan, S. P., Lee, H. K., Nissim, K., Raskhodnikova, S., and Smith, A. D. 2011. "What can we learn privately?" SIAM J. Comput., vol. 40, no. 3, pp. 793--826, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Warner, S. L. 1965. "Randomized response: A survey technique for eliminating evasive answer bias," Journal of the American Statistical Association, vol. 60, no. 309, pp. 63--69, 1965.Google ScholarGoogle ScholarCross RefCross Ref
  4. Erdos, P. and Renyi, A. 1960. "On the evolution of random graphs," in Publication of the Mathematical Institute of the HungarianAcademy of Sciences, 1960, pp. 17--61.Google ScholarGoogle Scholar
  5. Aiello, W., Chung, F. R. K., and Lu, L. 2000. "A random graph mo-del for massive graphs," in Proceedings of the Thirty-SecondAnnual ACM Symposium on Theory of Computing, May 21-23, 2000, Portland, OR, USA, 2000, pp. 171--180. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Leskovec, J., Chakrabarti, D., Kleinberg, J. M., Faloutsos, C., and Ghahramani, Z. 2010. "Kronecker graphs: An approach to modeling networks," Journal of Machine Learning Research, vol. 11, pp. 985--1042, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Pfeiffer, J. J., Moreno, S., Fond, T. L., Neville, J., and Gallagher, B. 2014. "Attributed graph models: modeling network structure with correlated attributes," in 23rd International World Wide Web Conference, WWW'14, Seoul, Republic of Korea, April 7-11, 2014, 2014, pp. 831--842. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Mir, D. J., andWright, R. N. 2012. "A differentially private estimator for the stochastic kronecker graph model," in Proceedingsof the 2012 Joint EDBT/ICDT Workshops, Berlin, Germany, March 30, pp. 167--176. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Jorgensen, Z., Yu, T., and Cormode, G. 2016. "Publishing attributed social graphs with formal privacy guarantees," in Proceedingof the 2016 International Conference on Management of Data, SIGMOD Conference 2016, San Francisco, CA, USA, Ju-ne 26 - July 01, 2016, 2016, pp. 107--122. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Qin, Z., Yang, Y., Yu, T., Khalil, I., Xiao, X., and Ren, K. 2016. "Heavy hitter estimation over set-valued data with local differential privacy," in Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security. ACM, pp. 192--203. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Qin, Z., Yu, T., Yang, Y., Khalil, I., Xiao, X., and Ren K., 2017. "Generating synthetic decentralized social graphs with local differential privacy," in Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, CCS 2017, Dallas, TX, USA, October 30 - November 03, 2017, 2017, pp. 425--438. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Dwork, C., Mcsherry, F., and Nissim, K. 2006. Calibrating Noise to Sensitivity in Private Data Analysis. Springer Berlin Heidelberg, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Mcsherry, F. D. 2010. "Privacy integrated queries: an extensible platform for privacy-preserving data analysis." Communications of the Acm, vol. 53, no. 9, pp. 89--97, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Wang, T., Blocki, J., Li, N., and Jha, S. 2017. "Locally differentially private protocols for frequency estimation," 2017. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Gheid, Z., and Challal, Y. 2016. "Efficient and privacy-preserving k-means clustering for big data mining," in Trustcom/BigDataSE/ISPA, 2016 IEEE. IEEE, 2016, pp. 791--798.Google ScholarGoogle Scholar
  16. "Stanford Large Network Dataset Collection." {Online}. Available: http://snap.stanford.edu/data/Google ScholarGoogle Scholar

Index Terms

  1. A Two-Phase Algorithm for Generating Synthetic Graph Under Local Differential Privacy

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Other conferences
      ICCNS '18: Proceedings of the 8th International Conference on Communication and Network Security
      November 2018
      166 pages
      ISBN:9781450365673
      DOI:10.1145/3290480

      Copyright © 2018 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 2 November 2018

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article
      • Research
      • Refereed limited

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader