A division-of-labor-signature (t, n) threshold-authenticated encryption scheme with message linkage based on the elliptic curve cryptosystem

We present a new (t, n) threshold-authenticated encryption scheme with message linkage to reduce the load on the signer using a division-of-labor signature. Only t signers can examine and sign an over-large message on behalf of the whole group, by dividing the whole message into a few readable submessage blocks; then, each signer needs only to examine and sign the designated submessage block rather than the whole message. Consequently, the load on the signer should be substantially reduced to improve the performance. Moreover, the proposed scheme is based on the elliptic curve cryptosystem, because of its highly efficient performance and comprehensiveness of security, supporting the practical use of the scheme.

[1]  Susan K. Langford Threshold DSS Signatures without a Trusted Party , 1995, CRYPTO.

[2]  Chin-Chen Chang,et al.  Threshold signature schemes with traceable signers in group communications , 1998, Comput. Commun..

[3]  R. A. Rueppel,et al.  Message recovery for signature schemes based on the discrete logarithm problem , 1994, EUROCRYPT.

[4]  Kaoru KUROSAWAzy New Elgamal Type Threshold Digital Signature Scheme , 1996 .

[5]  Chin-Chen Chang,et al.  Authenticated encryption scheme without using a one way function , 1995 .

[6]  Neal Koblitz,et al.  Algebraic aspects of cryptography , 1998, Algorithms and computation in mathematics.

[7]  Chin-Chen Chang,et al.  Authenticated Encryption Schemes with Linkage Between Message Blocks , 1997, Inf. Process. Lett..

[8]  Alfred Menezes,et al.  The State of Elliptic Curve Cryptography , 2000, Des. Codes Cryptogr..

[9]  Victor S. Miller,et al.  Use of Elliptic Curves in Cryptography , 1985, CRYPTO.

[10]  N. Koblitz Elliptic curve cryptosystems , 1987 .

[11]  Patrick Horster,et al.  Authenticated encryption schemes with low communication costs , 1994 .

[12]  K. Kurosawa,et al.  New EIGamal Type Threshold Digital Signature Scheme , 1996 .

[13]  Rainer A. Rueppel,et al.  Message Recovery for Signature Schemes Based on the Discrete Logarithm Problem , 1996, Des. Codes Cryptogr..

[14]  L. Harn Group-oriented (t, n) threshold digital signature scheme and digital multisignature , 1994 .

[15]  Chi-Sung Laih,et al.  Cryptanalysis of Nyberg-Rueppel's message recovery scheme , 2000, IEEE Communications Letters.

[16]  Jinn-ke Jan,et al.  An Efficient Authenticated Encryption Scheme With Message Linkages and Low Communication Costs , 2002, J. Inf. Sci. Eng..

[17]  Rainer A. Rueppel,et al.  A new signature scheme based on the DSA giving message recovery , 1993, CCS '93.

[18]  Hung-Yu Chien,et al.  Authenticated encryption schemes with message linkages for message flows , 2003, Comput. Electr. Eng..

[19]  Chin-Chen Chang,et al.  (t, n) Threshold Digital Signature With Traceability Property , 1999, J. Inf. Sci. Eng..

[20]  Chin-Chen Chang,et al.  Autenticated Encryption Schemes with Message Linkage , 1996, Inf. Process. Lett..

[21]  Ian F. Blake,et al.  Elliptic curves in cryptography , 1999 .