Dual-Cloud Collaborative Graph Edit Distance Secure Computation Protocol
Mathematical Modeling and Algorithm Application · 23.03.2026 · 8 (3) · 8-17
DOI: 10.54097/1yzx3y42 ↗Kurz gefasst
Studienprotokoll in der Zeitschrift Mathematical Modeling and Algorithm Application, online erschienen am 23.03.2026. Verfasst von Yufeng Wang. Der Volltext ist frei zugänglich (Open Access, CC BY-NC 4.0).
Abstract (Originalsprache)
To address the challenge of securely computing graph edit distance in directed graph scenarios without compromising parties' privacy data, this paper proposes a homomorphic encryption-based, dual-cloud-assisted secure graph edit distance computation protocol. The protocol encodes graph structures as adjacency matrices and introduces random parity noise to protect the original data's parity. It then leverages homomorphic encryption to compute edit distance in ciphertext form. Employing a dual-cloud server architecture, the protocol offloads most computational tasks to the cloud, eliminating direct interaction between data users. This approach enhances computational efficiency while ensuring privacy security. Theoretical analysis and simulation experiments demonstrate the protocol's security under a semi-honest model, with superior user-side computational overhead compared to existing solutions.
Zitieren
APA
Wang, Y. (2026). Dual-Cloud Collaborative Graph Edit Distance Secure Computation Protocol. Mathematical Modeling and Algorithm Application, 8(3), 8-17. https://doi.org/10.54097/1yzx3y42
Vancouver
Wang Y. Dual-Cloud Collaborative Graph Edit Distance Secure Computation Protocol. Mathematical Modeling and Algorithm Application. 2026;8(3):8-17. doi:10.54097/1yzx3y42
BibTeX
@article{Wang2026,
author = {Wang, Yufeng},
title = {Dual-Cloud Collaborative Graph Edit Distance Secure Computation Protocol},
journal = {Mathematical Modeling and Algorithm Application},
year = {2026},
volume = {8},
number = {3},
pages = {8--17},
doi = {10.54097/1yzx3y42}
}
EUVIMED