On Secret Sharing Schemes, Matroids and Polymatroids

DOI10.1007/978-3-540-70936-7_15zbMath1129.94029OpenAlexW2178407497MaRDI QIDQ3596383

Carles Padró, Jaume Martí-Farré

Publication date: 30 August 2007

Published in: Theory of Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-70936-7_15

zbMATH Keywords

MatroidsSecret sharingPolymatroidsIdeal access structuresIdeal secret sharing schemesInformation rate

Mathematics Subject Classification ID

Cryptography (94A60) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (9)

The free product of M-fuzzifying matroids1 ⋮ On-line secret sharing ⋮ Secret-Sharing Schemes: A Survey ⋮ Efficient robust secret sharing from expander graphs ⋮ Extensions of access structures and their cryptographic applications ⋮ Matroids Can Be Far from Ideal Secret Sharing ⋮ Ideal secret sharing schemes whose minimal qualified subsets have at most three participants ⋮ Ideal Hierarchical Secret Sharing Schemes ⋮ An impossibility result on graph secret sharing

This page was built for publication: On Secret Sharing Schemes, Matroids and Polymatroids