共查询到19条相似文献,搜索用时 156 毫秒
1.
密钥生成是密码系统的一个重要组成部分,其安全性对整个密码系统的安全性起着至关重要的作用.在群体保密通信、电子商务和面向群体的密码学中,往往需要采用分布式的密钥生成方式.本文对基于向量空间接入结构的分布式密钥生成进行了研究.以向量空间接入结构上信息论安全的一个可验证秘密分享方案为基础,提出了适应于这类接入结构的一个安全高效的分布式密钥生成协议.该协议比常见的基于门限接入结构的分布式密钥生成协议具有更广泛的适用性. 相似文献
2.
本文在分析现有几种基于分布式PKI/CA体制的安全解决方案中,如何生成和分发CA密钥存在问题的基础上,提出了一种应用于AdHoc网络的新型密钥生成机制─基于门限RSA密码体制的分布式CA密钥共享生成机制,显著提高了系统的安全性和鲁棒性。 相似文献
3.
4.
5.
在RSA密码体制基本原理的基础上,提出了一种通过通信双方交互式认证过程实现密码自主授权密钥在线分发的协议。 相似文献
6.
量子密钥分发基于量子物理基本原理,提供信息论安全性,是迄今发展最为成熟的量子密码技术。其中,连续变量量子密钥分发具有与现有光通信网络兼容性较好的特点,同时具备高重复频率和高密钥速率发展潜力,是当前量子保密通信领域的重要发展方向。综述了连续变量量子密钥分发的基本原理,回顾了连续变量量子密钥分发协议的发展历程,介绍了协议的安全证明现状和主流方案,包括随路本振系统和本地本振系统,以及高斯调制方案和离散调制方案。最后概述了连续变量量子密钥分发的发展现状并展望了其未来发展趋势。 相似文献
7.
无论什么样的密码体制,其保密性都取决于密钥,而密钥的管理往往起决定性作用。密钥管理可以理解为密码系统所需密钥的产生、分配、输入、存储和消毁等。本文综述分布式多级密钥管理及分发系统。 相似文献
8.
以联合作战使命任务需求为牵引,基于作战网络模型,提出了密码信息网络和密码任务群组概念;作战网络的动态性导致了密码任务群组的不确定性,从而增大了密钥的生成与分发难度。利用复杂网络的邻接矩阵机理设计了密码任务群组的计算方法,并对密码态势认知、密码网络建模、密钥的生成和分发路径等关键环节进行了分析研究。结合信息化条件下联合作战指挥特点,设计了分发流程和架构,实现了密钥自动生成和灵活动态调整,解决了特定战斗任务之不确定性、多样性和复杂性带来的密钥分发难题。有效提高了密钥分发科学化和规范化水平,为密钥分发系统与指挥信息系统的深度融合、与作战系统和通信网络系统的自动协同筹划奠定了基础。 相似文献
9.
传统密码体制的密钥分发,一般是通过不同于密文传递渠道的其它渠道。在计算机网络这样的信息加工系统中,用户数目很大,通过其它渠道分发密钥是很不方便的。为了解决这个问题,W.Diffie 和 M.Hellman 在1976年提出了一种新的密码体制:公开密钥密码体制。这种密码的加密和解密使用不同的密钥,加密的密钥是公开的,只对解密的密钥保密。因此,公开钥密码体制又称为双钥密码体制或非对称密码体制。公开钥密码体制的每个用户各有一个加密算法 E 和一个解密算法 D,E 对外公开,但 D 保密。 相似文献
10.
介绍和讨论了格理论在公钥密码体制中的应用.利用格的归约技术可以分析研究计算部分密钥位与整个密钥位的计算复杂性.在均匀模式下,计算基于公钥系统的Okamoto协议的2loglogp密钥位与计算整个密钥的难度是相同的.用格的理论建立了一个公钥密码系统,且该系统是安全的,除非能够在多项式时间内从n维格L中找到最短的非零向量. 相似文献
11.
12.
Authenticated key exchange protocols represent an important cryptographic mechanism that enables several parties to communicate securely over an open network. Elashry, Mu, and Susilo proposed an identity‐based authenticated key exchange (IBAKE) protocol where different parties establish secure communication by means of their public identities.The authors also introduced a new security notion for IBAKE protocols called resiliency, that is, if the secret shared key is compromised, the entities can generate another shared secret key without establishing a new session between them. They then claimed that their IBAKE protocol satisfies this security notion. We analyze the security of their protocol and prove that it has a major security flaw, which renders it insecure against an impersonation attack. We also disprove the resiliency property of their scheme by proposing an attack where an adversary can compute any shared secret key if just one secret bit is leaked. 相似文献
13.
14.
Transport Layer Security (TLS) is the most important cryptographic protocol in use today. However, finding a cryptographic security proof for the complete, unaltered protocol has proven to be a challenging task. We give the first such proof in the standard model for the core cryptographic protocol underlying TLS cipher suites based on ephemeral Diffie–Hellman key exchange (TLS-DHE). This includes the cipher suite TLS_DHE_DSS_WITH_3DES_EDE_CBC_SHA, which is mandatory in TLS 1.0 and TLS 1.1. It is impossible to prove the TLS Handshake secure in the classical security models of Bellare–Rogaway and Canetti–Krawczyk. The reason for this is that the final Finished messages of the TLS Handshake are encrypted with the session key, which provides an opportunity to distinguish real keys from random values. Therefore we start with proving the security of a truncated version of the TLS Handshake protocol, which has also been considered in previous work on TLS, and give the first proof of this variant in the standard model. Then we define the new notion of authenticated and confidential channel establishment (ACCE), which allows the monolithic analysis of protocols for which a modular security proof is not possible. We show that the combination of the TLS-DHE Handshake protocol and the TLS Record Layer encryption is secure in this model. Since the conference publication of this paper, the notion of ACCE has found many further applications, for example to the analysis of further TLS cipher suites (Krawczyk et al., Crypto 2013; Li et al., PKC 2014), advanced mechanisms like secure renegotiation of TLS session keys (Giesen et al., CCS 2013), and other practical protocols like EMV channel establishment (Brzuska et al., CCS 2013), SSH (Bergsma et al., CCS 2014), and QUIC (Lychev et al., S&P 2015). 相似文献
15.
16.
开放分布系统安全中的Bayes信任模型 总被引:2,自引:2,他引:0
为了解决开放分布系统的安全问题,本文提出了一个Bayes信任模型.借鉴人类的信任概念,该模型根据直接经验和推荐信息可以计算出一个实体对其他实体的信任值.在该模型中,把实体间交互成功的概率作为信任的重要指标,选择Beta分布作为其先验分布,通过对实体间4种不同关系的分析,获得相应的成功交互概率的估计.最终可形成实体的相对稳定的交互系统,为是否和别的实体交互提供依据.该模型考虑了影响信任的主观因素和客观因素,且具有统计基础,为解决开放分布系统的安全问题提供了新方法. 相似文献
17.
Chandrashekhar Meshram Cheng‐Chi Lee Abhay S. Ranadive Chun‐Ta Li Sarita Gajbhiye Meshram Jitendra V. Tembhurne 《International Journal of Communication Systems》2020,33(7)
Cloud computing technologies have been prospering in recent years and have opened an avenue for a wide variety of forms of adaptable data sharing. Taking advantage of these state‐of‐the‐art innovations, the cloud storage data owner must, however, use a suitable identity‐based cryptographic mechanism to ensure the safety prerequisites while sharing data to large numbers of cloud data users with fuzzy identities. As a successful way to guarantee secure fuzzy sharing of cloud data, the identity‐based cryptographic technology still faces an effectiveness problem under multireceiver configurations. The chaos theory is considered a reasonable strategy for reducing computational complexity while meeting the cryptographic protocol's security needs. In an identity‐based cryptographic protocol, public keys for individual clients are distributed, allowing the clients to separately select their own network identities or names as their public keys. In fact, in a public‐key cryptographic protocol, it is for the best that the confirmation of the public key is done in a safe, private manner, because this way the load of storage on the server's side can be considerably relieved. The objective of this paper is to outline and examine a conversion process that can transfer cryptosystems using Chebyshev's chaotic maps over the Galois field to a subtree‐based protocol in the cloud computing setting for fuzzy user data sharing, as opposed to reconcocting a different structure. Furthermore, in the design of our conversion process, no adjustment of the original cryptosystem based on chaotic maps is needed. 相似文献
18.
19.
在环境受限的无线通信网络环境中,身份认证和会话密钥的协商是确保通信双方能否建立安全会话的关键。为使认证和密钥建立协议中采用的密码技术能适合受限通信环境中的应用,提出一个基于身份的认证的密钥建立协议,并使用SVO逻辑证明设计协议的安全目标。 相似文献