Ideal multipartite secret sharing schemes
From MaRDI portal
Publication:434350
DOI10.1007/S00145-011-9101-6zbMATH Open1272.94078OpenAlexW2046021070MaRDI QIDQ434350FDOQ434350
Authors: Oriol Farràs, Jaume Martí-Farré, Carles Padró 
Publication date: 10 July 2012
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.304.9114
Recommendations
- Ideal Multipartite Secret Sharing Schemes
- Ideal secret sharing schemes for useful multipartite access structures
- Efficient explicit constructions of multipartite secret sharing schemes
- Ideal hierarchical secret sharing schemes
- Ideal Secret Sharing Schemes Whose Minimal Qualified Subsets Have at Most Three Participants
secret sharingideal tripartite access structuresinteger polymatroidsmultipartite access structuremultipartite matroid ports
Combinatorial aspects of matroids and geometric lattices (05B35) Authentication, digital signatures and secret sharing (94A62)
Cites Work
- Discrete Convex Analysis
- Title not available (Why is that?)
- Title not available (Why is that?)
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- How to share a secret
- A Solution of the Shannon Switching Game
- On the classification of ideal secret sharing schemes
- Submodular functions and optimization
- On secret-sharing matroids
- Matroid representations by partitions
- Almost affine codes
- On secret sharing schemes, matroids and polymatroids
- An explication of secret sharing schemes
- On the size of shares for secret sharing schemes
- On secret sharing systems
- Perfect secret sharing schemes on five participants
- The size of a share must be large
- Secret sharing schemes with three or four minimal qualified subsets
- Secret sharing schemes with bipartite access structure
- Title not available (Why is that?)
- Title not available (Why is that?)
- Ideal hierarchical secret sharing schemes
- On 2-level secret sharing
- Discrete polymatroids
- A FORBIDDEN MINOR CHARACTERIZATION OF MATROID PORTS
- Three-level secret sharing schemes from the twisted cubic
- Multipartite secret sharing by bivariate interpolation
- A representation of a family of secret sharing matroids
- Inequalities for Shannon entropy and Kolmogorov complexity
- Weighted threshold secret sharing schemes
- Ideal secret sharing schemes with multipartite access structures
- Characterizing Ideal Weighted Threshold Secret Sharing
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the composition of matroids and ideal secret sharing schemes
- Hierarchical threshold secret sharing
Cited In (33)
- Rational quantum secret sharing scheme based on GHZ state
- Efficient Explicit Constructions of Multipartite Secret Sharing Schemes
- Natural generalizations of threshold secret sharing
- Secret-sharing schemes for very dense graphs
- Practical (fully) distributed signatures provably secure in the standard model
- Ideal Multipartite Secret Sharing Schemes
- On the classification of ideal secret sharing schemes
- Secret sharing schemes for ports of matroids of rank 3.
- Ideal secret sharing schemes whose minimal qualified subsets have at most three participants
- Operations over linear secret sharing schemes
- Strongly ideal secret sharing schemes
- Linear threshold multisecret sharing schemes
- Ideal uniform multipartite secret sharing schemes
- Strong security of linear ramp secret sharing schemes with general access structures
- Efficient explicit constructions of compartmented secret sharing schemes
- Multiplicative and verifiably multiplicative secret sharing for multipartite adversary structures
- Title not available (Why is that?)
- A new efficient hierarchical multi-secret sharing scheme based on linear homogeneous recurrence relations
- Ideal secret sharing schemes with multiple secrets
- On abelian and homomorphic secret sharing schemes
- Access structures determined by uniform polymatroids
- How to share a secret
- Multilevel secret sharing schemes arising from the normal rational curve
- Ideal secret sharing schemes for useful multipartite access structures
- Secret Sharing Schemes for (k, n)-Consecutive Access Structures
- Multipartite Secret Sharing by Bivariate Interpolation
- Ideal hierarchical secret sharing and lattice path matroids
- Secret sharing on regular bipartite access structures
- Extending Brickell-Davenport theorem to non-perfect secret sharing schemes
- Secret sharing schemes for compartmented access structures
- Bipartite secret sharing and staircases
- Local bounds for the optimal information ratio of secret sharing schemes
- Efficient explicit constructions of multipartite secret sharing schemes
This page was built for publication: Ideal multipartite secret sharing schemes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q434350)
