Sciweavers

TCC
2009
Springer
151views Cryptology» more  TCC 2009»
15 years 2 days ago
Secret Sharing and Non-Shannon Information Inequalities
The known secret-sharing schemes for most access structures are not efficient; even for a one-bit secret the length of the shares in the schemes is 2O(n) , where n is the number of...
Amos Beimel, Ilan Orlov