(t+1, n) threshold and generalized DSS signatures without a trusted party

Chih Hung Wang, Tzone-Lih Hwang

Research output: Contribution to conferencePaper

2 Citations (Scopus)

Abstract

A (t, n) threshold signature scheme allows n members of a group to share a secret key such that any t members can create a valid group signature. Of course, any t members can compromise this system. However, designing a (t, n) threshold signature scheme based on Digital Signature Standard (DSS) is difficult if there is no trusted party, to distribute the shares of the secret. At Crypto'95, a (t2-t+1)-out-of-n threshold DSS signature scheme without a trusted party was proposed. It requires t2-t+1 members to sign a document, but t members can conspire to destroy this scheme. At Crypto'96, Gennaro et. al. improved the above result to propose a robust threshold DSS signature scheme which requires 2t+1 members in the signing procedure. This paper proposes a new method to reduce the number of signers to t+1. We also extend our scheme to generalized case.

Original languageEnglish
Pages221-226
Number of pages6
Publication statusPublished - 1997 Dec 1
EventProceedings of the 1997 13th Annual Computer Security Applications Conference, ACSAC - San Diego, CA, USA
Duration: 1997 Dec 81997 Dec 12

Other

OtherProceedings of the 1997 13th Annual Computer Security Applications Conference, ACSAC
CitySan Diego, CA, USA
Period97-12-0897-12-12

Fingerprint

Electronic document identification systems

All Science Journal Classification (ASJC) codes

  • Software

Cite this

Wang, C. H., & Hwang, T-L. (1997). (t+1, n) threshold and generalized DSS signatures without a trusted party. 221-226. Paper presented at Proceedings of the 1997 13th Annual Computer Security Applications Conference, ACSAC, San Diego, CA, USA, .
Wang, Chih Hung ; Hwang, Tzone-Lih. / (t+1, n) threshold and generalized DSS signatures without a trusted party. Paper presented at Proceedings of the 1997 13th Annual Computer Security Applications Conference, ACSAC, San Diego, CA, USA, .6 p.
@conference{d9472a6c538f4e7f806c22fc36ea7750,
title = "(t+1, n) threshold and generalized DSS signatures without a trusted party",
abstract = "A (t, n) threshold signature scheme allows n members of a group to share a secret key such that any t members can create a valid group signature. Of course, any t members can compromise this system. However, designing a (t, n) threshold signature scheme based on Digital Signature Standard (DSS) is difficult if there is no trusted party, to distribute the shares of the secret. At Crypto'95, a (t2-t+1)-out-of-n threshold DSS signature scheme without a trusted party was proposed. It requires t2-t+1 members to sign a document, but t members can conspire to destroy this scheme. At Crypto'96, Gennaro et. al. improved the above result to propose a robust threshold DSS signature scheme which requires 2t+1 members in the signing procedure. This paper proposes a new method to reduce the number of signers to t+1. We also extend our scheme to generalized case.",
author = "Wang, {Chih Hung} and Tzone-Lih Hwang",
year = "1997",
month = "12",
day = "1",
language = "English",
pages = "221--226",
note = "Proceedings of the 1997 13th Annual Computer Security Applications Conference, ACSAC ; Conference date: 08-12-1997 Through 12-12-1997",

}

Wang, CH & Hwang, T-L 1997, '(t+1, n) threshold and generalized DSS signatures without a trusted party' Paper presented at Proceedings of the 1997 13th Annual Computer Security Applications Conference, ACSAC, San Diego, CA, USA, 97-12-08 - 97-12-12, pp. 221-226.

(t+1, n) threshold and generalized DSS signatures without a trusted party. / Wang, Chih Hung; Hwang, Tzone-Lih.

1997. 221-226 Paper presented at Proceedings of the 1997 13th Annual Computer Security Applications Conference, ACSAC, San Diego, CA, USA, .

Research output: Contribution to conferencePaper

TY - CONF

T1 - (t+1, n) threshold and generalized DSS signatures without a trusted party

AU - Wang, Chih Hung

AU - Hwang, Tzone-Lih

PY - 1997/12/1

Y1 - 1997/12/1

N2 - A (t, n) threshold signature scheme allows n members of a group to share a secret key such that any t members can create a valid group signature. Of course, any t members can compromise this system. However, designing a (t, n) threshold signature scheme based on Digital Signature Standard (DSS) is difficult if there is no trusted party, to distribute the shares of the secret. At Crypto'95, a (t2-t+1)-out-of-n threshold DSS signature scheme without a trusted party was proposed. It requires t2-t+1 members to sign a document, but t members can conspire to destroy this scheme. At Crypto'96, Gennaro et. al. improved the above result to propose a robust threshold DSS signature scheme which requires 2t+1 members in the signing procedure. This paper proposes a new method to reduce the number of signers to t+1. We also extend our scheme to generalized case.

AB - A (t, n) threshold signature scheme allows n members of a group to share a secret key such that any t members can create a valid group signature. Of course, any t members can compromise this system. However, designing a (t, n) threshold signature scheme based on Digital Signature Standard (DSS) is difficult if there is no trusted party, to distribute the shares of the secret. At Crypto'95, a (t2-t+1)-out-of-n threshold DSS signature scheme without a trusted party was proposed. It requires t2-t+1 members to sign a document, but t members can conspire to destroy this scheme. At Crypto'96, Gennaro et. al. improved the above result to propose a robust threshold DSS signature scheme which requires 2t+1 members in the signing procedure. This paper proposes a new method to reduce the number of signers to t+1. We also extend our scheme to generalized case.

UR - http://www.scopus.com/inward/record.url?scp=0031362009&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0031362009&partnerID=8YFLogxK

M3 - Paper

AN - SCOPUS:0031362009

SP - 221

EP - 226

ER -

Wang CH, Hwang T-L. (t+1, n) threshold and generalized DSS signatures without a trusted party. 1997. Paper presented at Proceedings of the 1997 13th Annual Computer Security Applications Conference, ACSAC, San Diego, CA, USA, .