期刊文献+
共找到4篇文章
< 1 >
每页显示 20 50 100
Linkable group signatures against malicious regulators for regulated privacy-preserving cryptocurrencies
1
作者 Xiao Wang Yanqi Zhao +3 位作者 Lingyue Zhang Min Xie Yong Yu Huilin Li 《High-Confidence Computing》 2025年第4期79-91,共13页
With the emergence of illegal behaviors such as money laundering and extortion,the regulation of privacy-preserving cryptocurrency has become increasingly important.However,existing regulated privacy-preserving crypto... With the emergence of illegal behaviors such as money laundering and extortion,the regulation of privacy-preserving cryptocurrency has become increasingly important.However,existing regulated privacy-preserving cryptocurrencies usually rely on a single regulator,which seriously threatens users’privacy once the regulator is corrupt.To address this issue,we propose a linkable group signature against malicious regulators(ALGS)for regulated privacy-preserving cryptocurrencies.Specifically,a set of regulators work together to regulate users’behavior during cryptocurrencies transactions.Even if a certain number of regulators are corrupted,our scheme still ensures the identity security of a legal user.Meanwhile,our scheme can prevent double-spending during cryptocurrency transactions.We first propose the model of ALGS and define its security properties.Then,we present a concrete construction of ALGS,which provides CCA-2 anonymity,traceability,non-frameability,and linkability.We finally evaluate our ALGS scheme and report its advantages by comparing other schemes.The implementation result shows that the runtime of our signature algorithm is reduced by 17%compared to Emura et al.(2017)and 49%compared to KSS19(Krenn et al.2019),while the verification time is reduced by 31%compared to Emura et al.and 47%compared to KSS19. 展开更多
关键词 Privacy protection Blockchain linkable group signatures Against malicious regulator
在线阅读 下载PDF
Linkable and traceable anonymous authentication with fine-grained access control
2
作者 Peng LI Junzuo LAI +4 位作者 Dehua ZHOU Lianguan HUANG Meng SUN Wei WU Ye YANG 《Frontiers of Computer Science》 2025年第2期115-125,共11页
To prevent misuse of privacy,numerous anonymous authentication schemes with linkability and/or traceability have been proposed to ensure different types of accountabilities.Previous schemes cannot simultaneously achie... To prevent misuse of privacy,numerous anonymous authentication schemes with linkability and/or traceability have been proposed to ensure different types of accountabilities.Previous schemes cannot simultaneously achieve public linking and tracing while holding access control,therefore,a new tool named linkable and traceable anonymous authentication with fine-grained access control(LTAA-FGAC)is offered,which is designed to satisfy:(i)access control,i.e.,only authorized users who meet a designated authentication policy are approved to authenticate messages;(ii)public linkability,i.e.,anyone can tell whether two authentications with respect to a common identifier are created by an identical user;(iii)public traceability,i.e.,everyone has the ability to deduce a double-authentication user’s identity from two linked authentications without the help of other parties.We formally define the basic security requirements for the new tool,and also give a generic construction so as to satisfy these requirements.Then,we present a formal security proof and an implementation of our proposed LTAA-FGAC scheme. 展开更多
关键词 anonymous authentication access control public linkability public traceability
原文传递
An Anonymous Authentication Scheme with Selective Linkability and Threshold Traceability
3
作者 PU Guangning YIN Fengmei 《Wuhan University Journal of Natural Sciences》 CAS CSCD 2023年第4期317-323,共7页
In order to protect the user's privacy identity,authentication requires anonymous authentication.Anonymous authentication is divided into unconditional anonymous authentication and traceable anonymous authenticati... In order to protect the user's privacy identity,authentication requires anonymous authentication.Anonymous authentication is divided into unconditional anonymous authentication and traceable anonymous authentication.Unconditional anonymous authentication can verify that the user belongs to an anonymous set,but the user's true identity cannot be obtained.However,in some applications,it is necessary to trace the true identity of the user.Therefore,a traceable anonymous authentication scheme is proposed.In order to prevent random tracing,the proposed scheme uses threshold joint tracing.When the identity of the authenticator needs to be traced,the threshold number of members can jointly trace the identity of the authenticator.In some special network applications such as anonymous electronic voting,in order to prevent repeated authentications and repeated elections,it is necessary to verify whether the two authentication signatures are signed by the same user without revealing the true identity of the user.Therefore,the proposed anonymous authentication scheme should have selective linkability.In order to achieve linkable authentication,the linkable tag is embedded by linkable ring signature.Compared with similar schemes through the simulation experiments,the implementation time of the proposed scheme is slightly better than other schemes. 展开更多
关键词 anonymous authentication TRACEABILITY THRESHOLD ring signature linkability
原文传递
Democratic Group Signatures with Linkability from Gap Diffie-Hellman Group
4
作者 刘彦宾 李祥学 +1 位作者 钱海峰 张文政 《Journal of Shanghai Jiaotong university(Science)》 EI 2008年第6期688-691,共4页
Democratic group signatures (DGSs) attract many researchers due to their appealing properties, i.e., anonymity, traceability and no group manager. Security results of existing work are based on decisional Diffie-Hel... Democratic group signatures (DGSs) attract many researchers due to their appealing properties, i.e., anonymity, traceability and no group manager. Security results of existing work are based on decisional Diffie-Hellman (DDH) assumption. In this paper, we present a democratic group signature scheme based on any gap Diffie-Hellman (GDH) group where DDH problem is easily but computational Diffe-Hellman (CDH) problem is hard to be solved. Besides the properties of ordinary DGSs, our scheme also provides the property of linkability, i.e., any public verifier can tell whether two group signatures are generated using the same private key. Security properties of our scheme employ a new and independently interesting decisional product Diffie-Hellman (DPDH) assumption which is weaker than DDH one. 展开更多
关键词 democratic group signature GDH group ANONYMITY TRACEABILITY linkability
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部