共查询到20条相似文献,搜索用时 234 毫秒
1.
基于单向函数的广义秘密共享方案 总被引:11,自引:0,他引:11
提出了广义秘密共享方案的概念,并给出了两个基于单向函数的广义秘密共享方案,这两个方案只需每个成员保存一个子秘密,而且每个成员的子秘密可以重复使用,并且在更新成员时无需更改每个成员的子秘密。 相似文献
2.
针对Chien-Jan-Tseng体制计算量大以及Yang-Chang-Hwang体制公开信息量大的不足,利用双变量单向函数提出了一个新的(t,n)门限多重秘密共享体制.通过一次秘密共享过程就可以实现对任意个秘密的共享,而参与者秘密份额的长度仅为一个秘密的长度.在秘密重构过程中,每个合作的参与者只需提交一个由秘密份额计算的伪份额,而不会暴露其秘密份额本身.本文体制结合了现有体制的优点并避免了它们的缺点,是一个实用、有效的体制. 相似文献
3.
利用杂凑函数的在线秘密分享机制 总被引:15,自引:1,他引:14
本文提出一种利用杂凑函数有效的在线秘密分享方式,此秘密分享方式通过一分享情报网可以生成多次秘密分享,使得秘密分享机制是多次性的.既使接入结构(Access Structure)发生变化的情形下,成员的秘密分享值不需改变,只需变更公告牌(Notice board)公开的情报,就可任意次生成系统秘密,任何不诚实的成员不论多少都可以被事后检查出,因计算量小,可在群体协议或群体密码方式中有效的利用. 相似文献
4.
5.
6.
牛冬梅 《信息安全与通信保密》2009,(8):72-73
文献[2]中提出了一种基于异或(XOR)操作的彩色图像秘密共享(2,n)方案,简单易于实现,但恢复密图的效果较差。通过分析此方案,文章提出一个多分存的彩色图像秘密共享(2,n)方案,通过给用户增加分存图像的方法改善了恢复密图的质量。实验分析表明所提方案不仅取得了很好的恢复效果,而且保持了安全性和算法的简单性。 相似文献
7.
基于椭圆曲线密码体制,提出了一个新的可公开验证的多秘密共享方案。该方案中,参与者和分发者可同时产生各参与者的秘密份额,可同时防止分发者和参与者进行欺骗。在秘密恢复过程中,任何个体都能验证参与者是否拥有有效的子秘密,秘密恢复者可验证参与者是否提供了正确的秘密份额。每个参与者只需要维护一个秘密份额,就可以实现对多个秘密的共享。方案的安全性是基于椭圆曲线密码体制以及(t,n)门限秘密共享体制的安全性。 相似文献
8.
9.
根据有限域GF(2^m)上的正规基表示和Massey-Omura乘法器,本文提出了一个复杂性为O(logm)的求逆算法。新算法完成一次求逆运算只需要「log2(m-1)」+w(m-1)-1次乘法和m-1次循环移位,这里「x」表示小于等于x的最大整数,w(m-1)表示m-1的二进制表示中“1”的个数。 相似文献
10.
提出了一种可认证的门限多秘密共享的新方案,通过成员提供的子密钥的一个影子来恢复秘密,由影子难以得到子密钥本身,因此可以复用,也即通过同一组子密钥共享多个秘密.该方案可以对分发者发布的信息和参与者提供的子密钥影子进行认证,从而可以抵御分发者欺骗和参与者欺骗.方案的安全性基于RSA密码系统和Shamir的(k,n)门限秘密共享方案.另外,本文还提出两种对这类门限多秘密共享方案的欺骗方法,能不同程度的破坏几个已有方案的安全性,但本文所提出的方案对这些欺骗有免疫能力.该方案是计算安全的,并且性能较现有诸方案更好. 相似文献
11.
László Csirmaz 《Journal of Cryptology》1997,10(4):223-231
A secret sharing scheme permits a secret to be shared among participants of an n-element group in such a way that only qualified subsets of participants can recover the secret. If any nonqualified subset
has absolutely no information on the secret, then the scheme is called perfect. The share in a scheme is the information that a participant must remember.
In [3] it was proved that for a certain access structure any perfect secret sharing scheme must give some participant a
share which is at least 50\percent larger than the secret size. We prove that for each n there exists an access structure on n participants so that any perfect sharing scheme must give some participant a share which is at least about times the secret size.^1 We also show that the best possible result achievable by the information-theoretic method used here is n times the secret size.
^1 All logarithms in this paper are of base 2.
Received 24 November 1993 and revised 15 September 1995 相似文献
12.
针对密钥生成系统中传统量化算法导致合法双方初始不一致率较高从而降低最终的密钥生成长度的问题,提出了双门限量化的基本模型,合法双方同时设置一个上门限和下门限,将高于上门限的采样值量化为1,低于下门限的采样值量化为0,同时将上、下门限之间的采样值舍弃。通过分析可知,这种量化方法有较高的可靠性,并且不会泄露有关密钥的任何信息。本文分析了其在密钥生成中的具体应用,并以合法双方最终生成的密钥的长度为目标函数,推导得到了双门限量化时最优的量化因子。进一步的仿真表明,相比较传统的等概量化,通过选择合适的量化因子,合法双方能够生成更长的密钥。在信噪比为15 dB-25 dB时,密钥长度的提升在0.1比特以上。 相似文献
13.
Ideal secret sharing schemes with multiple secrets 总被引:6,自引:0,他引:6
We consider secret sharing schemes which, through an initial issuing of shares to a group of participants, permit a number of different secrets to be protected. Each secret is associated with a (potentially different) access structure and a particular secret can be reconstructed by any group of participants from its associated access structure without the need for further broadcast information. We consider ideal secret sharing schemes in this more general environment. In particular, we classify the collections of access structures that can be combined in such an ideal secret sharing scheme and we provide a general method of construction for such schemes. We also explore the extent to which the results that connect ideal secret sharing schemes to matroids can be appropriately generalized.The work of the second and third authors was supported by the Australian Research Council. 相似文献
14.
15.
谭晓青 《信息安全与通信保密》2007,(5):27-29
论文基于线性码提出了一个非交互的可验证秘密分享方案,利用线性码的一致校验矩阵来验证每一个秘密分享者从秘密分配者Dealer处所获得子秘密的合法性,各子秘密拥有者独立验证,无须合作。 相似文献
16.
17.
An authenticated group key distribution protocol based on the generalized Chinese remainder theorem
下载免费PDF全文
![点击此处可从《International Journal of Communication Systems》网站下载免费的PDF全文](/ch/ext_images/free.gif)
The group key distribution protocol is a mechanism for distributing a group key that is used to encrypt the communication data transmitted in an open group. Recently, a novel group key distribution protocol based on secret sharing was proposed. In their protocol, the group key information is broadcast in an open network environment, and only authorized group members can obtain the group key. However, their protocol requires each group member to broadcast a random challenge to the rest of the group members in the construction of the group key, and this may increase communication cost and cause network traffic congestion. In this paper, we propose an authenticated group key distribution protocol based on the generalized Chinese remainder theorem that drastically reduces communication costs while maintaining at least the same degree of security. Our protocol is built on the secret sharing scheme based on Chinese remainder theorem, which requires fewer computation operations than the previous work. Copyright © 2012 John Wiley & Sons, Ltd. 相似文献
18.
Yanjun Liu Lein Harn Chin‐Chen Chang 《International Journal of Communication Systems》2014,27(11):3502-3512
A group key distribution protocol can enable members of a group to share a secret group key and use it for secret communications. In 2010, Harn and Lin proposed an authenticated group key distribution protocol using polynomial‐based secret sharing scheme. Recently, Guo and Chang proposed a similar protocol based on the generalized Chinese remainder theorem. In this paper, we point out that there are some security problems of Guo and Chang's protocol and propose a simpler authenticated group key distribution protocol based on the Chinese remainder theorem. The confidentiality of our proposed protocol is unconditionally secure. Copyright © 2013 John Wiley & Sons, Ltd. 相似文献
19.