Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
169 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Crypto'Graph: Leveraging Privacy-Preserving Distributed Link Prediction for Robust Graph Learning (2309.10890v1)

Published 19 Sep 2023 in cs.CR, cs.LG, and cs.SI

Abstract: Graphs are a widely used data structure for collecting and analyzing relational data. However, when the graph structure is distributed across several parties, its analysis is particularly challenging. In particular, due to the sensitivity of the data each party might want to keep their partial knowledge of the graph private, while still willing to collaborate with the other parties for tasks of mutual benefit, such as data curation or the removal of poisoned data. To address this challenge, we propose Crypto'Graph, an efficient protocol for privacy-preserving link prediction on distributed graphs. More precisely, it allows parties partially sharing a graph with distributed links to infer the likelihood of formation of new links in the future. Through the use of cryptographic primitives, Crypto'Graph is able to compute the likelihood of these new links on the joint network without revealing the structure of the private individual graph of each party, even though they know the number of nodes they have, since they share the same graph but not the same links. Crypto'Graph improves on previous works by enabling the computation of a certain number of similarity metrics without any additional cost. The use of Crypto'Graph is illustrated for defense against graph poisoning attacks, in which it is possible to identify potential adversarial links without compromising the privacy of the graphs of individual parties. The effectiveness of Crypto'Graph in mitigating graph poisoning attacks and achieving high prediction accuracy on a graph neural network node classification task is demonstrated through extensive experimentation on a real-world dataset.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (42)
  1. SEC 2: Recommended Elliptic Curve Domain Parameters, 2010.
  2. Friends and neighbors on the web. Social Networks, 25(3):211–230, 2003. URL: https://www.sciencedirect.com/science/article/pii/S0378873303000091, doi:10.1016/S0378-8733(03)00009-1.
  3. Uncovering chains of infections through spatio-temporal and visual analysis of covid-19 contact traces. Computers & Graphics, 106:1–8, 2022.
  4. Secure approximation of edit distance on genomic data. BMC Medical Genomics, 10, 07 2017. doi:10.1186/s12920-017-0279-9.
  5. The one-more-rsa-inversion problems and the security of chaum’s blind signature scheme. Journal of Cryptology, 16:185–215, 2003.
  6. Fast and private computation of cardinality of set intersection and union. In International Conference on Cryptology and Network Security, pages 218–231. Springer, 2012.
  7. Provably secure fair mutual private set intersection cardinality utilizing bloom filter. In Kefei Chen, Dongdai Lin, and Moti Yung, editors, Information Security and Cryptology, pages 505–525, Cham, 2017. Springer International Publishing.
  8. Post-quantum protocol for computing set intersection cardinality with linear complexity. IET Information Security, 14(6):661–669, 2020. URL: https://ietresearch.onlinelibrary.wiley.com/doi/abs/10.1049/iet-ifs.2019.0315, arXiv:https://ietresearch.onlinelibrary.wiley.com/doi/pdf/10.1049/iet-ifs.2019.0315, doi:10.1049/iet-ifs.2019.0315.
  9. Privacy-preserving link prediction. In Joaquin Garcia-Alfaro, Guillermo Navarro-Arribas, and Nicola Dragoni, editors, Data Privacy Management, Cryptocurrencies and Blockchain Technology, pages 35–50, Cham, 2023. Springer International Publishing.
  10. New directions in cryptography. IEEE Transactions on Information Theory, 22(6):644–654, 1976. doi:10.1109/TIT.1976.1055638.
  11. Approximating private set union/intersection cardinality with logarithmic complexity. IEEE Transactions on Information Forensics and Security, 12(11):2792–2806, 2017. doi:10.1109/TIFS.2017.2721360.
  12. Efficient private matching and set intersection. In Christian Cachin and Jan L. Camenisch, editors, Advances in Cryptology - EUROCRYPT 2004, pages 1–19, Berlin, Heidelberg, 2004. Springer Berlin Heidelberg.
  13. Node2vec: Scalable feature learning for networks. In Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD ’16, page 855–864, New York, NY, USA, 2016. Association for Computing Machinery. doi:10.1145/2939672.2939754.
  14. On deploying secure computing: Private intersection-sum-with-cardinality. In 2020 IEEE European Symposium on Security and Privacy (EuroS&P), pages 370–389, 2020. doi:10.1109/EuroSP48549.2020.00031.
  15. Paul Jaccard. Etude de la distribution florale dans une portion des alpes et du jura. Bulletin de la Societe Vaudoise des Sciences Naturelles, 1901.
  16. A parameterized probabilistic model of network evolution for supervised link prediction. In Sixth International Conference on Data Mining (ICDM’06), pages 340–349, 2006. doi:10.1109/ICDM.2006.8.
  17. Semi-supervised classification with graph convolutional networks. In 5th International Conference on Learning Representations, ICLR 2017, Toulon, France, April 24-26, 2017, Conference Track Proceedings. OpenReview.net, 2017. URL: https://openreview.net/forum?id=SJU4ayYgl.
  18. The link prediction problem for social networks. In Proceedings of the Twelfth International Conference on Information and Knowledge Management, CIKM ’03, page 556–559, New York, NY, USA, 2003. Association for Computing Machinery. doi:10.1145/956863.956972.
  19. Efficient and privacy-preserving ad conversion for v2x-assisted proximity marketing. In 2018 IEEE 15th International Conference on Mobile Ad Hoc and Sensor Systems (MASS), pages 10–18, 2018. doi:10.1109/MASS.2018.00014.
  20. Unbalanced private set intersection cardinality protocol with low communication cost. Future Generation Computer Systems, 102:1054–1061, 2020. URL: https://www.sciencedirect.com/science/article/pii/S0167739X19316413, doi:10.1016/j.future.2019.09.022.
  21. Efficient estimation of word representations in vector space. In Yoshua Bengio and Yann LeCun, editors, 1st International Conference on Learning Representations, ICLR 2013, Scottsdale, Arizona, USA, May 2-4, 2013, Workshop Track Proceedings, 2013. URL: http://arxiv.org/abs/1301.3781.
  22. Privacy-preserving integration of medical data: a practical multiparty private set intersection. Journal of medical systems, 41:1–10, 2017.
  23. Private set intersection: A systematic literature review. Computer Science Review, 49:100567, 2023. URL: https://www.sciencedirect.com/science/article/pii/S1574013723000345, doi:10.1016/j.cosrev.2023.100567.
  24. BotGrep: Finding P2P bots with structured graph analysis. In 19th USENIX Security Symposium (USENIX Security 10), Washington, DC, August 2010. USENIX Association. URL: https://www.usenix.org/conference/usenixsecurity10/botgrep-finding-p2p-bots-structured-graph-analysis.
  25. M. E. J. Newman. Clustering and preferential attachment in growing networks. Phys. Rev. E, 64:025102, Jul 2001. doi:10.1103/PhysRevE.64.025102.
  26. Secure association rule mining on vertically partitioned data using private-set intersection. IEEE Access, 8:144458–144467, 2020. doi:10.1109/ACCESS.2020.3014330.
  27. Using graph theory to analyze biological networks. BioData mining, 4:1–27, 2011.
  28. Deepwalk: Online learning of social representations. In Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD ’14, page 701–710, New York, NY, USA, 2014. Association for Computing Machinery. doi:10.1145/2623330.2623732.
  29. Amanda Cristina Davi Resende and Diego F. Aranha. Faster unbalanced private set intersection. In Financial Cryptography, volume 10957, pages 203–221. Springer, 2018.
  30. The network data repository with interactive graph analytics and visualization. In AAAI, 2015. URL: https://networkrepository.com.
  31. New approach to set representation and practical private set-intersection protocols. IEEE Access, 7:64897–64906, 2019. doi:10.1109/ACCESS.2019.2917057.
  32. The graph neural network model. IEEE Transactions on Neural Networks, 20(1):61–80, 2009. doi:10.1109/TNN.2008.2005605.
  33. Efficient and private set intersection of human genomes. In 2018 IEEE International Conference on Bioinformatics and Biomedicine (BIBM), pages 761–764, 2018. doi:10.1109/BIBM.2018.8621291.
  34. Amit Singhal. Modern information retrieval: A brief overview. Bulletin of the IEEE Computer Society Technical Committee on Data Engineering, 2001.
  35. User interactions in social networks and their implications. In Proceedings of the 4th ACM European Conference on Computer Systems, EuroSys ’09, page 205–218, New York, NY, USA, 2009. Association for Computing Machinery. doi:10.1145/1519065.1519089.
  36. Adversarial examples for graph data: Deep insights into attack and defense. In Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, IJCAI-19, pages 4816–4823. International Joint Conferences on Artificial Intelligence Organization, 7 2019. doi:10.24963/ijcai.2019/669.
  37. Edog: Adversarial edge detection for graph neural networks. In 2023 IEEE Conference on Secure and Trustworthy Machine Learning (SaTML), pages 291–305, 2023. doi:10.1109/SaTML54575.2023.00027.
  38. Privacy-preserving link prediction in multiple private networks. IEEE Transactions on Computational Social Systems, 10(2):538–550, 2023. doi:10.1109/TCSS.2022.3168010.
  39. Link prediction based on graph neural networks. In Proceedings of the 32nd International Conference on Neural Information Processing Systems, NIPS’18, page 5171–5181, Red Hook, NY, USA, 2018. Curran Associates Inc.
  40. Privacy-preserving link prediction in decentralized online social networks. In Günther Pernul, Peter Y A Ryan, and Edgar Weippl, editors, Computer Security – ESORICS 2015, pages 61–80, Cham, 2015. Springer International Publishing.
  41. Adversarial attacks on neural networks for graph data. In Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, KDD ’18, page 2847–2856, New York, NY, USA, 2018. Association for Computing Machinery. doi:10.1145/3219819.3220078.
  42. Adversarial attacks on graph neural networks via meta learning. In 7th International Conference on Learning Representations, ICLR 2019, New Orleans, LA, USA, May 6-9, 2019. OpenReview.net, 2019. URL: https://openreview.net/forum?id=Bylnx209YX.
Citations (1)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

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