关键词: 多重数字签名;紧安全性归约;决策Diffie-Hellman问题;随机预言模型

Abstract:

An efficient multisignature scheme was proposed, whose security is tightly related to the hardness of the Dicisional DiffieHellman problem (DDHP) in the random oracle model. Under the Proof-Of-Possession (POP) key registration assumption, the scheme was proved unforgeable against the adaptive chosen message and signing groups attacks. Both the size of multi-signature and the computation cost of verification do not increase with the increase of the signers. Compared with the Computational Diffie-Hellman Problem (CDHP)-based scheme with tight security reduction proposed by Z C WANG, the scheme has the merits of fewer communication rounds and less computation cost. Thus it can be used in many electronic transactions.

Key words: multi-signature;tight security reduction;Decisional Diffie-Hellman Problem (DDHP);random oracle model