EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

DFB-PPGSQ: Dynamic Forward-Private and Epochal Backward-Private Graph Similarity Matching Query over Encrypted Sensor Graph Databases

Huiying Hou iD, Yucong Ma, Zisu Zhao, Xinrui Ge iD

Sensors · 28.07.2026 · 26 (15) · 4804

DOI: 10.3390/s26154804 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Sensors, online erschienen am 28.07.2026. Verfasst von Huiying Hou und 3 weiteren Autor:innen. Beteiligte Einrichtung: The Key Laboratory of Grain Information Processing and Control, Henan University of Technology, Zhengzhou 450001, China. Die Arbeit nennt 33 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: National Natural Science Foundation of China, Henan Provincial Key Scientific and Technological Project, Zhengzhou Municipal R&D Special Fund-Supported Research Project.

AbstractSchlagwörterBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

In applications pertaining to sensor network, the Internet of Things, industrial monitoring, and cyber–physical security, graphs are increasingly being outsourced to clouds, where similarity search should be supported without exposing graph content, query graphs, update contents, or database evolution. Existing privacy-preserving graph similarity schemes mainly target static encrypted databases, and as such struggle to handle insertions, deletions, label updates, and long-running index maintenance. This paper proposes DFB-PPGSQ, a dynamic forward-private and epochal backward-private graph similarity matching scheme that moves branch-based lower-bound filtering into a structured encryption framework. DFB-PPGSQ uses epoch-local feature tokens, per-record occurrence handles, one-time update labels, update buffers, deletion tombstones, and shuffle-based branch–tree re-randomization to preserve pruning efficiency while making same-epoch tombstone, traversal, size, timing, and refresh leakage explicit. We formalize the system model, leakage functions, algorithms, and security interpretation, then implement a reproducible Python prototype with HMAC-SHA256 token generation and multi-profile dynamic sensor-topology workloads. Across five random seeds, DFB-PPGSQ keeps server-side filtering latency close to the static branch–tree baseline (46.60 ms versus 44.72 ms at 4000 graphs), avoids immediate full-rebuild updates (0.091 ms insertion and 0.092 ms label update), and keeps metadata-assisted cross-epoch token linkage below 5.6% attack success after refresh in additional industrial and campus IoT stress workloads. Storage, communication, exact GED refinement, side-channel hardening, and verifiable-result protection are treated as deployment costs and limitations rather than being included in the headline latency.

Schlagwörter

Stichwörter der Autor:innen

IoT securitydynamic graph updateencrypted graph databaseepochal backward privacyforward privacygraph similarity matchingsearchable encryptionsensor cloudstructured encryption

Autor:innen und Institutionen

  • The Key Laboratory of Grain Information Processing and Control, Henan University of Technology, Zhengzhou 450001, China.
  • The School of Artificial Intelligence and Big Data, Henan University of Technology, Zhengzhou 450001, China.
  • Henan Province Key Laboratory of Cyberspace Situation Awareness, Zhengzhou Institute of Information Science and Technology, Zhengzhou 450001, China.
  • School of Computer Science and Technology, Qingdao University, Qingdao 266071, China.

ORCID-Profile: Huiying Hou, Xinrui Ge

Förderung

  • National Natural Science Foundation of China
  • Henan Provincial Key Scientific and Technological Project
  • Zhengzhou Municipal R&D Special Fund-Supported Research Project
  • Open Project of Key Laboratory of Grain Information Processing and Control, Ministry of Education
  • Zhengzhou Municipal R&D Special Fund-Supported Research Project

Zitieren

APA

Hou, H., Ma, Y., Zhao, Z., & Ge, X. (2026). DFB-PPGSQ: Dynamic Forward-Private and Epochal Backward-Private Graph Similarity Matching Query over Encrypted Sensor Graph Databases. Sensors, 26(15), 4804. https://doi.org/10.3390/s26154804

Vancouver

Hou H, Ma Y, Zhao Z, Ge X. DFB-PPGSQ: Dynamic Forward-Private and Epochal Backward-Private Graph Similarity Matching Query over Encrypted Sensor Graph Databases. Sensors. 2026;26(15):4804. doi:10.3390/s26154804

BibTeX
@article{Hou2026,
  author = {Hou, Huiying and Ma, Yucong and Zhao, Zisu and Ge, Xinrui},
  title = {DFB-PPGSQ: Dynamic Forward-Private and Epochal Backward-Private Graph Similarity Matching Query over Encrypted Sensor Graph Databases},
  journal = {Sensors},
  year = {2026},
  volume = {26},
  number = {15},
  pages = {4804},
  doi = {10.3390/s26154804}
}
Kostenlos starten →