Secret sharing homomorphisms: keeping shares of a secret secret
Proceedings on Advances in cryptology---CRYPTO '86
Universal one-way hash functions and their cryptographic applications
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
On families of hash functions via geometric codes and concatenation
CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes
SIAM Journal on Discrete Mathematics
Some new bounds for cover-free families
Journal of Combinatorial Theory Series A
Communications of the ACM
Introduction to Coding Theory
Designs, Graphs, Codes, and Their Links
Designs, Graphs, Codes, and Their Links
Design and Analyses of Two Basic Protocols for Use in TTP-Based Key Escrow
ACISP '97 Proceedings of the Second Australasian Conference on Information Security and Privacy
Universal Hashing and Authentication Codes
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Key Escrow in Mutually Mistrusting Domains
Proceedings of the International Workshop on Security Protocols
Optimal-resilience proactive public-key cryptosystems
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Efficient multiplicative sharing schemes
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
Distributing the Encryption and Decryption of a Block Cipher
Designs, Codes and Cryptography
| Hi-index | 0.00 |
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.