一种可证安全的短盲签名方案  

A Provably Secure Short Blind Signature Scheme

作　　者：左黎明 夏萍萍[1,2] 陈祚松 ZUO Liming;XIA Pingping;CHEN Zuosong(School of Science,East China Jiaotong University,Nanchang 330013,China;Research Institute of System Engineering and Cryptography,East China Jiaotong University,Nanchang 330013,China)

机构地区：[1]华东交通大学理学院,南昌330013 [2]华东交通大学系统工程与密码学研究所,南昌330013

出　　处：《计算机工程》2019年第12期114-118,共5页Computer Engineering

基　　金：国家自然科学基金(11761033);江西省教育厅科技项目(GJJ161417,GJJ170386)

摘　　要：无线网络环境下电子现金、电子投票和电子票据保护等应用场景存在传输带宽受限、超低功耗设备计算性能弱以及传输能力差等问题。为此,通过简化盲化过程和签名过程,提出一种高效的短盲签名方案,并在计算性Diffie-Hellman困难问题假设和随机预言机模型下证明其安全性。分析结果表明,与典型同类方案相比,该方案计算量较小,签名较短,适用于计算能力和传输能力均受限的应用场合。In the wireless network environment,applications of blind signature such as digital cash,digital voting and digital invoice protection are challenged by limited transmission bandwidth,weak transmission capabilities and poor computing performance of ultra-low-power devices.To address the problem,an efficient short blind signature scheme is proposed.The scheme simplifies the blinding procedure and signing process,and its security is proven under the Computational Diffie-Hellman(CDH)assumption and the random oracle model.Analysis results show that compared with other similar typical schemes,the proposed scheme reduces the amount of computations and the length of signature,making it applicable to scenarios with limited computational capabilities and transmission capabilities.

关 键 词：数字签名 盲签名 双线性对 短签名 计算性Diffie-Hellman问题 

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