Symmetric Private Shortest Path Retrieval for LM-Enabled Route Services on Consumer Devices

Route optimization is widely utilized in consumer electronics like Google Maps and Facebook connections. However, due to the limitations of consumer devices, users often rely on online service providers to process large-model-enabled route services, which may involve sensitive information such as location and social relationships. This raises privacy concerns, necessitating the need for a system that ensures expected utility while protecting the privacy of both consumers and service providers. This problem, known as Symmetric Private Shortest Path Retrieval, has been studied in the literature, either focusing on specific data types or a simple private setting where the data user and owner are the same. In this paper, we propose a low-latency symmetric private shortest path query for generic graph data in a more realistic public service model. We propose several novel techniques, including a chained encryption method and an oblivious key transfer mechanism to efficiently reveal the queried shortest path without leaking additional information to either the consumers or service provider. Experimental results demonstrate that our scheme outperforms the state-of-the-art by being approximately 46 to 53 times faster and consuming roughly 36 to 74 times less bandwidth for a city navigation service.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Consumer Electronics
Published
2025-05-01
DOI
https://doi.org/10.1109/tce.2025.3573179
Citations
1
Primary Topic
IPv6, Mobility, Handover, Networks, Security
Type
article
Field-Weighted Citation Impact
0.73
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Symmetric Private Shortest Path Retrieval for LM-Enabled Route Services on Consumer Devices

Kok‐Lim Alvin Yau, Yangfei Lin, Mengmeng Yang, Xuefeng Liu et al.
1 citations
IEEE Transactions on Consumer Electronics
IPv6, Mobility, Handover, Networks, Security
0.73
article

Symmetric Private Shortest Path Retrieval for LM-Enabled Route Services on Consumer Devices

Kok‐Lim Alvin Yau, Yangfei Lin, Mengmeng Yang, Xuefeng Liu, Jing Lei, Fake Lyu
article en
1 citations

Abstract

Route optimization is widely utilized in consumer electronics like Google Maps and Facebook connections. However, due to the limitations of consumer devices, users often rely on online service providers to process large-model-enabled route services, which may involve sensitive information such as location and social relationships. This raises privacy concerns, necessitating the need for a system that ensures expected utility while protecting the privacy of both consumers and service providers. This problem, known as Symmetric Private Shortest Path Retrieval, has been studied in the literature, either focusing on specific data types or a simple private setting where the data user and owner are the same. In this paper, we propose a low-latency symmetric private shortest path query for generic graph data in a more realistic public service model. We propose several novel techniques, including a chained encryption method and an oblivious key transfer mechanism to efficiently reveal the queried shortest path without leaking additional information to either the consumers or service provider. Experimental results demonstrate that our scheme outperforms the state-of-the-art by being approximately 46 to 53 times faster and consuming roughly 36 to 74 times less bandwidth for a city navigation service.

IEEE Transactions on Consumer ElectronicsVol. 71(2)
University of Tsukuba (JP), Xidian University (CN), University of Electro-Communications (JP), Health Sciences and Nutrition (AU), Data61 (AU), Universiti Tunku Abdul Rahman (MY)
Openalex Percentile: Top 28%
IPv6, Mobility, Handover, Networks, Security
0.73
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.