STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
An explication of secret sharing schemes
Designs, Codes and Cryptography
Communications of the ACM
How to (Really) Share a Secret
CRYPTO '88 Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology
Dynamic Threshold Scheme Based on the Definition of Cross-Product in an N-Dimentional Linear Space
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
On the Information Rate of Secret Sharing Schemes (Extended Abstract)
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Threshold Schemes with Disenrollment
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Graph decompositions and secret sharing schemes
EUROCRYPT'92 Proceedings of the 11th annual international conference on Theory and application of cryptographic techniques
Scalable threshold scheme without a trusted third party
ICCC '02 Proceedings of the 15th international conference on Computer communication
A new multi-stage secret sharing scheme using one-way function
ACM SIGOPS Operating Systems Review
| Hi-index | 0.00 |
We consider secret sharing schemes in which the dealer has the feature of being able (after a preprocessing stage) to activate a particular access structure out of a given set and/or to allow the participants to reconstruct different secrets (in different time instants) by sending to all participants the same broadcast message. In this paper we establish a formal setting to study such secret sharing schemes. The security of the schemes presented is unconditional, since they are not based on any computational assumption. We give bounds on the size of the shares held by participants and on the site of the broadcast message in such schemes.