Secret sharing schemes for ports of matroids of rank 3
From MaRDI portal
Publication:5858541
DOI10.14736/kyb-2020-5-0903OpenAlexW3111723048MaRDI QIDQ5858541
Publication date: 13 April 2021
Published in: Kybernetika (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10338.dmlcz/148490
Cryptography (94A60) Combinatorial aspects of matroids and geometric lattices (05B35) Authentication, digital signatures and secret sharing (94A62)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Secret-sharing matroids need not be algebraic
- On the number of matroids
- Ideal multipartite secret sharing schemes
- Erdős-Pyber theorem for hypergraphs and secret sharing
- Ideal secret sharing schemes whose minimal qualified subsets have at most three participants
- On the classification of ideal secret sharing schemes
- Matroid representations by partitions
- Geometric secret sharing schemes and their duals
- Covering a graph by complete bipartite graphs
- The size of a share must be large
- Almost affine codes
- The asymptotic number of geometries
- Improving the linear programming technique in the search for lower bounds in secret sharing
- Secret sharing schemes on sparse homogeneous access structures with rank three
- Graph decompositions and secret sharing schemes
- Superpolynomial lower bounds for monotone span programs
- On the asymptotic proportion of connected matroids
- Secret-sharing schemes for general and uniform access structures
- Adhesivity of polymatroids
- Secret-Sharing Schemes: A Survey
- How to share a secret
- On Matroids and Nonideal Secret Sharing
- Lower bounds for constant weight codes
- A FORBIDDEN MINOR CHARACTERIZATION OF MATROID PORTS
- PROBABILISTIC CONDITIONAL INDEPENDENCE STRUCTURES AND MATROID THEORY: BACKGROUND1
- Monotone Boolean functions
- Universally ideal secret-sharing schemes
- Breaking the circuit-size barrier in secret sharing
- Matroids Can Be Far from Ideal Secret Sharing
This page was built for publication: Secret sharing schemes for ports of matroids of rank 3