Decomposition constructions for secret-sharing schemes

From MaRDI portal
Publication:4307278

DOI10.1109/18.272461zbMath0803.94017OpenAlexW2131278486MaRDI QIDQ4307278

Douglas R. Stinson

Publication date: 4 October 1994

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

Full work available at URL: https://semanticscholar.org/paper/7d0dd39ca633a5263163a608ab9c08bd4a873e19




Related Items (65)

Ideal secret sharing schemes on graph-based $3$-homogeneous access structuresLower bounds for robust secret sharing schemesSecret-sharing schemes for very dense graphsOn secret sharing schemesRobust vector space secret sharing schemesOn the power of amortization in secret sharing: \(d\)-uniform secret sharing and CDS with constant information rateOptimal linear secret sharing schemes for graph access structures on six participantsSecret sharing on large girth graphsSome democratic secret sharing schemesOn the information rate of perfect secret sharing schemesImproved constructions of secret sharing schemes by applying \((\lambda ,\omega )\)-decompositionsA note on secret sharing schemes with three homogeneous access structureImproving the linear programming technique in the search for lower bounds in secret sharingOn an infinite family of graphs with information ratio \(2 - 1/k\)Anonymous secret sharing schemesBounds and constructions for unconditionally secure distributed key distribution schemes for general access structuresSecret sharing schemes for graph-based prohibited structuresThe optimal average information ratio of secret-sharing schemes for the access structures based on unicycle graphs and bipartite graphsApproximation and decomposition in lattices of cluttersSecret Sharing Schemes for (k, n)-Consecutive Access StructuresComplexity of universal access structuresSharing one secret vs. sharing many secrets.On identification secret sharing schemes.Visual cryptography on graphsRational quantum secret sharing scheme based on GHZ stateStrong security of linear ramp secret sharing schemes with general access structuresFinding lower bounds on the complexity of secret sharing schemes by linear programmingRecursive constructions for perfect secret sharing schemesCommon information, matroid representation, and secret sharing for matroid portsOn Linear Secret Sharing for Connectivity in Directed GraphsA New (k,n)-Threshold Secret Sharing Scheme and Its ExtensionOptimal information ratio of secret sharing schemes on Dutch windmill graphsOn-line secret sharingOn the information ratio of graphs without high-degree neighborsSecret-Sharing Schemes: A SurveyIdeal Secret Sharing Schemes for Useful Multipartite Access StructuresFully dynamic secret sharing schemesNew bounds on the average information rate of secret-sharing schemes for graph-based weighted threshold access structuresErdős-Pyber theorem for hypergraphs and secret sharingOn ideal homomorphic secret sharing schemes and their decompositionOn the information rate of secret sharing schemesThe complexity of the connected graph access structure on seven participantsExact information ratios for secret sharing on small graphs with girth at least 5Optimal assignment schemes for general access structures based on linear programmingSecret sharing on the \(d\)-dimensional cubeSecret sharing schemes with three or four minimal qualified subsetsSecret sharing schemes on access structures with intersection number equal to oneSharing multiple secrets: Models, schemes and analysisOptimal complexity of secret sharing schemes with four minimal qualified subsetsOn secret sharing schemes, matroids and polymatroidsReduced access structures with four minimal qualified subsets on six participantsThe exact values of the optimal average information ratio of perfect secret-sharing schemes for tree-based access structuresA perfect threshold secret sharing scheme to identify cheatersOn abelian and homomorphic secret sharing schemesGeneral information dispersal algorithmsSecret Sharing Schemes for Dense Forbidden GraphsHypergraph decomposition and secret sharingOn the optimization of bipartite secret sharing schemesRandomness in secret sharing and visual cryptography schemesAn impossibility result on graph secret sharingGraph decompositions and secret sharing schemesON THE DEALER'S RANDOMNESS REQUIRED IN PERFECT SECRET SHARING SCHEMES WITH ACCESS STRUCTURES OF CONSTANT RANKLower bounds on the information rate of secret sharing schemes with homogeneous access structure.Randomness in distribution protocolsWeighted decomposition construction for perfect secret sharing schemes






This page was built for publication: Decomposition constructions for secret-sharing schemes