Bipartite secret sharing and staircases

DOI10.1016/j.disc.2024.113909arXiv2103.04904OpenAlexW3133748407MaRDI QIDQ6124455

Carles Padró, František Matúš, László Csirmaz

Publication date: 27 March 2024

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2103.04904

zbMATH Keywords

cryptographyentropy methodsubmodular optimizationlinear secret sharingmultipartite secret sharing

Mathematics Subject Classification ID

Cryptography (94A60) Measures of information, entropy (94A17) Authentication, digital signatures and secret sharing (94A62)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Ideal multipartite secret sharing schemes
• On the optimization of bipartite secret sharing schemes
• Tight bounds on the information rate of secret sharing schemes
• The size of a share must be large
• Classes of matroids closed under minors and principal extensions
• Secret sharing on the \(d\)-dimensional cube
• Submodular functions and optimization.
• Secret sharing schemes with bipartite access structure
• Optimal Information Rate of Secret Sharing Schemes on Trees
• Secret-Sharing Schemes: A Survey
• How to share a secret
• On secret sharing schemes, matroids and polymatroids
• A FORBIDDEN MINOR CHARACTERIZATION OF MATROID PORTS
• Conditional Independences among Four Random Variables I
• A Solution of the Shannon Switching Game
• Conditions for representability and transversality of matroids
• Theory of Cryptography

This page was built for publication: Bipartite secret sharing and staircases