On-line multiple secret sharing based on a one-way function

Based on a one-way function and the intractability of the Diffie-Hellman pr oblem, Pinch proposed a on-line multiple secret sharing protocol which allo ws the shares to be reused. Ghodosi et al. showed that Pinch's protocol is vulnerable to cheating. They also proposed a method to prevent the cheating problem in Pinch's protocol. However, both Pinch's and Ghodosi et al.'s pr otocols suffer from the disadvantages of high computation overhead and sequ ential reconstruction in the secret recovery phase. In this article, we pro pose a new on-line multiple secret sharing scheme. The security of the prop osed scheme is only based on a one-way function, not on other intractable p roblems. Compared with other well-known schemes, our scheme has the advanta ges of lower computation overhead and parallel reconstruction in the secret recovery phase. (C) 1999 Elsevier Science B.V. All rights reserved.