A Secure Multi-Party Computation Protocol for Graph Editing Distance against Malicious Attacks
Mathematics · 01.12.2023 · 11 (23) · 4847
DOI: 10.3390/math11234847 ↗Kurz gefasst
Studienprotokoll in der Zeitschrift Mathematics, online erschienen am 01.12.2023. Verfasst von Xin Liu und 6 weiteren Autor:innen. Die Arbeit wurde bisher 4-mal zitiert (Crossref) und nennt 31 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: National Natural Science Foundation of China, Inner Mongolia Natural Science Foundation, 2023 Inner Mongolia Young Science and Technology Talents Support Project.
Abstract (Originalsprache)
The secure computation of the graph structure is an important element in the field of secure calculation of graphs, which is important in querying data in graphs, since there are no algorithms for the graph edit distance problem that can resist attacks by malicious adversaries. In this paper, for the problem of secure computation of similarity edit distance of graphs, firstly, the encoding method applicable to the Paillier encryption algorithm is proposed, and the XOR operation scheme is proposed according to the Paillier homomorphic encryption algorithm. Then, the security algorithm under the semi-honest model is designed, which adopts the new encoding method and the XOR operation scheme. Finally, for the malicious behaviors that may be implemented by malicious participants in the semi-honest algorithm, using the hash function, a algorithm for secure computation of graph editing distance under the malicious model is designed, and the security of the algorithm is proved, and the computational complexity and the communication complexity of the algorithm are analyzed, which is more efficient compared with the existing schemes, and has practical value. The algorithm designed in this paper fills the research gap in the existing literature on the problem of graph edit distance and contributes to solving the problem.
Förderung
- National Natural Science Foundation of China
- Inner Mongolia Natural Science Foundation
- 2023 Inner Mongolia Young Science and Technology Talents Support Project
- 2022 Basic Scientific Research Project of Direct Universities of Inner Mongolia
- 2022 Fund Project of Central Government Guiding Local Science and Technology Development
- 2022 Chinese Academy of Sciences “Western Light” Talent Training Program “Western Young Scholars” Project
- Open Foundation of State key Laboratory of Networking and Switching Technology (Beijing University of Posts and Telecommunications)
- Inner Mongolia Discipline Inspection and Supervision Big Data Laboratory Open Project Fund
Zitieren
APA
Liu, X., Kong, J., Peng, L., Luo, D., Xu, G., Chen, X., & Liu, X. (2023). A Secure Multi-Party Computation Protocol for Graph Editing Distance against Malicious Attacks. Mathematics, 11(23), 4847. https://doi.org/10.3390/math11234847
Vancouver
Liu X, Kong J, Peng L, Luo D, Xu G, Chen X, et al. A Secure Multi-Party Computation Protocol for Graph Editing Distance against Malicious Attacks. Mathematics. 2023;11(23):4847. doi:10.3390/math11234847
BibTeX
@article{Liu2023,
author = {Liu, Xin and Kong, Jianwei and Peng, Lu and Luo, Dan and Xu, Gang and Chen, Xiubo and Liu, Xiaomeng},
title = {A Secure Multi-Party Computation Protocol for Graph Editing Distance against Malicious Attacks},
journal = {Mathematics},
year = {2023},
volume = {11},
number = {23},
pages = {4847},
doi = {10.3390/math11234847}
}
EUVIMED