DDHP-based multi-signature scheme with tight security reduction
基于DDHP的紧安全性归约多重数字签名方案

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(C...