Privacy-Preserving Hierarchical Top-k Nearest Keyword Search on Graphs

Graph search techniques are increasingly vital for applications involving labeled or textual content on network vertices. A key task is the top-k nearest keyword (kNK) search on undirected graphs where a query vertex and keywords identify k closest vertices containing the keywords. With cloud storag...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Electronics (Basel) Ročník 14; číslo 4; s. 736
Hlavní autoři: Zhu, Xijuan, Xu, Zifeng, Hu, Chao, Lin, Jun
Médium: Journal Article
Jazyk:angličtina
Vydáno: Basel MDPI AG 01.02.2025
Témata:
Access control
Access to information
Algorithms
Apexes
Big Data
Blockchain
Cloud computing
Collaboration
Confidentiality
Cybersecurity
Data encryption
Efficiency
Encryption
Graph theory
Graphs
Keywords
Privacy
Pseudorandom
Queries
Researchers
Searching
Security clearances
ISSN:2079-9292, 2079-9292
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Graph search techniques are increasingly vital for applications involving labeled or textual content on network vertices. A key task is the top-k nearest keyword (kNK) search on undirected graphs where a query vertex and keywords identify k closest vertices containing the keywords. With cloud storage widely used for outsourcing graph services, ensuring data privacy and security is critical. Existing solutions employ encrypted indexes for privacy-preserving keyword searches but lack fine-grained access control, limiting their ability to accommodate diverse user needs. To address this, we propose privacy-preserving hierarchical top-k nearest keyword search on graphs (PH-kNK), a novel scheme enhancing privacy-preserving top-k keyword searches by integrating hierarchical access control. PH-kNK introduces hierarchical query entry indexes that regulate access at multiple security levels, significantly improving privacy, security and adaptability. The granular query entry indexes established by our approach enables users with higher security levels to query the graph structure and access corresponding vertices while maintaining transparency for lower-level users. The scheme leverages pseudo-random mapping, order-preserving encryption and re-encryption of search indexes to ensure robust data security. Experimental results on real-world datasets demonstrate the scheme’s high efficiency and validate its security.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2079-9292
2079-9292
DOI:10.3390/electronics14040736