tailieunhanh - New Digital Multisignature Scheme with Distinguished Signing Responsibilities - Luu Hong Dung

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 scheme with distinguished signing responsibilities. Then, we propose a new multisignature scheme with distinguished signing responsibilities. | IJCSNS International Journal of Computer Science and Network Security January 2010 51 New Digital Multisignature Scheme with Distinguished Signing Responsibilities Luu Hong Dung and Nguyen Hieu Minh Faculty of Information Technology Le Qui Don Technical University 100 Hoang Quoc Viet Ha Noi Viet Nam Summary 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 scheme with distinguished signing responsibilities. Then we propose a new multisignature scheme with distinguished signing responsibilities. In this scheme each group member has distinguished signing responsibility and partial contents of the message can be verified without revealing the whole message. Our proposed scheme is more efficient than the scheme reviewed and capable of application in practice. Keywords Multisignature scheme Elliptic curve Distinguished signing responsibilities. I. Introduction Digital signatures can be classified into two main categories single signature and multiple signature or multisignature . Single signature refers to the cases where only one party signs a document while multiple signature refers to the cases where more than one party sign a single document. The digital signature schemes in use today can be classified according to the hard underlying mathematical problem which provides the basis for their security 1 1. Integer Factorization schemes which base their security on the intractability of the integer factorization problem. Examples of these include the RSA and Rabin signature schemes. 2. Discrete Logarithm schemes which base their security on the intractability of the ordinary discrete logarithm problem in a finite field. Examples of these include the ElGamal Schnorr DSA and Nyberg-Rueppel signature schemes. 3. .