共查询到18条相似文献,搜索用时 832 毫秒
1.
2.
一种高效的量子秘密共享方案 总被引:2,自引:1,他引:1
利用量子安全直接通信和量子密集编码的思想,本文提出一个新的基于GHZ三重态的高效量子秘密共享(QSS)方案.利用量子相干性和一个公开的比特串K,Alice直接让Bob和Charlie共享其秘密消息,而不是首先与Bob和Charlie建立共享的联合密钥,再用联合密钥传输消息.该方案中平均消耗一个GHZ态可以共享两比特的经典信息.我们分别给出了无噪声信道和有噪声信道情形的安全性分析,并重点就量子直接秘密共享和量子安全直接通信之间的区别说明了协议中使用公开的K的必要性. 相似文献
3.
4.
秘密共享方案的信息率是衡量秘密共享通信效率的重要指标,鉴于已有的秘密共享方案效率不高的问题,本文基于多线性对提出了信息率为m/(m+1)的可验证秘密共享方案.方案中,共享秘密为m维向量,其可验证性可利用多线性映射的多线性性质来实现;同时,在多线性Diffie-Hellman问题下,方案是可证明安全的.性能分析结果表明,与已有的相同安全级别下的秘密共享方案相比,该方案具有较高的通信效率,更适用于通信受限的数据容错的应用场景. 相似文献
5.
6.
基于2个不同的四粒子纠缠态分别提出了三方、四方量子秘密共享方案,其中采用的秘密信息是一个相同的未知两粒子纠缠态。在量子秘密共享方案中发送者对所拥有的粒子实施适当的Bell态(或GHZ态)测量,发送者和合作者通过经典通讯把测量结果告知信息接收者,接收者在其他合作者的协助下通过实施相应的量子操作完成对初始量子态信息的重构。对所提出的2个方案进行了讨论和比较,发现四方量子秘密共享方案的安全性更加可靠。 相似文献
7.
8.
秘密共享是指将一个秘密按适当的方式进行隐藏或拆分,只有若干个参与者一同协作才能恢复该秘密,该技术在云计算领域中能够确保信息安全和数据保密.提出了一种不使用纠缠态的量子秘密共享协议,通过使用量子密码算法确保系统的安全性.相比其他的秘密共享协议,该协议具有以下优点:与传统的基于数论的秘密共享协议相比,本协议由于使用量子通信的技术,从而能够有效抵抗Shor算法攻击;相比其他的量子秘密共享协议,由于本协议没有使用量子纠缠态,在技术程度上更容易实现;如果存在攻击者或恶意的参与者,该协议能够在秘密恢复过程中迅速发现,避免恢复错误的秘密. 相似文献
9.
基于W态及其非定域纠缠关联性,利用量子远程通信设计了一种量子秘密共享协议。在该协议中,Alice制备三粒子W态及秘密量子信息,将W态中的任意两粒子分别发送给Bob1和Bob2,并对自己拥有的粒子进行Bell基联合测量;依据Alice的测量结果,Bob1和Bob2联合进行相应的局域操作就能共同得到秘密信息。并对协议的安全性进行了详细分析,研究表明该协议能抵御多种攻击,如干扰重发攻击、纠缠攻击等。 相似文献
10.
11.
提出一种采用经典-量子ε-universal哈希类的簇态量子模糊哈希构造方法.传统哈希与模糊哈希算法不能有效抵抗量子攻击.通过采用diamond范数方法,构建了一种哈希函数类最优子集并且提供信息论意义上的更优安全性.基于量子簇态独特的物理级单向计算属性,相应算法更接近于物理可实现.进一步,构造了一种在信息安全与生物特征识别方面的隐蔽信息搜索策略.该生物识别搜索算法基于簇态量子ε-universal模糊哈希构建.该策略能有效抵抗量子算法攻击,确保数据存储安全,并降低了计算复杂度.相比于其他类似策略,此算法具有更精简的结构,理论分析表明此算法具有较高的识别效率与更好的数据安全性. 相似文献
12.
Carlet C. Ding C. Yuan J. 《IEEE transactions on information theory / Professional Technical Group on Information Theory》2005,51(6):2089-2102
In this paper, error-correcting codes from perfect nonlinear mappings are constructed, and then employed to construct secret sharing schemes. The error-correcting codes obtained in this paper are very good in general, and many of them are optimal or almost optimal. The secret sharing schemes obtained in this paper have two types of access structures. The first type is democratic in the sense that every participant is involved in the same number of minimal-access sets. In the second type of access structures, there are a few dictators who are in every minimal access set, while each of the remaining participants is in the same number of minimal-access sets. 相似文献
13.
Secret sharing schemes with bipartite access structure 总被引:7,自引:0,他引:7
Padro C. Saez G. 《IEEE transactions on information theory / Professional Technical Group on Information Theory》2000,46(7):2596-2604
We study the information rate of secret sharing schemes whose access structure is bipartite. In a bipartite access structure there are two classes of participants and all participants in the same class play an equivalent role in the structure. We characterize completely the bipartite access structures that can be realized by an ideal secret sharing scheme. Both upper and lower bounds on the optimal information rate of bipartite access structures are given. These results are applied to the particular case of weighted threshold access structure with two weights 相似文献
14.
15.
量子密钥分发系统由于能够提供一种物理上安全的密钥分发方式,因此成为量子信息领域的研究热点,其中如何在现实条件下保证量子密钥分发的无条件安全性是该领域的一个重要研究课题。本文从经典保密通信系统中具有完善保密性的一次一密体制出发,介绍了量子密钥分发系统的应用模型和整体保密通信系统的安全性基础,以及自量子密钥分发协议被提出以来量子密钥传输现实无条件安全性的研究进展,重点介绍了针对现实条件安全漏洞的各种类型的量子黑客攻击方案、防御方式,以及最近两年被广泛重视的与测量设备无关的量子密钥分发系统的理论和实验进展。 相似文献
16.
17.
In this paper we study secret sharing schemes for access structures based on graphs. A secret sharing scheme enables a secret
key to be shared among a set of participants by distributing partial information called shares. Suppose we desire that some
specified pairs of participants be able to compute the key. This gives rise in a natural way to a graphG which contains these specified pairs as its edges. The secret sharing scheme is calledperfect if a pair of participants corresponding to a nonedge ofG can obtain no information regarding the key. Such a perfect secret sharing scheme can be constructed for any graph. In this
paper we study the information rate of these schemes, which measures how much information is being distributed as shares compared
with the size of the secret key. We give several constructions for secret sharing schemes that have a higher information rate
than previously known schemes. We prove the general result that, for any graphG having maximum degreed, there is a perfect secret sharing scheme realizingG in which the information rate is at least 2/(d+3). This improves the best previous general bound by a factor of almost two.
The work of E. F. Brickell was performed at the Sandia National Laboratories and was supported by the U.S. Department of Energy
under Contract Number DE-AC04-76DP00789. The research of D. R. Stinson was supported by NSERC Operating Grant A9287 and by
the Center for Communication and Information Science, University of Nebraska. 相似文献
18.
Decomposition constructions for secret-sharing schemes 总被引:7,自引:0,他引:7
Stinson D.R. 《IEEE transactions on information theory / Professional Technical Group on Information Theory》1994,40(1):118-125
The paper describes a very powerful decomposition construction for perfect secret-sharing schemes. The author gives several applications of the construction and improves previous results by showing that for any graph G of maximum degree d, there is a perfect secret-sharing scheme for G with information rate 2/(d+1). As a corollary, the maximum information rate of secret-sharing schemes for paths on more than three vertices and for cycles on more than four vertices is shown to be 2/3 相似文献