arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 0808.0156cs.CRcs.NI
收藏

认证对抗路由

Authenticated Adversarial Routing

Yair Amir, Paul Bunn, Rafail Ostrovksy

摘要:

本文的目的是证明在一个不可靠的和动态变化的同步网络中,大多数恶意内部试图破坏和改变消息或以任何方式中断通信的认证吞吐量高效路由的可行性。更具体地说,在本文中,我们试图回答以下问题:给定一个网络,其中大多数节点控制的恶意对手和其拓扑结构是不断变化的每一轮,是否有可能开发一个协议,每个处理器的多项式有界内存,保证吞吐量高效和正确的端到端通信?对于非常普遍的腐败模式,我们肯定地回答了这个问题:我们只要求网络的拓扑结构和对手的腐败模式每轮至少留下一条通过诚实节点连接发送者和接收者的路径(尽管这条路径可能在每轮都发生变化)。Out构造在公钥设置中工作,并且每个处理器享有有限的内存(不依赖于流量的大小,并且在网络大小中是多项式的)。我们的协议实现了最佳的传送率,可以忽略不计的解码错误。我们强调,我们的协议假设没有知识的节点被损坏,也没有路径是可靠的,在任何一轮,也是完全分布式的节点在本地决策,使他们不需要知道网络的拓扑结构在任何时候。

英文摘要:

The aim of this paper is to demonstrate the feasibility of authenticated throughput-efficient routing in an unreliable and dynamically changing synchronous network in which the majority of malicious insiders try to destroy and alter messages or disrupt communication in any way. More specifically, in this paper we seek to answer the following question: Given a network in which the majority of nodes are controlled by a malicious adversary and whose topology is changing every round, is it possible to develop a protocol with polynomially-bounded memory per processor that guarantees throughput-efficient and correct end-to-end communication? We answer the question affirmatively for extremely general corruption patterns: we only request that the topology of the network and the corruption pattern of the adversary leaves at least one path each round connecting the sender and receiver through honest nodes (though this path may change at every round). Out construction works in the public-key setting and enjoys bounded memory per processor (that does not depend on the amount of traffic and is polynomial in the network size.) Our protocol achieves optimal transfer rate with negligible decoding error. We stress that our protocol assumes no knowledge of which nodes are corrupted nor which path is reliable at any round, and is also fully distributed with nodes making decisions locally, so that they need not know the topology of the network at any time.

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

↑