An Efficient MQ-based Signature with Tight Security Proof

Hiroki Furue, D. Duong, T. Takagi
{"title":"An Efficient MQ-based Signature with Tight Security Proof","authors":"Hiroki Furue, D. Duong, T. Takagi","doi":"10.15803/ijnc.10.2_308","DOIUrl":null,"url":null,"abstract":"At PKC 2018, Chen et al. proposed SOFIA, the first MQ-based digital signature scheme having tight security in the quantum random oracle model (QROM). SOFIA is constructed by applying an extended version of the Unruh transform (EUROCRYPT 2015) to the mathcal MQ-based 5-pass identification scheme (IDS) proposed by Sakumoto et al. (CRYPTO 2011). In this paper, we propose an MQ-based 3-pass IDS with impersonation probability of 1/2 and apply the original version of the Unruh transform to it to obtain a more efficient MQ-based digital signature scheme tightly secure in the QROM. The signature size of our digital signature scheme decreases by about 35% compared with SOFIA in the level I of NIST PQC security category, and is supposed to be the shortest among that of MQ-based signatures tightly secure in the QROM.","PeriodicalId":270166,"journal":{"name":"Int. J. Netw. Comput.","volume":"33 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Int. J. Netw. Comput.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.15803/ijnc.10.2_308","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

At PKC 2018, Chen et al. proposed SOFIA, the first MQ-based digital signature scheme having tight security in the quantum random oracle model (QROM). SOFIA is constructed by applying an extended version of the Unruh transform (EUROCRYPT 2015) to the mathcal MQ-based 5-pass identification scheme (IDS) proposed by Sakumoto et al. (CRYPTO 2011). In this paper, we propose an MQ-based 3-pass IDS with impersonation probability of 1/2 and apply the original version of the Unruh transform to it to obtain a more efficient MQ-based digital signature scheme tightly secure in the QROM. The signature size of our digital signature scheme decreases by about 35% compared with SOFIA in the level I of NIST PQC security category, and is supposed to be the shortest among that of MQ-based signatures tightly secure in the QROM.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
具有严密安全证明的高效mq签名
在PKC 2018上,Chen等人提出了SOFIA,这是第一个在量子随机oracle模型(QROM)中具有严格安全性的基于mq的数字签名方案。SOFIA是通过将Unruh变换(EUROCRYPT 2015)的扩展版本应用于Sakumoto等人(CRYPTO 2011)提出的基于数学mq的5次识别方案(IDS)来构建的。在本文中,我们提出了一种模拟概率为1/2的基于mq的3-pass IDS,并对其应用了原始版本的Unruh变换,从而获得了一种在QROM中严密安全的更高效的基于mq的数字签名方案。与NIST PQC安全类别一级的SOFIA相比,我们的数字签名方案的签名大小减少了约35%,并且应该是在QROM中严格安全的基于mq的签名中最短的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Resilient Scheduling Heuristics for Rigid Parallel Jobs Preface: Special Issue on Workshop on Advances in Parallel and Distributed Computational Models 2020 Dynamic DAG Scheduling Under Memory Constraints for Shared-Memory Platforms Assessment of NVSHMEM for High Performance Computing A Sequential Detection Method for Intrusion Detection System Based on Artificial Neural Networks
×
引用
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