A practical solution to the (t, n) threshold untraceable signature with (k, l) verification scheme

Authors:
Jen-Ho Yang;Chin-Chen Chang;Chih-Hung Wang
Affiliations:
Department of Computer Science and Information Engineering, National Chung Cheng University, Chiayi, Taiwan;Department of Computer Science and Information Engineering, National Chung Cheng University, Chiayi, Taiwan;Department of Computer Science and Information Engineering, National Chiayi University, Chiayi, Taiwan
Venue:
UIC'06 Proceedings of the Third international conference on Ubiquitous Intelligence and Computing
Year:
2006

Citing 5
Cited 1

How to prove yourself: practical solutions to identification and signature problems

Proceedings on Advances in cryptology---CRYPTO '86
A modification of the Fiat-Shamir scheme

CRYPTO '88 Proceedings on Advances in cryptology
How to share a secret

Communications of the ACM
A method for obtaining digital signatures and public-key cryptosystems

Communications of the ACM
Shared Generation of Authenticators and Signatures (Extended Abstract)

CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology

Research on anonymous signatures and group signatures

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

The (t, n) threshold signature scheme can delegate the signing capability to all n participants in a group, and at least t participants can cooperatively sign a message on behalf of the group, where t ≤v. For the group communication in the real society, the verification site also needs to be restricted in its associated access privileges. Therefore, this paper proposes a practical solution to the (t, n) threshold untraceable signature with (k, l) verification scheme, which requires that k out of l verifiers or more can verify the threshold signature on behalf of the verification group. Compared with the previous works, such as Wang et al.’s scheme and Chang et al.’s scheme, our proposed scheme is more practical and expansible. Our scheme allows each group to be both a signing party and a verification party, and the shadows of all group members are no need to be redistributed after the initialization has been finished. In addition, the share distribution center (SDC) is not required in our scheme.