检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:ZHU Xiaoling HU Donghui HOU Zhengfeng DING Liang
出 处:《China Communications》2014年第9期60-67,共8页中国通信(英文版)
基 金: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.Existing location privacypreserving 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 V 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.
关 键 词:vehicular ad hoc network locationbased services location k-anonymity securemulti-party computation
分 类 号:TP311[自动化与计算机技术—计算机软件与理论] TP393.08[自动化与计算机技术—计算机科学与技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.112