计算机工程与应用 ›› 2009, Vol. 45 ›› Issue (19): 101-103.DOI: 10.3778/j.issn.1002-8331.2009.19.030

• 网络、通信、安全 • 上一篇    下一篇

可验证可关联的环签名方案

赵树平1,王化群1,2   

  1. 1.大连水产学院 信息工程学院,辽宁 大连 116023
    2.福建师范大学 网络安全与密码技术重点实验室,福州 350007
  • 收稿日期:2008-12-22 修回日期:2009-03-06 出版日期:2009-07-01 发布日期:2009-07-01
  • 通讯作者: 赵树平

Verifiable and linkable ring signature scheme

ZHAO Shu-ping1,WANG Hua-qun1,2   

  1. 1.School of Information Engineering,Dalian Fisheries University,Dalian,Liaoning 116023,China
    2.Key Laboratory of Network Security and Cryptology,Fujian Normal University,Fuzhou 350007,China
  • Received:2008-12-22 Revised:2009-03-06 Online:2009-07-01 Published:2009-07-01
  • Contact: ZHAO Shu-ping

摘要: 根据电子投票和电子抽奖的需要,提出了可验证可关联的环签名概念。利用密码哈希函数的良好性质和DLP的困难性问题,构造了一个可验证可关联的环签名方案。通过安全分析,该方案满足存在不可伪造性、签名者匿名性、可关联性、可验证性等特点。

关键词: 环签名, 离散对数, 可证安全

Abstract: Based on the need of E-voting and E-lottery,the notion of verifiable and linkable ring signature is put forward.Making use of the good properties of cryptography Hash functions and the difficulties of DLP,a verifiable and linkable ring signature scheme is constructed.Through the security analysis,the scheme satisfies the following properties:Existential unforgeable,signer ambiguous,linkable and verifiable.

Key words: ring signature, discrete logarithm, provable security