✦ LIBER ✦

The optimal linear secret sharing scheme for any given access structure

✍ Scribed by Chunming Tang,Shuhong Gao,Chengli Zhang

Book ID: 126359780
Publisher: Academy of Mathematics and Systems Science, Chinese Academy of Sciences
Year: 2013
Tongue: English
Weight: 205 KB
Volume: 26
Category: Article
ISSN: 1009-6124
DOI: 10.1007/s11424-013-2131-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Linear Secret Sharing Schemes and Rearra

Linear Secret Sharing Schemes and Rearrangements of Access Structures

✍ Liang-liang Xiao; Mu-lan Liu 📂 Article 📅 2004 🏛 Institute of Applied Mathematics, Chinese Academy 🌐 English ⚖ 185 KB

Secret Sharing Schemes with Detection of

Secret Sharing Schemes with Detection of Cheaters for a General Access Structure

✍ Sergio Cabello; Carles Padró; Germán Sáez 📂 Article 📅 2002 🏛 Springer 🌐 English ⚖ 119 KB

The exact values of the optimal average

The exact values of the optimal average information ratio of perfect secret-sharing schemes for tree-based access structures

✍ Lu, Hui-Chuan; Fu, Hung-Lin 📂 Article 📅 2013 🏛 Springer 🌐 English ⚖ 199 KB

Optimal assignment schemes for general a

Optimal assignment schemes for general access structures based on linear programming

✍ Li, Qiang; Li, Xiang Xue; Lai, Xue Jia; Chen, Ke Fei 📂 Article 📅 2013 🏛 Springer 🌐 English ⚖ 363 KB

Decomposition Construction for Secret Sh

Decomposition Construction for Secret Sharing Schemes with Graph Access Structures in Polynomial Time

✍ Sun, Hung-Min; Wang, Huaxiong; Ku, Bying-He; Pieprzyk, Josef 📂 Article 📅 2010 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 375 KB

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