基于布尔运算与Arnold变换的减像素秘密共享方案

为了减小参与者的负担,本文基于布尔运算提出了一种像素缩小的(2n,2n)秘密共享方案,该方案通过Arnold变换和加密算法将一幅图像共享成2n幅大小为原图像1/2n的分存图像,只有所有分存图像共同存在时才能够无质量损失地恢复出原图像信息。对比研究表明了该方案的有效性和优点。     

束缚纠缠态量子秘密共享的不安全性分析

分析了以Smolin束缚纠缠态作为通道量子态的量子秘密共享方案的安全性.给出了一个简单的来自通信方内部的截获重发攻击策略,这个攻击策略是依赖比对单量子比特测量结果的窃听检测程序所不能检测出来的.结果表明,仅以束缚纠缠Smolin态作为通道量子态的量子秘密共享方案对于来自内部的窃听攻击不是无条件的.     

Scheme for Quantum Dense Coding with Secret Sharing in Cavity QED

Quantum dense coding （QDC） is a process originally proposed to send two classical bits information from a sender to a receiver by sending only one qubit. Our scheme of QDC is proposed following some ideas on secret sharing with entanglement in cavity QED. Based on the theory of secret sharing the QDC process can be more secure.     

Cryptanalysis and Improvement of Two GHZ-State-Based QSDC Protocols

In a recent paper[J. Korean. Phys. Soc. 49 （2006） 459], two GHZ-state-based quantum secure direct communication protocols were presented. Here we point out that an eavesdropper can utilize a special property of GHZ states, i.e. ＂correlation-elicitable＂ to obtain half information of the transmitted secrets without being detected in both protocols. The particular attack strategy is demonstrated in detail. Furthermore, a possible improvement is proposed, which makes the protocols secure against this kind of attack.     

一种基于双偏振分束器的量子秘密共享方案

提出一个基于双偏振分束器的单量子比特全光纤量子秘密共享方案, 该方案具有自动补偿光纤及光学器件的双折射效应和相位抖动的功能, 在干涉对比度测试和稳定性测试时, 该方案在5 km通信距离中, 获得的干涉对比度优于993%, 且可长时间保持稳定. 关键词： 量子秘密共享 偏振分束器 单光子干涉     

Constructions for Anonymous Secret Sharing Schemes Using Combinatorial Designs

In an anonymous secret sharing scheme the secret can be reconstructed without knowledge ofwhich participants hold which shares.In this paper some constructions of anonymous secret sharing schemeswith 2 thresholds by using combinatorial designs are given.Let v(t,w,q)denote the minimum size of the setof shares of a perfect anonymous(t,w)threshold secret sharing scheme with q secrets.In this paper we provethat v(t,w,q)=(q)if t and w are fixed and that the lower bound of the size of the set of shares in[4]is notoptimal under certain condition.     

多授权中心可验证的基于属性的加密方案

在本文构造的方案中,将可验证的属性加密方案由单个授权中心推广剑多个授权中心,使得多授权中心的基于属性的加密在解密出错时,可以榆验出是哪个授权中心部分的密钥出错,只需要去找该授权中心重发,不用让所有授权中心均重发;其次各个授权中心在被检查出错时,也只需要重发对应部分的信息;当密钥通过验证,而解密依然出错,说明是加密过程中或者密文跟随的消息属性出了问题,不会出现无法判断哪里出错的情况.同时证明了加入可验证性后,在经过修正的安全模型下,并不影响多授权中心基于属性加密的安全性.     

Threshold Quantum Secret Sharing of Secure Direct Communication

We propose a （L, n）-threshold quantum secret sharing protocol of secure direct communication following some ideas of Zhang＇s protocol [Phys. Lett. A 342 （2005） 60] and Tokunaga et al.＇s protocol [Phys. Rev. A 71 （2005） 012314]. The sender distributes the classical secret shares to his or her n agents and each agent owns a secret share in advance. The sender＇s secure direct communication message can be extracted by an agent subset by collaboration in such a way that at least t or more agents can obtain the secret message with the mutual assistances but any t - 1 or fewer agents cannot. In contrast to the previous multiparty quantum secret sharing protocols in which the sender＇s secret message can be recovered only if all the agents collaborate, our protocol is more practical and more flexible.