PPK模型下的有序多重数字签名方案  

Ordered Digital Multi-Signature Scheme in Plain Public Key Model

作　　者：马昌社[1] 

机构地区：[1]华南师范大学计算机学院,广州510631

出　　处：《计算机工程》2011年第9期19-21,共3页Computer Engineering

基　　金：国家自然科学基金资助项目(60703094)

摘　　要：现有的多重数字签名方案大多是基于不现实的假设来设计的,效率不高。为此,采用双线性配对及基于哈希的底数和指数绑定方法,提出一种新的多重数字签名方案,其生成和验证数字签名的计算复杂度与单一数字签名保持一致。在PPK模型下验证其安全性,结果表明,该方案与现有PKI系统完全兼容。The state of existed multi-signature schemes suffers from either impractical assumptions or inefficiency.This paper presents an efficient and ordered multi-signature scheme from bilinear maps via the hashed binding technique of the exponent and the base.The computational complexity of the generation and verification of our multi-signatures is the same as those of single signature.It is proven secure in Plain Public Key（PPK） model,which indicates this scheme is completely compatible with PKI system.

关 键 词：多重数字签名 可证安全 PPK模型 数字签名 双线性配对 

分 类 号：TP311.52[自动化与计算机技术—计算机软件与理论]