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 [15] (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. © Springer-Verlag Berlin Heidelberg 2014.
CITATION STYLE
Tentu, A. N., & Rao, A. A. (2014). Efficient verifiable multi-secret sharing based on Y.C.H scheme. In Communications in Computer and Information Science (Vol. 448 CCIS, pp. 100–109). Springer Verlag. https://doi.org/10.1007/978-3-662-44893-9_9
Mendeley helps you to discover research relevant for your work.