scientific article; zbMATH DE number 708804
From MaRDI portal
zbMath0809.94010MaRDI QIDQ4318692
Publication date: 30 March 1995
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Lower bounds for robust secret sharing schemes, Secret-sharing schemes for very dense graphs, On secret sharing schemes, On Entropy, Information Inequalities, and Groups, Optimal linear secret sharing schemes for graph access structures on six participants, On the information rate of perfect secret sharing schemes, Improved constructions of secret sharing schemes by applying \((\lambda ,\omega )\)-decompositions, Anonymous secret sharing schemes, Secret sharing schemes for graph-based prohibited structures, The optimal average information ratio of secret-sharing schemes for the access structures based on unicycle graphs and bipartite graphs, Recursive constructions for perfect secret sharing schemes, Fully dynamic secret sharing schemes, New bounds on the average information rate of secret-sharing schemes for graph-based weighted threshold access structures, On the information rate of secret sharing schemes, An explication of secret sharing schemes, Optimal assignment schemes for general access structures based on linear programming, Optimal complexity of secret sharing schemes with four minimal qualified subsets, Hypergraph decomposition and secret sharing, Graph decompositions and secret sharing schemes, Lower bounds on the information rate of secret sharing schemes with homogeneous access structure., Weighted decomposition construction for perfect secret sharing schemes
