Papers
Topics
Authors
Recent
Search
2000 character limit reached

K-stars LDP: A Novel Framework for (p, q)-clique Enumeration under Local Differential Privacy

Published 4 Mar 2024 in cs.CR, cs.CY, and cs.DS | (2403.01788v1)

Abstract: (p,q)-clique enumeration on a bipartite graph is critical for calculating clustering coefficient and detecting densest subgraph. It is necessary to carry out subgraph enumeration while protecting users' privacy from any potential attacker as the count of subgraph may contain sensitive information. Most recent studies focus on the privacy protection algorithms based on edge LDP (Local Differential Privacy). However, these algorithms suffer a large estimation error due to the great amount of required noise. In this paper, we propose a novel idea of k-stars LDP and a novel k-stars LDP algorithm for (p, q)-clique enumeration with a small estimation error, where a k-stars is a star-shaped graph with k nodes connecting to one node. The effectiveness of edge LDP relies on its capacity to obfuscate the existence of an edge between the user and his one-hop neighbors. This is based on the premise that a user should be aware of the existence of his one-hop neighbors. Similarly, we can apply this premise to k-stars as well, where an edge is a specific genre of 1-stars. Based on this fact, we first propose the k-stars neighboring list to enable our algorithm to obfuscate the existence of k-stars with Warner' s RR. Then, we propose the absolute value correction technique and the k-stars sampling technique to further reduce the estimation error. Finally, with the two-round user-collector interaction mechanism, we propose our k-stars LDP algorithm to count the number of (p, q)-clique while successfully protecting users' privacy. Both the theoretical analysis and experiments have showed the superiority of our algorithm over the algorithms based on edge LDP.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (39)
  1. K. Wang, W. Zhang, X. Lin, Y. Zhang, L. Qin, and Y. Zhang, “Efficient and effective community search on large-scale bipartite graphs,” in 2021 IEEE 37th International Conference on Data Engineering (ICDE).   IEEE, 2021, pp. 85–96.
  2. K. Wang, W. Zhang, Y. Zhang, L. Qin, and Y. Zhang, “Discovering significant communities on bipartite graphs: An index-based approach,” IEEE Transactions on Knowledge and Data Engineering, 2021.
  3. K. Wang, X. Lin, L. Qin, W. Zhang, and Y. Zhang, “Towards efficient solutions of bitruss decomposition for large-scale bipartite graphs,” The VLDB Journal, vol. 31, no. 2, pp. 203–226, 2022.
  4. J. Yang, Y. Peng, and W. Zhang, “(p, q)-biclique counting and enumeration for large sparse bipartite graphs,” Proceedings of the VLDB Endowment, vol. 15, no. 2, pp. 141–153, 2021.
  5. J. Imola, T. Murakami, and K. Chaudhuri, “Locally differentially private analysis of graph statistics,” in 30th USENIX Security Symposium (USENIX Security 21), 2021, pp. 983–1000.
  6. C. Dwork, “Differential privacy: A survey of results,” in International conference on theory and applications of models of computation.   Springer, 2008, pp. 1–19.
  7. X. Ding, S. Sheng, H. Zhou, X. Zhang, Z. Bao, P. Zhou, and H. Jin, “Differentially private triangle counting in large graphs,” IEEE Transactions on Knowledge and Data Engineering, 2021.
  8. J. Ficek, W. Wang, H. Chen, G. Dagne, and E. Daley, “Differential privacy in health research: A scoping review,” Journal of the American Medical Informatics Association, vol. 28, no. 10, pp. 2269–2276, 2021.
  9. Y. Zhao and J. Chen, “A survey on differential privacy for unstructured data content,” ACM Computing Surveys (CSUR), 2022.
  10. A. Girgis, D. Data, S. Diggavi, P. Kairouz, and A. T. Suresh, “Shuffled model of differential privacy in federated learning,” in International Conference on Artificial Intelligence and Statistics.   PMLR, 2021, pp. 2521–2529.
  11. X. Bi and X. Shen, “Distribution-invariant differential privacy,” Journal of Econometrics, 2022.
  12. V. Karwa, S. Raskhodnikova, A. Smith, and G. Yaroslavtsev, “Private analysis of graph structure,” Proceedings of the VLDB Endowment, vol. 4, no. 11, pp. 1146–1157, 2011.
  13. M. Bi, Y. Wang, Z. Cai, and X. Tong, “A privacy-preserving mechanism based on local differential privacy in edge computing,” China Communications, vol. 17, no. 9, pp. 50–65, 2020.
  14. Q. Ye, H. Hu, M. H. Au, X. Meng, and X. Xiao, “Lf-gdpr: A framework for estimating graph metrics with local differential privacy,” IEEE Transactions on Knowledge and Data Engineering, 2020.
  15. B. Bebensee, “Local differential privacy: a tutorial,” arXiv preprint arXiv:1907.11908, 2019.
  16. S. Hidano and T. Murakami, “Degree-preserving randomized response for graph neural networks under local differential privacy,” arXiv preprint arXiv:2202.10209, 2022.
  17. M. Yang, L. Lyu, J. Zhao, T. Zhu, and K.-Y. Lam, “Local differential privacy and its applications: A comprehensive survey,” arXiv preprint arXiv:2008.03686, 2020.
  18. S. P. Kasiviswanathan, H. K. Lee, K. Nissim, S. Raskhodnikova, and A. Smith, “What can we learn privately?” SIAM Journal on Computing, vol. 40, no. 3, pp. 793–826, 2011.
  19. J. Imola, T. Murakami, and K. Chaudhuri, “{{\{{Communication-Efficient}}\}} triangle counting under local differential privacy,” in 31st USENIX Security Symposium (USENIX Security 22), 2022, pp. 537–554.
  20. S. L. Warner, “Randomized response: A survey technique for eliminating evasive answer bias,” Journal of the American Statistical Association, vol. 60, no. 309, pp. 63–69, 1965.
  21. S. Arifuzzaman, M. Khan, and M. Marathe, “Patric: A parallel algorithm for counting triangles in massive networks,” in Proceedings of the 22nd ACM international conference on Information & Knowledge Management, 2013, pp. 529–538.
  22. S. K. Bera and C. Seshadhri, “How the degeneracy helps for triangle counting in graph streams,” in Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2020, pp. 457–467.
  23. ——, “How to count triangles, without seeing the whole graph,” in Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, 2020, pp. 306–316.
  24. T. Eden, A. Levi, D. Ron, and C. Seshadhri, “Approximately counting triangles in sublinear time,” SIAM Journal on Computing, vol. 46, no. 5, pp. 1603–1646, 2017.
  25. S. Chu and J. Cheng, “Triangle listing in massive networks and its applications,” in Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining, 2011, pp. 672–680.
  26. A. Atminas, V. V. Lozin, and I. Razgon, “Linear time algorithm for computing a small biclique in graphs without long induced paths,” in Scandinavian Workshop on Algorithm Theory.   Springer, 2012, pp. 142–152.
  27. M. Dawande, P. Keskinocak, and S. Tayur, “On the biclique problem in bipartite graphs,” Pittsburgh: GSIA Working Paper: Carnegie Mellon University, 1996.
  28. L. Chen, C. Liu, R. Zhou, J. Xu, and J. Li, “Efficient maximal biclique enumeration for large sparse bipartite graphs,” Proceedings of the VLDB Endowment, vol. 15, no. 8, pp. 1559–1571, 2022.
  29. Y. Lu, C. A. Phillips, and M. A. Langston, “Biclique: an r package for maximal biclique enumeration in bipartite graphs,” BMC research notes, vol. 13, no. 1, pp. 1–5, 2020.
  30. C. E. Tsourakakis, U. Kang, G. L. Miller, and C. Faloutsos, “Doulion: counting triangles in massive graphs with a coin,” in Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining, 2009, pp. 837–846.
  31. B. Wu, K. Yi, and Z. Li, “Counting triangles in large graphs by random sampling,” IEEE Transactions on Knowledge and Data Engineering, vol. 28, no. 8, pp. 2013–2026, 2016.
  32. X. Chen, S. Mauw, and Y. Ramírez-Cruz, “Publishing community-preserving attributed social graphs with a differential privacy guarantee,” arXiv preprint arXiv:1909.00280, 2019.
  33. W.-Y. Day, N. Li, and M. Lyu, “Publishing graph degree distribution with node differential privacy,” in Proceedings of the 2016 International Conference on Management of Data, 2016, pp. 123–138.
  34. S. P. Kasiviswanathan, K. Nissim, S. Raskhodnikova, and A. Smith, “Analyzing graphs with node differential privacy,” in Theory of Cryptography Conference.   Springer, 2013, pp. 457–476.
  35. J. Zhang, G. Cormode, C. M. Procopiuc, D. Srivastava, and X. Xiao, “Private release of graph statistics using ladder functions,” in Proceedings of the 2015 ACM SIGMOD international conference on management of data, 2015, pp. 731–745.
  36. Q. Ye, H. Hu, M. H. Au, X. Meng, and X. Xiao, “Towards locally differentially private generic graph metric estimation,” in 2020 IEEE 36th International Conference on Data Engineering (ICDE).   IEEE, 2020, pp. 1922–1925.
  37. H. Sun, X. Xiao, I. Khalil, Y. Yang, Z. Qin, H. Wang, and T. Yu, “Analyzing subgraph statistics from extended local views with decentralized differential privacy,” in Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, 2019, pp. 703–717.
  38. M. Hay, C. Li, G. Miklau, and D. Jensen, “Accurate estimation of the degree distribution of private networks,” in 2009 Ninth IEEE International Conference on Data Mining.   IEEE, 2009, pp. 169–178.
  39. H. Zhang, S. Latif, R. Bassily, and A. Rountev, “Differentially-private control-flow node coverage for software usage analysis,” in USENIX Security Symposium (USENIX Security), 2020.

Summary

No one has generated a summary of this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Sign Up to Summarize

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Generate Now

Collections

Sign up for free to add this paper to one or more collections.

User Circle Single Streamline Icon: https://streamlinehq.com Sign Up