一种动态（t，n）门限的多级多秘密共享方案

现有的门限多秘密共享方案中,大多数存在着固定的门限值、多次利用单秘密共享来实现多秘密共享等问题。为了解决这些问题,文中提出了一种动态（t,n）门限的多级多秘密共享方案。此方案具有如下特点：对于不同等级的多秘密,多秘密分发者可动态地调整其恢复时的门限值;对于相同等级的多秘密,多秘密分发者在分发、恢复、更新和验证等操作时能一次完成。     

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

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

多分存彩色图像秘密共享（2，n）方案

文献[2]中提出了一种基于异或（XOR）操作的彩色图像秘密共享（2,n）方案,简单易于实现,但恢复密图的效果较差。通过分析此方案,文章提出一个多分存的彩色图像秘密共享（2,n）方案,通过给用户增加分存图像的方法改善了恢复密图的质量。实验分析表明所提方案不仅取得了很好的恢复效果,而且保持了安全性和算法的简单性。     

广义(k,n)-门限方案

１９７９年，Ｓｈａｍｉｒ提出的（ｋ，ｎ）－门限密钥分散管理的概念使密钥管理更加安全灵活。但这一方案也有其不完善之处，因为在现实中参与密钥管理的人在系统中所处的地位不尽相同，有许多活动必须要求某些特定的人参与才能进行。本文考查了此类情形，将（ｋ，ｎ）－门限方案加以推广，提出了更为一般的（ｔ，ｋ，ｎ）－门限方案，给出（ｔ，ｋ，ｎ）－秘密分享矩阵的概念，并利用（ｔ，ｋ，ｎ）－秘密分享矩阵实现（ｔ，ｋ，ｎ）－门限方案。     

A Novel(n,n)Secret Image Sharing Scheme Based on Sudoku

Recently, Chang et al. proposed a Sudoku-based secret image sharing scheme. They utilized the Sudoku grid to generate meaningful shadow images, and their scheme satisfied all essential requirements. Based on Chang et al.’s scheme, we propose a novel (n, n) secret image sharing scheme based on Sudoku. In the proposed scheme, a secret image can be shared among n different cover images by generating n shadow images, and the secret image can be reconstructed without distortion using only these n shadow images. Also, the proposed scheme can solve the overflow and underflow problems. The experimental results show that the visual quality of the shadow images is satisfactory. Furthermore, the proposed scheme allows for a large embedding capacity.     

关于(k,n)-门限方案的进一步讨论

1979年,Shamir提出的(k,n)-门限密钥分散管理的概念使密钥管理更加安全灵活,但这一方案也有其不完善之处,因为在现实中参与密钥管理的人在系统中所处的地位不尽相同,有许多活动要求某些特定的人必须参与才能进行。本文考查了此类情形,将(k,n)-门限方案加以推广,提出了更为一般的(t,k,n)-门限方案,并利用(k,n)-门限方案给出了实现(t,k,n)-门限方案的方法。     

High Performance Group Merging/Splitting Scheme for Group Key Management

The group merging/splitting event is different to the joining/leaving events in which only a member joins or leaves group, but in the group merging/splitting event two small groups merge together into a group or a group is divided into two independent parts. Rekeying is an importance issue for key management whose target is to guarantee forward security and backward security in case of membership changes, however rekeying efficiency is related to group scale in most existing group key management schemes, so as to those schemes are not suitable to the applications whose rekeying time delay is limited strictly. In particular, multiple members are involved in the group merging/splitting event, thus the rekeying performance becomes a worried problem. In this paper, a high performance group merging/splitting group key management scheme is proposed based on an one-encryption-key multi-decryption-key key protocol, in the proposed scheme each member has an unique decryption key that is corresponding to a common encryption key so as to only the common encryption key is updated when the group merging/splitting event happens, however the secret decryption key still keeps unchanged. In efficiency aspect, since no more than a message on merging/splitting event is sent, at time the network load is reduced since only a group member’s key material is enough for other group members to agree a fresh common encryption key. In security aspect, our proposed scheme achieves the key management security requirements including passive security, forward security, backward security and key independence. Therefore, our proposed scheme is suitable to the dynamitic networks that the rekeying time delay is limited strictly such as tolerate delay networks.     

关于（k,n）门通信密钥分散保管系统的讨论

本文提出了几种实现Ｓｈａｍｉｒ（１）提出的（ｋ，ｎ）门通信密钥分散保管系统的方法。这些方法克服了以往许多实现方法的一个共同缺点。     

基于椭圆曲线的无可信中心(t,n)门限群签名

基于有限域上椭圆曲线离散对数难解性,提出了无可信方的(t,n)门限签名方案和可验证的密钥协商方案。利用一个改进的椭圆曲线签名方程,我们得到一个从计算和安全上都比现有的椭圆曲线数字签名算法(ECDSA)更高效的签名方案。此方案具有更短的密钥,更快的计算和更好的安全性。     

Secure Self-healing Group Key Distribution Scheme with Constant Storage for SCADA Systems in Smart Grid

Wireless Personal Communications - Smart grid has a great advantage over the traditional power grid and it is a critical condition in people’s daily life. The security of data communication...     

An Efficient,Scalable Key Transport Scheme (ESKTS) for Delay/Disruption Tolerant Networks

In the past, security protocols including key transport protocols are designed with the assumption that there are two parties communication with each other and an adversary tries to intercept this communication. In Delay/Disruption Tolerant Networking (DTN), packet delivery relies on intermediate parties in the communication path to store and forward the packets. DTN security architecture requires that integrity and authentication should be verified at intermediate nodes as well as at end nodes and confidentiality should be maintained for end communicating parties. This requires new security protocols and key management to be defined for DTN as traditional end-to-end security protocols will not work with DTN. To contribute towards solving this problem, we propose a novel Efficient and Scalable Key Transport Scheme (ESKTS) to transport the symmetric key generated at a DTN node to other communicating body securely using public key cryptography and proxy signatures. It is unique effort to design a key transport protocol in compliance with DTN architecture. ESKTS ensures that integrity and authentication is achieved at hop-by-hop level as well as end-to-end level. It also ensures end-to-end confidentiality and freshness for end communicating parties. This scheme provides a secure symmetric key transport mechanism based on public key cryptography to exploit the unique bundle buffering characteristics of DTN to reduce communication and computation cost .     

适用于Intranet的分层鉴别与密钥分配协议

根据ISO制定的网络安全结构,结合Internet的具体特点,提出了一种解决Internet安全性的安全模式,并设计了一个适用于Internet环境的鉴别与密钥分配协议。新协议采用分层机制,在低层利用Intranet的已有鉴别与密钥分配协议,在高层则采用双钥密码体制设计了一个跨Intranet的鉴别与密钥分配协议。该协议不必更换客户机原有的应用软件,只需增加一个网际鉴别服务器,在原鉴别服务器的数据库中增添网际鉴别服务器的密钥即可实现跨Intranet保密通信。新协议与已有协议有很好的兼容性,安全性高,有利于网络的安全管理,并可以在各种远程访问中建立Intranet间的端—端保密通信。     

Internet网络环境中认证与密钥分配的研究

本文根据ＩＳＯ制定的ＯＳＩ安全结构，提出了一种解决ｉｎｔｒａｎｅｔ安全性问题的全面安全模式，并设计了一个适用于Ｉｎｔｅｒｎｅｔ环境的认证与密钥分配协议；新协议采用分层机制，在低层利用ｉｎｔｒａｎｅｔ本地网的已有认证与密钥分配协议，在高层则采用双钥密码体制来设计跨ｉｎｔｒａｎｅｔ的认证与密钥分配协议。新协议与已有密码协议有很好的兼容性，且不降低原协议的安全性，并为ｉｎ－ｔｒａｎｅｔ的各种远程访问提供安全保护，有利于网络的安全管理     

(n+1,m,2t)均衡弹性函数的非线性构造方法

基于GF(2)n上(n,m,2t-1)均衡弹性函数,运用其对偶分布性质和各分量函数弹性阶的相关特性,得到了(n 1,m,2t)均衡弹性函数的非线性构造方法。这些方法使得自变量的维数与弹性阶同步增长,且函数的代数次数也相应增加,从而避免了线性构造的缺陷。     

（k，n）异或视觉密码的一般性研究

通过研究(k, n)异或视觉密码像素扩展度最优的必要条件,该文提出一种由基矩阵生成(k, n)异或视觉密码的方法,并从理论上证明了该方法适合2相似文献   

On Construction of the$(24, 12, 8)$Golay Codes

Two product array codes are used to construct the (24,12,8) binary Golay code through the direct sum operation. This construction provides a systematic way to find proper (8,4,4) linear block component codes for generating the Golay code, and it generates and extends previously existing methods that use a similar construction framework. The code constructed is simple to decode     

Group Key Authentication scheme for Vanet INtrusion detection (GKAVIN)

Wireless Networks - Security must be provided in VANET as it is open to various attacks due to malicious vehicle, Brute force attack, misbehaving and faulty nodes, malicious users, and malicious...     

基于Mignotte''''s列的(t,n)门限群签名方案

电子学报中曾提出了一个在不改变其他有效群成员的签名密钥的情况下，可安全快速地加入或删除群成员的群签名方案。但此方案没有涉及到实际运用中需要设置门限的情况，现对原方案做了改进和推广，保留了原方案中可安全快速地加入或删除群成员的优点，推广到了每次参与签名人数变动较大，并需要设置门限的情况，利用中国剩余定理提出了一个新的基于Mignotte’s门限秘密共享方案的（t，n）门限群签名方案。