The KIPS Transactions:PartC (정보처리학회논문지C)

Korea Information Processing Society (한국정보처리학회)
권호 표지
DOI QR코드

DOI QR Code

Secure and Efficient Secret Sharing Scheme Based on Wide Pipe Hash Function

광역 파이프 해쉬 함수에 기반한 안전하고 효율적인 비밀분산

  • 김희도 (강릉영동대학 부사관과) ;
  • 원동호 (성균관대학교 정보통신공학부)
  • Published : 2006.12.31
Download PDF
⟨ Previous Next ⟩

Abstract

In this paper, we propose a secure and efficient secret sharing scheme Based on wide pipe hash function This scheme provides the property to share multiple secrets and allows participants to be added/deleted dynamically, without haying to redistribute new secret shares. Proposed scheme has advantage to detect cheating and identify of all cheater, regardless of their number. Futhermore, it is more secure and efficient than previous schemes based on hash function.

본 논문은 광역 파이프 해쉬함수에 기반한 안전하고 효율적인 비밀 분산 방식을 제안하고자 한다. 제안하는 비밀분산방식은 액세스 구조가 변하는 경우에도 공개한 값들만 변경하면 각 참가자에게 새로운 비밀 정보를 재분산 없이 그대로 사용할 수 있다. 또 참가자들의 부정이 있는 경우 그 수에 관계없이 항상 부정한 참가자들의 신분을 밝혀낼 수 있으며, 기존에 제안한 해쉬기반비밀분산 방식들 보다 안전하고, 계산상 효율적이라는 장점을 가지고 있다.

Keywords

References

  1. G. R. Blakely, 'Safeguarding cryptographic key,' In proceeding of AFIPS National Computer Conference, pp.313-317, 1979
  2. AdiShamir, How to share a secret, Communication of the ACM, 21 : 120-126. 1979 https://doi.org/10.1145/359168.359176
  3. C. Cacjom, 'On-line secret sharing.' In C. boyd, editor, Proceeding of the 5th IMA conference on Cryptography and Coding, pp.190-198. Springer-Verlag, 1995
  4. Soo-Hyun Oh, Seung-Joo Kim, Dong-Ho Won, Efficient On-line Sharing Scheme based on One-way Hash Function. The transaction of the Korea Information Processing Society, Vol.7-C NO.10, pp.3128-3137, October, 2000
  5. 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 Theorem Computing pp.218-229, 1987
  6. R. G. E. Pinch, On-line multiple secret sharing, Electronic Letters. 32(12) : 1087-1088, 1996 https://doi.org/10.1049/el:19960692
  7. H. Ghodosi, J. Pieprzyk, G.R. Chaudhrt, J. Seberry, How to pervent cheating in Pinch's scheme, Electronic Letters. 33(17) : 1453-1454, 1997 https://doi.org/10.1049/el:19970980
  8. Chan Yeob Yeun, Chris J. Mitchell, Mike Burmester, An Online Secret Sharing Scheme which Identifies All Cheater, Proc. of NORDSEC 98. The Third Noridic Workshop on Information Security Singapore, Dec., 1998
  9. Stefan Lucks, A Failure-Friendly Design Principle for Hash Functions, ASICRYPT 2005, LNCS 3788, pp.474C 494, 2005 https://doi.org/10.1007/11593447_26