{"title":"一个强RSA签名方案及其应用","authors":"Zhengjun Cao, Lihua Liu","doi":"10.1109/SNPD.2007.33","DOIUrl":null,"url":null,"abstract":"We present an efficient improvement of the strong RSA signature scheme [1], which is very similar to Fischlin sig nature [2]. Both two signatures are based on strong RSA assumption. In the original scheme, the signer has to choose a prime with prescribed length in signing phase. Except that, three generators of QRn should be chosen in the set-up phase. Our scheme removes or relaxes these restrictions. It only needs to choose two generators of QRn and an odd. Our scheme saves about 1/2 computational cost of the original scheme. Moreover, we propose a blind signature scheme and a partially blind signature scheme based on the basic scheme. To the best of our knowledge, it's the first time to propose such a blind signature scheme and a partially blind signature scheme based on strong RSA assumption.","PeriodicalId":197058,"journal":{"name":"Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"A Strong RSA Signature Scheme and Its Application\",\"authors\":\"Zhengjun Cao, Lihua Liu\",\"doi\":\"10.1109/SNPD.2007.33\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We present an efficient improvement of the strong RSA signature scheme [1], which is very similar to Fischlin sig nature [2]. Both two signatures are based on strong RSA assumption. In the original scheme, the signer has to choose a prime with prescribed length in signing phase. Except that, three generators of QRn should be chosen in the set-up phase. Our scheme removes or relaxes these restrictions. It only needs to choose two generators of QRn and an odd. Our scheme saves about 1/2 computational cost of the original scheme. Moreover, we propose a blind signature scheme and a partially blind signature scheme based on the basic scheme. To the best of our knowledge, it's the first time to propose such a blind signature scheme and a partially blind signature scheme based on strong RSA assumption.\",\"PeriodicalId\":197058,\"journal\":{\"name\":\"Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007)\",\"volume\":\"57 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-07-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SNPD.2007.33\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SNPD.2007.33","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

摘要

我们提出了一种有效改进的强RSA签名方案[1],它与Fischlin签名性质[2]非常相似。这两种签名都基于强RSA假设。在原方案中,签名者必须在签名阶段选择一个规定长度的素数。除此之外,在设置阶段应选择三个QRn发生器。我们的方案取消或放宽了这些限制。它只需要选择两个QRn和一个奇数的生成器。本方案比原方案节省约1/2的计算量。在此基础上,提出了一种盲签名方案和一种部分盲签名方案。据我们所知,这是第一次提出这样的盲签名方案和基于强RSA假设的部分盲签名方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A Strong RSA Signature Scheme and Its Application
We present an efficient improvement of the strong RSA signature scheme [1], which is very similar to Fischlin sig nature [2]. Both two signatures are based on strong RSA assumption. In the original scheme, the signer has to choose a prime with prescribed length in signing phase. Except that, three generators of QRn should be chosen in the set-up phase. Our scheme removes or relaxes these restrictions. It only needs to choose two generators of QRn and an odd. Our scheme saves about 1/2 computational cost of the original scheme. Moreover, we propose a blind signature scheme and a partially blind signature scheme based on the basic scheme. To the best of our knowledge, it's the first time to propose such a blind signature scheme and a partially blind signature scheme based on strong RSA assumption.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
An RBF Network Based Beamformer for Mimo Wireless Communication Systems Tailoring Software Evolution Process Communication Optimization Algorithms based on Extend Data Flow Graph Improving Blind Equalization Algorithm for Wireless Communication Systems Speech Enhancement Employing Modified a Priori SNR Estimation
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1