Improving the Linear Programming Technique in the Search for Lower Bounds in Secret Sharing

DOI10.1109/TIT.2020.3005706zbMath1453.94135OpenAlexW3040061546MaRDI QIDQ5138879

Oriol Farràs, Carles Padró, Tarik Kaced, Sebastià Martín

Publication date: 4 December 2020

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.2020.3005706

zbMATH Keywords

lower boundsVamos matroidinformation ratio of secret sharing schemesnon-Shannon-type bounds

Mathematics Subject Classification ID

Linear programming (90C05) Authentication, digital signatures and secret sharing (94A62)

Related Items

Secret sharing on regular bipartite access structures, On abelian and homomorphic secret sharing schemes