Skip to main content

PU_Bpub: High-Dimensional Data Release Mechanism Based on Spectral Clustering with Local Differential Privacy

  • Conference paper
  • First Online:
Wireless Algorithms, Systems, and Applications (WASA 2022)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 13472))

  • 1214 Accesses

Abstract

Although the release and analysis of high-dimensional data bring tremendous value to people, it causes great hidden danger to participants’ privacy in the meantime. Various privacy protection methods based on differential privacy have been proposed at present. However, most of them cannot simultaneously solve the problems of high computational overhead and privacy threats from untrusted servers caused by the curse of high dimensionality. Therefore, we propose a safer and more effective high-dimensional data release algorithm based on local differential privacy, which is referred to as PU_Bpub. It effectively preserves the dimensional correlation of the original high-dimensional data and reduces the communication overhead of synthetic data. Extensive experiments on real-world datasets demonstrate that our solution substantially outperforms the state-of-the-art techniques in terms of computational overhead, and the synthetic dataset has high utility.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Ye, Q.Q., Meng, X.F., Zhu, M.J., et al.: Survey on local differential privacy. J. Soft. 29, 159–183 (2018)

    MathSciNet  Google Scholar 

  2. Dwork, C.: Differential privacy in new settings. In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 174–183. SIAM (2010)

    Google Scholar 

  3. Wang, N., Xiao, X.K., Yang, Y., et al.: PrivTrie: effective frequent term discovery under local differential privacy. In: Proceedings of IEEE ICDE, Piscataway, pp. 821–832. IEEE (2018)

    Google Scholar 

  4. Zhang, X., Chen, L., Jin, K., et al.: Private high-dimensional data publication with junction tree. J. Comput. Res. Dev. 55(12), 2794–2809 (2018)

    Google Scholar 

  5. Hardt, M., Roth, A.: Beyond worst-case analysis in private singular vector computation. In: Proceedings of the Forty-fifth Annual ACM Symposium on Theory of Computing, New York, USA, pp. 331–340. ACM (2013)

    Google Scholar 

  6. Chaudhuri, K., Sarwate, A.D., Sinha, K.: A nearoptimal algorithm for differentially-private principal components. J. Mach. Learn. Res. 14(1), 2905–2943 (2013)

    MathSciNet  MATH  Google Scholar 

  7. Peng, C., Zhao, Y., Fan, M.: A differential private data publishing algorithm via principal component analysis based on maximum information coefficient. Netinfo Secur. 20(2), 37–48 (2020)

    Google Scholar 

  8. Sun, H., Yang, J., Cheng, X., et al.: A high-dimensional numeric data collection algorithm for local difference privacy based on random projection. Big Data Res. 6(01), 3–11 (2020)

    Google Scholar 

  9. Zhang, J., Cormode, G., Procopiuc, C.M., et al.: PrivBayes: private data release via Bayesian networks. In: Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data, New York, USA, pp. 1423–1434 (2014)

    Google Scholar 

  10. Ren, X.B., Yu, C.-M., Yu, W.R., et al.: LoPub: high-dimensional crowdsourced data publication with local differential privacy. IEEE Trans. Inf. Forensic Secur. 13, 2151–2166 (2018)

    Article  Google Scholar 

  11. Wang, T., Yang, X., Ren, X., Yu, W., Yang, S.: Local private high-dimensional crowdsourced data release based on copula functions. IEEE Trans. Serv. Comput. 15(2), 778–792 (2019)

    Article  Google Scholar 

  12. Min, X., Bolin, D., Tianhao, W., et al.: Collecting and analyzing data jointly from multiple services under local differential privacy. Proc. VLDB Endowmen. 13(11), 2760–2772 (2020)

    Google Scholar 

Download references

Acknowledgement

This paper is supported by Inner Mongolia Natural Science Foundation (Grant No. 2018MS06026) and the Science and Technology Program of Inner Mongolia Autonomous Region (Grant No. 2019GG116).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Xuebin Ma .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Lin, A., Ma, X. (2022). PU_Bpub: High-Dimensional Data Release Mechanism Based on Spectral Clustering with Local Differential Privacy. In: Wang, L., Segal, M., Chen, J., Qiu, T. (eds) Wireless Algorithms, Systems, and Applications. WASA 2022. Lecture Notes in Computer Science, vol 13472. Springer, Cham. https://doi.org/10.1007/978-3-031-19214-2_48

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-19214-2_48

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-19213-5

  • Online ISBN: 978-3-031-19214-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics