Pub Date : 2020-07-01DOI: 10.1109/INFOCOMWKSHPS50562.2020.9162889
Akinsola Akinsanya, Manish Nair, Yijin Pan, Jiangzhou Wang
A switched-beam based multiple-input-multiple output (MIMO) vehicle-to-infrastructure (V2I) system can grant better system reliability as the signal-to-interference-plus-noise ratio (SINR) can be significantly optimized. In order to maximize the number of served vehicles by the simple switched-beam based V2I system, it is crucial to additionally introduce vehicle-to-vehicle (V2V) communication because (i) more than one vehicle might occupy a beam coverage, and (ii) vehicles may be out of the coverage region of a beam. In this paper, we proposed a cooperative infrastructure-beam allocation (IBA) and location-estimation (LE) scheme to optimize system coverage and reliability. IBA is an SINR optimization algorithm, and LE is a location-based proximity service for V2I and V2V communications respectively. Our simulation results show that a reliable beam coverage region in switched-beam V2I can be achieved with flexible value of SINR threshold. Also, the outage probability and average rates are directly dependent on set SINR thresholds. Finally, cooperation between V2I and V2V communication significantly improves the utility ratio which is further used as a metric for reliability.
{"title":"A Dynamic Resource Allocation Scheme in Vehicular Communications","authors":"Akinsola Akinsanya, Manish Nair, Yijin Pan, Jiangzhou Wang","doi":"10.1109/INFOCOMWKSHPS50562.2020.9162889","DOIUrl":"https://doi.org/10.1109/INFOCOMWKSHPS50562.2020.9162889","url":null,"abstract":"A switched-beam based multiple-input-multiple output (MIMO) vehicle-to-infrastructure (V2I) system can grant better system reliability as the signal-to-interference-plus-noise ratio (SINR) can be significantly optimized. In order to maximize the number of served vehicles by the simple switched-beam based V2I system, it is crucial to additionally introduce vehicle-to-vehicle (V2V) communication because (i) more than one vehicle might occupy a beam coverage, and (ii) vehicles may be out of the coverage region of a beam. In this paper, we proposed a cooperative infrastructure-beam allocation (IBA) and location-estimation (LE) scheme to optimize system coverage and reliability. IBA is an SINR optimization algorithm, and LE is a location-based proximity service for V2I and V2V communications respectively. Our simulation results show that a reliable beam coverage region in switched-beam V2I can be achieved with flexible value of SINR threshold. Also, the outage probability and average rates are directly dependent on set SINR thresholds. Finally, cooperation between V2I and V2V communication significantly improves the utility ratio which is further used as a metric for reliability.","PeriodicalId":104136,"journal":{"name":"IEEE INFOCOM 2020 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126098147","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-07-01DOI: 10.1109/INFOCOMWKSHPS50562.2020.9162585
Siqin Fang, Sean Kennedy, Chenggang Wang, Boyang Wang, Qingqi Pei, Xuefeng Liu
Nearest neighbor search, a classic way of identifying similar data, can be applied to various areas, including database, machine learning, natural language processing, software engineering, etc. Secure nearest neighbor search aims to find nearest neighbors to a given query point over encrypted data without accessing data in plaintext. It provides privacy protection to datasets when nearest neighbor queries need to be operated by an untrusted party (e.g., a public server). While different solutions have been proposed to support nearest neighbor queries on encrypted data, these existing solutions still encounter critical drawbacks either in efficiency or privacy. In light of the limitations in the current literature, we propose a novel approximate nearest neighbor search solution, referred to as Sparser, by leveraging a combination of space-filling curves, perturbation, and Order-Preserving Encryption. The advantages of Sparser are twofold, strengthening privacy and improving efficiency. Specifically, Sparser pre-processes plaintext data with space-filling curves and perturbation, such that data is sparse, which mitigates leakage abuse attacks and renders stronger privacy. In addition to privacy enhancement, Sparser can efficiently find approximate nearest neighbors over encrypted data with logarithmic time. Through extensive experiments over real-world datasets, we demonstrate that Sparser can achieve strong privacy protection under leakage abuse attacks and minimize search time.
{"title":"Sparser: Secure Nearest Neighbor Search with Space-filling Curves","authors":"Siqin Fang, Sean Kennedy, Chenggang Wang, Boyang Wang, Qingqi Pei, Xuefeng Liu","doi":"10.1109/INFOCOMWKSHPS50562.2020.9162585","DOIUrl":"https://doi.org/10.1109/INFOCOMWKSHPS50562.2020.9162585","url":null,"abstract":"Nearest neighbor search, a classic way of identifying similar data, can be applied to various areas, including database, machine learning, natural language processing, software engineering, etc. Secure nearest neighbor search aims to find nearest neighbors to a given query point over encrypted data without accessing data in plaintext. It provides privacy protection to datasets when nearest neighbor queries need to be operated by an untrusted party (e.g., a public server). While different solutions have been proposed to support nearest neighbor queries on encrypted data, these existing solutions still encounter critical drawbacks either in efficiency or privacy. In light of the limitations in the current literature, we propose a novel approximate nearest neighbor search solution, referred to as Sparser, by leveraging a combination of space-filling curves, perturbation, and Order-Preserving Encryption. The advantages of Sparser are twofold, strengthening privacy and improving efficiency. Specifically, Sparser pre-processes plaintext data with space-filling curves and perturbation, such that data is sparse, which mitigates leakage abuse attacks and renders stronger privacy. In addition to privacy enhancement, Sparser can efficiently find approximate nearest neighbors over encrypted data with logarithmic time. Through extensive experiments over real-world datasets, we demonstrate that Sparser can achieve strong privacy protection under leakage abuse attacks and minimize search time.","PeriodicalId":104136,"journal":{"name":"IEEE INFOCOM 2020 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126662428","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-07-01DOI: 10.1109/INFOCOMWKSHPS50562.2020.9162650
Xiaofan He, Richeng Jin, H. Dai
As a powerful mathematical framework that allows intelligent agents to gradually learn their optimal strategies in unknown dynamic environments, reinforcement learning (RL) has found its success in many important applications. Nonetheless, a common stumbling block of RL algorithms is their low learning speed. Although different methods have been developed in literature to enhance the learning speed when special structure or prior learning experience is available, expediting RL in the general settings still remains a challenge. The Zap Q-learning is a recent breakthrough in this direction, which is shown to be an order of magnitude faster than the conventional Q-learning and its cutting-edging variants. Inspired by this exciting result, a novel algorithm, termed Glide and Zap Q-learning (G-Zap Q-learning), is proposed in this work by incorporating a novel gliding step into the learning process. The proposed algorithm is provably convergent to the optimal strategy and can further increase the learning speed of the original Zap Q-learning by several folds. In addition, it is applicable to general Markov decision processes (MDPs) and hence assumes wide applications. Simulations over both randomly generated MDPs and an exemplary application of privacy-aware task offloading in mobile-edge computing are conducted to validate the effectiveness of the proposed algorithm.
{"title":"Glide and Zap Q-Learning","authors":"Xiaofan He, Richeng Jin, H. Dai","doi":"10.1109/INFOCOMWKSHPS50562.2020.9162650","DOIUrl":"https://doi.org/10.1109/INFOCOMWKSHPS50562.2020.9162650","url":null,"abstract":"As a powerful mathematical framework that allows intelligent agents to gradually learn their optimal strategies in unknown dynamic environments, reinforcement learning (RL) has found its success in many important applications. Nonetheless, a common stumbling block of RL algorithms is their low learning speed. Although different methods have been developed in literature to enhance the learning speed when special structure or prior learning experience is available, expediting RL in the general settings still remains a challenge. The Zap Q-learning is a recent breakthrough in this direction, which is shown to be an order of magnitude faster than the conventional Q-learning and its cutting-edging variants. Inspired by this exciting result, a novel algorithm, termed Glide and Zap Q-learning (G-Zap Q-learning), is proposed in this work by incorporating a novel gliding step into the learning process. The proposed algorithm is provably convergent to the optimal strategy and can further increase the learning speed of the original Zap Q-learning by several folds. In addition, it is applicable to general Markov decision processes (MDPs) and hence assumes wide applications. Simulations over both randomly generated MDPs and an exemplary application of privacy-aware task offloading in mobile-edge computing are conducted to validate the effectiveness of the proposed algorithm.","PeriodicalId":104136,"journal":{"name":"IEEE INFOCOM 2020 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123871686","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-07-01DOI: 10.1109/INFOCOMWKSHPS50562.2020.9162942
Di Zhang, Lei Fan
Edge computing reduces the overhead of data centers and improves the efficiency of data processing. However, traditional cloud data protection mechanisms are no longer applicable to edge devices. Data leakage and other privacy issues may occur when computation is outsourced to edge nodes. The decentralization raises new privacy challenge for data control, storage and computation. In this work, we present Cerberus, a brand-new framework that preserves data privacy in edge computing by combining blockchain, distributed data storage and trusted execution environment (TEE). Blockchain is used to maintain a global computation state, and also acts as a medium of information interaction. Distributed data storage provides a secure and large-capacity storage. TEE-based off-chain computation guarantees confidentiality and efficiency of data processing. We also implement a prototype of Cerberus using Hyperledger Fabric and Intel SGX. Our evaluation on a sample of data sorting application shows that Cerberus achieves significant speed ups over previous cryptographic schemes. Compared with non secure computation, Cerberus can preserve data privacy without incurring much performance loss.
{"title":"Cerberus: Privacy-Preserving Computation in Edge Computing","authors":"Di Zhang, Lei Fan","doi":"10.1109/INFOCOMWKSHPS50562.2020.9162942","DOIUrl":"https://doi.org/10.1109/INFOCOMWKSHPS50562.2020.9162942","url":null,"abstract":"Edge computing reduces the overhead of data centers and improves the efficiency of data processing. However, traditional cloud data protection mechanisms are no longer applicable to edge devices. Data leakage and other privacy issues may occur when computation is outsourced to edge nodes. The decentralization raises new privacy challenge for data control, storage and computation. In this work, we present Cerberus, a brand-new framework that preserves data privacy in edge computing by combining blockchain, distributed data storage and trusted execution environment (TEE). Blockchain is used to maintain a global computation state, and also acts as a medium of information interaction. Distributed data storage provides a secure and large-capacity storage. TEE-based off-chain computation guarantees confidentiality and efficiency of data processing. We also implement a prototype of Cerberus using Hyperledger Fabric and Intel SGX. Our evaluation on a sample of data sorting application shows that Cerberus achieves significant speed ups over previous cryptographic schemes. Compared with non secure computation, Cerberus can preserve data privacy without incurring much performance loss.","PeriodicalId":104136,"journal":{"name":"IEEE INFOCOM 2020 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"16 10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125625977","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-07-01DOI: 10.1109/infocomwkshps50562.2020.9162702
Syed Bilal Hussain Shah, Lei Wang, P. Reddy, C. A. Carie
The restricted resources in IoT networks such as limited battery have resulted in strict requirements to prolong the network life time. To improve the communication, IoT nodes attempt to optimize the available energy in the sensor network, this makes them vulnerable to the malicious attacks from adversaries because of open scenario. In addition, enhancing the security level will consume the energy and decreases network life time. In order to balance energy and security in the network game theory concept is used. We design a non cooperative game between energy and security where the utilities of both energy and security players are maximized by controlling the number of nodes transmitting and hash length. We consider complete and incomplete information game and determine Nash equilibrium. Extensive simulation have been performed to examine Nash equilibrium. We obtained Nash equilibrium for both energy and security players.
{"title":"Non-Cooperative Game to Balance Energy and Security in Resource Constrained IoT Networks","authors":"Syed Bilal Hussain Shah, Lei Wang, P. Reddy, C. A. Carie","doi":"10.1109/infocomwkshps50562.2020.9162702","DOIUrl":"https://doi.org/10.1109/infocomwkshps50562.2020.9162702","url":null,"abstract":"The restricted resources in IoT networks such as limited battery have resulted in strict requirements to prolong the network life time. To improve the communication, IoT nodes attempt to optimize the available energy in the sensor network, this makes them vulnerable to the malicious attacks from adversaries because of open scenario. In addition, enhancing the security level will consume the energy and decreases network life time. In order to balance energy and security in the network game theory concept is used. We design a non cooperative game between energy and security where the utilities of both energy and security players are maximized by controlling the number of nodes transmitting and hash length. We consider complete and incomplete information game and determine Nash equilibrium. Extensive simulation have been performed to examine Nash equilibrium. We obtained Nash equilibrium for both energy and security players.","PeriodicalId":104136,"journal":{"name":"IEEE INFOCOM 2020 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"359 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131404860","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-07-01DOI: 10.1109/INFOCOMWKSHPS50562.2020.9162936
Yuanjun Yao, Q. Cao, P. Ruth, Mert Cevik, Cong Wang, J. Chase
Research testbed fabrics have potential to support long-lived, evolving, interdomain experiments, including opt-in application traffic across multiple campuses and edge sites. We propose abstractions and security infrastructure to facilitate multi-domain networking, and a reusable controller toolkit (Ex-oPlex) for network service providers (NSPs) running in testbed-hosted virtual network slices. We demonstrate the idea on the ExoGENI testbed, which allows slices to interconnect and exchange traffic over peering links by mutual consent. Each ExoPlex NSP runs a peering controller that manages its interactions with its linked peers and controls the NSP's dataplane network via SDN. Our approach expresses policies for secure peering and routing in a declarative language-logical peering. The prototype uses logic rules to verify IP prefix ownership, filter and validate route advertisements, and implement user-specified policies for connectivity and path control in networks with multiple transit NSPs.
{"title":"Logical Peering for Interdomain Networking on Testbeds","authors":"Yuanjun Yao, Q. Cao, P. Ruth, Mert Cevik, Cong Wang, J. Chase","doi":"10.1109/INFOCOMWKSHPS50562.2020.9162936","DOIUrl":"https://doi.org/10.1109/INFOCOMWKSHPS50562.2020.9162936","url":null,"abstract":"Research testbed fabrics have potential to support long-lived, evolving, interdomain experiments, including opt-in application traffic across multiple campuses and edge sites. We propose abstractions and security infrastructure to facilitate multi-domain networking, and a reusable controller toolkit (Ex-oPlex) for network service providers (NSPs) running in testbed-hosted virtual network slices. We demonstrate the idea on the ExoGENI testbed, which allows slices to interconnect and exchange traffic over peering links by mutual consent. Each ExoPlex NSP runs a peering controller that manages its interactions with its linked peers and controls the NSP's dataplane network via SDN. Our approach expresses policies for secure peering and routing in a declarative language-logical peering. The prototype uses logic rules to verify IP prefix ownership, filter and validate route advertisements, and implement user-specified policies for connectivity and path control in networks with multiple transit NSPs.","PeriodicalId":104136,"journal":{"name":"IEEE INFOCOM 2020 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127714148","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-07-01DOI: 10.1109/infocomwkshps50562.2020.9162860
Pengfei Zhu, Konglin Zhu, Lin Zhang
C-V2X extended from cellular networks has been considered one of the promising communication techniques for Internet of Vehicles (IoV). Correspondingly, it inherits the security issues from cellular networks, i.e., LTE or 5G, and also bring new types of security issues. In this paper, we take LTE-V2X as an example to investigate the potential security and privacy issues of LTE-V2X. In particular, we first study the LTE-V2X communication procedure and discover the potential security flaws. Then we use the platooning case to show the harmfulness caused by different types of attacks using the security flaws. Finally, we use SUMO and OMNET++ to simulate platoon and LTE-V2X, and conduct different types of attacks on the simulator. The simulation results show that various attacks severely degrade the performance of platoon from the perspective of inter-vehicle distance and vehicle speed.
{"title":"Security Analysis of LTE-V2X and A Platooning Case Study","authors":"Pengfei Zhu, Konglin Zhu, Lin Zhang","doi":"10.1109/infocomwkshps50562.2020.9162860","DOIUrl":"https://doi.org/10.1109/infocomwkshps50562.2020.9162860","url":null,"abstract":"C-V2X extended from cellular networks has been considered one of the promising communication techniques for Internet of Vehicles (IoV). Correspondingly, it inherits the security issues from cellular networks, i.e., LTE or 5G, and also bring new types of security issues. In this paper, we take LTE-V2X as an example to investigate the potential security and privacy issues of LTE-V2X. In particular, we first study the LTE-V2X communication procedure and discover the potential security flaws. Then we use the platooning case to show the harmfulness caused by different types of attacks using the security flaws. Finally, we use SUMO and OMNET++ to simulate platoon and LTE-V2X, and conduct different types of attacks on the simulator. The simulation results show that various attacks severely degrade the performance of platoon from the perspective of inter-vehicle distance and vehicle speed.","PeriodicalId":104136,"journal":{"name":"IEEE INFOCOM 2020 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127757934","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-07-01DOI: 10.1109/infocomwkshps50562.2020.9163037
Shahzeb Mustafa, P. K. Dey, M. Yuksel
We present GENIX; a modular emulation framework that mimics the behavior of IXPs on a public test-bed. GENIX is implemented in Global Environment for Network Innovations (GENI) and capable of enumerating various interactions among ISPs, expected in the real world. GENIX is the first effort towards alleviating the complexities of large-scale emulation to abstract a lightweight design where IXP dynamics can be usefully applied. We test GENIX for its ability to handle large volumes of traffic flow and its performance during network congestion.
{"title":"GENIX: A GENI-based IXP Emulation","authors":"Shahzeb Mustafa, P. K. Dey, M. Yuksel","doi":"10.1109/infocomwkshps50562.2020.9163037","DOIUrl":"https://doi.org/10.1109/infocomwkshps50562.2020.9163037","url":null,"abstract":"We present GENIX; a modular emulation framework that mimics the behavior of IXPs on a public test-bed. GENIX is implemented in Global Environment for Network Innovations (GENI) and capable of enumerating various interactions among ISPs, expected in the real world. GENIX is the first effort towards alleviating the complexities of large-scale emulation to abstract a lightweight design where IXP dynamics can be usefully applied. We test GENIX for its ability to handle large volumes of traffic flow and its performance during network congestion.","PeriodicalId":104136,"journal":{"name":"IEEE INFOCOM 2020 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128001521","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-07-01DOI: 10.1109/INFOCOMWKSHPS50562.2020.9162709
Haili Yu, Guangshun Li, Junhua Wu, Xinrong Ren, Jiabin Cao
With the rapid development of Vehicular Ad-hoc Network (VANETs), Frequently communication between vehicles and base stations has generated a large amount of trajectory information. The vehicle trajectory data can be used for real-time traffic management, intelligent driving and onboard entertainment, but it brings huge storage pressure and risk of privacy leakage. Although existing trajectory protection algorithms can generate a large number of similar trajectories, these virtual trajectories are easily identified by an attacker and cannot be virtualized according to vehicles needs. Based on the existing rotation algorithms, we proposes a virtual trajectory generation algorithm(VTG), which generates corresponding virtual points according to the user's needs at each positions and form virtual trajectories through connecting virtual position points. At the same time, the edge node are regarded as trusted third party to ensure physical control in the privacy protection model and served as a bridge between users and Location Based Services (LBS) while storing part of trajectory data. Finally, the effectiveness and security of the method are verified through a large number of simulations, our experiments indicate that the method can provide better privacy protection for users.
随着车载自组织网络(VANETs)的快速发展，车辆与基站之间频繁的通信产生了大量的轨迹信息。车辆轨迹数据可用于实时交通管理、智能驾驶和车载娱乐，但也带来了巨大的存储压力和隐私泄露风险。虽然现有的轨迹保护算法可以生成大量相似的轨迹，但这些虚拟轨迹很容易被攻击者识别，无法根据车辆的需要进行虚拟化。在现有旋转算法的基础上，提出了一种虚拟轨迹生成算法(VTG)，该算法在每个位置根据用户的需要生成相应的虚拟点，并通过连接虚拟位置点形成虚拟轨迹。同时，在隐私保护模型中，边缘节点作为可信第三方来保证物理控制，在存储部分轨迹数据的同时，充当用户与LBS (Location Based Services)之间的桥梁。最后，通过大量的仿真验证了该方法的有效性和安全性，实验表明该方法可以为用户提供更好的隐私保护。
{"title":"A Location-Based Path Privacy Protection Scheme in Internet of Vehicles","authors":"Haili Yu, Guangshun Li, Junhua Wu, Xinrong Ren, Jiabin Cao","doi":"10.1109/INFOCOMWKSHPS50562.2020.9162709","DOIUrl":"https://doi.org/10.1109/INFOCOMWKSHPS50562.2020.9162709","url":null,"abstract":"With the rapid development of Vehicular Ad-hoc Network (VANETs), Frequently communication between vehicles and base stations has generated a large amount of trajectory information. The vehicle trajectory data can be used for real-time traffic management, intelligent driving and onboard entertainment, but it brings huge storage pressure and risk of privacy leakage. Although existing trajectory protection algorithms can generate a large number of similar trajectories, these virtual trajectories are easily identified by an attacker and cannot be virtualized according to vehicles needs. Based on the existing rotation algorithms, we proposes a virtual trajectory generation algorithm(VTG), which generates corresponding virtual points according to the user's needs at each positions and form virtual trajectories through connecting virtual position points. At the same time, the edge node are regarded as trusted third party to ensure physical control in the privacy protection model and served as a bridge between users and Location Based Services (LBS) while storing part of trajectory data. Finally, the effectiveness and security of the method are verified through a large number of simulations, our experiments indicate that the method can provide better privacy protection for users.","PeriodicalId":104136,"journal":{"name":"IEEE INFOCOM 2020 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132823394","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-07-01DOI: 10.1109/infocomwkshps50562.2020.9162833
Morteza Kheirkhah, T. K. Phan, Xinpeng Wei, D. Griffin, M. Rio
Internet protocols have developed significantly over the last 50 years but have reached a point where the further improvements in performance, resilience, security and privacy cannot be achieved by simple incremental changes. This paper proposes a new IP protocol that puts the user's end host at the centre of major algorithmic decisions. It consist of three new mechanisms: a private source routing establishment protocol that allows inter-domain traffic routes to be decided by the user and kept private from the providers whilst allowing for anonymous connections where two node can communicate without knowing the identity/address of the other end point; a mechanism to control reception of packets that mitigates denial-of-service attacks and a new directory system that puts the end user at the core of the decisions enabling anycast and mobility with a pub-sub mechanism with fine grain capabilities for describe resources. These changes allow end nodes to have a much tighter control of how they send and receive their traffic and provide a paradigm shift for the Internet ecosystem.
{"title":"UCIP: User Controlled Internet Protocol","authors":"Morteza Kheirkhah, T. K. Phan, Xinpeng Wei, D. Griffin, M. Rio","doi":"10.1109/infocomwkshps50562.2020.9162833","DOIUrl":"https://doi.org/10.1109/infocomwkshps50562.2020.9162833","url":null,"abstract":"Internet protocols have developed significantly over the last 50 years but have reached a point where the further improvements in performance, resilience, security and privacy cannot be achieved by simple incremental changes. This paper proposes a new IP protocol that puts the user's end host at the centre of major algorithmic decisions. It consist of three new mechanisms: a private source routing establishment protocol that allows inter-domain traffic routes to be decided by the user and kept private from the providers whilst allowing for anonymous connections where two node can communicate without knowing the identity/address of the other end point; a mechanism to control reception of packets that mitigates denial-of-service attacks and a new directory system that puts the end user at the core of the decisions enabling anycast and mobility with a pub-sub mechanism with fine grain capabilities for describe resources. These changes allow end nodes to have a much tighter control of how they send and receive their traffic and provide a paradigm shift for the Internet ecosystem.","PeriodicalId":104136,"journal":{"name":"IEEE INFOCOM 2020 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115091638","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：