Number-Theoretic Attack on Lyuu-Wu's Multi-proxy Multi-signature Scheme

Fanyu Kong, Jia Yu
{"title":"Number-Theoretic Attack on Lyuu-Wu's Multi-proxy Multi-signature Scheme","authors":"Fanyu Kong, Jia Yu","doi":"10.1109/IAS.2009.130","DOIUrl":null,"url":null,"abstract":"Y. D. Lyuu and M. L. Wu had proposed an improved multi-proxy multi-signature scheme, which was claimed to resist the forge attack. Lately, L. Guo and G. Wang found an inside attack on the Lyuu-Wu's scheme. In this paper, we propose a new attack on Lyuu-Wu's scheme, which can factor the parameter $N$ and $Q$ by using efficient number-theoretic algorithms when $Q$ is roughly larger than the square root of $N$. It follows that Lyuu-Wu's scheme suffers from the forge attack from the proxy signers in that case.","PeriodicalId":240354,"journal":{"name":"2009 Fifth International Conference on Information Assurance and Security","volume":"70 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 Fifth International Conference on Information Assurance and Security","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IAS.2009.130","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Y. D. Lyuu and M. L. Wu had proposed an improved multi-proxy multi-signature scheme, which was claimed to resist the forge attack. Lately, L. Guo and G. Wang found an inside attack on the Lyuu-Wu's scheme. In this paper, we propose a new attack on Lyuu-Wu's scheme, which can factor the parameter $N$ and $Q$ by using efficient number-theoretic algorithms when $Q$ is roughly larger than the square root of $N$. It follows that Lyuu-Wu's scheme suffers from the forge attack from the proxy signers in that case.
吕武多代理多重签名方案的数论攻击
Y. D. Lyuu和M. L. Wu提出了一种改进的多代理多重签名方案,并声称该方案可以抵抗伪造攻击。后来,郭立国和王立国发现了对吕武计划的内部攻击。本文提出了一种新的对Lyuu-Wu方案的攻击,当Q$大致大于N$的平方根时,利用有效的数论算法将参数$N$和$Q$分解。由此可见,在这种情况下,Lyuu-Wu的方案遭受了代理签名者的伪造攻击。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信