A dynamic secret sharing scheme with cheater detection

  • Shin-Jia Hwang
  • Chin-Chen Chang
Session 2: Secret Sharing
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1172)


We propose an efficient dynamic threshold scheme with cheater detection. By our scheme, without collecting and changing any secret shadows, the secret shadows can be reused after recovering or renewing the shared secret. Thus the new scheme is efficient and practical. In addition, the new scheme can detect the cheaters. Furthermore, the amount of public data is still proportional to the number of shadowholders.


Secret sharing dynamic threshold scheme cheater detection 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Asmuth, A. and Bloom, J. (1983): “A Modular Approach to Key Safeguarding,” IEEE Transactions on Information Theory, Vol. IT-29, 1983, pp. 208–210.Google Scholar
  2. 2.
    Blakley, G. R. (1979): “Safeguarding Cryptographic Keys,” Proceedings of the National Computer Conference, 1979, American Federation of Information Processing Societies, Vol. 48, 1979, pp. 242–268.Google Scholar
  3. 3.
    Blakley, G. R. and Meadows, C. (1984): “Security of Ramp Schemes,” Advances in Cryptology-Crypto '84, Springer-Verlag, Berlin, Heidelberg, 1984, pp. 242–268.Google Scholar
  4. 4.
    Chang, C. C. and Hwang, S. J. (1992): “Sharing a Dynamic Secret,” IEEE International Phoenix Conference on Computer and Communications, Wyndham Paradise Vally Resort Scottsdale Arizona, U.S.A., April, 1992, pp.– Scholar
  5. 5.
    Charnes, Pieprzyk, and Safavi-Naini (1994): “Using the Discrete Logarithm for Dynamic (t, n) Secret Sharing Schemes”, 2nd ACM Conference on Computer & Communication Security, 1994, pp. 89–95.Google Scholar
  6. 6.
    Diffie, W. and Hellman, M. E.(1976): “New Directions in Cryptography,” IEEE Transactions on Information Theory, Vol. IT-22, No. 6, 1976, pp. 644–654.Google Scholar
  7. 7.
    ElGamal, T. (1985): “A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms,” IEEE Transactions on Information Theory, Vol. IT-31, No. 4, July 1985, pp. 469–472.Google Scholar
  8. 8.
    He, J. and Dawson, E. (1994): “Multistage Secret Sharing Based on One-way Function,” Electronics Letters, Vol. 30, No. 19, September, 1994, pp. 1591–1592.Google Scholar
  9. 9.
    He, J. and Dawson, E. (1995): “Multisecret-Sharing Scheme Based on One-Way Function,” Electronics Letters, Vol. 31, No. 2, January, 1995, pp. 93–95.Google Scholar
  10. 10.
    Hwang, S. J., Chang, C. C. and Yang, W. P. (1995): “An Efficient Dynamic Threshold Scheme,” IEICE TRANS. INF. & SYST., Vol. E79-D, No. 7, 1996, pp. 936–942.Google Scholar
  11. 11.
    Karnin, E. D., Greene, J. W. and Hellman, H. E. (1983): “On Secret Sharing Systems,” IEEE Transactions on Information Theory, Vol. IT-29, 1983, pp. 35–41.Google Scholar
  12. 12.
    Knuth, D. (1981): The Art of Computer Programming, Vol. 2: Seminumerical Algorithms, Second Edition, Addison-Wesley, Reading, Mass, 1981.Google Scholar
  13. 13.
    Lain, C., Harn, L., Lee, J. and Hwang, T. (1989): “Dynamic Threshold Scheme Based on the Definition of Cross-Product in an N-Dimensional Linear Space,” Proceeding of Crypto '89, Santa Barbara, California, U.S.A., August 1989, pp. 20–24.Google Scholar
  14. 14.
    Shamir, A. (1979): “How to Share a Secret,” Communications of the Association for Computing Machinery, Vol. 22, No. 11, 1979, pp. 612–613.Google Scholar
  15. 15.
    Sun, H. M. (1990): “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., 1990, pp. 36–67.Google Scholar
  16. 16.
    Sun H. M. and Shieh, S. P. (1994a): “On Dynamic Threshold Schemes,” Information Processing Letters, Vol. 52, 1994, pp. 201–206.Google Scholar
  17. 17.
    Sun H. M. and Shieh, S. P. (1994b): “Construction of Dynamic Threshold Schemes”, Electronics Letters, Vol. 30, No. 24, November, 1995, pp. 2023–2024Google Scholar
  18. 18.
    Xain, Y. Y. (1988): “Relationship Between MDS Codes and Threshold Scheme,” Electronics Letters, Vol. 24, No. 3, 1988, pp. 154–156.Google Scholar
  19. 19.
    Zheng, Y., Hardjono, T. and Seberry, J. (1994): “Reusing Shares in Secret Sharing Schemes,” The Computer Journal, Vol. 37, No. 3, 1994, pp. 200–205.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Shin-Jia Hwang
    • 1
  • Chin-Chen Chang
    • 1
    • 2
  1. 1.Department of Information ManagementChaoyang Institute of TechnologyWuFeng,Taichung CountryTaiwan 143 R O C
  2. 2.Institute of Computer Science and Information EngineeringNational Chung Cheng UniversityChiayiTaiwan 621 ROC

Personalised recommendations