摘要
给出了一种基于 Shamir( k,n)门陷方案 [1 ]的多签名方案 [2 ] ,该方案不仅实现了对信息的签名 ,而且在基于两个数学定理的基础上 ,能够保证认证中心在出现某成员否认自己的签名行为时进行鉴定 ,使签名行为不可否认 .
This paper presents a digital multisignature scheme based on Shamir(k,n) threshold function. On the ground of two mathematics theorem the system realizes signature for information, meanwhile it ensures that KAC is able to identify the member when someone denies his signature, therefore the signature can not be deied.
出处
《长沙铁道学院学报》
CSCD
2000年第1期41-43,94,共4页
Journal of Changsha Railway University
基金
铁道部科技专项项目资助!( J992 1 97)
关键词
多签名
(k
n)门陷函数
单向哈希函数
鉴定
multisignature
(k,n)threshold function
one way Has function
identify
