Approximation and decomposition in lattices of clutters

DOI10.1016/j.disc.2023.113445zbMath1515.94103OpenAlexW4366403205MaRDI QIDQ6041563

Anna de Mier, Jaume Martí-Farré

Publication date: 31 May 2023

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

Full work available at URL: https://doi.org/10.1016/j.disc.2023.113445

zbMATH Keywords

latticeclutterclutter decomposition

Mathematics Subject Classification ID

Cryptography (94A60) Combinatorial aspects of matroids and geometric lattices (05B35) Graph theory (05C99) Authentication, digital signatures and secret sharing (94A62)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• From clutters to matroids
• Transformation and decomposition of clutters into matroids
• Perfect secret sharing schemes on five participants
• An explication of secret sharing schemes
• Tight bounds on the information rate of secret sharing schemes
• Secret sharing schemes with three or four minimal qualified subsets
• Graph decompositions and secret sharing schemes
• Completion and decomposition of a clutter into representable matroids
• Uniform clutters and dominating sets of graphs
• Secret sharing schemes with bipartite access structure
• How to share a secret
• Decomposition constructions for secret-sharing schemes
• Bottleneck extrema

This page was built for publication: Approximation and decomposition in lattices of clutters