Recommendations
- Secret sharing schemes for very dense graphs
- Secret sharing schemes for dense forbidden graphs
- The share size of secret-sharing schemes for almost all access structures and graphs
- Linear secret-sharing schemes for forbidden graph access structures
- Some improved bounds on the information rate of perfect secret sharing schemes
Cites work
- scientific article; zbMATH DE number 4179276 (Why is no real title available?)
- scientific article; zbMATH DE number 4012495 (Why is no real title available?)
- scientific article; zbMATH DE number 176567 (Why is no real title available?)
- scientific article; zbMATH DE number 4123667 (Why is no real title available?)
- scientific article; zbMATH DE number 708804 (Why is no real title available?)
- scientific article; zbMATH DE number 1775428 (Why is no real title available?)
- scientific article; zbMATH DE number 812038 (Why is no real title available?)
- A note on monotone complexity and the rank of matrices
- A very simple algorithm for estimating the number of k‐colorings of a low‐degree graph
- Absence of phase transition for antiferromagnetic Potts models via the Dobrushin uniqueness theorem
- Alternative Protocols for Generalized Oblivious Transfer
- An impossibility result on graph secret sharing
- Ciphertext-policy attribute-based encryption: an expressive, efficient, and provably secure realization
- Covering a graph by complete bipartite graphs
- Covering graphs by the minimum number of equivalence relations
- Decomposition construction for secret sharing schemes with graph access structures in polynomial time
- Decomposition constructions for secret-sharing schemes
- Decomposition of graphs and monotone formula size of homogeneous functions
- Erdős-Pyber theorem for hypergraphs and secret sharing
- General secure multi-party computation from any linear secret-sharing scheme
- Generalized oblivious transfer by secret sharing
- Graph decompositions and secret sharing schemes
- How to share a secret
- Hypergraph decomposition and secret sharing
- Ideal multipartite secret sharing schemes
- Lower bounds for monotone span programs
- Lower bounds on the information rate of secret sharing schemes with homogeneous access structure.
- Multiple assignment scheme for sharing secret
- On secret sharing schemes, matroids and polymatroids
- On secret sharing systems
- On set intersection representations of graphs
- On the Cryptographic Complexity of the Worst Functions
- On the classification of ideal secret sharing schemes
- On the information rate of perfect secret sharing schemes
- On the information rate of secret sharing schemes
- On the size of shares for secret sharing schemes
- Optimal Information Rate of Secret Sharing Schemes on Trees
- Probability and Computing
- Secret sharing over infinite domains
- Secret sharing schemes on graphs
- Secret sharing schemes on sparse homogeneous access structures with rank three
- Secret sharing schemes with bipartite access structure
- Secret sharing schemes with three or four minimal qualified subsets
- Secret-Sharing Schemes: A Survey
- Security of Ramp Schemes
- Superpolynomial lower bounds for monotone span programs
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
- The size of a share must be large
- Tight bounds on the information rate of secret sharing schemes
- Universally ideal secret-sharing schemes
Cited in
(23)- Secret sharing schemes for very dense graphs
- scientific article; zbMATH DE number 1788241 (Why is no real title available?)
- Critical set of caterpillar graph for secret sharing scheme
- On Linear Secret Sharing for Connectivity in Directed Graphs
- On the information ratio of non-perfect secret sharing schemes
- The share size of secret-sharing schemes for almost all access structures and graphs
- On the information ratio of graphs without high-degree neighbors
- Cryptography from planted graphs: security with logarithmic-size messages
- On the power of amortization in secret sharing: \(d\)-uniform secret sharing and CDS with constant information rate
- Secret sharing schemes for graph-based prohibited structures
- Ideal homogeneous access structures constructed from graphs
- Measuring, simulating and exploiting the head concavity phenomenon in BKZ
- Secret sharing schemes for dense forbidden graphs
- Improving the linear programming technique in the search for lower bounds in secret sharing
- The optimal average information ratio of secret-sharing schemes for the access structures based on unicycle graphs and bipartite graphs
- Lower bounds for secret-sharing schemes for \(k\)-hypergraphs
- Optimal linear secret sharing schemes for graph access structures on six participants
- Privacy-preserving data splitting: a combinatorial approach
- Percolation in the secrecy graph
- Succinct computational secret sharing
- Access structure in graphs in high dimension and application to secret sharing
- Optimal linear multiparty conditional disclosure of secrets protocols
- Local bounds for the optimal information ratio of secret sharing schemes
This page was built for publication: Secret-sharing schemes for very dense graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q290386)
