Redistribution of Mechanical Secret Shares

Vaults are used extensively in the financial world. Some of these vaults use a secret sharing scheme in which the shares are mechanical keys. Reorganization of a corporation sometimes requires to change the access structure of those authorized to open the vault. Although changing access structure is studied in the context of secret sharing schemes, the techniques are inadequate in the case that the shares are mechanical keys. For example, some schemes require that an existing secret sharing scheme (vault in our case) be fitted with new sets of shares (mechanical keys in our case). That is a number of share sets (key sets) be produced that open the same vault. Making such a modification to a mechanical vault is very expensive, if at all possible. We study how one can redistribute secret shares only by using copying of these shares, which is the only operation one can allow to deal with mechanical shares without changing the mechanical vault mechanism.

[1]  Reihaneh Safavi-Naini,et al.  Bounds and Techniques for Efficient Redistribution of Secret Shares to New Access Structures , 1999, Comput. J..

[2]  P. Erdös,et al.  Families of finite sets in which no set is covered by the union ofr others , 1985 .

[3]  Joan Feigenbaum,et al.  Advances in Cryptology-Crypto 91 , 1992 .

[4]  Moti Yung,et al.  Optimal-resilience proactive public-key cryptosystems , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[5]  J. Hirschfeld.  Projective Geometries Over Finite Fields , 1980 .

[6]  Thomas Johansson,et al.  On Families of Hash Functions via Geometric Codes and Concatenation , 1993, CRYPTO.

[7]  Tor Helleseth,et al.  Universal Hash Functions from Exponential Sums over Finite Fields and Galois Rings , 1996, CRYPTO.

[8]  Neal Koblitz,et al.  Advances in Cryptology — CRYPTO ’96 , 2001, Lecture Notes in Computer Science.

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

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

[11]  Robert H. Deng,et al.  Design and Analyses of Two Basic Protocols for Use in TTP-Based Key Escrow , 1997, ACISP.

[12]  Dieter Gollmann,et al.  Key Escrow in Mutually Mistrusting Domains , 1996, Security Protocols Workshop.

[13]  J. H. van Lint,et al.  Introduction to Coding Theory , 1982 .

[14]  Douglas R. Stinson.  Universal Hashing and Authentication Codes , 1991, CRYPTO.

[15]  Peter J. Cameron,et al.  Designs, graphs, codes, and their links , 1991 .

[16]  Andrew Odlyzko,et al.  Advances in Cryptology — CRYPTO’ 86 , 2000, Lecture Notes in Computer Science.

[17]  Lie Zhu,et al.  Some New Bounds for Cover-Free Families , 2000, J. Comb. Theory, Ser. A.

[18]  Amit Sahai,et al.  Coding Constructions for Blacklisting Problems without Computational Assumptions , 1999, CRYPTO.

[19]  Moni Naor,et al.  Universal one-way hash functions and their cryptographic applications , 1989, STOC '89.

[20]  Michael Wiener,et al.  Advances in Cryptology — CRYPTO’ 99 , 1999 .

[21]  Colin Boyd,et al.  Cryptography and Coding , 1995, Lecture Notes in Computer Science.

[22]  Larry Carter,et al.  Universal Classes of Hash Functions , 1979, J. Comput. Syst. Sci..

[23]  Douglas R. Stinson,et al.  Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes , 1998, SIAM J. Discret. Math..

[24]  Larry Carter,et al.  New Hash Functions and Their Use in Authentication and Set Equality , 1981, J. Comput. Syst. Sci..

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

[26]  Douglas R. Stinson,et al.  Advances in Cryptology — CRYPTO’ 93 , 2001, Lecture Notes in Computer Science.

[27]  J. H. Lint,et al.  Designs, graphs, codes, and their links , 1991 .

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