The size of a share must be large
From MaRDI portal
Publication:1382142
DOI10.1007/s001459900029zbMath0897.94012OpenAlexW2076645411MaRDI QIDQ1382142
Publication date: 19 October 1998
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s001459900029
Related Items (52)
Upslices, downslices, and secret-sharing with complexity of \(1.5^n\) ⋮ Quadratic secret sharing and conditional disclosure of secrets ⋮ Secret-sharing schemes for very dense graphs ⋮ On the power of amortization in secret sharing: \(d\)-uniform secret sharing and CDS with constant information rate ⋮ Optimal linear secret sharing schemes for graph access structures on six participants ⋮ Secret sharing on large girth graphs ⋮ Threshold Secret Sharing Requires a Linear Size Alphabet ⋮ Towards breaking the exponential barrier for general secret sharing ⋮ Improving the linear programming technique in the search for lower bounds in secret sharing ⋮ Recent Advances in Non-perfect Secret Sharing Schemes ⋮ On an infinite family of graphs with information ratio \(2 - 1/k\) ⋮ Secret sharing based on quantum Fourier transform ⋮ Bounds and constructions for unconditionally secure distributed key distribution schemes for general access structures ⋮ The optimal average information ratio of secret-sharing schemes for the access structures based on unicycle graphs and bipartite graphs ⋮ Local bounds for the optimal information ratio of secret sharing schemes ⋮ On the information ratio of non-perfect secret sharing schemes ⋮ Access structures determined by uniform polymatroids ⋮ Bipartite secret sharing and staircases ⋮ Sharing one secret vs. sharing many secrets. ⋮ Algebraic Cryptanalysis of CTRU Cryptosystem ⋮ The complexity of the graph access structures on six participants ⋮ Finding lower bounds on the complexity of secret sharing schemes by linear programming ⋮ Ideal multipartite secret sharing schemes ⋮ Secret sharing on regular bipartite access structures ⋮ Common information, matroid representation, and secret sharing for matroid ports ⋮ Optimal information ratio of secret sharing schemes on Dutch windmill graphs ⋮ On the information ratio of graphs without high-degree neighbors ⋮ Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification ⋮ Probabilistic secret sharing ⋮ On group-characterizability of homomorphic secret sharing schemes ⋮ Secret-Sharing Schemes: A Survey ⋮ Ideal Secret Sharing Schemes for Useful Multipartite Access Structures ⋮ Improved upper bounds for the information rates of the secret sharing schemes induced by the Vámos matroid ⋮ Extending Brickell-Davenport theorem to non-perfect secret sharing schemes ⋮ An ideal multi-secret sharing scheme based on MSP ⋮ Optimal assignment schemes for general access structures based on linear programming ⋮ Sharing multiple secrets: Models, schemes and analysis ⋮ How to share a secret ⋮ Optimal complexity of secret sharing schemes with four minimal qualified subsets ⋮ On secret sharing schemes, matroids and polymatroids ⋮ Matroids Can Be Far from Ideal Secret Sharing ⋮ The exact values of the optimal average information ratio of perfect secret-sharing schemes for tree-based access structures ⋮ Ideal secret sharing schemes whose minimal qualified subsets have at most three participants ⋮ On abelian and homomorphic secret sharing schemes ⋮ Secret Sharing Schemes for Dense Forbidden Graphs ⋮ Hypergraph decomposition and secret sharing ⋮ On the optimization of bipartite secret sharing schemes ⋮ Ideal Hierarchical Secret Sharing Schemes ⋮ Unnamed Item ⋮ An impossibility result on graph secret sharing ⋮ Secret sharing schemes for ports of matroids of rank 3 ⋮ Some Open Problems in Information-Theoretic Cryptography
This page was built for publication: The size of a share must be large
