Secret-sharing schemes for very dense graphs
From MaRDI portal
Publication:290386
DOI10.1007/s00145-014-9195-8zbMath1355.94047OpenAlexW2804115786MaRDI QIDQ290386
Yuval Mintz, Amos Beimel, Oriol Farràs
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
Related Items (11)
On the power of amortization in secret sharing: \(d\)-uniform secret sharing and CDS with constant information rate ⋮ Measuring, simulating and exploiting the head concavity phenomenon in BKZ ⋮ Optimal linear secret sharing schemes for graph access structures on six participants ⋮ 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 ⋮ Local bounds for the optimal information ratio of secret sharing schemes ⋮ On the information ratio of non-perfect secret sharing schemes ⋮ Optimal linear multiparty conditional disclosure of secrets protocols ⋮ On the information ratio of graphs without high-degree neighbors ⋮ Privacy-preserving data splitting: a combinatorial approach ⋮ Secret Sharing Schemes for Dense Forbidden Graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Ideal multipartite secret sharing schemes
- Erdős-Pyber theorem for hypergraphs and secret sharing
- Generalized oblivious transfer by secret sharing
- On the information rate of secret sharing schemes
- Lower bounds for monotone span programs
- 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
- On the classification of ideal secret sharing schemes
- Multiple assignment scheme for sharing secret
- Secret sharing over infinite domains
- Absence of phase transition for antiferromagnetic Potts models via the Dobrushin uniqueness theorem
- On the size of shares for secret sharing schemes
- 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.
- On the information rate of perfect secret sharing schemes
- 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
- How to share a secret
- On secret sharing schemes, matroids and polymatroids
- Ciphertext-Policy Attribute-Based Encryption: An Expressive, Efficient, and Provably Secure Realization
- Secret sharing schemes on graphs
- On set intersection representations of graphs
- Decomposition constructions for secret-sharing schemes
- On secret sharing systems
- Universally ideal secret-sharing schemes
- A very simple algorithm for estimating the number of k‐colorings of a low‐degree graph
- Decomposition Construction for Secret Sharing Schemes with Graph Access Structures in Polynomial Time
- Alternative Protocols for Generalized Oblivious Transfer
- Probability and Computing
- On the Cryptographic Complexity of the Worst Functions
This page was built for publication: Secret-sharing schemes for very dense graphs
