• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>IEEE Transactions on Parallel and Distributed Systems >Optimal Dispersal of Certificate Chains
【24h】

Optimal Dispersal of Certificate Chains

机译：证书链的最佳分散

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

We consider a network where users can issue certificates that identify the public keys of other users in the network. The issued certificates in a network constitute a set of certificate chains between users. A user u can obtain the public key of another user v from a certificate chain from u to v in the network. For the certificate chain from u to v, u is called the source of the chain and v is called the destination of the chain. Certificates in each chain are dispersed between the source and destination of the chain such that the following condition holds. If any user u needs to securely send messages to any other user v in the network, then u can use the certificates stored in u and v to obtain the public key of v (then u can use the public key of v to set up a shared key with v to securely send messages to v). The cost of dispersing certificates in a set of chains among the source and destination users in a network is measured by the total number of certificates that need to be stored in all users. A dispersal of a set of certificate chains in a network is optimal if no other dispersal of the same chain set has a strictly lower cost. In this paper, we show that the problem of computing optimal dispersal of a given chain set is NP-complete. Thus, minimizing the total number of certificates stored in all users is NP--complete. We identify three special classes of chain sets that are of practical interests and devise three polynomial-time algorithms that compute optimal dispersals for each class. We also present two polynomial-time extensions of these algorithms for more general classes of chain sets.
机译：我们考虑一个网络，用户可以在该网络中颁发证书，以标识网络中其他用户的公钥。网络中颁发的证书构成用户之间的一组证书链。用户u可以从网络中从u到v的证书链中获得另一个用户v的公钥。对于从u到v的证书链，u称为链的源，而v称为链的目的地。每个链中的证书分散在链的源和目的地之间，从而满足以下条件。如果任何用户u需要安全地向网络中的其他任何用户v发送消息，则u可以使用u和v中存储的证书来获取v的公钥（然后u可以使用v的公钥来设置a与v共享密钥以安全地向v发送消息）。将证书散布在网络中源用户和目标用户之间的一组链中的成本由需要存储在所有用户中的证书总数来衡量。如果同一链集的其他分散都没有严格降低成本，则在网络中分散一组证书链是最佳的。在本文中，我们表明，计算给定链集的最佳扩散的问题是NP完全的。因此，最小化存储在所有用户中的证书总数是NP--完成的。我们确定了三个特殊类别的链集具有实际意义，并设计了三种多项式时间算法来计算每个类别的最佳离散度。对于链集的更通用类别，我们还提出了这些算法的两个多项式时间扩展。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号