共查询到19条相似文献,搜索用时 93 毫秒
1.
《计算机应用与软件》2017,(2)
为了提高多方公平交换协议的安全性和运行效率,提出一种新的基于HECC的多方公平交换协议。利用基于超椭圆曲线双线性对的身份签名方案,提高了协议的运行效率;通过HECC的门限秘密共享技术确保了交易过程中的安全性。最后用改进的Kailar逻辑对新的多方公平交换协议进行形式化分析,结果表明新的多方公平交换协议不仅满足公平性、抗合谋性等,而且具有可追究性。 相似文献
2.
可验证加密签名方案常用于构建公平交换协议,公平交换协议中的可信第三方往往会成为瓶颈。该文将Boneh等提出的单仲裁者可验证加密签名方案扩展为具有多个仲裁者的方案,方案应用无可信中心的可验证秘密共享技术实现了仲裁权力的分散。基于所构建的方案设计了一个公平合同签署协议,协议的可信第三方由多个仲裁者来构成,降低了第三方与其中一方合谋欺骗的风险。除此之外,协议具有不可伪造性、非透明性、公平性和机密性。由于该方案的设计是基于短签名方案和聚集签名方案,因此具有更高的通信效率。 相似文献
3.
基于Gorantla等最近提出的标准模型下可证安全的可验证加密签名,提出了一个优化的公平数字签名交换方案。签名交换双方首先交换他们的可验证加密签名,验证通过以后再交换他们的真实签名,如果其中一方不能诚实地执行协议,则另一方可求助可信任第三方以达到公平交换的目的。提出的方案具有签名长度短、计算量小等优点,可以公平且有效地实现数字签名的交换。 相似文献
4.
公平交换协议是安全电子商务的基石,RSA密码体制在电子商务领域中得到了广泛的应用,设计基于RSA密码体制的公平交换协议具有重要的实践意义。文章提出了一种新的基于整数扩环的高效可验证的加密的RSA签名方案,基于该方案设计了一种高效、安全、简单、实用、快速的交换RSA签名的优化公平交换协议,对其安全性和效率进行了分析和比较。 相似文献
5.
基于身份的环签密算法兼具基于身份的密码体制与签密技术高效性的优点,同时具备环签名的模糊性。针对罗铭等提出的基于签密的公平交换协议(罗铭,邹春华,胡军,等. 基于签密的公平交易协议. 通信学报,2010,31(8A):146-150)中公平性水平与算法效率不高的问题,新方案引入了一个更加高效的基于身份的环签密算法,并将绑定签名身份与解密密文分开处理,构造了一种新的并发签名方案,并基于该方案构造了一个公平交换协议。分析表明,该方案克服了原方案公平性的不足,并在算法效率上有所提高,能很好地应用在电子支付、合同签署等电子商务活动中。 相似文献
6.
公平性是电子商务协议的基本安全要求.RSA是应用最为广泛的公钥密码体制之一.公平交换协议可以使得参与交换的双方以公平的方式交换信息,这样,要么任何一方都可以得到对方的信息,要么双方都得不到对方的信息.分析了现有的公平交换协议构造方法、体系结构及其在实用性和效率方面存在的问题.在此基础上,利用精心构造的扩环中可公开验证的、加密的RSA签名,提出了一种完全基于RSA签名方案的优化公平交换协议,并对其安全性和效率进行了证明和分析.分析表明,提出的方案是简洁、高效、安全的. 相似文献
7.
8.
作为电子商务核心的公平交换协议是目前研究的热点。针对Jianying Zhou方案的不足,提出了一种更为简洁和高效的公平交换协议。协议用密钥K加密消息,采用双重签名来保证消息的安全性。在发生争执时,可信第三方只需要公开H(K)来证实交换消息的真实性,与原协议相比执行效率和安全性均有提高。 相似文献
9.
公平交换协议是构造电子商务系统的最基本工具。BLS短签名是双线性密码学中应用最为广泛的密码元件之一。基于BLS短签名,提出了一种优化公平交换协议,并分析了其安全性与运行效率。 相似文献
10.
11.
针对目前对多方公平交换协议研究很薄弱这一事实,基于Zheng的签密方案[9],提出了一个安全高效的带离线半可信第三方的多方公平交换协议。 相似文献
12.
首次指出不可否认协议运行结果可分为认证强公平和期望强公平,其中后者优于前者。利用GPS数字签,提出一个新的带离线可信第三方的多方不可否认协议,该协议实现了期望强公平且允许发方给不同的接收方同的消息,突破了先前协议只允许发方给不同的接收方发送同一消息的局限性。协议同时允许发方自由选择,使得交易灵活而符合实际。最后给出协议的安全性分析。 相似文献
13.
《Electronic Commerce Research and Applications》2007,6(3):343-357
Some electronic commerce transactions are inherently performed between more than two parties. In this context, it is thus important to determine whether the underlying fair exchange protocols allowing the secure implementation of such transactions enable participants to exclude other entities from a protocol execution. This is an important point that has not been sufficiently addressed when analysing such kind of protocols, and that may be crucial for the successful accomplishment of multi-party electronic transactions. In this paper we define the properties related to exchange protocols and exclusions, study exclusion scenarios on two well-known multi-party fair exchange protocols and point out the implications that exclusions may have on the trust relationships between participants, and, more generally, on electronic commerce. Two new protocols more robust than existing multi-party fair exchange protocols are therefore proposed. 相似文献
14.
15.
In this paper, we propose a multi-party quantum key agreement protocol with five-qubit brown states and single-qubit measurements. Our multi-party protocol ensures each participant to contribute equally to the agreement key. Each party performs three single-qubit unitary operations on three qubits of each brown state. Finally, by measuring brown states and decoding the measurement results, all participants can negotiate a shared secret key without classical bits exchange between them. With the analysis of security, our protocol demonstrates that it can resist against both outsider and participant attacks. Compared with other schemes, it also possesses a higher information efficiency. In terms of physical operation, it requires single-qubit measurements only which weakens the hardware requirements of participant and has a better operating flexibility. 相似文献
16.
17.
18.
近年来,如何合理有效地在区块链上实现用户隐私数据保护是区块链技术领域的一个关键性问题针对此问题,设计出一种基于Pedersen承诺与Schnorr协议的安全多方计算协议(protocol of blockchain based on Pedersen commitment linked Schnorr protocol... 相似文献
19.
《Journal of Network and Computer Applications》2012,35(6):1793-1806
Fair signature exchange in emerging ubiquitous commerce (u-commerce) poses new security challenges. In particular, its operations are highly distributed and autonomous, and typically run on much open, dynamic and resource-diversified ubiquitous networks. These characteristics make the exchange very vulnerable to security attacks. Some effort has been made to address the challenges. As a result, an approach to autonomous fair exchange has been proposed specifically for u-commerce. Despite a number of novel features offered by the approach, its weaknesses are low efficiency and high complexity.This paper is aimed at proposing a more efficient and simpler solution for allowing the task of signature exchange to be delegated securely to selected devices in order to facilitate autonomous fair signature exchange on ubiquitous networks. To accomplish this aim, we have produced a novel approach to symmetric-key based verifiable proxy encryption to simplify the signature exchange delegation. Based on this approach, we have developed a new protocol for autonomous fair signature exchange in u-commerce. An analysis of the new protocol has been carried out to confirm its security, fairness and performance. A comparison with related work has demonstrated its better efficiency and simplicity. 相似文献