基于遗忘传输协议的路径隐私保护方案

Zian Yan, Jianhong Zhang
{"title":"基于遗忘传输协议的路径隐私保护方案","authors":"Zian Yan, Jianhong Zhang","doi":"10.1109/ICWOC55996.2022.9809903","DOIUrl":null,"url":null,"abstract":"Vehicular ad hoc networks (VANETs) can provide information and technical support for vehicles connected to the Internet, improving driving efficiency. However, VANETs requires drivers to disclose their specific driving paths to the server, and this measure increases the risk of leaking privacy. Honest but curious service providers may want to know customers' other private messages by collecting information about vehicle paths. Therefore, we propose an architecture based on the oblivious transport protocol to solve the above problems. In this architecture, the driver can obtain the required RSU messages without revealing the specific route information to the server. At the same time, our scheme uses the Chinese residual theorem to revoke malicious users, protecting the legitimate interests of service providers and RSU s. Finally, AES achieves fast authentication between the vehicle and the RSU, ensuring that the user can obtain real-time information while driving. Experiments show that our system can reduce computational costs compare to other methods.","PeriodicalId":402416,"journal":{"name":"2022 10th International Conference on Intelligent Computing and Wireless Optical Communications (ICWOC)","volume":"106 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Path Privacy-Preserving Scheme Based on Oblivious Transfer Protocol\",\"authors\":\"Zian Yan, Jianhong Zhang\",\"doi\":\"10.1109/ICWOC55996.2022.9809903\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Vehicular ad hoc networks (VANETs) can provide information and technical support for vehicles connected to the Internet, improving driving efficiency. However, VANETs requires drivers to disclose their specific driving paths to the server, and this measure increases the risk of leaking privacy. Honest but curious service providers may want to know customers' other private messages by collecting information about vehicle paths. Therefore, we propose an architecture based on the oblivious transport protocol to solve the above problems. In this architecture, the driver can obtain the required RSU messages without revealing the specific route information to the server. At the same time, our scheme uses the Chinese residual theorem to revoke malicious users, protecting the legitimate interests of service providers and RSU s. Finally, AES achieves fast authentication between the vehicle and the RSU, ensuring that the user can obtain real-time information while driving. Experiments show that our system can reduce computational costs compare to other methods.\",\"PeriodicalId\":402416,\"journal\":{\"name\":\"2022 10th International Conference on Intelligent Computing and Wireless Optical Communications (ICWOC)\",\"volume\":\"106 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-06-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 10th International Conference on Intelligent Computing and Wireless Optical Communications (ICWOC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICWOC55996.2022.9809903\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 10th International Conference on Intelligent Computing and Wireless Optical Communications (ICWOC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICWOC55996.2022.9809903","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

车辆自组织网络(VANETs)可以为连接到互联网的车辆提供信息和技术支持,提高驾驶效率。然而,VANETs要求司机向服务器披露他们的具体驾驶路径,这一措施增加了泄露隐私的风险。诚实但好奇的服务提供商可能想通过收集车辆路径信息来了解客户的其他私人信息。因此,我们提出了一种基于无关传输协议的体系结构来解决上述问题。在这个体系结构中,驱动程序可以获得所需的RSU消息,而无需向服务器透露特定的路由信息。同时,我们的方案利用中文残差定理撤销恶意用户,保护了服务提供商和RSU的合法权益。最后,AES实现了车辆与RSU之间的快速认证,保证了用户在行驶过程中能够获得实时信息。实验表明,与其他方法相比,该系统可以降低计算成本。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Path Privacy-Preserving Scheme Based on Oblivious Transfer Protocol
Vehicular ad hoc networks (VANETs) can provide information and technical support for vehicles connected to the Internet, improving driving efficiency. However, VANETs requires drivers to disclose their specific driving paths to the server, and this measure increases the risk of leaking privacy. Honest but curious service providers may want to know customers' other private messages by collecting information about vehicle paths. Therefore, we propose an architecture based on the oblivious transport protocol to solve the above problems. In this architecture, the driver can obtain the required RSU messages without revealing the specific route information to the server. At the same time, our scheme uses the Chinese residual theorem to revoke malicious users, protecting the legitimate interests of service providers and RSU s. Finally, AES achieves fast authentication between the vehicle and the RSU, ensuring that the user can obtain real-time information while driving. Experiments show that our system can reduce computational costs compare to other methods.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信