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

Selectively Linkable and Convertible Ring Signature Scheme Based on DLP

作　　者：曹素珍 孙晗 戴文洁 王秀娅 CAO Suzhen;SUN Han;DAI Wenjie;WANG Xiuya(College of Computer Science and Engineering,Northwest Normal University,Lanzhou 730070,China)

机构地区：[1]西北师范大学计算机科学与工程学院,兰州730070

出　　处：《计算机工程》2019年第2期144-147,153,共5页Computer Engineering

基　　金：国家自然科学基金(61662071;61562077;61662069);西北师范大学青年教师科研能力提升计划(NWNU-LKQN-14-7)

摘　　要：已有多数可链接可转换环签名方案不具备强匿名性。为此,提出一种基于离散对数问题的环签名方案。实际签名者通过随机选取秘密参数建立关联标签,以增强方案的匿名性。分析结果表明,该方案同时具备链接性、转换性和强匿名性,可抵抗转换性攻击,且在随机预言模型中具有安全性。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.

关 键 词：环签名方案 离散对数问题 可选择链接性 可转换性 无条件匿名性 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]