An optimal class of symmetric key generation systems
Proc. of the EUROCRYPT 84 workshop on Advances in cryptology: theory and application of cryptographic techniques
An explication of secret sharing schemes
Designs, Codes and Cryptography
Geometric secret sharing schemes and their duals
Designs, Codes and Cryptography
CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
Contemporary Cryptology: The Science of Information Integrity
Contemporary Cryptology: The Science of Information Integrity
On the Key Predistribution System: A Practical Solution to the Key Distribution Problem
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Perfectly-Secure Key Distribution for Dynamic Conferences
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
A Linear Construction of Secret Sharing Schemes
Designs, Codes and Cryptography
A General Decomposition Construction for Incomplete SecretSharing Schemes
Designs, Codes and Cryptography
On the Composition of Matroids and Ideal Secret Sharing Schemes
Designs, Codes and Cryptography
Lower bounds on the information rate of secret sharing schemes with homogeneous access structure
Information Processing Letters
Secret sharing schemes with three or four minimal qualified subsets
Designs, Codes and Cryptography
A General Approach to Robust Web Metering
Designs, Codes and Cryptography
Sharing Multiple Secrets: Models, Schemes and Analysis
Designs, Codes and Cryptography
Secret sharing schemes on access structures with intersection number equal to one
Discrete Applied Mathematics
A note on secret sharing schemes with three homogeneous access structure
Information Processing Letters
Ideal Multipartite Secret Sharing Schemes
EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
Ideal secret sharing schemes whose minimal qualified subsets have at most three participants
Designs, Codes and Cryptography
Secret sharing schemes on access structures with intersection number equal to one
Discrete Applied Mathematics
An impossibility result on graph secret sharing
Designs, Codes and Cryptography
On secret sharing schemes, matroids and polymatroids
TCC'07 Proceedings of the 4th conference on Theory of cryptography
Secret sharing schemes on access structures with intersection number equal to one
SCN'02 Proceedings of the 3rd international conference on Security in communication networks
Crypto topics and applications II
Algorithms and theory of computation handbook
SIAM Journal on Discrete Mathematics
Ideal secret sharing schemes for useful multipartite access structures
IWCC'11 Proceedings of the Third international conference on Coding and cryptology
Optimal complexity of secret sharing schemes with four minimal qualified subsets
Designs, Codes and Cryptography
Finding lower bounds on the complexity of secret sharing schemes by linear programming
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
On the optimization of bipartite secret sharing schemes
Designs, Codes and Cryptography
Ideal secret sharing schemes whose minimal qualified subsets have at most three participants
SCN'06 Proceedings of the 5th international conference on Security and Cryptography for Networks
On matroids and non-ideal secret sharing
TCC'06 Proceedings of the Third conference on Theory of Cryptography
Finding lower bounds on the complexity of secret sharing schemes by linear programming
Discrete Applied Mathematics
Information Sciences: an International Journal
| Hi-index | 0.01 |
A perfect secret sharing scheme is a system for the protection of a secret among a number of participants in such a way that only certain subsets of these participants can reconstruct the secret, and the remaining subsets can obtain no additional information about the secret. The efficiency of a perfect secret sharing scheme can be assessed in terms of its information rates. In this paper we discuss techniques for obtaining bounds on the information rates of perfect secret sharing schemes and illustrate these techniques using the set of monotone access structures on five participants. We give a full listing of the known informtion rate bounds for all the monotone access structures on five participants.