Existing location privacy- preserving methods, without a trusted third party, cannot resist conspiracy attacks and active attacks. This paper proposes a novel solution for location based service （LBS） in vehicular a...Existing location privacy- preserving methods, without a trusted third party, cannot resist conspiracy attacks and active attacks. This paper proposes a novel solution for location based service （LBS） in vehicular ad hoc network （VANET）. Firstly, the relationship among anonymity degree, expected company area and vehicle density is discussed. Then, a companion set F is set up by k neighbor vehicles. Based on secure multi-party computation, each vehicle in V can compute the centroid, not revealing its location to each other. The centroid as a cloaking location is sent to LBS provider （P） and P returns a point of interest （POI）. Due to a distributed secret sharing structure, P cannot obtain the positions of non-complicity vehicles by colluding with multiple internal vehicles. To detect fake data from dishonest vehicles, zero knowledge proof is adopted. Comparing with other related methods, our solution can resist passive and active attacks from internal and external nodes. It provides strong privacy protection for LBS in VANET.展开更多
基金国家自然科学基金项目"基于产学研跨组织知识集成网络的战略性新兴产业集群机制研究"(71573124)国家自然科学基金项目"基于跨组织知识集成网络的产学研协作机制研究"(71173104)欧盟项目"Marie Curie International Incoming Fellowship within the 7th European Community Framework Programmer"(FP7-PIIF-GA-2013-629051)
基金the National Natural Science Foundation of China，by the Natural Science Foundation of Anhui Province，by the Specialized Research Fund for the Doctoral Program of Higher Education of China，the Fundamental Research Funds for the Central Universities
文摘Existing location privacy- preserving methods, without a trusted third party, cannot resist conspiracy attacks and active attacks. This paper proposes a novel solution for location based service （LBS） in vehicular ad hoc network （VANET）. Firstly, the relationship among anonymity degree, expected company area and vehicle density is discussed. Then, a companion set F is set up by k neighbor vehicles. Based on secure multi-party computation, each vehicle in V can compute the centroid, not revealing its location to each other. The centroid as a cloaking location is sent to LBS provider （P） and P returns a point of interest （POI）. Due to a distributed secret sharing structure, P cannot obtain the positions of non-complicity vehicles by colluding with multiple internal vehicles. To detect fake data from dishonest vehicles, zero knowledge proof is adopted. Comparing with other related methods, our solution can resist passive and active attacks from internal and external nodes. It provides strong privacy protection for LBS in VANET.
