Post-quantum secure compact deterministic wallets from isogeny-based signatures with rerandomized keys

IF 1 4区 计算机科学 Q3 COMPUTER SCIENCE, THEORY & METHODS Theoretical Computer Science Pub Date : 2025-04-29 Epub Date: 2025-02-19 DOI:10.1016/j.tcs.2025.115127
Surbhi Shaw, Ratna Dutta
{"title":"Post-quantum secure compact deterministic wallets from isogeny-based signatures with rerandomized keys","authors":"Surbhi Shaw,&nbsp;Ratna Dutta","doi":"10.1016/j.tcs.2025.115127","DOIUrl":null,"url":null,"abstract":"<div><div>A deterministic wallet is a specialized type of cryptocurrency wallet designed to simplify key management and enhance security. In their research presented at CCS'19, Das et al. introduced a general framework for building deterministic wallets based on signature schemes with rerandomizable keys (rerandomizable signatures). This advanced form of signature scheme allows for independent yet consistent rerandomization of signing and public key. Additionally, they provided an instantiation of their framework using rerandomizable signatures derived from BLS and ECDSA. However, these wallet schemes reveal vulnerability to quantum threats, primarily because of their reliance on the discrete logarithm problem which poses a significant challenge to the security landscape.</div><div>As signature schemes with perfectly rerandomizable keys are central to the construction of deterministic wallets, we begin by offering a generic construction of such scheme from signature schemes based on cryptographic (free) group actions. We present an in-depth security analysis of our scheme proving them secure against <em>existential unforgeability under chosen-message attack with honestly rerandomized keys</em>. To ensure post-quantum security, we instantiate our generic construction of rerandomizable signature from isogeny-based signature schemes <em>Commutative Supersingular Isogeny based Fiat-Shamir signature</em> (<span>CSI-FiSh</span>) and <span>CSI-FiSh</span> <em>with Sharing-friendly Keys</em> (<span>CSI-SharK</span>). We extend our techniques to adaptor signatures as well as to design an <em>adaptor signature with rerandomizable keys</em> from isogenies. Additionally, we seamlessly integrate our generic rerandomizable signature scheme into the development of the deterministic wallet. Finally, we instantiate our deterministic wallet from rerandomizable signature scheme from <span>CSI-FiSh</span> which gives the first isogeny-based deterministic wallet, distinguished by its compact key sizes.</div></div>","PeriodicalId":49438,"journal":{"name":"Theoretical Computer Science","volume":"1035 ","pages":"Article 115127"},"PeriodicalIF":1.0000,"publicationDate":"2025-04-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Theoretical Computer Science","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0304397525000659","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2025/2/19 0:00:00","PubModel":"Epub","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

Abstract

A deterministic wallet is a specialized type of cryptocurrency wallet designed to simplify key management and enhance security. In their research presented at CCS'19, Das et al. introduced a general framework for building deterministic wallets based on signature schemes with rerandomizable keys (rerandomizable signatures). This advanced form of signature scheme allows for independent yet consistent rerandomization of signing and public key. Additionally, they provided an instantiation of their framework using rerandomizable signatures derived from BLS and ECDSA. However, these wallet schemes reveal vulnerability to quantum threats, primarily because of their reliance on the discrete logarithm problem which poses a significant challenge to the security landscape.
As signature schemes with perfectly rerandomizable keys are central to the construction of deterministic wallets, we begin by offering a generic construction of such scheme from signature schemes based on cryptographic (free) group actions. We present an in-depth security analysis of our scheme proving them secure against existential unforgeability under chosen-message attack with honestly rerandomized keys. To ensure post-quantum security, we instantiate our generic construction of rerandomizable signature from isogeny-based signature schemes Commutative Supersingular Isogeny based Fiat-Shamir signature (CSI-FiSh) and CSI-FiSh with Sharing-friendly Keys (CSI-SharK). We extend our techniques to adaptor signatures as well as to design an adaptor signature with rerandomizable keys from isogenies. Additionally, we seamlessly integrate our generic rerandomizable signature scheme into the development of the deterministic wallet. Finally, we instantiate our deterministic wallet from rerandomizable signature scheme from CSI-FiSh which gives the first isogeny-based deterministic wallet, distinguished by its compact key sizes.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
后量子安全紧凑型确定性钱包,来自基于等基因的签名和重新随机密钥
确定性钱包是一种专门类型的加密货币钱包,旨在简化密钥管理并增强安全性。在CCS'19上发表的研究中,Das等人介绍了一个基于具有可重新随机密钥(可重新随机签名)的签名方案构建确定性钱包的一般框架。这种高级形式的签名方案允许独立但一致的签名和公钥的重新随机化。此外,他们还使用来自BLS和ECDSA的可重新随机签名提供了其框架的实例化。然而,这些钱包方案暴露出易受量子威胁的脆弱性,主要是因为它们依赖于离散对数问题,这对安全环境构成了重大挑战。由于具有完全可再随机密钥的签名方案是构建确定性钱包的核心,因此我们首先从基于加密(自由)组动作的签名方案中提供此类方案的通用构造。我们对我们的方案进行了深入的安全性分析,证明它们在诚实重随机密钥的选择消息攻击下具有存在不可伪造性。为了保证后量子安全,我们实例化了基于等基因的可重随机签名方案(交换超奇异等基因法-沙米尔签名(CSI-FiSh)和具有共享友好密钥的CSI-FiSh (CSI-SharK))的可重随机签名的通用构造。我们将我们的技术扩展到适配器签名,并设计了具有来自同基因的可重新随机密钥的适配器签名。此外,我们将通用的可重新随机签名方案无缝集成到确定性钱包的开发中。最后,我们从CSI-FiSh的可重新随机签名方案中实例化了我们的确定性钱包,该方案给出了第一个基于等基因的确定性钱包,其特点是其紧凑的密钥大小。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Theoretical Computer Science
Theoretical Computer Science 工程技术-计算机:理论方法
CiteScore
2.60
自引率
18.20%
发文量
471
审稿时长
12.6 months
期刊介绍: Theoretical Computer Science is mathematical and abstract in spirit, but it derives its motivation from practical and everyday computation. Its aim is to understand the nature of computation and, as a consequence of this understanding, provide more efficient methodologies. All papers introducing or studying mathematical, logic and formal concepts and methods are welcome, provided that their motivation is clearly drawn from the field of computing.
期刊最新文献
On the order of lazy cellular automata Parameterized algorithms and complexity for scheduling with precedence constraints and time windows On the complexity of finding central configurations of the graph-generalized (n2−1)-puzzle An approximation algorithm for the asymmetric profitable tour problem with submodular penalties Online geometric hitting set using points in Zd
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1