HPRoP: Hierarchical Privacy-preserving Route Planning for Smart Cities

Author:

Tiausas Francis1ORCID,Yasumoto Keiichi2ORCID,Talusan Jose Paolo3ORCID,Yamana Hayato4ORCID,Yamaguchi Hirozumi5ORCID,Bhattacharjee Shameek6ORCID,Dubey Abhishek3ORCID,Das Sajal K.7ORCID

Affiliation:

1. Nara Institute of Science and Technology (NAIST), Japan

2. Nara Institute of Science and Technology (NAIST), Japan and RIKEN Center for Advanced Intelligence Project (AIP), Japan

3. Vanderbilt University, USA

4. Waseda University, Japan

5. Osaka University, Japan

6. Western Michigan University, USA

7. Missouri University of Science and Technology, USA

Abstract

Route Planning Systems (RPS) are a core component of autonomous personal transport systems essential for safe and efficient navigation of dynamic urban environments with the support of edge-based smart city infrastructure, but they also raise concerns about user route privacy in the context of both privately owned and commercial vehicles. Numerous high-profile data breaches in recent years have fortunately motivated research on privacy-preserving RPS, but most of them are rendered impractical by greatly increased communication and processing overhead. We address this by proposing an approach called Hierarchical Privacy-Preserving Route Planning (HPRoP), which divides and distributes the route-planning task across multiple levels and protects locations along the entire route. This is done by combining Inertial Flow partitioning, Private Information Retrieval (PIR), and Edge Computing techniques with our novel route-planning heuristic algorithm. Normalized metrics were also formulated to quantify the privacy of the source/destination points ( endpoint location privacy ) and the route itself ( route privacy ). Evaluation on a simulated road network showed that HPRoP reliably produces routes differing only by ≤ 20% in length from optimal shortest paths, with completion times within ∼ 25 seconds, which is reasonable for a PIR-based approach. On top of this, more than half of the produced routes achieved near-optimal endpoint location privacy (∼ 1.0) and good route privacy (≥ 0.8).

Funder

R&D for Trustworthy Networking for Smart and Connected Communities

Commissioned Research of National Institute of Information and Communications Technology

National Science Foundation

Publisher

Association for Computing Machinery (ACM)

Subject

Artificial Intelligence,Control and Optimization,Computer Networks and Communications,Hardware and Architecture,Human-Computer Interaction

Reference39 articles.

1. Gaurav Aggarwal, Sreenivas Gollapudi, and Ali Kemal Sinop. 2021. Sketch-based algorithms for approximate shortest paths in road networks. In Proceedings of the Web Conference. 3918–3929.

2. PIR with Compressed Queries and Amortized Query Processing

3. A privacy-preserving route planning scheme for the Internet of Vehicles

4. A security and privacy preserved intelligent vehicle navigation system;Baruah Barnana;IEEE Trans. Depend. Sec. Comput.,2022

5. Amos Beimel, Yuval Ishai, and Tal Malkin. 2000. Reducing the servers computation in private information retrieval: PIR with preprocessing. In Proceedings of the 20th Annual International Cryptology Conference. Springer, 55–73.

Cited by 1 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. CryptGraph: An Efficient Privacy-Enhancing Solution for Accurate Shortest Path Retrieval in Cloud Environments;Proceedings of the 19th ACM Asia Conference on Computer and Communications Security;2024-07

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3