Certificate dispersal in ad-hoc networks
Certificate dispersal in ad-hoc networks
复制标题
ad-hoc 网络中的证书分发
DOI：
10.1109/icdcs.2004.1281629
复制
发表时间：
2004
期刊：
影响因子：
--
通讯作者：
Eunjin Jung
中科院分区：
文献类型：
--
作者：
M. Gouda;Eunjin Jung
我们研究如何分散的证书，在一个ad-hoc网络中，网络节点之间，使以下条件成立。如果任何节点u接近网络中的任何其他节点v，则u可以使用存储在u或v中的证书来获得v的公钥（以便u可以安全地向v发送消息）。我们将证书分散的成本定义为网络中一个节点上存储的证书的平均数量。我们给出了证书的分散性成本的上限和下限，并表明这两个界限是紧的。我们还提出了两个证书分散算法，并表明，这些算法之一是更有效的比其他在几个重要的情况下。最后，我们确定了一个丰富的类的“证书图”的分散性成本是在一个恒定的因素从下界。
We investigate how to disperse the certificates, issued in an ad-hoc network, among the network nodes such that the following condition holds. If any node u approaches any other node v in the network, then u can use the certificates stored either in u or in v to obtain the public key of v (so that u can securely send messages to v). We define the cost of certificate dispersal as the average number of certificates stored in one node in the network. We give upper and lower bounds on the dispersability cost of certificates, and show that both bounds are tight. We also present two certificate dispersal algorithms, and show that one of those algorithms is more efficient than the other in several important cases. Finally, we identify a rich class of "certificate graphs" for which the dispersability cost is within a constant factor from the lower bound.