A pruned pendant vertex based index for shortest distance query under structured encrypted graph
The shortest distance query is used to determine the shortest distance between two vertices. Various graph encryption schemes have been proposed to achieve accurate, efficient and secure shortest distance queries for encrypted graphs. However, the majority of these schemes are inefficient or lack sc...
Saved in:
Main Authors: | HU, Mengdi, CHEN, Lanxiang, CHEN, Gaolin, MU, Yi, DENG, Robert H. |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2024
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/9562 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
PGAS: Privacy-preserving graph encryption for accurate constrained shortest distance queries
by: ZHANG, Can, et al.
Published: (2020) -
Search condition-hiding query evaluation on encrypted databases
by: Kim, Myungsun, et al.
Published: (2020) -
Effective indexing for approximate constrained shortest path queries on large road networks
by: Wang, Sibo, et al.
Published: (2017) -
C[subscript 2]-cofiniteness of the vertex algebra V[subscript L] [superscript +] and classification of irreducible modules of the vertex operator algebra V[subscript L] [superscript +<r>]
by: Phichet Jitjankarn
Published: (2011) -
On the linear vertex arboricity of graphs
by: HANG KIM HOO
Published: (2010)