On line multiple secret sharing
Richard G. E. Pinch · Electronics Letters · 1996
. A protocol for computationally secure "on-line" secret-sharing is presented, based on the intractability of the Diffie--Hellman problem, in which the participants ' shares can be reused. Introduction. Cachin [1] presents a protocol for "on-line" secret sharing with general access structures, with shares as short as the secret and in which participants may be dynamically added or deleted without having to redistribute new shares secretly to the existing participants. These capabilities are gained by storing additional authentic, but not secret, information in a publicly accessible central location. This proposal does not allow the shares to be reused after the secret has been reconstructed without a further distributed computation sub-protocol, although there is a modification allowing a predetermined number of multiple secrets to be reconstructed in a specified order. In this letter we present a modification of the protocol which allows for an arbitrary number of secrets to be ...