Pages that link to "Item:Q1894277"
From MaRDI portal
The following pages link to On the information rate of perfect secret sharing schemes (Q1894277):
Displaying 44 items.
- More information theoretical inequalities to be used in secret sharing? (Q287126) (← links)
- Secret-sharing schemes for very dense graphs (Q290386) (← links)
- On secret sharing schemes (Q293172) (← links)
- New bounds on the average information rate of secret-sharing schemes for graph-based weighted threshold access structures (Q497216) (← links)
- Bounds and constructions for unconditionally secure distributed key distribution schemes for general access structures (Q596095) (← links)
- On-line secret sharing (Q664393) (← links)
- Fully dynamic secret sharing schemes (Q671527) (← links)
- Lower bounds for monotone span programs (Q677989) (← links)
- Optimal complexity of secret sharing schemes with four minimal qualified subsets (Q717150) (← links)
- On the optimization of bipartite secret sharing schemes (Q766238) (← links)
- Improved constructions of secret sharing schemes by applying \((\lambda ,\omega )\)-decompositions (Q845708) (← links)
- Hypergraph decomposition and secret sharing (Q1028420) (← links)
- An impossibility result on graph secret sharing (Q1039271) (← links)
- Secret sharing schemes for graph-based prohibited structures (Q1125037) (← links)
- Sharing one secret vs. sharing many secrets. (Q1401235) (← links)
- Weighted decomposition construction for perfect secret sharing schemes (Q1609153) (← links)
- Improving the linear programming technique in the search for lower bounds in secret sharing (Q1648816) (← links)
- Optimal information ratio of secret sharing schemes on Dutch windmill graphs (Q1726013) (← links)
- Reduced access structures with four minimal qualified subsets on six participants (Q1783720) (← links)
- The complexity of the graph access structures on six participants (Q1943986) (← links)
- Finding lower bounds on the complexity of secret sharing schemes by linear programming (Q1949113) (← links)
- Recursive constructions for perfect secret sharing schemes (Q1962965) (← links)
- Exact information ratios for secret sharing on small graphs with girth at least 5 (Q2003345) (← links)
- Common information, matroid representation, and secret sharing for matroid ports (Q2220766) (← links)
- On the information ratio of graphs without high-degree neighbors (Q2231745) (← links)
- Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification (Q2232597) (← links)
- On group-characterizability of homomorphic secret sharing schemes (Q2235752) (← links)
- Optimal assignment schemes for general access structures based on linear programming (Q2260793) (← links)
- Secret sharing on the \(d\)-dimensional cube (Q2260799) (← links)
- On an infinite family of graphs with information ratio \(2 - 1/k\) (Q2390949) (← links)
- The optimal average information ratio of secret-sharing schemes for the access structures based on unicycle graphs and bipartite graphs (Q2410257) (← links)
- Sharing multiple secrets: Models, schemes and analysis (Q2491290) (← links)
- The exact values of the optimal average information ratio of perfect secret-sharing schemes for tree-based access structures (Q2510652) (← links)
- Optimal linear secret sharing schemes for graph access structures on six participants (Q2632007) (← links)
- Secret sharing on large girth graphs (Q2632835) (← links)
- Secret sharing on regular bipartite access structures (Q2701503) (← links)
- Secret Sharing Schemes for Dense Forbidden Graphs (Q2827736) (← links)
- Secret-Sharing Schemes: A Survey (Q3005578) (← links)
- An asymptotically perfect secret sharing scheme based on the Chinese Remainder Theorem (Q3174872) (← links)
- On Linear Secret Sharing for Connectivity in Directed Graphs (Q3540044) (← links)
- The lower bound and exact value of the information rate of some developed graph access structures (Q5145937) (← links)
- ON THE DEALER'S RANDOMNESS REQUIRED IN PERFECT SECRET SHARING SCHEMES WITH ACCESS STRUCTURES OF CONSTANT RANK (Q5249040) (← links)
- A New Approach to Image Sharing with High-Security Threshold Structure (Q5501945) (← links)
- The quantum secret sharing schemes based on hyperstar access structures (Q6497344) (← links)