Geometric secret sharing schemes and their duals
From MaRDI portal
Publication:1321560
DOI10.1007/BF01388562zbMath0794.94010OpenAlexW2003753892MaRDI QIDQ1321560
Keith M. Martin, Wen-Ai Jackson
Publication date: 11 September 1994
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01388562
Related Items
On the information rate of perfect secret sharing schemes, Distributed ring signatures from general dual access structures, Generalised cumulative arrays in secret sharing, 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, On the information ratio of non-perfect secret sharing schemes, Secret Sharing Schemes for (k, n)-Consecutive Access Structures, Finding lower bounds on the complexity of secret sharing schemes by linear programming, Secret sharing on regular bipartite access structures, Common information, matroid representation, and secret sharing for matroid ports, On group-characterizability of homomorphic secret sharing schemes, Lower bounds for monotone span programs, A general approach to robust web metering, Secret sharing schemes with three or four minimal qualified subsets, Secret sharing schemes on access structures with intersection number equal to one, Optimal complexity of secret sharing schemes with four minimal qualified subsets, On secret sharing schemes, matroids and polymatroids, Reduced access structures with four minimal qualified subsets on six participants, On abelian and homomorphic secret sharing schemes, Generation of key predistribution schemes using secret sharing schemes, On the optimization of bipartite secret sharing schemes, Shared generation of pseudo-random functions, Multilevel secret sharing schemes arising from the normal rational curve, Matroid representations by partitions, Secret sharing schemes for ports of matroids of rank 3
Cites Work
