Generalized linear threshold scheme
Proceedings of CRYPTO 84 on Advances in cryptology
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Communications of the ACM
Information Theory and Reliable Communication
Information Theory and Reliable Communication
Information Theory: Coding Theorems for Discrete Memoryless Systems
Information Theory: Coding Theorems for Discrete Memoryless Systems
Generalized Secret Sharing and Monotone Functions
CRYPTO '88 Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology
Some Improved Bounds on the Information Rate of Perfect Secret Sharing Schemes
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
Size of shares and probability of cheating in threshold schemes
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
Nonperfect secret sharing schemes and matroids
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
On key distribution via true broadcasting
CCS '94 Proceedings of the 2nd ACM Conference on Computer and communications security
Tight Bounds on the Information Rate of Secret SharingSchemes
Designs, Codes and Cryptography
Lower bounds on the information rate of secret sharing schemes with homogeneous access structure
Information Processing Letters
Changing Thresholds in the Absence of Secure Channels
ACISP '99 Proceedings of the 4th Australasian Conference on Information Security and Privacy
New Results on Unconditionally Secure Distributed Oblivious Transfer
SAC '02 Revised Papers from the 9th Annual International Workshop on Selected Areas in Cryptography
On the Information Rate of Secret Sharing Schemes (Extended Abstract)
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
New General Lower Bounds on the Information Rate of Secret Sharing Schemes
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
t-Cheater Identifiable (k, n) Threshold Secret Sharing Schemes
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
ISC '01 Proceedings of the 4th International Conference on Information Security
Secret Sharing in Graph-Based Prohibited Structures
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Graph decompositions and secret sharing schemes
EUROCRYPT'92 Proceedings of the 11th annual international conference on Theory and application of cryptographic techniques
Crypto topics and applications II
Algorithms and theory of computation handbook
Research note: An on-line secret sharing scheme for multi-secrets
Computer Communications
| Hi-index | 0.00 |
A secret sharing scheme permits a secret to be shared among participants in such a way that only qualified subsets of partecipants can recover the secret, but any non-qualified subset has absolutely no information on the secret. The set of all qualified subsets defines the access structure to the secret. Sharing schemes are useful in the management of cryptographic keys and in multy-party secure protocols.We analyze the relationships among the entropies of the sample spaces from which the shares and the secret are chosen. We show that there are access structures with 4 participants for which any secret sharing scheme must give to a participant a share at least 50% greater than the secret size. This is the first proof that there exist access structures for which the best achievable information rate (i.e., the ratio between the size of the secret and that of the largest share) is bounded away from 1. The bound is the best possible, as we construct a secret sharing scheme for the above access structures which meets the bound with equality.