PGAS: Privacy-preserving graph encryption for accurate constrained shortest distance queries
The constrained shortest distance (CSD) query is used to determine the shortest distance between two vertices of a graph while ensuring that the total cost remains lower than a given threshold. The virtually unlimited storage and processing capabilities of cloud computing have enabled the graph owne...
Saved in:
Main Authors: | ZHANG, Can, ZHU, Liehuang, SHARIF, Kashif, ZHANG, Chuan, LIU, Ximeng |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2020
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/5908 https://ink.library.smu.edu.sg/context/sis_research/article/6911/viewcontent/PGAS_av.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
A pruned pendant vertex based index for shortest distance query under structured encrypted graph
by: HU, Mengdi, et al.
Published: (2024) -
Effective indexing for approximate constrained shortest path queries on large road networks
by: Wang, Sibo, et al.
Published: (2017) -
Efficient navigation for constrained shortest path with adaptive expansion control
by: XIA, Wenwen, et al.
Published: (2022) -
Server-aided revocable attribute-based encryption for cloud computing services
by: CUI, Hui, et al.
Published: (2020) -
Privacy-preserving outsourced calculation toolkit in the cloud
by: LIU, Ximeng, et al.
Published: (2020)