论文部分内容阅读
针对车联网用户安全与隐私保护问题,提出一种基于匿名互换的用户安全与隐私保护机制。该机制提出构建可以匿名互换的社团———Mix-Crowd,并基于组密钥机制实现了保证基本安全需求下的匿名互换。基于实际数据分析讨论Mix-Crowd划分规则对机制性能的影响,并采用熵衡量该机制提供的不可连接性程度。理论分析表明:该机制下系统的最大熵独立于匿名互换次数,即该机制可以用较少的匿名互换次数和较小的组规模实现较高的安全性。
Aiming at the problem of car users’ security and privacy protection, this paper proposes an anonymous exchange of user security and privacy protection mechanisms. This mechanism proposes to construct Mix-Crowd, an anonymous exchange society, and implement anonymous exchange based on the group key mechanism to ensure the basic security requirements. Based on the actual data analysis, the influence of Mix-Crowd classification rules on mechanism performance is discussed, and entropy is used to measure the degree of non-connectivity provided by this mechanism. Theoretical analysis shows that the maximum entropy of the system under this mechanism is independent of the number of anonymous exchanges, that is, the mechanism can achieve higher security with fewer anonymous interchanges and smaller group sizes.