You are looking at a specific version 20180330:234602 of this paper.
See the latest version.
Paper 2017/919
Improving the Linear Programming Technique in the Search for Lower Bounds in Secret Sharing
Oriol Farras and Tarik Kaced and Sebastia Martin and Carles Padro
Abstract
We present a new improvement in the linear programming technique to derive lower bounds on the information ratio of secret sharing schemes. We obtain non-Shannon-type bounds without using information inequalities explicitly. Our new technique makes it possible to determine the optimal information ratio of linear secret sharing schemes for all access structures on 5 participants and all graph-based access structures on 6 participants. In addition, new lower bounds are presented also for some small matroid ports and, in particular, the optimal information ratios of the linear secret sharing schemes for the ports of the Vamos matroid are determined.
Metadata
- Available format(s)
- Category
- Cryptographic protocols
- Publication info
- Published by the IACR in EUROCRYPT 2018
- Keywords
- Secret sharingInformation inequalitiesRank inequalitiesCommon informationLinear Programming
- Contact author(s)
- carles padro @ upc edu
- History
- 2022-03-30: last of 3 revisions
- 2017-09-24: received
- See all versions
- Short URL
- https://ia.cr/2017/919
- License
-
CC BY