基于DLP的可选择链接可转换环签名方案

摘要

Most of the existing linkable and convertible ring signature schemes do not have strong anonymity. To solve this problem, a ring signature scheme based on Discrete Logarithm Problem (DLP) is proposed. The actual signer establishes an association tag by randomly selecting secret parameters to enhance the anonymity of the scheme. Analysis results show that the proposed scheme has linkability, convertibility and strong anonymity, can resist convertible attacks, and has security in random oracle model.%已有多数可链接可转换环签名方案不具备强匿名性.为此, 提出一种基于离散对数问题的环签名方案.实际签名者通过随机选取秘密参数建立关联标签, 以增强方案的匿名性.分析结果表明, 该方案同时具备链接性、转换性和强匿名性, 可抵抗转换性攻击, 且在随机预言模型中具有安全性.