摘要： 现有的多重数字签名方案大多是基于不现实的假设来设计的，效率不高。为此，采用双线性配对及基于哈希的底数和指数绑定方法，提出一种新的多重数字签名方案，其生成和验证数字签名的计算复杂度与单一数字签名保持一致。在PPK模型下验证其安全性，结果表明，该方案与现有PKI系统完全兼容。
关键词:
多重数字签名,
可证安全,
PPK模型,
数字签名,
双线性配对
Abstract: 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.
Key words:
digital multi-signature,
provable security,
PPK model,
digital signature,
bilinear matching
中图分类号:
马昌社. PPK模型下的有序多重数字签名方案[J]. 计算机工程, 2011, 37(9): 19-21.
MA Chang-She. Ordered Digital Multi-Signature Scheme in Plain Public Key Model[J]. Computer Engineering, 2011, 37(9): 19-21.