Efficient Verifiable Multi-Secret Sharing Based on Y.C.H Scheme
In this paper, we propose an efficient verifiable multi-secret sharing protocol based on an identity based signature scheme, that uses identities for its participants. The scheme makes use of advantages of identity based signature scheme and hash function for the verifiability which does not require much computation. It checks either dealer or participant(s) honesty, that means a corrupted dealer may provide a fake secret or a participant may provide a fake share to the other participants in the reconstruction phase. In the previous proposed schemes, dealer  (or) participants [12,16] could communicate with each other securely before the secret distribution phase for sending secret shadows and they used exponential functions for verification. In our scheme, we do not require pre-secure communication between a dealer and participants, although we use a two-variable way for the distribution purpose but we do not prevent from any exponential functions for the verification phase. Our scheme resist a dealer/participant(s) cheating behaviour efficiently.
Keywordsthreshold secret sharing multi-secret sharing verifiable identity based signature hash function
Unable to display preview. Download preview PDF.
- 1.Blakley, G.R.: Safeguarding cryptographic keys. In: AFIPS Conference Proceedings, vol. 48, pp. 313–317 (1979)Google Scholar
- 4.Chien, H.Y., Jan, J.K., Tseng, Y.M.: A practical (t,n) multi-secret sharing scheme. IEICE Trans. Fundamentals E83-A 12, 2762–2765 (2000)Google Scholar
- 5.Goldwasser, S., Bellare, M.: http://cseweb.ucsd.edu/~mihir/papers/gb.pdf
- 10.Menezes, A., Oorschot, P., Vanstone, S.: Handbook of applied cryptography. CRC Press (1996)Google Scholar
- 17.Chien, J.H.-Y., Tseng, J.-K., et al.: A practical (t,n) multi-secret sharing. IEICE Transactions on Fundamentals of Electronics. Communications and Computer Sciences E83-A (12), 2762–2765 (2000)Google Scholar