Secret Sharing Schemes for Dense Forbidden Graphs
From MaRDI portal
Publication:2827736
DOI10.1007/978-3-319-44618-9_27zbMath1482.94065OpenAlexW2515129191MaRDI QIDQ2827736
Naty Peter, Amos Beimel, Oriol Farràs
Publication date: 21 October 2016
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-44618-9_27
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Authentication, digital signatures and secret sharing (94A62)
Related Items (max. 100)
Measuring, simulating and exploiting the head concavity phenomenon in BKZ ⋮ Local bounds for the optimal information ratio of secret sharing schemes ⋮ Optimal linear multiparty conditional disclosure of secrets protocols
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Secret-sharing schemes for very dense graphs
- Generalized oblivious transfer by secret sharing
- Lower bounds for monotone span programs
- A note on monotone complexity and the rank of matrices
- 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
- 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
- Protecting data privacy in private information retrieval schemes
- 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: 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
- Communication Complexity of Conditional Disclosure of Secrets and Attribute-Based Encryption
- Secret sharing schemes on graphs
- On set intersection representations of graphs
- Decomposition constructions for secret-sharing schemes
- Universally ideal secret-sharing schemes
- Fuzzy Identity-Based Encryption
- Alternative Protocols for Generalized Oblivious Transfer
- On the Cryptographic Complexity of the Worst Functions
This page was built for publication: Secret Sharing Schemes for Dense Forbidden Graphs
