共查询到16条相似文献,搜索用时 93 毫秒
1.
2.
用量子效应实现身份认证 总被引:3,自引:0,他引:3
利用量子现象对信息进行保密是目前国际量子信息学界和密码学界关注的问题之一.本文利用量子效应实现了网络通信中通信者之间的身份确认.身份确认是密码学中的一个重要课题,本文提出的量子认证协议具有可证明安全性. 相似文献
3.
4.
5.
一种基于混沌的量子身份认证 总被引:1,自引:1,他引:0
提出了一种新的基于混沌的量子身份认证方案,该方案将混沌系统对初值条件和参数的极度敏感性及混沌序列的良好伪随机性与量子密码的绝对安全性结合在一起,能够有效地抵抗多次身份认证中由于有限精度导致的混沌特性退化而造成对混沌系统初值和参数的攻击。在方案的实现过程中,利用量子隐形传态原理,解决了多次身份认证中出现的混沌迭代异步问题,实现了每一次身份认证中双方的同步,从而实现了“一次一密”的量子身份认证。整个身份认证过程实现简单,具有动态性和可证明的安全性。 相似文献
6.
提出了一个量子身份认证方案,该方案仅在注册时需要认证中心,以后不再依赖于任何第三方.在方案的实施过程中采用一种动态方式,即合法通信者之间每次可动态获得一个新的认证密钥.所提方案具有可证明安全性,安全性由量子不可克隆性和方案本身的动态特性保证. 相似文献
7.
8.
基于隐形传态的跨中心量子身份认证方案 总被引:3,自引:3,他引:0
基于量子光学中的隐形传态原理和量子纠缠交换技术,提出一个网络中跨中心的量子身份认证方案。在分布式网络系统中,通过客户端和服务端之间,以及服务端相互之间的量子信道共享EPR纠缠对进行信息传输,同时在经典信道上也进行必须的交互协商,实现了无条件安全的量子身份认证。其无条件安全性得到了量子力学原理的保证,与EPR密钥分发协议的安全性相同。与已有的量子身份认证方案相比,该方案克服了点对点的量子身份认证方案的缺点,具有可跨中心认证的优点,扩大了认证的范围,具有更好的灵活性和实用性。 相似文献
9.
10.
王媛媛 《信息技术与信息化》2009,(4):52-53
本文综合评价了各种认证机制和方案的优劣,并分析了身份认证的理论和应用,列举了一些对身份认证的各种实现方法、技术现状及发展趋势,同时设计了一个利用数字签名实现的简单的身份认证方案. 相似文献
11.
With the rapid development of quantum theory and the existence of polynomial algorithm in quantum computation based on discrete logarithm problem and large integer decomposition problem,the security of the algorithm was seriously threatened.Therefore,two authentication key agreement protocols were proposed rely on ring-learning-with-error (RLWE) assumption including lattice-based implicit authentication key agreement scheme and lattice-based explicit authentication key agreement scheme and proved its security.The implicit authentication key agreement protocol is less to communicate and faster to authentication,the explicit authentication key agreement protocol is more to secure.At the same time,bidirectional authentication of users and servers can resist unpredictable online dictionary attacks.The new protocol has higher efficiency and shorter key length than other password authentication key agreement protocols.It can resist quantum attacks.Therefore,the protocol is efficient,secure,and suitable for large-scale network communication. 相似文献
12.
In this study, based on attribute and password, we introduce a new kind of two‐factor authentication protocol that has various applications such as anonymous authentication and privacy protection. Specifically, our proposal is constructed by introducing password authentication into the generic framework of attribute‐based authentication. Consequently, it not only achieves two‐factor authentication, but also enjoys the advantages of attribute authentication and password authentication simultaneously. Furthermore, to formally evaluate the security of the proposed protocol, we present the corresponding security model, within which the detailed security proof of the proposal is given. Copyright © 2014 John Wiley & Sons, Ltd. 相似文献
13.
14.
无线通信系统认证方案与实现 总被引:1,自引:0,他引:1
主要对现有的安全认证技术进行了比较,并提出了一种符合EAP协议的无线认证方案,并对基于LAS-PDMA 无线通信系统环境进行了测试,证实为当前一种可行的具有一定安全性的无线网络认证方案。 相似文献
15.
文章提出利用共享EPR二粒子纠缠态完成对经典消息的加密认证,并结合量子稳定子码扩展完成对量子消息的认证。安全性依赖于EPR纠缠态的相干特性,量子稳定子码保证了量子态的真实性,量子一次一密保证了量子信息在信道的安全性。 相似文献
16.
Maryam Rajabzadeh Asaar Mahmoud Salmasizadeh Mohammad Reza Aref 《International Journal of Communication Systems》2018,31(6)
Signatures with partially message recovery in which some parts of messages are not transmitted with signatures to make them shorter are helpful where bandwidth is one of the critical concern. This primitive is especially used for signing short messages in applications such as time stamping, certified email services, and identity‐based cryptosystems. In this paper, to have quantum‐attack‐resistant short signatures, the first signature scheme with partially message recovery based on coding theory is presented. Next, it is shown that the proposal is secure under Goppa Parametrized Bounded Decoding and the Goppa Code Distinguishing assumptions in the random oracle model. Relying on the partially message recovery property, the proposal is shorter than Dallot signature scheme, the only provably secure and practical code‐based signature scheme, while it preserves Dallot signature efficiency. We should highlight that our scheme can be used as a building block to construct short code‐based signature schemes with special properties. To show this, we present a provably secure short designated verifier signature scheme, a nontransferable form of short signatures, which is used in electronic voting and deniable authentication protocols. 相似文献