高级检索
    眭鸿飞 陈建二 陈松乔 朱娜斐. 重路由匿名通信系统中基于秘密共享的重路由算法[J]. 计算机研究与发展, 2005, 42(10): 1660-1666.
    引用本文: 眭鸿飞 陈建二 陈松乔 朱娜斐. 重路由匿名通信系统中基于秘密共享的重路由算法[J]. 计算机研究与发展, 2005, 42(10): 1660-1666.
    Sui Hongfei, Chen Jian'er, Chen Songqiao, and Zhu Nafei. Secret Sharing-Based Rerouting in Rerouting-Based Anonymous Communication Systems[J]. Journal of Computer Research and Development, 2005, 42(10): 1660-1666.
    Citation: Sui Hongfei, Chen Jian'er, Chen Songqiao, and Zhu Nafei. Secret Sharing-Based Rerouting in Rerouting-Based Anonymous Communication Systems[J]. Journal of Computer Research and Development, 2005, 42(10): 1660-1666.

    重路由匿名通信系统中基于秘密共享的重路由算法

    Secret Sharing-Based Rerouting in Rerouting-Based Anonymous Communication Systems

    • 摘要: 重路由匿名通信系统主要采用重路由机制来提供匿名保护.已有的下一跳重路由方式具有抗攻击能力弱且通信延时大等缺陷.提出基于秘密共享的重路由算法,用于在下一跳路由中实现端到端的加密,从而有效增大恶意成员的攻击难度.理论分析表明,抗攻击能力达到与源路由方式同等水平.并且,由于发送者能有效控制路由长度,因而能保证良好的通信性能.

       

      Abstract: Rerouting is the main mechanism in rerouting-based anonymous communication system for protecting the anonymity of communication participant. Next hop rerouting, an important type of rerouting that is adopted in many rerouting-based anonymous communication systems, is easy to compromise by predecessor attack, and has the drawback of high communication delay. In this paper, a new next hop rerouting mechanism, secret sharing-based rerouting(SSR), is proposed based on threshold scheme. With this mechanism, end-to-end encryption between the sender and the last intermediator on the rerouting path can be achieved. Thus, the complexity for attackers to compromise the anonymity is made high. Theoretical analysis demonstrates that the complexity can be kept on the same level as source rerouting. Moreover, the sender can control the path length effectively, therefore limiting the communication delay.

       

    /

    返回文章
    返回