首页> 外文期刊>Networking, IEEE/ACM Transactions on >Delay Anonymity Tradeoff in Mix Networks: Optimal Routing
【24h】

Delay Anonymity Tradeoff in Mix Networks: Optimal Routing

机译:混合网络中的延迟匿名权衡:最优路由

获取原文
获取原文并翻译 | 示例

摘要

Anonymous systems on the Internet aim to protect users from revealing to an external unauthorized entity their identities and their network activities. Despite using layered encryption, these systems are still vulnerable to timing analysis, wherein an eavesdropper can use traffic correlation mechanisms to identify the source of packets arriving at a destination. Mixes are intelligent routers or proxy servers that aim to provide packet source anonymity from timing analysis by delaying and shuffling the order of received packets prior to transmission. Such shuffling strategies naturally increase latency and result in a tradeoff between anonymity and latency. This paper investigates this tradeoff in a network of mixes, by deriving the optimal routing for sources which maximizes weighted sum of anonymity and delay. The achievable anonymity is characterized analytically for a general multipath model, and it is shown that under light traffic conditions, there exists a unique single route strategy, which achieves the optimal delay anonymity tradeoff. A low complexity algorithm is presented that derives the optimal routes to achieve a desired tradeoff. The light traffic results are specialized for a graphical model of existing practical anonymous systems, and optimal scaling behavior with the size of such networks is characterized. In the heavy traffic regime, it is shown that optimal anonymity is achieved for any allocation of rates across the different routes. Simulations on example networks are presented where it is shown that the optimal routes derived under light traffic performs quite well in general traffic regime.
机译:Internet上的匿名系统旨在防止用户向外部未授权实体透露其身份和网络活动。尽管使用分层加密,但是这些系统仍然容易受到时序分析的影响,其中窃听者可以使用流量关联机制来识别到达目的地的数据包的来源。混合是智能路由器或代理服务器,旨在通过在传输之前延迟和改组接收到的数据包的顺序,从时序分析中提供数据包源的匿名性。这样的改组策略自然地增加了等待时间,并导致匿名和等待时间之间的权衡。本文研究了混合网络中的这种折衷,方法是为源分配最佳路由,从而使匿名和延迟的加权总和最大化。对于一般的多路径模型,分析了可实现的匿名性,并表明在轻交通条件下,存在一种独特的单路径策略,该策略可以实现最佳的延迟匿名性折衷。提出了一种低复杂度的算法,该算法可得出实现所需折衷的最佳路径。光通信量结果专门用于现有实用匿名系统的图形模型,并描述了具有此类网络大小的最佳缩放行为。在交通繁忙的情况下,表明对于不同路线上的任何费率分配都可以实现最佳匿名性。给出了对示例网络的仿真,结果表明,在轻型交通情况下得出的最佳路线在一般交通情况下表现良好。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号