On the information ratio of non-perfect secret sharing schemes
From MaRDI portal
Publication:1688395
DOI10.1007/s00453-016-0217-9zbMath1405.94102OpenAlexW2524272550MaRDI QIDQ1688395
Oriol Farràs, Torben Brandt Hansen, Tarik Kaced, Carles Padró
Publication date: 5 January 2018
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2117/114396
Related Items (6)
Optimal linear secret sharing schemes for graph access structures on six participants ⋮ Local bounds for the optimal information ratio of secret sharing schemes ⋮ Strong security of linear ramp secret sharing schemes with general access structures ⋮ On group-characterizability of homomorphic secret sharing schemes ⋮ On ideal homomorphic secret sharing schemes and their decomposition ⋮ On abelian and homomorphic secret sharing schemes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Secret-sharing schemes for very dense graphs
- Robust vector space secret sharing schemes
- On the optimization of bipartite secret sharing schemes
- On the classification of ideal secret sharing schemes
- On the size of shares for secret sharing schemes
- Geometric secret sharing schemes and their duals
- The size of a share must be large
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Finding lower bounds on the complexity of secret sharing schemes by linear programming
- Extending Brickell-Davenport theorem to non-perfect secret sharing schemes
- Secret Sharing, Rank Inequalities and Information Inequalities
- Optimal Non-perfect Uniform Secret Sharing Schemes
- Security of Ramp Schemes
- Optimal Information Rate of Secret Sharing Schemes on Trees
- Secret-Sharing Schemes: A Survey
- How to share a secret
- On secret sharing schemes, matroids and polymatroids
- Threshold Secret Sharing Requires a Linear Size Alphabet
- Recent Advances in Non-perfect Secret Sharing Schemes
- Polymatroidal dependence structure of a set of random variables
- On secret sharing systems
- Optimum General Threshold Secret Sharing
- Secret Sharing and Non-Shannon Information Inequalities
- Bounds on the Threshold Gap in Secret Sharing and its Applications
- Atomic Secure Multi-party Multiplication with Low Communication
- Matroids Can Be Far from Ideal Secret Sharing
- Strongly Multiplicative Ramp Schemes from High Degree Rational Points on Curves
- Elements of Information Theory
- Multi-linear Secret-Sharing Schemes
This page was built for publication: On the information ratio of non-perfect secret sharing schemes
