On the size of shares for secret sharing schemes
From MaRDI portal
Publication:1310452
DOI10.1007/BF00198463zbMath0786.68030MaRDI QIDQ1310452
Renato M. Capocelli, Luisa Gargano, Alfredo De Santis, Ugo Vaccaro
Publication date: 3 January 1994
Published in: Journal of Cryptology (Search for Journal in Brave)
Related Items (71)
More information theoretical inequalities to be used in secret sharing? ⋮ Secret-sharing schemes for very dense graphs ⋮ On secret sharing schemes ⋮ On the power of amortization in secret sharing: \(d\)-uniform secret sharing and CDS with constant information rate ⋮ On Entropy, Information Inequalities, and Groups ⋮ A novel group key transfer for big data security ⋮ ZCZ -- achieving \(n\)-bit SPRP security with a minimal number of tweakable-block-cipher calls ⋮ Optimal linear secret sharing schemes for graph access structures on six participants ⋮ On the information rate of perfect secret sharing schemes ⋮ A note on secret sharing schemes with three homogeneous access structure ⋮ A note on dynamic threshold schemes ⋮ Threshold Secret Sharing Requires a Linear Size Alphabet ⋮ Secret sharing schemes with partial broadcast channels ⋮ 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\) ⋮ Anonymous secret sharing schemes ⋮ On the information ratio of non-perfect secret sharing schemes ⋮ Sharing one secret vs. sharing many secrets. ⋮ On identification secret sharing schemes. ⋮ The complexity of the graph access structures on six participants ⋮ Ideal multipartite secret sharing schemes ⋮ Constructing ideal secret sharing schemes based on Chinese remainder theorem ⋮ Recursive constructions for perfect secret sharing schemes ⋮ On Linear Secret Sharing for Connectivity in Directed Graphs ⋮ Optimal information ratio of secret sharing schemes on Dutch windmill graphs ⋮ On-line secret sharing ⋮ Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification ⋮ Conditional Disclosure of Secrets: Amplification, Closure, Amortization, Lower-bounds, and Separations ⋮ 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 ⋮ Fully dynamic secret sharing schemes ⋮ On the information rate of secret sharing schemes ⋮ Lower bounds for monotone span programs ⋮ Secure computation without computers ⋮ Improved upper bounds for the information rates of the secret sharing schemes induced by the Vámos matroid ⋮ An ideal multi-secret sharing scheme based on MSP ⋮ A general approach to robust web metering ⋮ Optimal assignment schemes for general access structures based on linear programming ⋮ Secret sharing schemes with three or four minimal qualified subsets ⋮ Secret sharing schemes on access structures with intersection number equal to one ⋮ Sharing multiple secrets: Models, schemes and analysis ⋮ Quantum strongly secure ramp secret sharing ⋮ How to share a secret ⋮ Optimal complexity of secret sharing schemes with four minimal qualified subsets ⋮ Unnamed Item ⋮ On secret sharing schemes, matroids and polymatroids ⋮ Reduced access structures with four minimal qualified subsets on six participants ⋮ Matroids Can Be Far from Ideal Secret Sharing ⋮ The communication complexity of private simultaneous messages, revisited ⋮ Placing conditional disclosure of secrets in the communication complexity universe ⋮ Ideal secret sharing schemes whose minimal qualified subsets have at most three participants ⋮ On abelian and homomorphic secret sharing schemes ⋮ The Latin squares and the secret sharing schemes ⋮ A lower bound on the encoding length in lossy transmission ⋮ General information dispersal algorithms ⋮ 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 ⋮ Strongly secure ramp secret sharing schemes for general access structures ⋮ Graph decompositions and secret sharing schemes ⋮ ON THE DEALER'S RANDOMNESS REQUIRED IN PERFECT SECRET SHARING SCHEMES WITH ACCESS STRUCTURES OF CONSTANT RANK ⋮ Lower bounds on the information rate of secret sharing schemes with homogeneous access structure. ⋮ General Secret Sharing Based on the Chinese Remainder Theorem with Applications in E-Voting ⋮ Randomness in distribution protocols ⋮ Probability of shares in secret sharing schemes ⋮ Weighted decomposition construction for perfect secret sharing schemes
Cites Work
This page was built for publication: On the size of shares for secret sharing schemes
