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...
محفوظ في:
المؤلفون الرئيسيون: | ZHANG, Can, ZHU, Liehuang, SHARIF, Kashif, ZHANG, Chuan, LIU, Ximeng |
---|---|
التنسيق: | text |
اللغة: | English |
منشور في: |
Institutional Knowledge at Singapore Management University
2020
|
الموضوعات: | |
الوصول للمادة أونلاين: | https://ink.library.smu.edu.sg/sis_research/5908 https://ink.library.smu.edu.sg/context/sis_research/article/6911/viewcontent/PGAS_av.pdf |
الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
المؤسسة: | Singapore Management University |
اللغة: | English |
مواد مشابهة
-
A pruned pendant vertex based index for shortest distance query under structured encrypted graph
بواسطة: HU, Mengdi, وآخرون
منشور في: (2024) -
Effective indexing for approximate constrained shortest path queries on large road networks
بواسطة: Wang, Sibo, وآخرون
منشور في: (2017) -
Efficient navigation for constrained shortest path with adaptive expansion control
بواسطة: XIA, Wenwen, وآخرون
منشور في: (2022) -
Server-aided revocable attribute-based encryption for cloud computing services
بواسطة: CUI, Hui, وآخرون
منشور في: (2020) -
Privacy-preserving outsourced calculation toolkit in the cloud
بواسطة: LIU, Ximeng, وآخرون
منشور في: (2020)