Abstract: Concerning the privacy protection problem in Vehicular Ad Hoc NETwork (VANET), a scheme based on K-anonymous chain privacy protection was proposed. The scheme built a k anonymous area near the query node and forwarded the minimum boundary rectangle containing the k vehicles as location data. The process of forwarding constructed an anonymous chain to confuse the corresponding relationship of identity information and location information, thus greatly reducing the probability of successful attack. Seen from the analysis of security and simulation experiment results, this scheme can well protect the privacy of mobile vehicles and improve the security and privacy of vehicular network communication.

Key words: location privacy, anonymous space, K-anonymous chain, Chord, vehicular network

摘要： 针对车载网络通信中存在车辆隐私性保护问题,提出一个K-匿名链隐私保护机制。在查询节点处构建k匿名空间,并将包含此k个车辆的最小边界矩阵作为位置数据进行转发,转发过程中构造一条匿名链来混淆身份信息与位置信息的一一对应关系,从而大大降低被攻击成功的概率。通过对该机制安全性及仿真实验结果的分析,该机制能很好地保护车载网络中车辆的位置隐私,提高了车载网络通信的安全性及隐私性。

关键词: 位置隐私, 匿名空间, K-匿名链, Chord, 车载网络