针对已知签名者,提出了一种基于RSA密码系统的高级安全(t, n)阈值代理签名方案

Raman Kumar, H. Verma
{"title":"针对已知签名者,提出了一种基于RSA密码系统的高级安全(t, n)阈值代理签名方案","authors":"Raman Kumar, H. Verma","doi":"10.1109/IADCC.2010.5422940","DOIUrl":null,"url":null,"abstract":"In 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 can't do it. The threshold proxy signature scheme uses the RSA cryptosystem to generate the private and the public key of the signers [8]. In this article, we discuss the implementation and comparison of some threshold proxy signature schemes that are based on the RSA cryptosystem. Comparison is done on the basis of time complexity, space complexity and communication overhead. We compare the performance of four schemes: Hwang et al. [1], Wen et al.[2], Geng et al.[3] and Fengying et al[4] with the performance of a scheme that has been proposed by the authors of this article earlier and proposed an advanced secure (t, n) threshold proxy signature scheme. 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 proposed scheme is secure and efficient against notorious conspiracy attacks.","PeriodicalId":249763,"journal":{"name":"2010 IEEE 2nd International Advance Computing Conference (IACC)","volume":"352 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"35","resultStr":"{\"title\":\"An advanced secure (t, n) threshold proxy signature scheme based on RSA cryptosystem for known signers\",\"authors\":\"Raman Kumar, H. Verma\",\"doi\":\"10.1109/IADCC.2010.5422940\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In 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 can't do it. The threshold proxy signature scheme uses the RSA cryptosystem to generate the private and the public key of the signers [8]. In this article, we discuss the implementation and comparison of some threshold proxy signature schemes that are based on the RSA cryptosystem. Comparison is done on the basis of time complexity, space complexity and communication overhead. We compare the performance of four schemes: Hwang et al. [1], Wen et al.[2], Geng et al.[3] and Fengying et al[4] with the performance of a scheme that has been proposed by the authors of this article earlier and proposed an advanced secure (t, n) threshold proxy signature scheme. 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 proposed scheme is secure and efficient against notorious conspiracy attacks.\",\"PeriodicalId\":249763,\"journal\":{\"name\":\"2010 IEEE 2nd International Advance Computing Conference (IACC)\",\"volume\":\"352 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-03-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"35\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 IEEE 2nd International Advance Computing Conference (IACC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IADCC.2010.5422940\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE 2nd International Advance Computing Conference (IACC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IADCC.2010.5422940","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 35

摘要

在基于RSA的(t,n)门限代理签名方案中,任意t个或多个代理签名人都可以协同生成代理签名,而t-1个或更少的代理签名人无法协同生成代理签名。阈值代理签名方案使用RSA密码系统生成签名者的私钥和公钥[8]。在本文中,我们讨论了一些基于RSA密码系统的阈值代理签名方案的实现和比较。在时间复杂度、空间复杂度和通信开销的基础上进行比较。我们将Hwang等人[1]、Wen等人[2]、Geng等人[3]和Fengying等人[4]这四种方案的性能与本文作者之前提出的一种方案的性能进行了比较,该方案提出了一种高级安全(t, n)阈值代理签名方案。在该方案中,合并者和秘密股东都可以验证他们从对方接收到的信息的正确性。因此,所提出的方案对臭名昭著的阴谋攻击是安全有效的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An advanced secure (t, n) threshold proxy signature scheme based on RSA cryptosystem for known signers
In 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 can't do it. The threshold proxy signature scheme uses the RSA cryptosystem to generate the private and the public key of the signers [8]. In this article, we discuss the implementation and comparison of some threshold proxy signature schemes that are based on the RSA cryptosystem. Comparison is done on the basis of time complexity, space complexity and communication overhead. We compare the performance of four schemes: Hwang et al. [1], Wen et al.[2], Geng et al.[3] and Fengying et al[4] with the performance of a scheme that has been proposed by the authors of this article earlier and proposed an advanced secure (t, n) threshold proxy signature scheme. 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 proposed scheme is secure and efficient against notorious conspiracy attacks.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信