• 中国计算机学会会刊
  • 中国科技核心期刊
  • 中文核心期刊

计算机工程与科学

• 计算机网络与信息安全 • 上一篇    下一篇

去中心基于属性不可否认签名

魏亮1,2,黄振杰1,陈群山2   

  1. (1.福建省粒计算及其应用重点实验室(闽南师范大学),福建 漳州 363000;
    2.闽南师范大学计算机学院,福建 漳州 363000)
     
  • 收稿日期:2019-10-21 修回日期:2020-01-04 出版日期:2020-06-25 发布日期:2020-06-25
  • 基金资助:

    福建省自然科学基金(2019J01750);福建省中青年教师教育科研项目(JAT170345,JAT170346)

Decentralized attribute-based undeniable signature

WEI Liang1,2,HUANG Zhen-jie1,CHEN Qun-shan2   

  1. (1.Fujian Key Laboratory of Granular Computing and Application(Minnan Normal University),Zhangzhou 363000;
    2.School of Computer Science,Minnan Normal University,Zhangzhou 363000,China)
  • Received:2019-10-21 Revised:2020-01-04 Online:2020-06-25 Published:2020-06-25

摘要:

将基于属性、不可否认和去中心3个概念相结合,提出去中心基于属性不可否认签名的定义和安全模型,并基于离散对数困难问题构造一个无双线性对的方案。该方案主要基于Cramer等的证据隐藏零知识证明协议,以Schnorr协议作为其基础Σ协议,以Shamir门限方案作为其秘密分享方案;再使用Fiat-Shamir转换得到一个(t,n)门限签名(BTS)方案;然后再对BTS方案进行不可否认、防共谋和去中心化处理;最后得到一个去中心基于属性不可否认签名方案,并在随机预言机模型下证明了其安全性。
 

关键词: 数字签名, 基于属性签名, 不可否认签名, 去中心, 随机预言机模型

Abstract:

Combining the concepts of attribute-based, undeniability and decentralization, a new concept of decentralized attribute-based undeniable signature with formal security model is proposed, and a concrete non-bilinear pair scheme based on discrete logarithm difficulty problem is constructed. The scheme uses the witness-hiding zero-knowledge proof protocol proposed by Cramer et al. And the Schnorr protocol as the basic Σ  protocol, and uses the Shamir threshold scheme as its secret sharing scheme. Then, Fiat-Shamir transformation is used to obtain a (t,n) threshold signature (BTS) scheme. Then, undeniability, anti-collusion, and decentralization are performed on the BTS scheme. Finally, a decentralized attributes-based undeniable signature scheme is obtained, and its security is proved under the random oracle model.
 

Key words: digital signature, attribute-based signature, undeniable signature, decentralization, random oracle model