基于分簇的Ad Hoc网络密钥协商协议

以节点的公钥证书为基础,基于椭圆曲线密码体制提出一种分簇结构的Ad Hoc网络会话密钥协商协议,对协议的安全性和效率进行分析。该协议满足普遍认可的密钥协商安全要求,可抵抗中间人攻击、重放攻击、消息伪造攻击等多种攻击,有效地降低终端的计算、存储能力需求,减少了协商过程的通信开销。     

Ad Hoc网络中一种组密钥协商协议

移动Ad Hoc网络是一种新型的移动多跳无线网络。在网络中构建组密钥协商协议时应尽量减少节点的资源开销。该文提出一种新的多层组密钥协商协议,MTKA-ECC协议。该协议在多层组模型结构上,采用椭圆曲线密码体制实施密钥协商和分配,使得节点在密钥协商过程中具有低计算开销与低通信开销的优势。与GDH, TGDH组密钥协商协议相比,该协议有效地降低了节点在密钥协商过程中的计算和通信开销,适用于移动Ad Hoc网络。     

一种新的移动Ad Hoc网络会话密钥协商协议

文章在移动Ad Hoc网络环境下,以节点公钥证书为基础,提出了一个安全的会话密钥协商协议,使得非法节点无法获知通信内容,有效地保证了移动Ad Hoc网络的通信安全。     

Grouping Byzantine Agreement

The reliability of the distributed system has always been an important topic of research. Byzantine Agreement (BA) protocol, which allows the fault-free processors to agree on a common value, is one of the most fundamental problems studied in a distributed system. In previous works, the problem was visited in a fully connected network or an unfully connected network with fallible processors. In this paper, the BA problem is reexamined in a group-oriented network, which has the feature of grouping, and the network topology does not have to be fully connected. We also enlarge the fault tolerant capability by allowing dormant faults and malicious faults (also called as the dual failure mode) to exist in a group-oriented network simultaneously. The proposed protocol is more efficient than the traditional BA protocols and can tolerate the maximum number of tolerable faulty processors.     

Randomized Byzantine Agreement

A randomized model of distributed computation was recently presented by Rabin [ 81. This model admits a solution to the Byzantine Agreement Problem for systems of n asynchronous processes where no more than t are faulty. The algorithm described by Rabin produces agreement in an expected number of rounds which is a small constant independent of n and t. Using the same model, we present an algorithm of similar complexity which is able to tolerate a greater portion of malicious processes. The algorithm is also applicable, with minor changes, to systems of synchronous processes.     

无线Ad Hoc网络组密钥协商和管理方案

提出了一种无线Ad Hoc网络组密钥协商和管理方案,协商过程不需网络有特定拓扑结构,节点间不需预先的共享信息,协商结构易于维护,满足Ad Hoc网络无基础结构的特点和网络节点移动产生的密钥更新要求。分析表明,该方案充分考虑Ad Hoc节点分布特点,密钥安全可靠,防止dominator合谋攻击,密钥结构便于管理。节点间通信可靠迅速,减少了通信时延,密钥协商的通信量和计算量较已知协议有改进,适合于各类的无线Ad Hoc网络。     

Ad Hoc网络中一种基于环状分层结构的组密钥协商协议

移动ad hoc网络是一种新型的移动多跳无线网络.其自身的特征,如网络规模庞大、动态的拓扑结构、有限的计算、通信和存储能力等,使得传统的密钥分配和管理机制无法直接应用于该网络.提出了一种新的适用于移动 ad hoc网络的组密钥协商协议.该协议在环状分层结构上基于多线性映射进行组密钥的协商和分配,使得节点在密钥协商过程中具有低计算开销与低通信开销的优势,较好地解决了在移动ad hoc网络中进行组密钥协商时所遇到的节点能量受限问题,适用于移动ad hoc网络.     

Message-optimal protocols for Byzantine Agreement

It is often important for the correct processes in a distributed system to reach agreement, despite the presence of some faulty processes. Byzantine Agreement (BA) is a paradigm problem that attempts to isolate the key features of reaching agreement. We focus here on the number of messages required to reach BA, with particular emphasis on the number of messages required in thefailure-free runs, since these are the ones that occur most often in practice. The number of messages required is sensitive to the types of failures considered. In earlier work, Amduret al. (1992) established tight upper and lower bounds on the worst- and average-case number of messages required in failure-free runs for crash failures. We provide tight upper and lower bounds for all remaining types of failures that have been considered in the literature on the BA problem: receiving omission, sending omission, and general omission failures, as well as arbitrary failures with or without message authentication. We also establish a tradeoff between number of rounds and number of messages in the failure-free runs required to reach agreement in the case of crash, sending, and general omission failures.The work of V. Hadzilacos was supported, in part, by a grant from the Natural Sciences and Engineering Research Council of Canada.     

移动Ad hoc与WSN网络特点和路由协议分析

移动Ad hoc网络是近年来网络研究的热点,WSN(Wireless Sensor Networks,无线传感器网络)是传感器研究领域一个新的研究方向.由于它们之间诸多的相似性使得每当提到WSN的时候往往与Ad hoc网络做比较.本文试图通过对Ad hoc网络和WSN网络特点和路由协议的介绍和分析,使这两个领域区别并联系起来.     

基于口令认证的移动Ad Hoc网密钥协商方案

Ad Hoc网是一种不依赖于任何固定基础设施、没有中心控制节点、计算资源受限的新型无线移动网络.基于ECC(elliptic curves cryptography),提出了一个新的适用于Ad Hoc网的具有口令认证和共享口令进化的多方密钥协商方案.口令的一个功能是作为共享信息认证移动节点的密钥,另一个功能是作为对称密钥加密移动节点间的交互信息.共享口令进化机制保证每次认证节点密钥和协商会话密钥时口令的新鲜性和安全性,从而既减轻了移动节点的计算量和存储负担,又实现了移动节点之间的密钥认证和信息加密.新方案具有抗中间人攻击、抗重放攻击、密钥独立和前向安全等多种安全特性.     

Asynchronous Byzantine Agreement with optimal resilience

We present an efficient, optimally-resilient Asynchronous Byzantine Agreement (ABA) protocol involving $n = 3t+1$ parties over a completely asynchronous network, tolerating a computationally unbounded Byzantine adversary, capable of corrupting at most $t$ out of the $n$ parties. In comparison with the best known optimally-resilient ABA protocols of Canetti and Rabin (STOC 1993) and Abraham et al. (PODC 2008), our protocol is significantly more efficient in terms of the communication complexity. Our ABA protocol is built on a new statistical asynchronous verifiable secret sharing (AVSS) protocol with optimal resilience. Our AVSS protocol significantly improves the communication complexity of the only known statistical and optimally-resilient AVSS protocol of Canetti et al. Our AVSS protocol is further built on an asynchronous primitive called asynchronous weak commitment (AWC), while the AVSS of Canetti et al. is built on the primitive called asynchronous weak secret sharing (AWSS). We observe that AWC has weaker requirements than AWSS and hence it can be designed more efficiently than AWSS. The common coin primitive is one of the most important building blocks for the construction of an ABA protocol. In this paper, we extend the existing common coin protocol to make it compatible with our new AVSS protocol that shares multiple secrets simultaneously. As a byproduct, our new common coin protocol is more communication efficient than all the existing common coin protocols.     

Efficient Algorithms for Anonymous Byzantine Agreement

This paper considers the Byzantine agreement problem in a completely connected network of anonymous processors. In this network model the processors have no identifiers and can only detect the link through which a message is delivered. We present a polynomial-time agreement algorithm that requires 3⌊(n−t)t/(n−2t)⌋+4 rounds, where n>3t is the number of processors and t is the maximal number of faulty processors that the algorithm can tolerate. We also present an early-stopping variant of the algorithm.     

Lower bound for scalable Byzantine Agreement

We consider the problem of computing Byzantine Agreement in a synchronous network with n processors, each with a private random string, where each pair of processors is connected by a private communication line. The adversary is malicious and non-adaptive, i.e., it must choose the processors to corrupt at the start of the algorithm. Byzantine Agreement is known to be computable in this model in an expected constant number of rounds. We consider a scalable model where in each round each uncorrupt processor can send to any set of log n other processors and listen to any set of log n processors. We define the loss of an execution to be the number of uncorrupt processors whose output does not agree with the output of the majority of uncorrupt processors. We show that if there are t corrupt processors, then any randomised protocol which has probability at least 1/2 + 1/ logn of loss less than requires at least f rounds. This also shows that lossless protocols require both rounds, and for at least one uncorrupt processor to send messages during the protocol.     

无线Ad Hoc传感器网阴影衰落环境下连接性

连接性是在设计和仿真无线Ad Hoc传感器网时需要确定的重要基础性问题。在理想环境和阴影衰落环境下,在网络节点采用均匀分布时,对无线Ad Hoc传感器网的连接性采用网络覆盖的方法进行了理论计算,得出了在一定的范围中网络保持连接时所需的最少网络节点数nm in与最小节点发射半径Rm in的精确公式,这为在实际工程应用中的网络设计提供了重要的理论依据。     

Ad Hoc网络安全

Ad Hoc网络是针对移动主机提出的一种新型无线网络范例，与传统的移动无线网络不同，它不依赖任何固定设备。设计这种网络的一项主要挑战就是抵抗攻击的脆弱性。在这篇文章中，我们主要研究Ad Hoc网络所面临的威胁以及要达到的安全目标。我们找出这种新型网络环境下面临的新的挑战，并设计出新的方法以保证网络的正常通信。进一步地说，我们利用Ad Hoc网络内在的冗余(节点之间存在多条路线)来防止攻击。     

Byzantine Agreement under dual failure mobile network

Networks are trending towards wireless systems that provide support for mobile computing. The Byzantine Agreement (BA) protocols used in static networks do not perform well in a dynamically changing mobile environment. Mobile commerce and related applications are necessary for wireless networks. There are numerous properties in a wireless network that play important roles. For example, the processors in a wireless network have highly mobile capabilities. Processors can immigrate into or move away from the network at any time. Although mobile technology has brought greater convenience, it is comparatively more dangerous. Wireless systems are susceptible to security flaws such as attacks by hackers. The number of allowable faulty components within the system is also decreased. To increase the number of allowable faulty components and ensure network security, a simple, secure and efficient protocol, BAM, is proposed to handle the BA problem. The fault symptoms include malicious and dormant faults. Furthermore, the proposed protocol uses the minimum number of message exchange rounds to make all healthy processors agree on a common value and can tolerate the maximum number of allowable faulty components. The proposed method will also ensure message security and increase the system's fault tolerant capability.     

Byzantine Agreement in a generalized connected network

Traditionally, the Byzantine Agreement (BA) problem is studied either in a fully connected network or in a broadcast network. A generalized network model for BA is proposed in this paper. A fully-connected network or a broadcast network is a special case of the new network architecture. Under the new generalized network model, the BA problem is reexamined with the assumption of malicious faults on both processors and transmission medium (TM), as opposed to previous studies which consider malicious faults on processors only. The proposed algorithm uses the minimum number of message exchanges, and can tolerate the maximum number of allowable faulty components to make each healthy processor reach a common agreement for the cases of processor failures, TM failures, or processor/TM failures. The results can also be used to solve the interactive consistency problem and the consensus problem     

Ad Hoc Reviewers 2005

This article considers the nature of e-mail from the recipient's perspective-what the seemingly free and easy communication really costs the recipient. Information gathered by electronic monitoring software is shown to be at odds with the results of an online survey of e-mail users' perceptions of their e-mail experience-users drastically underestimate the disruptive effects of e-mail. The conclusion is that the constant monitoring of e-mail actually reduces productivity and that there is a need for increased power, control, and awareness on the part of the e-mail recipient to ensure that e-mail remains a tool rather than a tyrant. It is necesssary to alert the user of the true cost of e-mail alerts.