安全组播密钥管理的近似算法
Approximation Algorithms for Key Management in Secure Multicast
摘要:
许多保证参与者的隐私和真实性的数据分发和订阅系统依赖于对称密钥加密。在这样的系统中的一个重要问题是当组成员改变时维护共享组密钥。我们考虑的问题,确定一个关键的层次结构,最大限度地减少更新的平均通信成本,给定更新频率的组成员和边加权无向图,捕捉路由成本。首先,我们提出了一个多项式时间近似方案,用于最小化更新所需的多播消息的平均数量。我们接下来表明,当路由成本被认为是,即使底层路由网络是一个树网络,甚至当每个组成员有相同的更新频率的问题是NP-难的。我们的主要结果是一个多项式时间常数因子近似算法的一般情况下,路由网络是一个任意的加权图和组成员有不均匀的更新频率。
英文摘要:
Many data dissemination and publish-subscribe systems that guarantee the privacy and authenticity of the participants rely on symmetric key cryptography. An important problem in such a system is to maintain the shared group key as the group membership changes. We consider the problem of determining a key hierarchy that minimizes the average communication cost of an update, given update frequencies of the group members and an edge-weighted undirected graph that captures routing costs. We first present a polynomial-time approximation scheme for minimizing the average number of multicast messages needed for an update. We next show that when routing costs are considered, the problem is NP-hard even when the underlying routing network is a tree network or even when every group member has the same update frequency. Our main result is a polynomial time constant-factor approximation algorithm for the general case where the routing network is an arbitrary weighted graph and group members have nonuniform update frequencies.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。