一种基于二次型的无线传感器网络密钥管理方案

针对现有的基于多项式的密钥预分配管理方案受限于节点间密钥共享率和网络连通率等问题,文中提出了一种基于二次型的无线传感器密钥管理方案.该方案突破现有二元t次对称多项式建立共享密钥的思路,引入多元非对称二次型多项式,利用二次型特征值与特征向量之间的关系,分析证明二次型正交对角化的特性,生成密钥信息,节点则通过交换密钥信息实现身份认证,生成与邻居节点之间独立唯一的会话密钥.性能分析表明,与现有的密钥管理方案相比,方案在抗俘获性、连通性、可扩展性、通信开销和存储开销上有较大的改进.     

WSN的网络安全管理机制研究

本文提出一种基于多项式的WSN密钥管理方案.基站通过计算节点秘密信息构成的多项式来生成网络的全局密钥,节点通过全局密钥可以认证网络中的合法节点.节点用全局密钥经过对称多项式密钥交换来生成与簇头节点之间的会话密钥.该方案能够动态更新密钥,从而解决了由于节点被捕获所导致的信息泄露、密钥连通性下降和密钥更新通信开销大等问题.性能分析表明,该方案与现有的密钥预分配方案相比,具有更低的存储开销、通信开销、良好的扩展性和连通性.     

无线传感器网络中具有撤销功能的自愈组密钥管理方案

在有限域F_q上构造基于秘密共享的广播多项式,提出一种具有节点撤销功能的组密钥更新方案.同时,基于单向散列密钥链建立组密钥序列,采用组密钥预先更新机制,容忍密钥更新消息的丢失,实现自愈.分析表明,在节点俘获攻击高发的环境中,方案在计算开销和通信开销方面具有更好的性能.     

WSN中基于全同态加密的对偶密钥建立方案

针对Guo等人基于排列的多对称多项式方案提出一种攻击方法,证明其方案未能突破容忍门限,并不能抵御大规模节点俘获攻击。通过引入全同态加密提出一种对偶密钥建立方案,使共享密钥计算过程在加密状态下完成,.阻止了敌手获得与多项式有关的信息,成功应对了大规模节点俘获攻击。提出一种全同态加密体制的间接实现方法,降低了方案的存储及计算复杂度。分析及实验表明本方案的存储、计算和通信开销完全满足无线传感器网络的要求。     

一种可验证的基于超混沌系统的灰度图像多密钥共享算法

提出一种可验证的图像多密钥共享方案。算法中,灰度图像首先被置乱,而后划分为多个图像子块,利用图像子块的哈希值作为超混沌系统的初始值,生成多个随机网格(RG),最后利用RG和图像子块的异或生成共享的多个子密钥。提出的算法具有共享密钥空间小、能够无损恢复秘密图像,同时能够验证密钥的持有者是否对密钥进行了恶意篡改,能应用于重要领域如医学以及军事图像的保护。实验结果和对算法的比较分析,验证了算法的有效性。     

基于单向函数的多级密钥共享方案

本文在Ｈａｒｎ于１９９５年指出的一个多级密钥（ｔ,ｎ）－门限密钥共享方案的基础上,给出了两个新的多级密钥（ｔ,ｎ）－门限密钥共享方案,该方案能够检测欺骗者。     

基于单向函数的多级密钥共享方案

本文在Harn于1995年指出的一个多级密钥(t,n)-门限密钥共享方案的基础上,给出了两个新的多级密钥(t,n)-门限密钥共享方案,该方案能够检测欺骗者。     

一种基于EIGamal和(t,n)门限的密钥恢复方案

本文提出了一种基于ElGamal公钥算法和(t,n)门限的密钥恢复方案.它将要托管的密钥K分成n份并交给n个托管代理保管,当需要恢复时,任何t个代理托管的子密钥均可以恢复密钥K,而任何少于t个代理托管的子密钥均无法恢复.在密钥和子密钥的传送过程中,采用了ElGamal算法和ECC算法作校验,分两个阶段实现,提高了安全性和灵活性.     

基于多随机信号流的密钥生成方案

基于随机信号流的密钥生成方案会在合法发送方发送随机信号时泄露部分共享随机源信息导致密钥安全性和可达密钥速率较低。针对此问题,该文提出一种基于多随机信号流的密钥生成方案。首先,发送方利用信道互易性和上行导频估计下行信道,然后发送方在各天线上发送相互独立的随机信号流。由于窃听者难以准确估计所有随机信号流,因此难以窃取接收方每根天线接收到的叠加随机信号,而发送方则可根据估计的下行信道和自身发送的随机信号流计算出接收方各天线的接收信号。因此,可以将接收天线上的叠加随机信号作为共享随机源提取密钥。进一步地,该文还推导了该方案的可达密钥速率和共享随机源的互信息量表达式,并分析了两者间的关系以及对密钥安全性的影响。最后,通过仿真验证了该方案的有效性,仿真结果表明该方案能够有效降低窃听者观察到的共享随机源互信息,从而提升可达密钥速率及密钥安全性。     

移动自组网的组密钥链更新算法

针对移动自组网拓扑结构变化频繁,组密钥更新频率高,计算次数多,通信量巨大的特点,提出了一种新的组密钥管理算法-分布式组密钥链更新算法(DKCGR).基于密钥链和左/右向性密钥结构设计了DKCGR算法.通过相邻节点生成共享密钥建立一条循环的密钥链和向左或者向右方向生成若干共享密钥,完成组密钥的更新.同时,借鉴LKH的树形密钥方案,将密钥链用4叉树表示.实验结果表明:DKCGR算法随着加入节点的增多其计算次数将是一个常数,有效控制计算量.与传统的LKH相比节约了n/2(n指节点数)次通信量.     

A New Gradual Secret Sharing Scheme with Diverse Access Structure

A multi-secret sharing scheme tries to share multiple secrets among a group of players in such a way that co-operation of pre-specified subsets of them, called access structures, can reconstruct the secrets. Existing methods allow for all secrets to be recovered at once, by the same sharing algorithm, and by identical access structures. However, in many real world applications, secrets may not needed all at once, access structure may vary for different secrets (change over time), and a group of dishonest players may collude to obtain all secrets. In this paper, we propose a novel and efficient algorithm to address these issues. Our main objectives are, to recover each secret according to its own scheme, by its own access structure, and whenever needed. Our proposed algorithm also blocks collusion attacks by dishonest players. Our scheme can work with any general purpose threshold schemes. It is also rather efficient in terms of computational and communication overhead costs. There computational costs for sharing and recovering stages are almost negligible, and communication costs of sharing and recovering are of order \({{\mathcal {O}}}(n+k)\) and \({{\mathcal {O}}}(\sum _{i=1}^{k} t^{i})\) respectively, where n is the number of players and where \(t^i\)’s are the threshold values for the k secrets.     

一种无损多秘密分享视觉密码方案

针对分享多幅秘密图像存在信息损失的问题,该文给出(n, n)无损多秘密分享视觉密码的定义,在此基础上基于环状共享份设计了一种(n, n)多秘密视觉密码方案,使秘密图像的信息损失为零。实验结果表明,该方案不仅实现了在多个参与者之间分享多幅秘密图像,而且秘密图像能够完全恢复。     

一种基于生物免疫遗传学的新优化方法

本文将免疫遗传学的基本思想引入到优化设计中.模拟生物体的实际免疫行为,设计出了融合应答、免疫记忆、基因重组、新陈代谢、浓度控制、隔离小生境技术和混沌思想的实用化的免疫遗传算法.然后利用此算法对多峰值函数的寻优过程进行实验研究,证明了本文的方法能够改善简单遗传算法的优化能力,所得结果令人满意.     

Verifiable Threshold Scheme in Multi-Secret Sharing Distributions upon Extensions of ECC

In this paper, we propose a verifiable multi-secret sharing scheme. Some secrets are protected by distributing them among many participants, whereby only an authorized group of participants can reconstruct the secrets. In our scheme, the secret will change periodically and the dealer will periodically publish some of the information to increase the robustness of system, in addition, the participants can verify the information which they have received. Each participant holds only one permanent, private secret, and some of them use it during different time periods to reconstruct the corresponding shared secrets without revealing their own private information. Because some public information is renewed in our scheme, the old information has nothing to do with the next secret. We also compare our scheme to the same technique-based studies in the fields promoting the benefits we achieve in this paper.     

一个有效的门限多重秘密共享体制

针对Chien-Jan-Tseng体制计算量大以及Yang-Chang-Hwang体制公开信息量大的不足,利用双变量单向函数提出了一个新的(t,n)门限多重秘密共享体制.通过一次秘密共享过程就可以实现对任意个秘密的共享,而参与者秘密份额的长度仅为一个秘密的长度.在秘密重构过程中,每个合作的参与者只需提交一个由秘密份额计算的伪份额,而不会暴露其秘密份额本身.本文体制结合了现有体制的优点并避免了它们的缺点,是一个实用、有效的体制.     

一种安全有效的（t,n）多秘密共享认证方案

基于双子密钥的思想给出了一种安全有效的(t,n)多秘密共享认证方案,其优点是每个成员可以多次使用自己的子密钥来恢复庄家任意给定的用于共享的多个密钥,重构一个密钥只需公开3个参数,为抵抗成员的欺骗无须执行零知识证明协议.所给的方案与已有的方案相比在计算量和通信量方面有明显的优越性.     

一个可验证的门限多秘密分享方案

基于离散对数计算和大整数分解的困难性,利用RSA加密体制提出了一个新的门限多秘密分享方案.该方案通过零知识证明等协议来防止秘密分发者和秘密分享者的欺诈行为,因而是一个可验证的门限多秘密分享方案.该方案还具有:秘密影子可重复使用;子秘密影子可离线验证;供分享的秘密不须事先作预计算等特点.该方案可用于会议密钥(秘密)分配、安全多方计算、门限数字签名等应用领域.     

Efficient multisecret sharing scheme using new proposed computational security model

A multisecret sharing (MSS) is a method for sharing a set of secrets among some participants. They can recover each of these secrets without endangering the other secrets. Two kinds of security models have been proposed for MSS schemes. These models are categorized into 2 types. The first security model is unconditional security. This approach decreases the efficiency of MSS schemes. Therefore, the second type of security, which is more relaxed, appeared. This approach is called computational security. In this paper, with 2 examples, we will show that the current definition of computational security does not satisfy all of our expectations from a secure MSS scheme. In fact, in these examples, recovering a secret leaks information to the other secrets while these schemes are considered secure in view of the computational security. After determining the shortcomings of the current security definition, we propose a new definition for computational security and present an MSS scheme that enjoys rigorous proof of security in terms of the new definition. In addition, a complete comparison in terms of share size, number of public values, and required operations for recovering a secret between our scheme and previous schemes indicates that the presented scheme is efficient.     

A New Verifiable Multi-secret Sharing Scheme Based on Bilinear Maps

In a (t, n)-threshold multi-secret sharing scheme, several secrets are shared among n participants in such a way that any t (or more) of them can reconstruct the secrets while a group of (t − 1) can not obtain any information. Therefore, when such schemes are used to distribute sensitive information over a network, fault tolerance property is achieved since even if n − t of the nodes go out of function, the remaining t nodes suffice to recover the information. In 2009, Wang et al. proposed a verifiable (t, n)-threshold multi-secret sharing scheme (WTS) based on elliptic curves in which the secrets can change periodically [Wireless Pers. Commun., Springer-Verlage, doi:. In this paper, we propose a verifiable (t, n)-threshold multi-secret sharing scheme based on bilinear maps. Our scheme does not require a secure channel and participants can verify the shares pooled in the reconstruction phase. Our proposed scheme is multi-use such that in order to change the secrets, it is sufficient to renew some public information. Furthermore, the proposed scheme is flexible to the threshold value. Therefore, our proposed scheme has all the merits of (WTS), however, we achieve two major improvements. First when the secrets are to be changed, we require to publish fewer public values. This reduction can be very important in certain applications such as steganographic use of secret sharing schemes. The second is that (WTS) is designed with the assumption that the number of secrets (m) is equal to the threshold t so that the case m > t is handled by repeating the scheme é \fracmt ù{\left\lceil \frac{m}{t}\right\rceil} times. However, in designing the scheme we do not assume any restrictions on the number of secrets.     

门限多重秘密共享方案

本文提出了一个门限多重秘密共享方案,其安全性依赖于RSA数字签名的安全性,即大数分解的困难性.该方案具有如下特点:参与者的子秘密可反复使用,可用来共享任意多个秘密;能有效预防管理员欺诈及参与者之间的互相欺骗;此外,在验证是否有欺诈行为存在的过程中,不需要执行交互协议.