Privacy-Preserving Shortest Distance Query for Dynamic Large-Scale Road Network-Reference-Cited by-同舟云学术

Privacy-Preserving Shortest Distance Query for Dynamic Large-Scale Road Network

Published:2023-06 Issue:2 Volume:17 Page:1729-1740
ISSN:1932-8184
Container-title:IEEE Systems Journal
language:
Short-container-title:IEEE Systems Journal

Author:

Sun Fangyuan¹^ORCID,Yu Jia¹^ORCID,Hao Rong¹^ORCID,Yang Ming²^ORCID,Kong Fanyu³^ORCID

Affiliation:

1. College of Computer Science and Technology, Qingdao University, Qingdao, China

2. Shandong Provincial Key Laboratory of Computer Networks, Shandong Computer Science Center, Qilu University of Technology (Shandong Academy of Sciences), Jinan, China

3. School of Software, Shandong University, Jinan, China

Funder

National Natural Science Foundation of China

Major Scientific and Technological Innovation project of Shandong Province

Open Foundation of State key Laboratory of Networking and Switching Technology

Beijing University of Posts and Telecommunications

Publisher

Institute of Electrical and Electronics Engineers (IEEE)

Subject

Electrical and Electronic Engineering,Control and Systems Engineering,Computer Networks and Communications,Computer Science Applications,Information Systems

Link

http://xplorestaging.ieee.org/ielx7/4267003/10146391/10042186.pdf?arnumber=10042186

Reference37 articles.

1. Dynamic and historical shortest-path distance queries on large evolving networks by pruned landmark labeling

2. SecGBD: Graph encryption for exact shortest distance queries with efficient updates;wang;Proc Int Conf Financial Cryptography Data Secur,0

3. Shortest Paths and Distances with Differential Privacy

4. Constrained top-k nearest fuzzy keyword queries on encrypted graph in road network

5. Introduction to algorithms;cormen;J Oper Res Soc,2001