摘要
基于身份识别、离散对数问题和安全的单向函数,提出了一个无需原始签名人的(t,n)门限代理签名方案,使得任意t个或更多个代理签名人可以合作产生对消息的代理签名.新方案隐藏了代理签名人的身份,既保护了代理签名人的隐私,又防止了可能的联合欺骗,还可以在发生分歧时揭示签名参与者的真实身份.
Based on the identification scheme, the security of the discrete logarithmic problem and the one - way function, this paper proposes a new threshold proxy signature scheme without the cooperation of the Original Signer, and or more proxy signers form a designated group of proxy signers which can generate proxy signatures. In this scheme, the proxy signers' identity is hidden. And it can not only protect signers' privacy, but also pre- vent the joint cheating and reveal the participant signers' actual identities when needed.
出处
《平顶山学院学报》
2007年第5期84-86,共3页
Journal of Pingdingshan University
基金
国家自然科学基金资助项目(10671056)
关键词
离散对数问题
原始签名人
代理签名人
门限代理签名
discrete logarithmic problem
original signer
proxy signer
threshold proxy signature