Secret sharing schemes with bipartite access structure

DOI10.1109/18.887867zbMath0999.94031OpenAlexW2101330985MaRDI QIDQ2705984

Carles Padró, Germán Sáez

Publication date: 19 March 2001

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/1759be641d04ff402a47577eba7c354c9c667cf9

zbMATH Keywords

cryptographyinformation ratesecret-sharing schemesbipartite access

Mathematics Subject Classification ID

Measures of information, entropy (94A17) Authentication, digital signatures and secret sharing (94A62)

Related Items

Ideal secret sharing schemes on graph-based $3$-homogeneous access structures, Secret-sharing schemes for very dense graphs, Optimal linear secret sharing schemes for graph access structures on six participants, A note on secret sharing schemes with three homogeneous access structure, Improving the linear programming technique in the search for lower bounds in secret sharing, Bounds and constructions for unconditionally secure distributed key distribution schemes for general access structures, Approximation and decomposition in lattices of clutters, Secret Sharing Schemes for (k, n)-Consecutive Access Structures, Bipartite secret sharing and staircases, A new efficient hierarchical multi-secret sharing scheme based on linear homogeneous recurrence relations, Ideal multipartite secret sharing schemes, Ideal hierarchical secret sharing and lattice path matroids, Secret sharing on regular bipartite access structures, On Linear Secret Sharing for Connectivity in Directed Graphs, Optimal information ratio of secret sharing schemes on Dutch windmill graphs, Ideal Secret Sharing Schemes for Useful Multipartite Access Structures, New bounds on the average information rate of secret-sharing schemes for graph-based weighted threshold access structures, Secret sharing schemes with three or four minimal qualified subsets, Secret sharing schemes on access structures with intersection number equal to one, Three-level secret sharing schemes from the twisted cubic, How to share a secret, Optimal complexity of secret sharing schemes with four minimal qualified subsets, On secret sharing schemes, matroids and polymatroids, Extensions of access structures and their cryptographic applications, Reduced access structures with four minimal qualified subsets on six participants, Ideal secret sharing schemes whose minimal qualified subsets have at most three participants, On abelian and homomorphic secret sharing schemes, Multipartite secret sharing by bivariate interpolation, On the optimization of bipartite secret sharing schemes, Ideal Hierarchical Secret Sharing Schemes, Efficient explicit constructions of compartmented secret sharing schemes, A rational threshold signature model and protocol based on different permissions, Lower bounds on the information rate of secret sharing schemes with homogeneous access structure.