摘要
基于配对函数和陷门同态置换的签名聚合方法提出了安全的顺序相关的多重数字签名方案,具有以下特点:利用配对函数来记录签名顺序,使得签名可依序进行;签名人数不受限制;签名较短、签名和验证过程简单;无须第三方为每次签名生成密钥以及签名者的编号等。该方案可用于电子商务、电子政务中。
Based on the pairing function and trapdoor homomorphic permutations method to aggregate the signatures,a dependent sequential multisignature scheme is presented.This Scheme possess of the following properties:the multiple signatures is ordered by using the pairing function;no limitation to the number of signers;the final signature is relatively short;the process for signature and verification is simple;and it is not necessary for a third party to generate the key and decide the order of signers.It can be applied to the E-commerce and E-government.
出处
《计算机工程与应用》
CSCD
北大核心
2005年第20期135-138,共4页
Computer Engineering and Applications
基金
国家自然科学基金(编号:60473030)
国家教育部博士点专项基金(编号:20020613020)
四川省教育厅自然科学预研基金(编号:2004c015)的资助
关键词
顺序相关多重数字签名
聚合签名
陷门同态置换
配对函数
dependent sequential multisignatures,aggregated signature,trapdoor homomorphic permutations,pairing function