Secret sharing schemes on access structures with intersection number equal to one

Lower bounds on the information rate of

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

✍ Carles Padró; Germán Sáez 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 81 KB

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