arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0908.1805cs.NIcs.CR
收藏

匿名网络理论

Towards a Theory of Anonymous Networking

J. Ghaderi, R. Srikant

摘要:

匿名网络的问题时,窃听观察数据包的时间在通信网络中被认为是。其目标是隐藏源-目的节点的身份,以及网络中信息流的路径。实现这种匿名性的一种方法是使用混合器。混合器是从多个源接收分组并通过在输出链路处混合分组来改变分组的定时以防止窃听者找到传出分组的源的节点。在本文中,我们考虑两个简单但基本的情况:双输入单输出混频器和双输入双输出混频器。对于第一种情况,我们使用的匿名性的信息理论的定义,基于平均熵每包,并找到一个严格的延迟约束下的最佳混合策略。对于第二种情况,考虑了完全匿名性,并在严格的延迟约束和平均队长约束下,找到了具有完全匿名性的最大吞吐量策略。

英文摘要:

The problem of anonymous networking when an eavesdropper observes packet timings in a communication network is considered. The goal is to hide the identities of source-destination nodes, and paths of information flow in the network. One way to achieve such an anonymity is to use mixers. Mixers are nodes that receive packets from multiple sources and change the timing of packets, by mixing packets at the output links, to prevent the eavesdropper from finding sources of outgoing packets. In this paper, we consider two simple but fundamental scenarios: double input-single output mixer and double input-double output mixer. For the first case, we use the information-theoretic definition of the anonymity, based on average entropy per packet, and find an optimal mixing strategy under a strict latency constraint. For the second case, perfect anonymity is considered, and maximal throughput strategies with perfect anonymity are found under a strict latency constraint and an average queue length constraint.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑