On Matroids and Nonideal Secret Sharing

DOI10.1109/TIT.2008.921708zbMATH Open1328.94074MaRDI QIDQ3604544FDOQ3604544

Authors: Amos Beimel, Noam Livne 

Publication date: 24 February 2009

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

Recommendations

• Theory of Cryptography
• Matroids Can Be Far from Ideal Secret Sharing
• On Secret Sharing Schemes, Matroids and Polymatroids
• On secret sharing schemes, matroids and polymatroids
• Secret sharing schemes for ports of matroids of rank 3.

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Authentication, digital signatures and secret sharing (94A62)

Cited In (19)

• Matroids Can Be Far from Ideal Secret Sharing
• Secret sharing schemes for ports of matroids of rank 3
• On the diameter of matroid ports
• Improved upper bounds for the information rates of the secret sharing schemes induced by the Vámos matroid
• On the composition of matroids and ideal secret sharing schemes
• On secret-sharing matroids
• On ideal homomorphic secret sharing schemes and their decomposition
• Ideal secret sharing schemes whose minimal qualified subsets have at most three participants
• A representation of a family of secret sharing matroids
• Title not available (Why is that?)
• On the Power of Nonlinear Secret-Sharing
• Title not available (Why is that?)
• Common information, matroid representation, and secret sharing for matroid ports
• Ideal Secret Sharing Schemes Whose Minimal Qualified Subsets Have at Most Three Participants
• On abelian and homomorphic secret sharing schemes
• On ideal and weakly-ideal access structures
• On Codes, Matroids, and Secure Multiparty Computation From Linear Secret-Sharing Schemes
• On secret sharing schemes, matroids and polymatroids
• Theory of Cryptography

This page was built for publication: On Matroids and Nonideal Secret Sharing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3604544)