Abstract:

In this paper we present a new group-based multisignature scheme (i.e., a protocol which allows a group of signers to produce joint signature on a common message), based on symmetric pairings of Type 1. The idea of the scheme is such that there are arbitrary number of signing parties with independent keys that sign the same message. Furthermore, the scheme has one of the most desired property as for multisignatures, that the length of a final signature is always constant and does not depend on number of signers. The security analysis is conducted in euf-cma model, where the security of the scheme is reduced to the hardness of solving the computational Diffie-Hellman problem.