一种基于离散对数的代理盲签名体制  

Proxy-blind-signature method based on discrete logarithm

作　　者：李伟[1] 郝林[1] 

机构地区：[1]云南大学信息学院,云南昆明650091

出　　处：《计算机工程与设计》2006年第21期3976-3978,共3页Computer Engineering and Design

基　　金：国家自然科学基金项目(60573104);云南省自然科学基金项目(2002F0010M)

摘　　要：在普通的代理签名中,原始待签消息对代理签名者来说是完全可见的,但在现实应用中,原始待签消息可能含有原始签名者或消息接收者的一些机密,这时让代理签名者看到待签消息的明文是不合理的。针对这一问题,将盲签名的体制引入代理签名中,并基于离散对数问题的困难性给出了有效的实现算法。考虑到原始签名者一般都是一些低速的移动设备,因此算法在委托密钥的产生和盲因子的去除过程中都充分考虑到了尽可能的减轻原始签名者的计算负担。另外,在算法中引入了时间戳和生存期相结合的方法,有效地解决了原始签名者和代理签名者相互抵赖的问题。In ordinary proxy signature, the original message to be signed is complete plain text to the proxy signer. But in reality, there maybe some private information contained in the message to be signed, at this circumstance it is not reasonable for the proxy singer to see the plain text. In order to solve this problem, the blind-signature mechanism is used in proxy signature, and an efficient realizing algorithm based on the difficulty of the discrete logarithm problem （DLP） is also given. In general, original signers are the low- speed mobile equipments, so their computational burdens are minimized as much as possible in commission-key generating and blind-factor removing. Besides, combined with the time stamp and TTL, the mutual denial problem is also effectively solved.

关 键 词：数字签名 代理签名 盲签名 离散对数 时间戳 

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