检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:周健[1,2] 孙丽艳[1] 段爱华[1] 施文君[1]
机构地区:[1]安徽财经大学管理科学与工程学院,安徽蚌埠233041 [2]北京邮电大学计算机学院,北京100083
出 处:《信息网络安全》2017年第8期45-52,共8页Netinfo Security
基 金:国家自然科学基金[61402001;61402147];安徽省高校自然科学研究项目[KJ2013B001];安徽财经大学重点项目[ACKY1517ZDB]
摘 要:空间自组织网络具有长延时、宽覆盖、受限能力、高速移动等特点,短时间内对网络全部实体身份进行有效认证是一个困难问题。针对这一问题,文章设计了一种随机密钥图结构,证明基于DH协议的具有共边的实体能够相互认证身份。在此基础上提出一种面向分布式网络的身份预配置管理方案,根据网络规模、连通概率、节点度从密钥图中随机获取部分实体认证材料,在保证认证效率的前提下通过提高证书数量缩小秘密值规模,使得和邻居的认证成功概率为大概率事件。Due to long time delay, broad coverage area, limited node capability and high mobility in mobile space self-organized networks, it is difficult to recognize the identity of node efficiently and safely. In order to solve the question, this paper put forwards a scheme based on random key graph, with which two nodes could prove the identity each other if they have a same edge from the random key graph based on DH protocol. At time, pre-configurationidentity authentication protocol is suggested for distributed networks, space entities get part of the material of identity authentication so as to recognize all legal nodes identity directly and indirectly according to parameters including network size, key graph scale, connective probability, and recognizing the legal identity of neighbor nodes successfully is a high probability event.So the scale of secret value for node identity can be lessened in the condition of guaranteeing the efficiency of identity authentication with increasing the number of certificates.
分 类 号:TN918.4[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.185