On the information rate of perfect secret sharing schemes
From MaRDI portal
Publication:1894277
DOI10.1007/BF01398012zbMath0829.94006OpenAlexW2160940849MaRDI QIDQ1894277
Publication date: 24 July 1995
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01398012
Applications of graph theory (05C90) Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Measures of information, entropy (94A17)
Related Items (43)
More information theoretical inequalities to be used in secret sharing? ⋮ Secret-sharing schemes for very dense graphs ⋮ On secret sharing schemes ⋮ An asymptotically perfect secret sharing scheme based on the Chinese Remainder Theorem ⋮ Optimal linear secret sharing schemes for graph access structures on six participants ⋮ Secret sharing on large girth graphs ⋮ Improved constructions of secret sharing schemes by applying \((\lambda ,\omega )\)-decompositions ⋮ 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\) ⋮ Bounds and constructions for unconditionally secure distributed key distribution schemes for general access structures ⋮ Secret sharing schemes for graph-based prohibited structures ⋮ The optimal average information ratio of secret-sharing schemes for the access structures based on unicycle graphs and bipartite graphs ⋮ Sharing one secret vs. sharing many secrets. ⋮ The complexity of the graph access structures on six participants ⋮ Finding lower bounds on the complexity of secret sharing schemes by linear programming ⋮ Secret sharing on regular bipartite access structures ⋮ Recursive constructions for perfect secret sharing schemes ⋮ Common information, matroid representation, and secret sharing for matroid ports ⋮ On Linear Secret Sharing for Connectivity in Directed Graphs ⋮ Optimal information ratio of secret sharing schemes on Dutch windmill graphs ⋮ On-line secret sharing ⋮ 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 ⋮ Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification ⋮ On group-characterizability of homomorphic secret sharing schemes ⋮ Secret-Sharing Schemes: A Survey ⋮ Fully dynamic secret sharing schemes ⋮ New bounds on the average information rate of secret-sharing schemes for graph-based weighted threshold access structures ⋮ Lower bounds for monotone span programs ⋮ 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 ⋮ Sharing multiple secrets: Models, schemes and analysis ⋮ Optimal complexity of secret sharing schemes with four minimal qualified subsets ⋮ Reduced access structures with four minimal qualified subsets on six participants ⋮ The exact values of the optimal average information ratio of perfect secret-sharing schemes for tree-based access structures ⋮ Secret Sharing Schemes for Dense Forbidden Graphs ⋮ Hypergraph decomposition and secret sharing ⋮ On the optimization of bipartite secret sharing schemes ⋮ An impossibility result on graph secret sharing ⋮ A New Approach to Image Sharing with High-Security Threshold Structure ⋮ ON THE DEALER'S RANDOMNESS REQUIRED IN PERFECT SECRET SHARING SCHEMES WITH ACCESS STRUCTURES OF CONSTANT RANK ⋮ Weighted decomposition construction for perfect secret sharing schemes
Cites Work
- On the classification of ideal secret sharing schemes
- Some improved bounds on the information rate of perfect secret sharing schemes
- An explication of secret sharing schemes
- On the size of shares for secret sharing schemes
- Geometric secret sharing schemes and their duals
- How to share a secret
- Decomposition constructions for secret-sharing schemes
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the information rate of perfect secret sharing schemes
