Author, as appears in the article.: Farràs O; Kaced T; Martín S; Padró C
Department: Enginyeria Informàtica i Matemàtiques
e-ISSN: 1557-9654
URV's Author/s: Farràs Ventura, Oriol
Keywords: Secret sharing schemes Rank inequalities Linear programming Information inequalities Common information
Abstract: © 1963-2012 IEEE. 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.
Thematic Areas: Matemática / probabilidade e estatística Library and information sciences Information systems Engineering, electrical & electronic Engenharias iv Engenharias iii Computer science, information systems Computer science applications Ciencias sociales Ciência da computação Astronomia / física
licence for use: https://creativecommons.org/licenses/by/3.0/es/
ISSN: 0018-9448
Author's mail: oriol.farras@urv.cat
Author identifier: 0000-0002-7495-5980
Record's date: 2023-02-19
Papper version: info:eu-repo/semantics/acceptedVersion
Papper original source: Ieee Transactions On Information Theory. 66 (11): 7088-7100
APA: Farràs O; Kaced T; Martín S; Padró C (2020). Improving the Linear Programming Technique in the Search for Lower Bounds in Secret Sharing. Ieee Transactions On Information Theory, 66(11), 7088-7100. DOI: 10.1109/TIT.2020.3005706
Licence document URL: https://repositori.urv.cat/ca/proteccio-de-dades/
Entity: Universitat Rovira i Virgili
Journal publication year: 2020
Publication Type: Journal Publications
Repositori URV