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...

Full description

Saved in:
Bibliographic Details
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