Cao Chengtang, You Lin, Hu Gengran
School of Cyberspace Security, Hangzhou Dianzi University, Hangzhou 310018, China.
Department of Basic Science, Guizhou Industry Polytechnic College, Guiyang 550008, China.
Entropy (Basel). 2023 Jan 28;25(2):237. doi: 10.3390/e25020237.
In this paper, a novel linkable ring signature scheme is constructed. The hash value of the public key in the ring and the signer's private key are based on random numbers. This setting makes it unnecessary to set the linkable label separately for our constructed scheme. When judging the linkability, it is necessary to determine whether the number of the intersections of the two sets reaches the threshold related to the number of the ring members. In addition, under the random oracle model, the unforgeability is reduced to the SVPγ problem. The anonymity is proved based on the definition of statistical distance and its properties.
本文构造了一种新颖的可链接环签名方案。环中公钥的哈希值和签名者的私钥基于随机数。这种设置使得我们构造的方案无需单独设置可链接标签。在判断可链接性时，需要确定两个集合的交集数量是否达到与环成员数量相关的阈值。此外，在随机预言模型下，不可伪造性被归约为SVPγ问题。基于统计距离的定义及其性质证明了匿名性。
