CSI-Otter: isogeny-based (partially) blind signatures from the class group action with a twist

IF 1.2 2区 数学 Q3 COMPUTER SCIENCE, THEORY & METHODS Designs, Codes and Cryptography Pub Date : 2024-07-17 DOI:10.1007/s10623-024-01441-7
Shuichi Katsumata, Yi-Fu Lai, Jason T. LeGrow, Ling Qin
{"title":"CSI-Otter: isogeny-based (partially) blind signatures from the class group action with a twist","authors":"Shuichi Katsumata, Yi-Fu Lai, Jason T. LeGrow, Ling Qin","doi":"10.1007/s10623-024-01441-7","DOIUrl":null,"url":null,"abstract":"<p>In this paper, we construct the first provably-secure isogeny-based (partially) blind signature scheme. While at a high level the scheme resembles the Schnorr blind signature, our work does not directly follow from that construction, since isogenies do not offer as rich an algebraic structure. Specifically, our protocol does not fit into the <i>linear identification protocol</i> abstraction introduced by Hauck, Kiltz, and Loss (EUROCYRPT’19), which was used to generically construct Schnorr-like blind signatures based on modules such as classical groups and lattices. Consequently, our scheme is provably secure in the random oracle model (ROM) against poly-logarithmically-many concurrent sessions assuming the subexponential hardness of the group action inverse problem. In more detail, our blind signature exploits the <i>quadratic twist</i> of an elliptic curve in an essential way to endow isogenies with a strictly richer structure than abstract group actions (but still more restrictive than modules). The basic scheme has public key size 128 B and signature size 8 KB under the CSIDH-512 parameter sets—these are the smallest among all provably secure post-quantum secure blind signatures. Relying on a new <i>ring</i> variant of the group action inverse problem (<span>\\(\\textsf{rGAIP}\\)</span>), we can halve the signature size to 4 KB while increasing the public key size to 512 B. We provide preliminary cryptanalysis of <span>\\({\\textsf{rGAIP}} \\)</span> and show that for certain parameter settings, it is essentially as secure as the standard <span>\\(\\textsf{GAIP}\\)</span>. Finally, we show a novel way to turn our blind signature into a partially blind signature, where we deviate from prior methods since they require hashing into the set of public keys while hiding the corresponding secret key—constructing such a hash function in the isogeny setting remains an open problem.</p>","PeriodicalId":11130,"journal":{"name":"Designs, Codes and Cryptography","volume":"32 1","pages":""},"PeriodicalIF":1.2000,"publicationDate":"2024-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Designs, Codes and Cryptography","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s10623-024-01441-7","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

Abstract

In this paper, we construct the first provably-secure isogeny-based (partially) blind signature scheme. While at a high level the scheme resembles the Schnorr blind signature, our work does not directly follow from that construction, since isogenies do not offer as rich an algebraic structure. Specifically, our protocol does not fit into the linear identification protocol abstraction introduced by Hauck, Kiltz, and Loss (EUROCYRPT’19), which was used to generically construct Schnorr-like blind signatures based on modules such as classical groups and lattices. Consequently, our scheme is provably secure in the random oracle model (ROM) against poly-logarithmically-many concurrent sessions assuming the subexponential hardness of the group action inverse problem. In more detail, our blind signature exploits the quadratic twist of an elliptic curve in an essential way to endow isogenies with a strictly richer structure than abstract group actions (but still more restrictive than modules). The basic scheme has public key size 128 B and signature size 8 KB under the CSIDH-512 parameter sets—these are the smallest among all provably secure post-quantum secure blind signatures. Relying on a new ring variant of the group action inverse problem (\(\textsf{rGAIP}\)), we can halve the signature size to 4 KB while increasing the public key size to 512 B. We provide preliminary cryptanalysis of \({\textsf{rGAIP}} \) and show that for certain parameter settings, it is essentially as secure as the standard \(\textsf{GAIP}\). Finally, we show a novel way to turn our blind signature into a partially blind signature, where we deviate from prior methods since they require hashing into the set of public keys while hiding the corresponding secret key—constructing such a hash function in the isogeny setting remains an open problem.

Abstract Image

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
CSI-Otter:基于同源性的(部分)类组行动盲签名,别出心裁
在本文中,我们构建了第一个可证明安全的基于同源的(部分)盲签名方案。虽然在高层次上,该方案类似于施诺尔盲签名,但我们的工作并不直接沿用该构建,因为同源并不提供如此丰富的代数结构。具体来说,我们的协议并不符合 Hauck、Kiltz 和 Loss(EUROCYRPT'19)提出的线性识别协议抽象,该抽象被用于基于经典群和网格等模块通用地构建类似施诺尔的盲签名。因此,假设群作用逆问题具有亚指数硬度,我们的方案在随机甲骨文模型(ROM)中对多对数多并发会话是安全的。更详细地说,我们的盲签名利用了椭圆曲线的二次扭曲,以一种重要的方式赋予同源以严格意义上比抽象群作用更丰富的结构(但仍然比模块更严格)。在 CSIDH-512 参数集下,基本方案的公钥大小为 128 B,签名大小为 8 KB,是所有可证明安全的后量子安全盲签名中最小的。我们提供了对\({\textsf{rGAIP}} \)的初步密码分析,并证明在某些参数设置下,它基本上与标准\(\textsf{GAIP}\)一样安全。最后,我们展示了一种将我们的盲签名变成部分盲签名的新方法,我们的方法与之前的方法不同,因为它们需要对公钥集进行散列,同时隐藏相应的秘钥--在同源设置中构建这样的散列函数仍然是一个未决问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Designs, Codes and Cryptography
Designs, Codes and Cryptography 工程技术-计算机:理论方法
CiteScore
2.80
自引率
12.50%
发文量
157
审稿时长
16.5 months
期刊介绍: Designs, Codes and Cryptography is an archival peer-reviewed technical journal publishing original research papers in the designated areas. There is a great deal of activity in design theory, coding theory and cryptography, including a substantial amount of research which brings together more than one of the subjects. While many journals exist for each of the individual areas, few encourage the interaction of the disciplines. The journal was founded to meet the needs of mathematicians, engineers and computer scientists working in these areas, whose interests extend beyond the bounds of any one of the individual disciplines. The journal provides a forum for high quality research in its three areas, with papers touching more than one of the areas especially welcome. The journal also considers high quality submissions in the closely related areas of finite fields and finite geometries, which provide important tools for both the construction and the actual application of designs, codes and cryptographic systems. In particular, it includes (mostly theoretical) papers on computational aspects of finite fields. It also considers topics in sequence design, which frequently admit equivalent formulations in the journal’s main areas. Designs, Codes and Cryptography is mathematically oriented, emphasizing the algebraic and geometric aspects of the areas it covers. The journal considers high quality papers of both a theoretical and a practical nature, provided they contain a substantial amount of mathematics.
期刊最新文献
The complexity of the SupportMinors Modeling for the MinRank Problem When arcs extend uniquely: a higher-dimensional generalization of Barlotti’s result Constructing optimal linear codes for code-based masking schemes of higher-orders Editorial: WCC 2024—Workshop on coding and cryptography Polygonal triples
×
引用
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