Perfect secret sharing schemes on five participants
From MaRDI portal
Publication:676919
zbMath0868.94035MaRDI QIDQ676919
Keith M. Martin, Wen-Ai Jackson
Publication date: 23 March 1997
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
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, More information theoretical inequalities to be used in secret sharing?, 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, On an infinite family of graphs with information ratio \(2 - 1/k\), The optimal average information ratio of secret-sharing schemes for the access structures based on unicycle graphs and bipartite graphs, Approximation and decomposition in lattices of clutters, Secret Sharing Schemes for (k, n)-Consecutive Access Structures, Finding lower bounds on the complexity of secret sharing schemes by linear programming, Ideal multipartite secret sharing schemes, Common information, matroid representation, and secret sharing for matroid ports, Optimal information ratio of secret sharing schemes on Dutch windmill graphs, The lower bound and exact value of the information rate of some developed graph access structures, On the information ratio of graphs without high-degree neighbors, On group-characterizability of homomorphic secret sharing schemes, 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, The complexity of the connected graph access structure on seven participants, A generalized information theoretical model for quantum secret sharing, Exact information ratios for secret sharing on small graphs with girth at least 5, Optimal assignment schemes for general access structures based on linear programming, Secret sharing on the \(d\)-dimensional cube, Secret sharing schemes on access structures with intersection number equal to one, Optimal complexity of secret sharing schemes with four minimal qualified subsets, 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 the optimization of bipartite 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
