共查询到20条相似文献,搜索用时 109 毫秒
1.
给出了一个应用G.Ateniese的可验证加密的公平交换协议,即构成了在因特网上公平交换数字签名的双方之间的一个协议。通过该协议,一方对消息的有效签名进行加密,并随后向另一方证明他得到的密文确实包含该签名,其安全性基于离散对数问题。 相似文献
2.
对现有的各种公平交换协议进行了分类。利用公开可验证秘密共享原理、群加密方案,提出一 个新的基于离线半可信第三方的多方公平交换协议,离线第三方只在意外情况下才介入协议且其只能解密半个密钥分量,既保证了交换数据的机密性又实现了交易的真正公平,且交换的拓扑关系也对外(包括第三方) 保密。 相似文献
3.
在不断发展的网络交易中,公平交换起着重要的作用,而可验证加密是公平交换协议的重要基础之一。首先介绍了可验证加密及其安全的定义,描述了相关的密码技术,最后讨论了有效的可验证加密方案。可验证加密技术的研究与发展对于网络中的公平交换非常重要。 相似文献
4.
带脱线半可信第三方的公平非否认交换协议 总被引:5,自引:0,他引:5
不可否认性和公平性是电子商务交换协议中的两个重要性质.本文以带盲密文的可验证加密方案为基础,提出了一种新的带有脱线半可信第三方公平的非否认协议,使协议中的任何一方可以单方面终止协议的执行但又不破坏公平性. 相似文献
5.
针对云计算中数据不是存储在本地而是以密文形式托管到“云端”,导致已有的公平交换协议不能很好适应云环境这一问题,构造了一个可在随机预言模型下证明安全的匿名条件的代理重加密方案,并在其基础上设计了一个能运用于云环境交换数据的公平交换协议。 相似文献
6.
自动交换光网络的GMPLS实现及应用 总被引:1,自引:0,他引:1
介绍了自动交换光网络(ASON)与通用多协议标记交换(GMPLS)之间的关系,分析了GMPLS的层次结构模型,针对实际应用介绍了信令、路由和链路管理等协议,并在此基础上给出利用GMPLS实现ASON控制平面的一般方法和标记交换路径(LSP)创建过程,最后阐述了ASON的应用及存在的问题。 相似文献
7.
8.
随着互联网电子商务等业务的发展,公平非抵赖的信息传送协议(fair non-repudiation protocol)逐渐成为网络安全研究的新热点.现有的一些协议大多建立在可信第三方(trusted third party——TTP)基础之上,协议能否顺利进行主要依赖于TTP,如果TTP受到攻击,那么协议将失效.因此,迫切需要一个无需TTP的公平非抵赖协议.由于已有此类协议在安全性上是不对称的,不能保证发送方的信息安全.本文在分析已有非抵赖协议机制及其安全性的基础上,设计了一种发送方优先的协议,并根据双方的计算能力提出了一种可协商的无需可信第三方的公平非抵赖信息交换协议,使非抵赖信息交换的安全性摆脱了对TTP的依赖,并解决了信息的发送方和接收方的计算能力不对等时而存在的安全问题. 相似文献
9.
网络用户的身份鉴别和密钥交换问题是网络安全的核心问题,目前最常见的鉴别密钥交换协议为基于口令的鉴别密钥交换(PAKE)协议。论文讨论了PAKE协议的设计目的、基本模式及其安全需求,并给出了双方模式和三方模式PAKE协议的交互过程,为网络安全协议的设计提供了参考。 相似文献
10.
11.
In SAC'05, Strangio proposed protocol ECKE- 1 as an efficient elliptic curve Diffie-Hellman two-party key agreement protocol using public key authentication. In this letter, we show that protocol ECKE-1 is vulnerable to key-compromise impersonation attacks. We also present an improved protocol - ECKE-1N, which can withstand such attacks. The new protocol's performance is comparable to the well-known MQV protocol and maintains the same remarkable list of security properties. 相似文献
12.
Tianjie Cao Dongdai Lin 《Communications Letters, IEEE》2006,10(8):623-625
In 2002, Zhu et al. proposed a password-based authenticated key exchange protocol based on RSA. Many researchers pointed out that Zhu et al.'s protocol is vulnerable to off-line dictionary attack. In 2003, Yeh et al. proposed an improved protocol. Recently, Lo and Yang-Wang pointed out that Yeh et al.'s improved protocol is also vulnerable to offline dictionary attack. To avoid this weakness existed in Yeh et al.'s protocol, Lo and Yang-Wang proposed two improved protocols. However, in this letter, we show that the Lo protocol is vulnerable to an active off-line dictionary attack and the Yang-Wang protocol is vulnerable to a passive off-line dictionary attack. 相似文献
13.
14.
Efficient ID-based key agreement from Weil pairing 总被引:1,自引:0,他引:1
Xun Yi 《Electronics letters》2003,39(2):206-208
In 2002, N.P. Smart proposed an ID-based authenticated key agreement protocol based on the Weil pairing. In this present new work, Smart's protocol is improved and a more efficient ID-based key agreement protocol from the Weil pairing is developed. 相似文献
15.
16.
An authenticated group key distribution protocol based on the generalized Chinese remainder theorem
下载免费PDF全文
![点击此处可从《International Journal of Communication Systems》网站下载免费的PDF全文](/ch/ext_images/free.gif)
The group key distribution protocol is a mechanism for distributing a group key that is used to encrypt the communication data transmitted in an open group. Recently, a novel group key distribution protocol based on secret sharing was proposed. In their protocol, the group key information is broadcast in an open network environment, and only authorized group members can obtain the group key. However, their protocol requires each group member to broadcast a random challenge to the rest of the group members in the construction of the group key, and this may increase communication cost and cause network traffic congestion. In this paper, we propose an authenticated group key distribution protocol based on the generalized Chinese remainder theorem that drastically reduces communication costs while maintaining at least the same degree of security. Our protocol is built on the secret sharing scheme based on Chinese remainder theorem, which requires fewer computation operations than the previous work. Copyright © 2012 John Wiley & Sons, Ltd. 相似文献
17.
18.
Su Mi Lee Dong Hoon Lee 《Communications Letters, IEEE》2006,10(8):638-639
Recently, Jung (2006), proposed an efficient group key agreement protocol over authenticated channel. In this letter, we present a critique of the protocol. In particular, we show that Jung's protocol is vulnerable to attacks of malicious insiders. 相似文献
19.
证明了针对匿名RFID身份认证协议ARAP协议可以进行假冒伪造攻击,并提出了改进版的ARAP协议。攻击的实质在于协议中运用的异或运算会将相同的值消去,或者可以设计特定的随机数实现重放攻击。提出了一种新的运算操作———置换操作,并在改进版的ARAP协议中将原协议的部分异或运算改为置换操作。改进版的ARAP协议还能抵抗跟踪攻击、非同步攻击和重放攻击等。 相似文献
20.
Tzu-Chun Lin 《电子科技学刊:英文版》2018,16(2):139-144
The deniable authentication protocol is an important notion that allows a receiver to identify the source of a given message, but not to prove the identity of the sender to a third party. Such property is very useful for providing secure negotiation over the Internet. The ID-based deniable authentication protocol based on elliptic Diffie-Hellman key agreement protocol cannot defend the sender spoofing attack and message modification attack. In this paper, we present an improved protocol based on double elliptic Diffie-Hellman scheme. According to the comparison result, the proposed protocol performs better. 相似文献