层次网络中强弹性非交互密钥预分配
Strongly Resilient Non-Interactive Key Predistribution For Hierarchical Networks
摘要：
密钥建立是网络安全中必不可少的基本工具，网络中的成对节点通过密钥建立共享密钥，以保护它们之间的通信。已经有一些密钥协商或预分配方案，其属性是可以在没有交互的情况下建立密钥（\cite{Blom84,BSHKY92,S97}）。近年来，分层密码学和分层网络的密钥管理已经成为活跃的主题（参见\cite{BBG05,GHKRRW08,GS02,HNZI02,HL02,Matt04} . ). \cite{Matt04,GHKRRW08}在Blom密钥预分配方案（Blom KPS，[1]）和配对的基础上提出了一种分层网络的密钥协商方案。本文介绍了推广的Blom-Blundo等人的密钥预分配方案。这些推广的Blom-Blundo等人的密钥预分配方案具有与Blom-Blundo等人的KPS方案相同的安全功能。然而，不同的和随机的这些KPS可以用于网络的各个部分，以增强弹性。我们还提出了一族超椭圆曲线的密钥预分配方案。这些来自不同随机曲线的密钥预分配方案可用于分层网络的各个部分。然后，在此基础上构造了一个非交互的、基于身份的、动态的密钥预分配方案，该方案基于广义Blom-Blundo等人的KPS和超椭圆曲线KPS，并具有如下性质. 1)在网络中的每个节点处的$O(A_KU)$存储，其中$U$是扩展数，并且$A_K$是分层网络的第$K$层处的节点的数目; 2）对任意多个叶节点和内部节点的损害的强弹性; 3）没有随机预言的信息理论安全性。
英文摘要：
Key establishment is the basic necessary tool in the network security, by which pairs in the network can establish shared keys for protecting their pairwise communications. There have been some key agreement or predistribution schemes with the property that the key can be established without the interaction (\cite{Blom84,BSHKY92,S97}). Recently the hierarchical cryptography and the key management for hierarchical networks have been active topics(see \cite{BBG05,GHKRRW08,GS02,HNZI02,HL02,Matt04}. ). Key agreement schemes for hierarchical networks were presented in \cite{Matt04,GHKRRW08} which is based on the Blom key predistribution scheme(Blom KPS, [1]) and pairing. In this paper we introduce generalized Blom-Blundo et al key predistribution schemes. These generalized Blom-Blundo et al key predistribution schemes have the same security functionality as the Blom-Blundo et al KPS. However different and random these KPSs can be used for various parts of the networks for enhancing the resilience. We also presentkey predistribution schemes from a family hyperelliptic curves. These key predistribution schemes from different random curves can be used for various parts of hierarchical networks. Then the non-interactive, identity-based and dynamic key predistributon scheme based on this generalized Blom-Blundo et al KPSs and hyperelliptic curve KPSs for hierarchical networks with the following properties are constructed. 1)$O(A_KU)$ storage at each node in the network where $U$ is the expansion number and $A_K$ is the number of nodes at the $K$-th level of the hierarchical network; 2)Strongly resilience to the compromising of arbitrary many leaf and internal nodes; 3)Information theoretical security without random oracle.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
