On-Line Secret Sharing

We propose a new construction for computationally secure secret sharing schemes with general access structures where all shares are as short as the secret. Our scheme provides the capability to share multiple secrets and to dynamically add participants on-line, without having to re-distribute new shares secretly to the current participants. These capabilities are gained by storing additional authentic (but not secret) information at a publicly accessible location.

[1]  Hugo Krawczyk,et al.  Secret Sharing Made Short , 1994, CRYPTO.

[2]  Gustavus J. Simmons,et al.  Contemporary Cryptology: The Science of Information Integrity , 1994 .

[3]  László Csirmaz.  The Size of a Share Must Be Large , 1994, EUROCRYPT.

[4]  Josh Benaloh,et al.  Generalized Secret Sharing and Monotone Functions , 1990, CRYPTO.

[5]  Alfredo De Santis,et al.  Fully Dynamic Secret Sharing Schemes , 1993, Theor. Comput. Sci..

[6]  Silvio Micali,et al.  How to play ANY mental game , 1987, STOC.

[7]  M. Smid,et al.  Key escrowing today , 1994, IEEE Communications Magazine.

[8]  Adi Shamir,et al.  How to share a secret , 1979, CACM.

[9]  A. Beimel,et al.  Lower bounds for monotone span programs , 2005, computational complexity.

[10]  Silvio Micali,et al.  Fair Public-Key Cryptosystems , 1992, CRYPTO.

[11]  Giovanni Di Crescenzo,et al.  Multi-Secret Sharing Schemes , 1994, CRYPTO.

[12]  Michael O. Rabin,et al.  Efficient dispersal of information for security, load balancing, and fault tolerance , 1989, JACM.

[13]  Alfredo De Santis,et al.  Fully Dynamic Secret Sharing Schemes , 1996, Theor. Comput. Sci..

[14]  Alfredo De Santis,et al.  On the Size of Shares for Secret Sharing Schemes , 1991, CRYPTO.

[15]  László Csirmaz,et al.  The Size of a Share Must Be Large , 1994, Journal of Cryptology.

[16]  Leslie Lamport,et al.  Password authentication with insecure communication , 1981, CACM.

[17]  Douglas R. Stinson,et al.  An explication of secret sharing schemes , 1992, Des. Codes Cryptogr..

[18]  G. R. Blakley,et al.  Threshold Schemes with Disenrollment , 1992, CRYPTO.

[19]  J. Massey,et al.  Threshold Schemes with Disenrollment , 1993, Proceedings. IEEE International Symposium on Information Theory.

[20]  Mitsuru Ito,et al.  Secret sharing scheme realizing general access structure , 1989 .