✦ LIBER ✦

Finding lower bounds on the complexity of secret sharing schemes by linear programming

✍ Scribed by Padró, Carles; Vázquez, Leonor; Yang, An

Book ID: 120311677
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 275 KB
Volume: 161
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2012.10.020

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Tight Bounds on the Information Rate of

Tight Bounds on the Information Rate of Secret Sharing Schemes

✍ Carlo Blundo; Alfredo De Santis; Roberto De Simone; Ugo Vaccaro 📂 Article 📅 1997 🏛 Springer 🌐 English ⚖ 701 KB

Some improved bounds on the information

Some improved bounds on the information rate of perfect secret sharing schemes

✍ E. F. Brickell; D. R. Stinson 📂 Article 📅 1992 🏛 Springer 🌐 English ⚖ 612 KB

Lower bounds on the state complexity of

Lower bounds on the state complexity of linear tail-biting trellises

✍ Shany, Y.; Reuven, I.; Be'ery, Y. 📂 Article 📅 2004 🏛 IEEE 🌐 English ⚖ 348 KB

Lower bounds on the linear complexity of

Lower bounds on the linear complexity of the discrete logarithm in finite fields

✍ Meidl, W.; Winterhof, A. 📂 Article 📅 2001 🏛 IEEE 🌐 English ⚖ 297 KB

Improved upper bounds for the informatio

Improved upper bounds for the information rates of the secret sharing schemes induced by the Vámos matroid

✍ Jessica Ruth Metcalf-Burton 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 244 KB