关联的无证书环签名方案  

Linkable Certificateless Ring Signature Scheme

作　　者：刘纯璐 游林[2] LIU Chun-lu;YOU Lin(School of Communication Engineering,Hangzhou Dianzi University,Hangzhou Zhejiang 310018,China;School of CyberspaceSecurity,Hangzhou Dianzi University,Hangzhou Zhejiang 310018,China)

机构地区：[1]杭州电子科技大学通信工程学院,浙江杭州310018 [2]杭州电子科技大学网络空间安全学院,浙江杭州310018

出　　处：《通信技术》2019年第8期1967-1970,共4页Communications Technology

基　　金：浙江省自然科学基金重点项目(No.LZ17F020002);国家自然科学基金资助项目(No.61772166,No.61272045)~~

摘　　要：将关联性与无证书环签名相结合,首次提出关联的无证书环签名方案。该方案克服了证书管理问题和密钥托管问题,并且能够在保障诚实用户隐私性的同时,避免签名权滥用的情况发生。基于椭圆曲线离散对数困难性问题的假设,证明了在随机预言机模型中该方案针对两种典型的敌手具有不可伪造性。此外,该方案没有使用双线性对运算,从而解决了同类型签名方案中双线对运算存在的计算效率低的问题,在电子选举、数字货币等网络环境中有较好的实际应用效果。By combining the linkability with the certificateless ring signature,the linkable certificateless ring signature scheme is proposed for the first time.The scheme can overcome the problems of certificate management and key escrow,and protect the privacy of honest users while avoiding the abuse of signature rights.Based on the assumption of elliptic curve discrete logarithm difficulty problem,it is proved that the scheme is unforgeable for two typical adversaries in the random oracle model.In addition,the scheme does not use bilinear pairing operation,which solves the problem of low computational efficiency of the bilinear pairing operation in the same type of signature scheme,and has better practical application effects in network environments such as electronic election and digital currency.

关 键 词：环签名 无证书签名 关联性 椭圆曲线离散对数 

分 类 号：TP309[自动化与计算机技术—计算机系统结构]