基于量子隐写术的计算安全比特承诺协议

在量子比特承诺协议中,目前流行的方案没有很好地解决信道噪声的影响,实用性不强。根据量子隐写术对信息的隐藏性,提出一种新的量子比特承诺协议。提出了利用量子信道噪声结合遮盖比特隐藏敏感信息,同时采用量子纠错码的方法克服信道噪声,有效地抵抗了第三方窃听攻击和噪声对信息的影响和破坏。通过理论分析与仿真证明该协议的绑定性和完善隐蔽性;理论证明了方案的有效性,为量子密码协议的推广应用提供了理论基础。     

一种新的Vickrey安全拍卖协议

利用比特承诺协议、多方安全计算协议及ElGamal加密方案,本文给出了一种新的Vickrey安全拍卖协议.该协议具有匿名性,秘密性,高效性,同时它支持商品最优分配原理.即使某一投标者与拍卖行相互勾结时,也不会影响协议的安全性与有效性.     

基于伪随机合成器的比特承诺

本文给出了两种可行的比特承诺方案:一种适应于承诺若干个比特,一种适应于承诺任意长度的消息。该方案的安全性是基于伪随机合成器的存在性,承诺者可以拥有无限的计算资源。其优点是对安全参数的要求较小。     

通用可组合公平安全多方计算协议简

在通用可组合框架下研究安全多方计算的公平性问题。在UC框架下,提出公平安全多方计算的安全模型。在模型中形式化定义了公平安全多方加法计算理想函数 和公平安全多方乘法计算理想函数 。然后,基于双线性对技术和承诺方案理想函数 ,在 -混合模型下分别设计公平加法协议 和公平乘法协议 安全实现理想函数 和 。最后,性能分析表明所提协议的有效性,能更好地满足应用需求。     

无条件安全的量子茫然传送

茫然传送作为安全多方计算的基础协议具有重要的理论研究和实用价值.目前已有的经典环境中的各茫然传送协议大都基于公钥密码学或一些附加的计算困难性假设,而这些基础在量子计算机制下将变得相当脆弱.本文根据量子贝尔态的特性,提出了一种新的量子茫然传送协议,对其正确性与安全性进行了分析与证明.该协议可同时抵抗通信信道中噪声和可能存在的窃听,在安全性、健壮性、窃听检测等方面均优于经典计算环境下的各种茫然传送协议.     

对安全多方计算协议的研究

针对以往协议不仅构造复杂,而且效率不高的缺陷,提出了一个有效的安全多方计算协议。基于两轮串不经意传输和异或比特承诺,构造了新的Global Committed Oblivious Transfer子协议。协议构造简单,与以前的同类型协议相比,提高了协议的执行效率,增强了协议的实用性;最后,讨论了协议的安全性和复杂度。     

GUC安全的关系联结算子保密计算协议

分布式数据库系统的关系算子的保密计算协议是多方保密计算(MPC)理论的重要应用领域之一,目前该方向的绝大部分工作主要针对如何构造查询类算子的保密计算协议,对如何构造数据生成类算子的保密计算协议则较少涉及。针对广泛应用的关系联结(join)算子,基于保密及匿名的身份基公钥加密(IBE)方案及其用户私钥盲生成协议给出联结算子的2-方保密计算协议的一种通用的、不依赖于随机oracle(即标准模型)的有效构造,并证明该构造具有GUC(generlized universal composability)安全性。     

对比特承诺不经意传输协议的研究

比特承诺不经意传输是不经意传输和比特承诺自然融合的一种密码学工具.它在Oblivious Circuit Evaluation、Mental Games、分布式计算以及电子交易等协议中有着重要的应用.以往的协议不仅构造复杂,而且效率不高.为了解决这一问题,基于两轮串不经意传输和异或比特承诺,本文提出了一种新的比特承诺不经意传输协议.该协议构造简单,与以前的同类型协议相比,提高了协议的执行效率,增强了协议的实用性;最后,讨论了协议的安全性和复杂度.     

协议

0010251一种有效的比特承诺方案〔刊〕/郑东//通信学报.—2000,21(2)—78～80(L)本文给出了一种基于子集和问题的比特承诺方案,该方案的优点是接受者 Bob 不需要向承诺者 Alice发送任何消息,其安全性是基于子集和问题的困难性。此方案的另一个优点是:它对承诺一个 bit 或承诺多个bit 都是有效的。参10     

一种有效的比特承诺方案

本文给出了一种基于子集和问题的比特承诺方案,该方案的优点是接受者Ｂｏｂ不需要向承诺者Ａｉｃｅ发送任何消息,其安全性是基于子集和问题的困难性。此方案的另一个优点是：它对承诺一个ｂｉｔ或承诺多个ｂｉｔ都是有效的。     

Verifiable three-party secure key exchange protocol based on eigenvalue

In order to solve the problem that the traditional key exchange protocol,which was not flexible enough and flawed in security,cannot provide the function of three-party key negotiation,firstly,a simple and flexible three-party key exchange scheme that can resist man-in-the-middle attacks was proposed with the help of secret matrix eigenvalues.However,the validity of key exchange cannot be verified by the scheme,and counterfeiting by middlemen can’t be prevented.Then based on it,the secret matrix was reconstructed,where the matrix order was a large even number,and all the eigenvalues appeared in pairs,similar to the diagonal matrix.Based on the special secret matrix,the verification part which can be used to verify the legitimacy of the communication party was introduced to the scheme,and the verifiable three-party key exchange protocol based on the eigenvalue was given.The protocol not only solved the problem of three-party key exchange,but also verified identity legitimacy.It is proved that it’s feasible to design a three-party key exchange protocol by the eigenvalue.The final protocol is both secure and efficient.     

基于密钥共享的安全多方计算应用

介绍了安全多方计算的基本概念和基于密钥共享的安全多方计算协议。现有的基于密钥共享的安全多方计算协议,能够计算有限域上的任意函数,但是研究表明,如果一个协议使用广泛,那么必然会牺牲性能上的一些代价。构造了函数f（s1,s2,…,sn）=αs1＋αs2＋…＋αsn的安全多方计算协议,对一般化的基于密钥共享的安全多方计算协议进行剪裁,去掉不相关的部分,并增加可验证性,大大提高了协议效率和实用性。     

Single-Term Unlinkable Electronic Cash Based on Bit Commitment

In this paper, an efficient single-term electronic cash based on bit commitment scheme is proposed. Every protocol in our scheme can be erecuted in logarithmic time. By using the partial blind signature, this scheme overcomes the problems of previous schemes through its greater efficiency and the unlinkability of every cash it generates.     

一种新型的多方公平交换协议

对现有的各种公平交换协议进行了分类。利用公开可验证秘密共享原理、群加密方案,提出一 个新的基于离线半可信第三方的多方公平交换协议,离线第三方只在意外情况下才介入协议且其只能解密半个密钥分量,既保证了交换数据的机密性又实现了交易的真正公平,且交换的拓扑关系也对外(包括第三方) 保密。     

Password-based three-party authenticated key exchange protocol from lattices

Password-based three-party authenticated key exchange protocol allow clients to establish a protected session key through a server over insecure channels.Most of the existing PAKE protocols on lattices were designed for the two parties,which could not be applied to large-scale communication systems,so a novel three-party PAKE protocol from lattices was proposed.The PAKE protocol was constructed by using a splittable public-key encryption scheme and an associated approximate smooth projective Hash function,and message authentication mechanism was introduced in the protocol to resist replay attacks.Compared with the similar protocols,the new protocol reduces the number of communication round and improves the efficiency and the security of protocol applications.     

基于纠缠辅助码的量子模糊承诺和生物认证

本文针对经典模糊承诺体制不能有效抵抗量子算法攻击的问题,在纠缠辅助量子纠错码的基础上,结合量子哈希构造一类新的量子模糊承诺体制.利用无需自对偶约束的量子纠错码空间构建模糊承诺集产生承诺阶段所需的码字,并对其施加用于模糊证明的加噪变换,有效抵抗量子傅立叶取样攻击;提出一种量子哈希,对随机量子序列进行混淆扩散后加密,实现信息论意义上的一次一密安全.据此构建的量子模糊承诺体制可有效抵抗量子图灵机攻击.该文还给出了基于量子模糊承诺的挑战响应生物认证方案,分别对量子模糊承诺和生物认证方案在量子计算环境下的安全性作了分析,证明了其安全性和有效性.     

A new privacy-preserving Euclid-distance protocol and its applications in WSNs

Recently, privacy concerns become an increasingly critical issue. Secure multi-party computation plays an important role in privacy-preserving. Secure multi-party computational geometry is a new field of secure multi-party computation. In this paper, we devote to investigating the solutions to some secure geometric problems in a cooperative environment. The problem is collaboratively computing the Euclid-distance between two private vectors without disclosing the private input to each other. A general privacy-preserving Euclid-distance protocol is firstly presented as a building block and is proved to be secure and efficient in the comparison with the previous methods. And we proposed a new protocol for the application in Wireless Sensor Networks (WSNs), based on the novel Euclid-distance protocol and Density-Based Clustering Protocol (DBCP), so that the nodes from two sides can compute cooperatively to divide them into clusters without disclosing their location information to the opposite side.     

Verifiable Multi-Party Universal Blind Quantum Computing in Distributed Networks

Blind quantum computing (BQC) ensures that a classical client could delegate complex computing tasks to a remote quantum server safely.In order to detect the dishonest behavior of the participants,we present a verifiable multi-party universal BQC protocol in distributed networks.By using the stabilizer formalism,we propose an honesty check method to test the correctness of the graph states generated by the servers.The honesty of both the clients and the servers can be judged fairly with the help of the arbitrator.Moreover,a load balancer is introduced to control the possible breakdown of servers in the network.No-signaling principle ensures the unconditional security of the protocol.Through the use of universal resource states,our protocol can be applied in more multi-party verifiable universal BQC protocols.The failure management and workload balancing of the protocol also provide a promising prospect for the future BQC network.