Ideal multipartite secret sharing schemes
From MaRDI portal
Publication:434350
DOI10.1007/s00145-011-9101-6zbMath1272.94078OpenAlexW2046021070MaRDI QIDQ434350
Oriol Farràs, Carles Padró, Jaume Martí-Farré
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
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)
Related Items
Secret-sharing schemes for very dense graphs, Local bounds for the optimal information ratio of secret sharing schemes, Access structures determined by uniform polymatroids, Secret Sharing Schemes for (k, n)-Consecutive Access Structures, Bipartite secret sharing and staircases, Ideal uniform multipartite secret sharing schemes, A new efficient hierarchical multi-secret sharing scheme based on linear homogeneous recurrence relations, Rational quantum secret sharing scheme based on GHZ state, Strong security of linear ramp secret sharing schemes with general access structures, Ideal hierarchical secret sharing and lattice path matroids, Multiplicative and verifiably multiplicative secret sharing for multipartite adversary structures, Secret sharing on regular bipartite access structures, Linear threshold multisecret sharing schemes, Operations over Linear Secret Sharing Schemes, Secret sharing schemes for compartmented access structures, Extending Brickell-Davenport theorem to non-perfect secret sharing schemes, How to share a secret, On abelian and homomorphic secret sharing schemes, Multilevel secret sharing schemes arising from the normal rational curve, Efficient explicit constructions of compartmented secret sharing schemes, Secret sharing schemes for ports of matroids of rank 3, Practical (fully) distributed signatures provably secure in the standard model
Cites Work
- Unnamed Item
- 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
- The size of a share must be large
- Almost affine codes
- A representation of a family of secret sharing matroids
- Inequalities for Shannon entropy and Kolmogorov complexity
- Weighted threshold secret sharing schemes
- Secret sharing schemes with three or four minimal qualified subsets
- 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
- Characterizing Ideal Weighted Threshold Secret Sharing
- A FORBIDDEN MINOR CHARACTERIZATION OF MATROID PORTS
- Discrete Convex Analysis
- On secret sharing systems
- A Solution of the Shannon Switching Game
- On the composition of matroids and ideal secret sharing schemes
