Matroids Can Be Far from Ideal Secret Sharing

DOI10.1007/978-3-540-78524-8_12zbMath1162.94337OpenAlexW1509869316MaRDI QIDQ5445507

Noam Livne, Carles Padró, Amos Beimel

Publication date: 5 March 2008

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

Full work available at URL: https://doi.org/10.1007/978-3-540-78524-8_12

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (17)

Improving the linear programming technique in the search for lower bounds in secret sharing ⋮ On the information ratio of non-perfect secret sharing schemes ⋮ Finding lower bounds on the complexity of secret sharing schemes by linear programming ⋮ Common information, matroid representation, and secret sharing for matroid ports ⋮ On group-characterizability of homomorphic secret sharing schemes ⋮ Secret-Sharing Schemes: A Survey ⋮ Ideal Secret Sharing Schemes for Useful Multipartite Access Structures ⋮ Improved upper bounds for the information rates of the secret sharing schemes induced by the Vámos matroid ⋮ Extending Brickell-Davenport theorem to non-perfect secret sharing schemes ⋮ Optimal assignment schemes for general access structures based on linear programming ⋮ How to share a secret ⋮ Optimal complexity of secret sharing schemes with four minimal qualified subsets ⋮ Introduction to Secret-Sharing ⋮ On abelian and homomorphic secret sharing schemes ⋮ On the optimization of bipartite secret sharing schemes ⋮ An impossibility result on graph secret sharing ⋮ Secret sharing schemes for ports of matroids of rank 3

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On secret sharing schemes
• On the classification of ideal secret sharing schemes
• Some improved bounds on the information rate of perfect secret sharing schemes
• On secret-sharing matroids
• Secret sharing over infinite domains
• Matroid representations by partitions
• On the size of shares for secret sharing schemes
• The size of a share must be large
• Almost affine codes
• Secret sharing schemes with three or four minimal qualified subsets
• How to share a secret
• Networks, Matroids, and Non-Shannon Information Inequalities
• Two Constructions on Limits of Entropy Functions
• On Secret Sharing Schemes, Matroids and Polymatroids
• A FORBIDDEN MINOR CHARACTERIZATION OF MATROID PORTS
• On characterization of entropy function via information inequalities
• On secret sharing systems
• Universally ideal secret-sharing schemes
• The Dual of the Notion of “Finitely Generated”
• Conditions for representability and transversality of matroids
• Theory of Cryptography

This page was built for publication: Matroids Can Be Far from Ideal Secret Sharing