一种高效的短签名  

Efficient Short Signature Scheme

作　　者：秦慧[1] 王尚平[1] 李敏[1] 周克复[1] 

机构地区：[1]西安理工大学理学院,陕西西安710048

出　　处：《计算机应用研究》2006年第11期80-82,共3页Application Research of Computers

基　　金：国家自然科学基金资助项目(60273089);陕西省自然科学研究计划资助项目(2003F37);陕西省教育厅自然科学研究计划资助项目(03JK165)

摘　　要：提出一种新的短签名方案,长度只有160bits,但其计算效率远远高于BLS短签名方案。基于大整数分解的困难性,该方案在选择消息攻击下是存在不可伪造的。作为短签名时,签名是一次性的,该方案的安全性证明不需要随机预言机模型。该方案很容易修改为一般的签名方案进行多次签名。A new short signature scheme is proposed against existentially forgery under a chosen message attack, A signature generated by the scheme is in the size of about 160bits, which is as short as BLS short signature scheme. However, the scheme is more efficient than BLS scheme and other short signature schemes. As a short signature, it is a one-time signature. The security of the scheme is based on the difficulty of integers factorization without the random oracle model. This one-time signature scheme can be modified to ordinary signature scheme to achieve multiple signatures.

关 键 词：短签名 一次性签名 大整数分解 随机预言机 

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