Redistributing Secret Shares to New Access Structures and Its Applications

Proactive secret sharing deals with refreshing secret shares, i.e., redistributing the shares of a secret to the original access structure. In this paper we focus on the general problem of redistributing shares of a secret key. Shares of a secret have been distributed such that access sets speci ed in the access structure (e.g., t-out-of-l) can access (or use) the secret. The problem is how to redistribute the secret, without recovering it, in such a way that those speci ed in the new access structure 0 will be able to recover the secret. We also adapt our scheme such that it can be used in the context of threshold cryptography and discuss its applications to secure databases.

[1]  N. Jacobson,et al.  Basic Algebra I , 1976 .

[2]  Ravi Kannan,et al.  Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix , 1979, SIAM J. Comput..

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

[4]  G. R. BLAKLEY.  Safeguarding cryptographic keys , 1979, 1979 International Workshop on Managing Requirements Knowledge (MARK).

[5]  R. J. McEliece,et al.  On sharing secrets and Reed-Solomon codes , 1981, CACM.

[6]  G. R. Blakley,et al.  Infinite Structures in Information Theory , 1982, CRYPTO.

[7]  Ehud D. Karnin,et al.  On secret sharing systems , 1983, IEEE Trans. Inf. Theory.

[8]  Adi Shamir,et al.  A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.

[9]  Silvio Micali,et al.  The knowledge complexity of interactive proof-systems , 1985, STOC '85.

[10]  Yvo Desmedt,et al.  Society and Group Oriented Cryptography: A New Concept , 1987, CRYPTO.

[11]  Josh Benaloh,et al.  Secret Sharing Homomorphisms: Keeping Shares of A Secret Sharing , 1986, CRYPTO.

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

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

[14]  N. Jacobson,et al.  Basic Algebra II , 1989 .

[15]  Yvo Desmedt,et al.  Threshold Cryptosystems , 1989, CRYPTO.

[16]  Douglas R Stinson,et al.  Some improved bounds on the information rate of perfect secret sharing schemes , 1990, Journal of Cryptology.

[17]  Sushil Jajodia,et al.  Dynamic voting algorithms for maintaining the consistency of a replicated database , 1990, TODS.

[18]  Torben P. Pedersen.  Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing , 1991, CRYPTO.

[19]  Torben P. Pedersen.  A Threshold Cryptosystem without a Trusted Party (Extended Abstract) , 1991, EUROCRYPT.

[20]  Rafail Ostrovsky,et al.  How To Withstand Mobile Virus Attacks , 1991, PODC 1991.

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

[22]  Moti Yung,et al.  How to share a function securely , 1994, STOC '94.

[23]  Giovanni Di Crescenzo,et al.  Multiplicative Non-abelian Sharing Schemes and their Application to Threshold Cryptography , 1994, ASIACRYPT.

[24]  Ran Canetti,et al.  Maintaining Security in the Presence of Transient Faults , 1994, CRYPTO.

[25]  Yvo Desmedt,et al.  Perfect Homomorphic Zero-Knowledge Threshold Schemes over any Finite Abelian Group , 1994, SIAM J. Discret. Math..

[26]  Hugo Krawczyk,et al.  Proactive Secret Sharing Or: How to Cope With Perpetual Leakage , 1995, CRYPTO.

[27]  Susan K. Langford.  Threshold DSS Signatures without a Trusted Party , 1995, CRYPTO.

[28]  Yvo Desmedt,et al.  Efficient Multiplicative Sharing Schemes , 1996, EUROCRYPT.

[29]  Stanislav,et al.  Robust and E cient Sharing of RSA FunctionsRosario , 1996 .