Optimal assignment schemes for general access structures based on linear programming
From MaRDI portal
Publication:2260793
DOI10.1007/s10623-013-9879-3zbMath1342.94080OpenAlexW2033171033MaRDI QIDQ2260793
Xuejia Lai, Qiang Li, Ke-Fei Chen, Xiang-Xue Li
Publication date: 12 March 2015
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-013-9879-3
linear programminginteger programmingsecret sharinginformation ratemultiple assignment schemeramp assignment scheme
Related Items (5)
Optimal linear secret sharing schemes for graph access structures on six participants ⋮ Improving the linear programming technique in the search for lower bounds in secret sharing ⋮ A perfect secret sharing scheme for general access structures ⋮ Finding the maximal adversary structure from any given access structure ⋮ Realizing secret sharing with general access structure
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Perfect secret sharing schemes on five participants
- A new polynomial-time algorithm for linear programming
- Improved constructions of secret sharing schemes by applying \((\lambda ,\omega )\)-decompositions
- On the classification of ideal secret sharing schemes
- Some improved bounds on the information rate of perfect secret sharing schemes
- An explication of secret sharing schemes
- A general decomposition construction for incomplete secret sharing schemes
- On the size of shares for secret sharing schemes
- The size of a share must be large
- Graph decompositions and secret sharing schemes
- On the information rate of perfect secret sharing schemes
- Security of Ramp Schemes
- How to share a secret
- Decomposition constructions for secret-sharing schemes
- On secret sharing systems
- Universally ideal secret-sharing schemes
- New bounds on the information rate of secret sharing schemes
- Matroids Can Be Far from Ideal Secret Sharing
- Theory of Cryptography
This page was built for publication: Optimal assignment schemes for general access structures based on linear programming
