首页> 外文期刊>Mathematical Problems in Engineering >Cryptanalysis and Performance Evaluation of Enhanced Threshold Proxy Signature Scheme Based on RSA for Known Signers
【24h】

Cryptanalysis and Performance Evaluation of Enhanced Threshold Proxy Signature Scheme Based on RSA for Known Signers

机译:基于RSA的已知签名者增强阈值代理签名方案的密码分析和性能评估

获取原文
获取原文并翻译 | 示例
           

摘要

In these days there are plenty of signature schemes such as the (t, n) threshold proxy signature scheme (Kumar and Verma 2010). The network is a shared medium so that the weakness security attacks such as eavesdropping, replay attack, and modification attack. Thus, we have to establish a common key for encrypting/decrypting our communications over an insecure network. In this scheme, a (t, n) threshold proxy signature scheme based on RSA, any t or more proxy signers can cooperatively generate a proxy signature while t - 1 or fewer of them cannot do it. The threshold proxy signature scheme uses the RSA cryptosystem to generate the private and the public key of the signers (Rivest et al., 1978). Comparison is done on the basis of time complexity, space complexity, and communication overhead. We compare the performance of four schemes (Hwang et al. (2003), Kuo and Chen (2005), Yong-Jun et al. (2007), and Li et al. (2007), with the performance of a scheme that has been proposed earlier by the authors of this paper. In the proposed scheme, both the combiner and the secret share holder can verify the correctness of the information that they are receiving from each other. Therefore, the enhanced threshold proxy signature scheme is secure and efficient against notorious conspiracy attacks.
机译:如今,有很多签名方案,例如(t,n)门限代理签名方案(Kumar和Verma 2010)。网络是一种共享介质,因此弱点安全攻击(例如窃听,重放攻击和修改攻击)。因此,我们必须建立一个公共密钥,以便通过不安全的网络对通信进行加密/解密。在此方案中,这是一个基于RSA的(t,n)门限代理签名方案,任何t个或多个代理签名者都可以协作生成代理签名,而t-1个或更少的代理签名者不能这样做。门限代理签名方案使用RSA密码系统来生成签名者的私钥和公钥(Rivest等,1978)。根据时间复杂度,空间复杂度和通信开销进行比较。我们将四种方案的性能(Hwang等人(2003),Kuo和Chen(2005),Yong-Jun等人(2007)和Li等人(2007)以及具有本文提出的方案中,组合器和秘密共享持有者都可以验证彼此接收的信息的正确性,因此,增强的阈值代理签名方案是安全有效的对抗臭名昭著的阴谋袭击。

著录项

  • 来源
    《Mathematical Problems in Engineering》 |2013年第3期|790257.1-790257.24|共24页
  • 作者单位

    Department of Computer Science and Engineering, Dr. B. R. Ambedkar National Institute of Technology, Jalandhar, Punjab, India;

    Department of Computer Science and Engineering, Dr. B. R. Ambedkar National Institute of Technology, Jalandhar, Punjab, India;

    Department of Computer Science and Engineering, Dr. B. R. Ambedkar National Institute of Technology, Jalandhar, Punjab, India;

  • 收录信息
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号