Ideal Secret Sharing Schemes for Useful Multipartite Access Structures
From MaRDI portal
Publication:3005583
DOI10.1007/978-3-642-20901-7_6zbMath1272.94079OpenAlexW137392596MaRDI QIDQ3005583
Publication date: 8 June 2011
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-20901-7_6
survey papersecret sharinginteger polymatroidsmultipartite secret sharingideal secret sharing schemeshierarchical secret sharing
Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Authentication, digital signatures and secret sharing (94A62)
Related Items (3)
A hierarchical graph model for conflict resolution with sequential moves ⋮ Homomorphic secret sharing for multipartite and general adversary structures supporting parallel evaluation of low-degree polynomials ⋮ Multiplicative and verifiably multiplicative secret sharing for multipartite adversary structures
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Perfect secret sharing schemes on five participants
- Three-level secret sharing schemes from the twisted cubic
- Hierarchical threshold secret sharing
- Multipartite secret sharing by bivariate interpolation
- On the classification of ideal secret sharing schemes
- Submodular functions and optimization
- An explication of secret sharing schemes
- On secret-sharing matroids
- Matroid representations by partitions
- On the size of shares for secret sharing schemes
- Tight bounds on the information rate of secret sharing schemes
- The size of a share must be large
- Almost affine codes
- Inequalities for Shannon entropy and Kolmogorov complexity
- Weighted threshold secret sharing schemes
- On 2-level secret sharing
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Discrete polymatroids
- Secret sharing schemes with bipartite access structure
- Ideal secret sharing schemes with multipartite access structures
- How to share a secret
- On secret sharing schemes, matroids and polymatroids
- Ideal Hierarchical Secret Sharing Schemes
- Secret Sharing and Non-Shannon Information Inequalities
- Characterizing Ideal Weighted Threshold Secret Sharing
- Decomposition constructions for secret-sharing schemes
- Discrete Convex Analysis
- On secret sharing systems
- Universally ideal secret-sharing schemes
- On the Optimization of Bipartite Secret Sharing Schemes
- Separating the Power of Monotone Span Programs over Different Fields
- On the Power of Nonlinear Secret-Sharing
- Ideal Multipartite Secret Sharing Schemes
- Matroids Can Be Far from Ideal Secret Sharing
- Excluded minors for Boolean polymatroids
This page was built for publication: Ideal Secret Sharing Schemes for Useful Multipartite Access Structures
