Signer revocability for threshold ring signatures

IF 4.1 2区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE
Da Teng, Yanqing Yao
{"title":"Signer revocability for threshold ring signatures","authors":"Da Teng,&nbsp;Yanqing Yao","doi":"10.1016/j.csi.2024.103960","DOIUrl":null,"url":null,"abstract":"<div><div><span><math><mi>t</mi></math></span>-out-of-<span><math><mi>n</mi></math></span> threshold ring signature (TRS) is a type of anonymous signature designed for <span><math><mi>t</mi></math></span> signers to jointly sign a message while hiding their identities among <span><math><mi>n</mi></math></span> parties that include themselves. However, can TRS address those needs if one of the signers wants to revoke his signature? Can non-signers be clipped without compromising anonymity? Current research has only addressed the functionally opposite property, namely, extendability. In this paper, we introduce the revocability of TRS, addressing the need for improved flexibility and privacy security. Specifically, we innovatively define two properties: revocability, allowing signers to revoke their identities non-interactively and update the signature from <span><math><mi>t</mi></math></span>-out-of-<span><math><mi>n</mi></math></span> to <span><math><mrow><mi>t</mi><mo>−</mo><mn>1</mn></mrow></math></span>-out-of-<span><math><mi>n</mi></math></span>; and clippability, enabling removal of non-signers from the ring. The synergy of these two properties enables dynamic revocation while keeping the signature size minimal. We analyze and define the boundaries of these operations, provide the DL-based constructions, and prove the security of the schemes. The asymptotic complexity of our approach reaches the same level as that of existing solutions, and especially when using larger ring sizes, experimental results demonstrate that it can effectively reduce the signature size.</div></div>","PeriodicalId":50635,"journal":{"name":"Computer Standards & Interfaces","volume":"93 ","pages":"Article 103960"},"PeriodicalIF":4.1000,"publicationDate":"2024-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Standards & Interfaces","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0920548924001296","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}
引用次数: 0

Abstract

t-out-of-n threshold ring signature (TRS) is a type of anonymous signature designed for t signers to jointly sign a message while hiding their identities among n parties that include themselves. However, can TRS address those needs if one of the signers wants to revoke his signature? Can non-signers be clipped without compromising anonymity? Current research has only addressed the functionally opposite property, namely, extendability. In this paper, we introduce the revocability of TRS, addressing the need for improved flexibility and privacy security. Specifically, we innovatively define two properties: revocability, allowing signers to revoke their identities non-interactively and update the signature from t-out-of-n to t1-out-of-n; and clippability, enabling removal of non-signers from the ring. The synergy of these two properties enables dynamic revocation while keeping the signature size minimal. We analyze and define the boundaries of these operations, provide the DL-based constructions, and prove the security of the schemes. The asymptotic complexity of our approach reaches the same level as that of existing solutions, and especially when using larger ring sizes, experimental results demonstrate that it can effectively reduce the signature size.
求助全文
约1分钟内获得全文 求助全文
来源期刊
Computer Standards & Interfaces
Computer Standards & Interfaces 工程技术-计算机:软件工程
CiteScore
11.90
自引率
16.00%
发文量
67
审稿时长
6 months
期刊介绍: The quality of software, well-defined interfaces (hardware and software), the process of digitalisation, and accepted standards in these fields are essential for building and exploiting complex computing, communication, multimedia and measuring systems. Standards can simplify the design and construction of individual hardware and software components and help to ensure satisfactory interworking. Computer Standards & Interfaces is an international journal dealing specifically with these topics. The journal • Provides information about activities and progress on the definition of computer standards, software quality, interfaces and methods, at national, European and international levels • Publishes critical comments on standards and standards activities • Disseminates user''s experiences and case studies in the application and exploitation of established or emerging standards, interfaces and methods • Offers a forum for discussion on actual projects, standards, interfaces and methods by recognised experts • Stimulates relevant research by providing a specialised refereed medium.
×
引用
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学术官方微信