欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
针对匿名通信系统中的搭便车（free-riding）问题，基于交易思想提出了一种促进匿名系统成员共同参与转发服务的匿名通信策略，量化地分析了匿名通信系统中发送者为实现可能无辜（probable innocence）应准备的钱币数量。理论分析和数据计算表明，在没有降低系统匿名性能的前提下，应用支付机制后的匿名系统能够公平地和经济有效地实现匿名通信，有效抑制成员串通获利现象，同时避免了下一跳路由中路径长度趋于无限长的可能性。
英文摘要：
In view of the free-riding problem in anonymous communication, i.e., presence of the nodes who use the systems while provide little or no service for other users in the systems, the paper proposes an anonymous communication strategy to promote and encourage participants to provide service for the systems, and analyzes the number of coins that a sender uses to pay for the peers on its anonymous route, and presents a new measure in the payment mechanism that is suitable to a next-hop anonymous system. The theoretical analysis and data calculation show that the system with the new payment mechanism can promote anonymous communication effectively while keep the system performance comparable to the existing anonymous systems such as Crowds. Moreover, the new method can avoid the drawback of existing anonymous systems that enforces no upper bound on the length of anonymous routes.
同期刊论文项目
同项目期刊论文
位置：