Zero-knowledge undeniable signatures (extended abstract)
EUROCRYPT '90 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Communications of the ACM
A group-oriented (t, n) undeniable signature scheme without trusted center
ACISP '96 Proceedings of the First Australasian Conference on Information Security and Privacy
Shared Generation of Authenticators and Signatures (Extended Abstract)
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Weakness in Some Threshold Cryptosystems
CRYPTO '96 Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Group-Oriented Undeniable Signature Schemes without the Assistance of a Mutually Trusted Party
ASIACRYPT '92 Proceedings of the Workshop on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
Threshold Undeniable RSA Signature Scheme
ICICS '01 Proceedings of the Third International Conference on Information and Communications Security
Research on anonymous signatures and group signatures
Computer Communications
| Hi-index | 0.24 |
At Auscrypt '92, Harn and Yang firstly proposed the concept of group-oriented undeniable signature. Two threshold undeniable signature schemes were devised in their article, where t can be either 1 or n. However, Langford in 1996 showed that the Harn-Yang (n, n) threshold undeniable signature scheme is not secure enough. In 1996, Lin et al. also proposed a new (t, n) threshold undeniable signature scheme without a trusted center. Unfortunately, the Langford attack can be applied to Lin et al.'s scheme as well. Thus, the problem of designing a general group-oriented (t, n) threshold undeniable signature scheme is remained open. The purpose of this article is to propose a (t, n) threshold undeniable signature scheme, where 1@?t@?n. Moreover, the signing policy will be extended to the generalized case, where any authorized subset can sign messages.