Lower bounds on the information rate of secret sharing schemes with homogeneous access structure

Authors:
Carles Padró;Germán Sáez
Affiliations:
Dep. de Matemàtica Aplicada IV, Univ. Politècnica de Catalunya, c/Jordi Girona, 1-3, 08034 Barcelona, Spain;Dep. de Matemàtica Aplicada IV, Univ. Politècnica de Catalunya, c/Jordi Girona, 1-3, 08034 Barcelona, Spain
Venue:
Information Processing Letters
Year:
2002

Citing 11
Cited 6

Generalized secret sharing and monotone functions

CRYPTO '88 Proceedings on Advances in cryptology
Some improved bounds on the information rate of perfect secret sharing schemes

Journal of Cryptology
An explication of secret sharing schemes

Designs, Codes and Cryptography
Perfect Secret Sharing Schemes on Five Participants

Designs, Codes and Cryptography
Tight Bounds on the Information Rate of Secret SharingSchemes

Designs, Codes and Cryptography
Weighted threshold secret sharing schemes

Information Processing Letters
How to share a secret

Communications of the ACM
Cryptography: Theory and Practice

Cryptography: Theory and Practice
On the Size of Shares for Secret Sharing Schemes

CRYPTO '91 Proceedings of the 11th 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
Secret sharing schemes with bipartite access structure

IEEE Transactions on Information Theory

A cost-effective encryption scheme for color images

Real-Time Imaging - Special issue on multi-dimensional image processing
Hypergraph decomposition and secret sharing

Discrete Applied Mathematics
On secret sharing schemes, matroids and polymatroids

TCC'07 Proceedings of the 4th conference on Theory of cryptography
Decomposition Construction for Secret Sharing Schemes with Graph Access Structures in Polynomial Time

SIAM Journal on Discrete Mathematics
Optimal complexity of secret sharing schemes with four minimal qualified subsets

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

Quantified Score

Hi-index	0.90

Visualization

Abstract

We present some new lower bounds on the optimal information rate and on the optimal average information rate of secret sharing schemes with homogeneous access structure. These bounds are found by using some covering constructions and a new parameter, the k-degree of a participant, that is introduced in this paper. Our bounds improve the previous ones in almost all cases.