Completeness theorems for non-cryptographic fault-tolerant distributed computation
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Multiparty unconditionally secure protocols
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Non-cryptographic fault-tolerant computing in constant number of rounds of interaction
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Meta-ElGamal signature schemes
CCS '94 Proceedings of the 2nd ACM Conference on Computer and communications security
Communications of the ACM
Robust threshold DSS signatures
Information and Computation
Handbook of Applied Cryptography
Handbook of Applied Cryptography
Threshold DSS Signatures without a Trusted Party
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
A Study on the Proposed Korean Digital Signature Algorithm
ASIACRYPT '98 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
Design Validations for Discrete Logarithm Based Signature Schemes
PKC '00 Proceedings of the Third International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
A public key cryptosystem and a signature scheme based on discrete logarithms
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
In this paper we present a generic construction of threshold ElGamal signature schemes. We classify ElGamal variants by two types according to ways of generating signatures. Then we develop the generic mechanism to convert a group of ElGamal variants into their threshold versions and prove unforgeability of constructed schemes. To demonstrate its application, we present threshold versions of two standard ElGamal variants, GOST 34.10 and KCDSA from our construction.