{"title":"A linkable ring signature scheme with unconditional anonymity in the standard model","authors":"Keisuke Hara","doi":"10.1016/j.tcs.2025.115093","DOIUrl":null,"url":null,"abstract":"<div><div>Ring signatures allow a user to sign messages as a member of a set of users, which is called a <em>ring</em>. This primitive ensures that anybody can check that one of the members in a ring generate a signature, but cannot detect which member does. Linkable ring signature is a novel extension of ring signature in the sense that anyone can verify whether two signatures were generated by the same user or not. One of the desirable features on (linkable) ring signature is <em>unconditional anonymity</em> which provides signers everlasting anonymity. In 2014, Liu, Au, Susilo, and Zhou proposed the first linkable ring signature scheme with unconditional anonymity. Their scheme is only secure in the random oracle model and leaves to construct a scheme in the standard model as an open problem. In this paper, we solve their open problem and propose the first linkable ring signature scheme with unconditional anonymity in the standard model. Our scheme is constructed based on a non-interactive proof of knowledge, a (standard) signature scheme, a commitment scheme, and a vector commitment scheme with specializable universal common reference string.</div></div>","PeriodicalId":49438,"journal":{"name":"Theoretical Computer Science","volume":"1033 ","pages":"Article 115093"},"PeriodicalIF":0.9000,"publicationDate":"2025-01-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/S0304397525000313","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0
Abstract
Ring signatures allow a user to sign messages as a member of a set of users, which is called a ring. This primitive ensures that anybody can check that one of the members in a ring generate a signature, but cannot detect which member does. Linkable ring signature is a novel extension of ring signature in the sense that anyone can verify whether two signatures were generated by the same user or not. One of the desirable features on (linkable) ring signature is unconditional anonymity which provides signers everlasting anonymity. In 2014, Liu, Au, Susilo, and Zhou proposed the first linkable ring signature scheme with unconditional anonymity. Their scheme is only secure in the random oracle model and leaves to construct a scheme in the standard model as an open problem. In this paper, we solve their open problem and propose the first linkable ring signature scheme with unconditional anonymity in the standard model. Our scheme is constructed based on a non-interactive proof of knowledge, a (standard) signature scheme, a commitment scheme, and a vector commitment scheme with specializable universal common reference string.
期刊介绍:
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.