Zapiski Nauchnykh Seminarov POMI
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Zap. Nauchn. Sem. POMI:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Zapiski Nauchnykh Seminarov POMI, 2023, Volume 530, Pages 113–127 (Mi znsl7436)  

This article is cited in 1 scientific paper (total in 1 paper)

A study of graph neural networks for link prediction on vulnerability to membership attacks

D. Shaikhelislamovabc, K. Lukyanovabd, N. Severinc, M. Drobyshevskiyabd, I. Makarovacd, D. Turdakovacd

a Ivannikov Institute for System Programming of the Russian Academy of Sciences, Moscow, Russia
b Moscow Institute of Physics and Technology (National Research University), Moscow, Russia
c HSE University, Moscow, Russia
d ISP RAS Research Center for Trusted Artificial Intelligence, Moscow, Russia
References:
Abstract: Graph neural networks (GNNs) have shown great promise in a variety of tasks involving graph data, including recommendation systems. However, as GNNs become more widely adopted in practical applications, concerns have arisen about their vulnerability to adversarial attacks. These attacks can lead to biased recommendations, potentially causing economic losses and safety risks. In this work, we consider an industrial application of recommendation systems for transport logistics and study their vulnerability to membership inference attacks. The dataset represents real train flows in Russia, published in the ETIS project. Experiments with three popular GNN architectures show that all of them can be successfully attacked even when the adversary has minimal background knowledge. Specifically, an attacker with access to only 1-2% of the actual data can successfully train their own GNN model to infer the membership of a shipper-consignee association in the training set with an accuracy over 94%. Our study also confirms that overfitting is the primary factor that influences the attack performance of recommendation systems.
Key words and phrases: membership inference attacks, recommendation systems, graph neural networks.
Funding agency Grant number
Ministry of Science and Higher Education of the Russian Federation
The work of Ilya Makarov on Section 2 was prepared in the framework of the strategic project “Digital Business” within the Strategic Academic Leadership Program “Priority 2030” at NUST MISiS.
Received: 06.09.2023
English version:
Journal of Mathematical Sciences (New York), 2024, Volume 285, Issue 2, Pages 234–244
DOI: https://doi.org/10.1007/s10958-024-07429-x
Document Type: Article
UDC: 004.852
Language: English
Citation: D. Shaikhelislamov, K. Lukyanov, N. Severin, M. Drobyshevskiy, I. Makarov, D. Turdakov, “A study of graph neural networks for link prediction on vulnerability to membership attacks”, Investigations on applied mathematics and informatics. Part II–2, Zap. Nauchn. Sem. POMI, 530, POMI, St. Petersburg, 2023, 113–127; J. Math. Sci. (N. Y.), 285:2 (2024), 234–244
Citation in format AMSBIB
\Bibitem{ShaLukSev23}
\by D.~Shaikhelislamov, K.~Lukyanov, N.~Severin, M.~Drobyshevskiy, I.~Makarov, D.~Turdakov
\paper A study of graph neural networks for link prediction on vulnerability to membership attacks
\inbook Investigations on applied mathematics and informatics. Part~II--2
\serial Zap. Nauchn. Sem. POMI
\yr 2023
\vol 530
\pages 113--127
\publ POMI
\publaddr St.~Petersburg
\mathnet{http://mi.mathnet.ru/znsl7436}
\transl
\jour J. Math. Sci. (N. Y.)
\yr 2024
\vol 285
\issue 2
\pages 234--244
\crossref{https://doi.org/10.1007/s10958-024-07429-x}
Linking options:
  • https://www.mathnet.ru/eng/znsl7436
  • https://www.mathnet.ru/eng/znsl/v530/p113
  • This publication is cited in the following 1 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Çàïèñêè íàó÷íûõ ñåìèíàðîâ ÏÎÌÈ
    Statistics & downloads:
    Abstract page:520
    Full-text PDF :217
    References:132
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2026