Signature schemes based on two hard problems simultaneously

Ching-Te Wang, Chu-Hsing Lin, Chinchen Chang
{"title":"Signature schemes based on two hard problems simultaneously","authors":"Ching-Te Wang, Chu-Hsing Lin, Chinchen Chang","doi":"10.1109/AINA.2003.1192943","DOIUrl":null,"url":null,"abstract":"Harn (1994) proposed a signature scheme based on the modified ElGamal scheme and claimed that the security relies on both the factorization and the discrete logarithm. That is, his scheme cannot be broken unless both of the above two problems can be solved simultaneously. Lee and Hwang (1996) showed that an attacker could generate a forged signature on the assumption when the discrete logarithm is solved. Recently, Shao (1998) proposed another two signature schemes, which the security rests on the two problems. In this paper, we propose two improved signature schemes that are really based on two hard problems simultaneously. In addition, the numbers of parameters and computations are reduced in comparison with those of Shao.","PeriodicalId":382765,"journal":{"name":"17th International Conference on Advanced Information Networking and Applications, 2003. AINA 2003.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"17th International Conference on Advanced Information Networking and Applications, 2003. AINA 2003.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AINA.2003.1192943","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 14

Abstract

Harn (1994) proposed a signature scheme based on the modified ElGamal scheme and claimed that the security relies on both the factorization and the discrete logarithm. That is, his scheme cannot be broken unless both of the above two problems can be solved simultaneously. Lee and Hwang (1996) showed that an attacker could generate a forged signature on the assumption when the discrete logarithm is solved. Recently, Shao (1998) proposed another two signature schemes, which the security rests on the two problems. In this paper, we propose two improved signature schemes that are really based on two hard problems simultaneously. In addition, the numbers of parameters and computations are reduced in comparison with those of Shao.
同时基于两个难题的签名方案
Harn(1994)在改进的ElGamal方案的基础上提出了一种签名方案,认为其安全性既依赖于因式分解,也依赖于离散对数。也就是说,除非上述两个问题同时得到解决,否则他的方案是不可能被打破的。Lee和Hwang(1996)表明,攻击者可以在求解离散对数的假设下生成伪造签名。最近,Shao(1998)提出了另外两种签名方案,其安全性建立在这两个问题之上。本文提出了两种改进的签名方案,这两种方案实际上是同时基于两个难题的。此外,与Shao的方法相比,该方法的参数和计算量都有所减少。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信