eprint.iacr.org will be offline for approximately an hour
for routine maintenance at 11pm UTC on Tuesday, April 16. We lost some data between
April 12 and April 14, and some authors have been notified that they need to resubmit their papers.
You are looking at a specific version 20130220:095447 of this paper.
See the latest version.
Paper 2013/082
Secret Sharing, Rank Inequalities and Information Inequalities
Sebastia Martin and Carles Padro and An Yang
Abstract
Beimel and Orlov proved that all information inequalities on four or five variables, together with all information inequalities on more than five variables that are known to date, provide lower bounds on the size of the shares in secret sharing schemes that are at most linear on the number of participants. We present here another negative result about the power of information inequalities in the search for lower bounds in secret sharing. Namely, we prove that all information inequalities on a bounded number of variables only can provide lower bounds that are polynomial on the number of participants.
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- Secret sharingInformation inequalitiesRank inequalitiesPolymatroid.
- Contact author(s)
- cpadro @ ma4 upc edu
- History
- 2015-11-27: last of 3 revisions
- 2013-02-20: received
- See all versions
- Short URL
- https://ia.cr/2013/082
- License
-
CC BY
