高效的后量子安全确定性钱包方案

IF 3.9 4区 计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS
Mingxing Hu, Zhen Liu, Yunhong Zhou
{"title":"高效的后量子安全确定性钱包方案","authors":"Mingxing Hu, Zhen Liu, Yunhong Zhou","doi":"10.1186/s42400-024-00216-w","DOIUrl":null,"url":null,"abstract":"<p>Since the advent of Bitcoin, cryptocurrencies have gained substantial popularity, and <i>crypto wallets</i> have evolved into the predominant tool for safeguarding and managing cryptographic keys to access cryptocurrency funds. <i>Deterministic wallets</i> are proposed as an advanced wallet mechanism to provide benefits such as low-maintenance, easy backup and recovery, and support for functionalities required by cryptocurrencies. Alkeilani Alkadri et al. (ACM CCS’20) presented the first post-quantum secure deterministic wallet scheme, but it exhibits a gap to bridge before achieving practical applicability, as reflected in both their concrete parameters size and computational efficiency. In this paper, we propose an efficient post-quantum secure deterministic wallet scheme. In particular, we present a new construction method for deterministic wallets, prove the security in the quantum random oracle model, and provide an efficient instantiation. The comparison result, with the work of Alkeilani Alkadri et al. (ACM CCS’20), shows our work has a comprehensive improvement on efficiency, e.g., the <i>pk</i> size is <span>\\(\\approx 40.7\\)</span> times shorter, <i>sk</i> is <span>\\(\\approx 9.2\\)</span> times shorter, and the signing time is <span>\\(\\approx 3.1\\)</span> times faster.</p>","PeriodicalId":36402,"journal":{"name":"Cybersecurity","volume":null,"pages":null},"PeriodicalIF":3.9000,"publicationDate":"2024-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Efficient post-quantum secure deterministic wallet scheme\",\"authors\":\"Mingxing Hu, Zhen Liu, Yunhong Zhou\",\"doi\":\"10.1186/s42400-024-00216-w\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>Since the advent of Bitcoin, cryptocurrencies have gained substantial popularity, and <i>crypto wallets</i> have evolved into the predominant tool for safeguarding and managing cryptographic keys to access cryptocurrency funds. <i>Deterministic wallets</i> are proposed as an advanced wallet mechanism to provide benefits such as low-maintenance, easy backup and recovery, and support for functionalities required by cryptocurrencies. Alkeilani Alkadri et al. (ACM CCS’20) presented the first post-quantum secure deterministic wallet scheme, but it exhibits a gap to bridge before achieving practical applicability, as reflected in both their concrete parameters size and computational efficiency. In this paper, we propose an efficient post-quantum secure deterministic wallet scheme. In particular, we present a new construction method for deterministic wallets, prove the security in the quantum random oracle model, and provide an efficient instantiation. The comparison result, with the work of Alkeilani Alkadri et al. (ACM CCS’20), shows our work has a comprehensive improvement on efficiency, e.g., the <i>pk</i> size is <span>\\\\(\\\\approx 40.7\\\\)</span> times shorter, <i>sk</i> is <span>\\\\(\\\\approx 9.2\\\\)</span> times shorter, and the signing time is <span>\\\\(\\\\approx 3.1\\\\)</span> times faster.</p>\",\"PeriodicalId\":36402,\"journal\":{\"name\":\"Cybersecurity\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":3.9000,\"publicationDate\":\"2024-08-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Cybersecurity\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.1186/s42400-024-00216-w\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Cybersecurity","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1186/s42400-024-00216-w","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

自比特币问世以来,加密货币大受欢迎,加密钱包已发展成为保护和管理加密密钥以获取加密货币资金的主要工具。确定性钱包是一种先进的钱包机制,具有维护成本低、易于备份和恢复、支持加密货币所需的功能等优点。Alkeilani Alkadri 等人(ACM CCS'20)提出了首个后量子安全确定性钱包方案,但该方案在实现实际应用之前仍有差距,具体体现在其具体参数大小和计算效率上。本文提出了一种高效的后量子安全确定性钱包方案。其中,我们提出了一种新的确定性钱包构造方法,证明了量子随机甲骨文模型的安全性,并提供了一种高效的实例化方法。与 Alkeilani Alkadri 等人的工作(ACM CCS'20)的对比结果表明,我们的工作在效率上有了全面的提升,例如,pk 大小缩短了大约 40.7 倍,sk 缩短了大约 9.2 倍,签名时间快了大约 3.1 倍。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

Efficient post-quantum secure deterministic wallet scheme

Efficient post-quantum secure deterministic wallet scheme

Since the advent of Bitcoin, cryptocurrencies have gained substantial popularity, and crypto wallets have evolved into the predominant tool for safeguarding and managing cryptographic keys to access cryptocurrency funds. Deterministic wallets are proposed as an advanced wallet mechanism to provide benefits such as low-maintenance, easy backup and recovery, and support for functionalities required by cryptocurrencies. Alkeilani Alkadri et al. (ACM CCS’20) presented the first post-quantum secure deterministic wallet scheme, but it exhibits a gap to bridge before achieving practical applicability, as reflected in both their concrete parameters size and computational efficiency. In this paper, we propose an efficient post-quantum secure deterministic wallet scheme. In particular, we present a new construction method for deterministic wallets, prove the security in the quantum random oracle model, and provide an efficient instantiation. The comparison result, with the work of Alkeilani Alkadri et al. (ACM CCS’20), shows our work has a comprehensive improvement on efficiency, e.g., the pk size is \(\approx 40.7\) times shorter, sk is \(\approx 9.2\) times shorter, and the signing time is \(\approx 3.1\) times faster.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Cybersecurity
Cybersecurity Computer Science-Information Systems
CiteScore
7.30
自引率
0.00%
发文量
77
审稿时长
9 weeks
×
引用
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学术官方微信