Efficient On-line Secret Sharing scheme based on One-way Hash Function

일반향 해쉬 함수에 기반한 효율적인 온라인 비밀분산 방식

  • 오수현 (성균관대학교 대학원 전기전자및컴퓨터공학과) ;
  • 김승주 (한국정보보호센터 기술부/암호기술팀) ;
  • 원동호 (성균관대학교 전기전자및컴퓨터공학부)
  • Published : 2000.10.01

Abstract

Secret sharing scheme is a cryptographic protocol in which a dealer distribures shares of a secret among a set of participants such that only authorized set of participants can recover the secret at a later. Secret sharing is an important cryptographic primitive in management of secret information, secure multiparty protocol and group-oriented cryptography, etc. In this paper, we propose an efficient, on-line secret sharing scheme based on one-way hash function. This scheme provides the property to share multiple secrets and allows participants to be added/deleted dynamically, without having to redistributo new shares. Proposed scheme has advantage to detect cheating and identify of all cheater, regardless of then number. Frthermore, it is more eficient than previous schemes.

Keywords

References

  1. G. R Blakely, 'Safeguarding cryptographic key,' In proceeding of AFIPS National Computer Conference, pp.313-317, 1979
  2. C. Cachin, 'On-line secret sharing,' In C. Boyd, editor. Proceeding of the 5th IMA conference on Cryptography and Coding, pp.190-198, Springer-Verlag, 1995
  3. L. Chen. D Gollmann. C J Mitehell and P wild, 'Secret sharing with Reusable Polynomial,' ACISP'97, pp.183-193 1997
  4. W. Diffie and M Hellman, 'New Directions in Cryptography,' IEEE Trransaction on Information Theory IT-22, pp.644-654, 1976
  5. P. Fedlman, 'A Practical scheme for Non-interactive Verifiable secret sharing,' Proceeding of the 28th Annual Symposium on the Foundation of Computer Science, pp.427-437, 1987
  6. O. Goldreich, S. Micali, and A. Wigderson, 'How to play any mental game or a completeness theorem for protocols with honest majority,' in Proc 19th ACM Symposium on Theory of Computing (STOC), pp 218-229, 1987 https://doi.org/10.1145/28395.28420
  7. H. Ghodosi, J. Pieprzyk, G. R. Chaudhry, J. Seberry, 'How to prevent cheating in Pinch's scheme,' Electronic Letters, 33(17) : 1453-1454, 1997
  8. H. Y Lin and L. Harn, 'A Generalized Secret Sharing Scheme with Cheater Detection,' Advances in Cryptology- ASIACRYPT'91 Proceeding, Springer-Verlag, pp.149-158, 1993
  9. A. Menezes, P. van Oorschot, S Vanstone, 'Handbook of Applied Cryptography,' CRC Press, 1996
  10. T. P. Pederson, 'Distrobuted provers with Applications to Undeniable signatures,' Advances in Cryptology-EUROCRYPT'91 Proceeding, Springer-Verlag, pp.221-242, 1991
  11. R. G. E. Pinch, 'On-line multiple secret sharing,' Electronic Letters, 32( 12) : 1087-1088, 1996 https://doi.org/10.1049/el:19960692
  12. R. Rivest, A. Shamir, and L. Adleman, 'A method for Obtaining Digital signature and Public key Cryptosystems,' Communication of the ACM, pp. 120-128, FEB. 1978 https://doi.org/10.1145/359340.359342
  13. Adi Shamir, 'How to share a secret,' Communication of the ACM, 21 : 120-126, 1979 https://doi.org/10.1145/359168.359176
  14. M. Tompa, H. Woll, 'How to share a secret with cheater,' Journal of Cryptology, 1 : 133-138, 1988
  15. Chan Yeob Yeun, Chris J. Mitchell, 'How to identify all cheater in Pinch's scheme,' JWIS '98, Japan-Singapore Joint Workshop on Information Security, Singapore, Dec. 1998
  16. Chan Yeob Yeun, Chris J. Mitchell, Mike Burmester, 'An Online Secret Sharing which Identifies All Cheater,' Proceeding of NORDSEC '98, The Third Nordic Workshop on Secure IT Systems. Norway, Nov. 1998
  17. Y. Zheng, T Hardjono and J. Seberry, 'Reusing share in secret sharing schemes,' The Computer Journal 37, pp.199-205, 1994 https://doi.org/10.1093/comjnl/37.3.199
  18. FIPS PUB-185 Escrowed Encryption Standard, 1993
  19. http://www.zoi.net/internet/index.htm