that their second threshold-multisignature scheme is vulnerable to universal forgery by an insider attacker under reasonable assumptions. In our attack, (n t + 1) colluding members can control the group secret key. Therefore, they can generate valid threshold-multisignautre for any message without the help

A multisignature scheme is a digital signature scheme that allows multiple signers to generate a single signature in a collaborative and simultaneous manner. In this paper we first review of the digital multisignature schemes using elliptic curvers and elliptic curve version of the multisignature

Abstract. A multisignature scheme for specified group of verifiers needs a group of signers ’ cooperation to sign a message to a specified group of verifiers that must cooperate to check the signature’s validity later. Recently, Zhang et al. proposed a new multisignature scheme for specified group

In this paper we present the first multisignature scheme giving message recovery based on the discrete logarithm problem. An efficient multisignature scheme with appendix has been proposed by Harn recently. We cryptanalyze this scheme, present two attacks and show how to countermeasure them

and Mazieres [NM04], such cost is minimized if the intermediate nodes along the multicast distribution tree aggregate the individual signatures generated by the multicast receivers into a single multisignature. While the solution of [NM04], based on a multisignature scheme of Boldyreva [Bol03], relied on so

signature to verify the message becomes less. In order to reduce the bandwidth needed to transmit attribute based signatures and keep signer's privacy, attribute based multisignature scheme (ABMS) was proposed in this paper. Moreover, we formalize and construct the ABMS. Our scheme is existentially

Abstract—In this paper, we motivate the need for efficient multisignature schemes in delegated mobile services. With the schemes, delegates can be identified and delegated accesses can be controlled. First, we give a new digital signature scheme with message recovery. Based on the digital signature

In this paper, we propose a new multisignature scheme based on discrete logarithms. We show that this new scheme can resist existential forgeries against adaptive chosen-message attacks in the random oracle model. The main contribution is that our security model gets rid of the special security

In 1999, Harn proposed a multisignature scheme with distinguished signing authorities. In Harn’s scheme, a malice member easily confuses the signing authorities since individual signatures and multisignatures both generated on the whole document cannot be used as evidence to distinguish the signing

scheme which overcomes the security weakness of Laih and Yen’s scheme.