基于组群的有限路长匿名通信协议
An Anonymous Communication Protocol Based on Groups with Definite Route Length
-
摘要: 匿名通信是指通过一定的方法将业务流中的通信关系加以隐藏 ,使窃听者无从直接获知或推知双方的通信关系或通信的一方 基于组群的匿名实现了通过多主机的转发对发送者或双方通信关系的隐藏 ,典型的实现如Crowds利用转发概率实现了发送者一定程度的匿名 ,但系统中路径长度没有上界 ,在极端的情况下可能会使转发路径无限长 ,这对网络服务来说是无法接受的 基于组群的有限路长匿名通信协议是一种改进的匿名通信协议 ,实现了路径长度的有界性 该协议获得的匿名度与路径长度k、泄密者比例、组群大小之间具有定量的关系 协议中通过构造一随机函数对路径长度随机取值 ,降低了发送者暴露的可能性 相关计算数据表明 ,在相同路径长度期望下 ,有限长度协议比Crowds具有更强的抗泄密能力Abstract: Anonymous communication can hide the communication relationship for traffic flow by using some methods, so that eavesdropper can not directly know or easily induce the relation or initiator of communication Anonymity based on groups realizes the anonymity by transmitting packets forward by hosts in the group Typical prototype such as Crowds can give initiator anonymity in a certain extent by using forward probability But there is no upper bound for the length of route, under the extreme circumstance the route length will be infinite which can not be accepted by network service An anonymous communication protocol based on groups with definite route length is an improved protocol for initiator anonymity based on groups The improved protocol limits the route length The inequation indicating the relation of anonymity,length of route, proportion of compromised hosts, and group scale will be given and proved in this paper Meanwhile, a randomized function is constructed to generate random value for length of route so as to minimize the probability of initiator exposed By comparing the related data calculated under the same expected value for the length of route, it is concluded that the improved protocol has more strong anti compromised capability than Crowds
下载: