Secret-sharing schemes for very dense graphs
From MaRDI portal
Publication:290386
DOI10.1007/S00145-014-9195-8zbMATH Open1355.94047OpenAlexW2804115786MaRDI QIDQ290386FDOQ290386
Authors: Amos Beimel, Oriol Farràs, Yuval Mintz 
Publication date: 1 June 2016
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.947.386
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
- How to share a secret
- Ciphertext-policy attribute-based encryption: an expressive, efficient, and provably secure realization
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
- Title not available (Why is that?)
- On the classification of ideal secret sharing schemes
- Multiple assignment scheme for sharing secret
- On secret sharing schemes, matroids and polymatroids
- A very simple algorithm for estimating the number of k‐colorings of a low‐degree graph
- Probability and Computing
- On the size of shares for secret sharing schemes
- On the information rate of perfect secret sharing schemes
- Decomposition constructions for secret-sharing schemes
- Title not available (Why is that?)
- On secret sharing systems
- A note on monotone complexity and the rank of matrices
- Hypergraph decomposition and secret sharing
- An impossibility result on graph secret sharing
- Decomposition of graphs and monotone formula size of homogeneous functions
- Covering graphs by the minimum number of equivalence relations
- Secret sharing over infinite domains
- Absence of phase transition for antiferromagnetic Potts models via the Dobrushin uniqueness theorem
- Tight bounds on the information rate of secret sharing schemes
- Covering a graph by complete bipartite graphs
- The size of a share must be large
- Secret sharing schemes with three or four minimal qualified subsets
- Secret sharing schemes on sparse homogeneous access structures with rank three
- Graph decompositions and secret sharing schemes
- Lower bounds on the information rate of secret sharing schemes with homogeneous access structure.
- Superpolynomial lower bounds for monotone span programs
- Secret sharing schemes with bipartite access structure
- Security of Ramp Schemes
- Optimal Information Rate of Secret Sharing Schemes on Trees
- Secret-Sharing Schemes: A Survey
- Title not available (Why is that?)
- General secure multi-party computation from any linear secret-sharing scheme
- Secret sharing schemes on graphs
- On set intersection representations of graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Ideal multipartite secret sharing schemes
- Title not available (Why is that?)
- Universally ideal secret-sharing schemes
- Title not available (Why is that?)
- Erdős-Pyber theorem for hypergraphs and secret sharing
- Decomposition construction for secret sharing schemes with graph access structures in polynomial time
- Alternative Protocols for Generalized Oblivious Transfer
- On the Cryptographic Complexity of the Worst Functions
- Generalized oblivious transfer by secret sharing
- On the information rate of secret sharing schemes
- Lower bounds for monotone span programs
Cited In (23)
- Secret sharing schemes for very dense graphs
- Title not available (Why is that?)
- 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
- Cryptography from planted graphs: security with logarithmic-size messages
- On the information ratio of graphs without high-degree neighbors
- Ideal homogeneous access structures constructed from graphs
- 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
- 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
- Succinct computational secret sharing
- Percolation in the secrecy graph
- 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)
