New ElGamal type threshold digital signature scheme

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Volumn E79-A, Issue 1, 1996, Pages 86-93

  Park, Choonsik ^a   Kurosawa, Kaoru ^b  

^a Electronics and Telecommunications Research Institute (ETRI)   (South Korea)

^b TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

Chosen message attack; Digital signature standard; ElGamal; Threshold digital signature

Indexed keywords

DATA PROCESSING; DECODING; DIGITAL SIGNAL PROCESSING; NETWORK PROTOCOLS; SECURITY OF DATA; STANDARDS;

CHOSEN MESSAGE ATTACK; CIPHERTEXT; DIGITAL SIGNATURE STANDARD; ELGAMAL TYPE; THRESHOLD DIGITAL SIGNATURE;

CRYPTOGRAPHY;

EID: 0029769836     PISSN: 09168508     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (23)

1. Y. Desmedt, "Society and group oriented cryptography: A new concept," Proc. Crypto'87, Lecture Notes in Computer Science, LNCS 293, pp. 120-127, Springer-Verlag, 1988.
2. O. Goldreich, S. Micali, and A. Wigderson, "How to play any mental game," Proc. 19th ACM Symposium on Theory of Computing, pp.218-229, 1987.
3. Y. Frankel, "A practical protocol for large group oriented networks," Proc. Eurocrypt'89, Lecture Notes in Computer Science, LNCS 434, pp.56-61, Springer-Verlag, 1990.
4. Y. Desmedt and Y Frankel, "Threshold cryptosystem," Proc. Crypto'89, Lecture Notes in Computer Science, LNCS 435, pp.307-315, Springer-Verlag, 1990.
5. T. Hwang, "Cryptosystem for group oriented cryptography," Proc. Eurocrypt'90, Lecture Notes in Computer Science, LNCS 473, pp.352-360, Springer-Verlag, 1991.
6. T.P. Pedersen, "A threshold cryptosystem without a trusted party," Proc. Eurocrypt'91, Lecture Notes in Computer Science, LNCS 547, pp.522-526, Springer-Verlag, 1991.
7. P. Feldman, "A practical scheme for non-interactive verifiable secret sharing," Proc. 28th IEEE symposium on Foundations of Computer Science, pp.427-437, 1987.
8. Y. Desmedt and Y. Frankel, "Shared generation of authenticators and signatures," Proc. Crypto'91, Lecture Notes in Computer Science, LNCS 576, pp.457-469, Springer-Verlag, 1991.
9. M. Cerecedo, T. Matsumoto, and H. Imai, "Efficient and secure multiparty generation of digital signatures based on discrete logarithms," IEICE Trans. Fundamentals, vol.E76-A, no.4, pp.532-545, 1993.
10. C.P. Schnorr, "Efficient identification and signatures for smart cards," Proc. Crypto'89, Lecture Notes in Computer Science, LNCS 435, pp.235-251, Springer-Verlag, 1990.
11. M. Ben-or, S. Goldwasser, and A. Wigderson, "Completeness theorems for non-cryptographic fault-tolerant distributed computation," Proc. 20th ACM Symposium on Theory of Computing, pp.1-10, 1988.
12. T. ElGamal, "A public-key cryptosystem and a signature scheme based on discrete logarithms," IEEE Trans. IT, vol.31, no.4, pp.469-472, 1985.
13. G. Agnew, R. Mullin, and S. Vanstone, "Improved digital signature scheme based on discrete logarithms," Electron. Lett., vol.26, no.14, pp.1024-1025, 1990.
14. "Working draft aerican national standard X9.30-199X, public key cryptography using irreversible algorithms for the financial services industry:part 1: The digital signature algorithm (DSA), american bankers association, Washington, D.C., Feb. 1992. A description of the algorithm and comments on the proposed can be found in the article "Debating Encryption Standards"," Commun. ACM, vol.35, no.7, pp.32-54, 1992.
15. J. Bar-Ilan and D. Beaver, "Non-cryptographic fault-tolerant computing in a constant number of rounds of interaction," Proc. ACM symposium on Principles of Distributed Computation, pp.201-209, 1989.
16. D. Beaver, "Secure multiparty protocol and zero knowledge proof systems tolerating a faulty minority," Journal of Cryptology, vol.4, no.4, pp.75-122, 1991.
17. M. Cerecedo, T. Matsumoto, and H. Imai, "Practical protocols for fault tolerant distributed generation of signatures," Symposium on cryptography and information security, Tateshina, Japan, April 2-4, pp.532-545, 1992.
18. T. Katoh, S. Hirose, M. Minoh, and K. Ikeda, "A protocol for group oriented signature scheme applying Elgamal's public key cryptosystem," Proc. IEICE fall conference, pp. 1-187, Sept. 1992.
19. A. Shimbo, "Multisgnature schemes based on the ElGamal scheme (in Japanese)," SCIS'94 workshop, Jan. 27-29, SCIS-2C, 1994.
20. K. Nyberg and R.A. Rueppel, "Message recovery for signature schemes based on the discrete logarithm problem," Proc. Eurocrypt'94, pp. 175-190, 1994.
21. L. Harn and Y. Xu, "Design of generalized ElGamal type digital signature schemes based on discrete logarithms," Electron. Lett., vol.30, no.24, pp.2025-2026, 1994.
22. A. Shamir, "How to share a secret," Commun. ACM, vol.22, no.11, pp.612-613, 1979.
23. T.P. Pedersen, "Distributed provers with applications to undeniable signatures," Proc. Eurocrypt'91, Lecture Notes in Computer Science, LNCS 547, pp.221-238, Springer-Verlag. 1991.