An efficient dynamic threshold scheme

IEICE Transactions on Information and Systems

Volumn E79-D, Issue 7, 1996, Pages 936-942

  Hwangi, Shin Jia ^a,b   Changii, Chin Chen ^a,b   Yang, Wei Pang ^a,b  

^a NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

^b NATIONAL CHUNG CHENG UNIVERSITY   (Taiwan)

Author keywords

Discrete logarithm; Dynamic threshold scheme; Secret sharing; Threshold scheme

Indexed keywords

MATHEMATICAL TECHNIQUES; OPERATIONS RESEARCH; SYSTEMS ANALYSIS; THRESHOLD ELEMENTS;

DISCRETE LOGARITHM; SECRET SHARING;

THRESHOLD LOGIC;

EID: 0030195519     PISSN: 09168532     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (17)

1. A. Asmuth and J. Bloom, "A modular approach to key safeguarding," IEEE Trans. Information Theory, vol. IT-29, pp. 208-210, 1983.
2. G. R. Blakley, "Safeguarding cryptographic keys," Proc. the National Computer Conference, 1979, American Federation of Information Processing Societies, vol. 48, pp. 242-268, 1979.
3. G. R. Blakley and C. Meadows, "Security of ramp schemes," in Advances in Cryptology-Crypto '84, pp. 242268, Springer-Verlag, Berlin, Heidelberg, 1984.
4. C. C. Chang and S. J. Hwang, "Sharing a dynamic secret," IEEE International Phoenix Conference on Computer and Communications (Wyndham Paradise Vally Resort Scottsdale Arizona, U.S.A.), pp. 3.4.4.1-3.4.4.4, April 1-3, 1992.
5. W. Diffie and M. E. Hellman, "New directions in cryptography," IEEE Trans. Information Theory, vol. IT-22, no. 6, pp. 644-654, 1976.
6. T. ElGamal, "A public key cryptosystem and a signature scheme based on discrete logarithms," IEEE Trans. Information Theory, vol. IT-31, no. 4, pp. 469-472, July 1985.
7. J. He and E. Dawson, "Multistage secret sharing based on one-way function," Electronics Letters, vol. 30, no. 19, pp. 1591-1592, Sept. 1994.
8. P. Horster, M. Michels, and H. Petersen, "Authenticated encryption schemes with low communication costs," Electronics Letters, vol. 30, no. 15, p. 1212, 1994.
9. E. D. Karnin, J. W. Greene, and H. E. Hellman, "On secret sharing systems," IEEE Trans. Information Theory, vol. IT-29, pp. 35-41, 1983.
10. D. Knuth, "The Art of Computer Programming, Vol. 2 : Seminumerical Algorithms," Second Edition, AddisonWesley, Reading, Mass, 1981.
11. C. Laih, L. Harn, J. Lee, and T. Hwang, "Dynamic threshold scheme based on the definition of cross-product in an N-dimensional linear space," Proc. Crypto '89, Santa Barbara, California, U.S.A., pp. 20-24, Aug. 1989.
12. U. M. Maurer, "Towards the equivalence of breaking the diffie-hellman protocol and computing discrete Logarithm," Proc. of Crypto '94 (Santa Barbara, California, U.S.A.), pp. 271-281, 1994.
13. A. J. Menexes, ed., "Applications of Finite Fields," Kluwer Acadmeic Publishers, Boston, pp. 115-131, 1993.
14. C. P. Schnorr, "Efficient identification and signatures for smart cards," in Advances in Cryptology : Crypto '89, Springer Verlag, New York, pp. 239-252, 1990.
15. A. Shamir, "How to share a secret," Communications of the Association for Computing Machinery, vol. 22, no. 11, pp. 612-613, 1979.
16. H. M. Sun, "Key management on public-key cryptosystems and threshold schemes," Master Thesis of Institute of Applied Mathematics, National Cheng Kung University, Tainan, Taiwan, R.O.C., pp. 36-67, 1990.
17. Y. Y. Xain, "Relationship between MDS codes and threshold scheme," Electronics Letters, vol. 24, no. 3, pp. 154-156, 1988.