Local bounds for the optimal information ratio of secret sharing schemes

DOI10.1007/s10623-018-0529-7zbMath1445.94019OpenAlexW2885607670MaRDI QIDQ2416938

Sara Ricci, Oriol Farràs, Jordi Ribes-González

Publication date: 24 May 2019

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-018-0529-7

zbMATH Keywords

cryptographysecret sharingmonotone span programmonotone Boolean formulainformation ratio

Mathematics Subject Classification ID

Cryptography (94A60) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Authentication, digital signatures and secret sharing (94A62)

Related Items (2)

Local bounds for the optimal information ratio of secret sharing schemes ⋮ Privacy-preserving data splitting: a combinatorial approach

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Secret-sharing schemes for very dense graphs
• Ideal multipartite secret sharing schemes
• Boolean function complexity. Advances and frontiers.
• On the optimization of bipartite secret sharing schemes
• On the classification of ideal secret sharing schemes
• The size of a share must be large
• A characterization of span program size and improved lower bounds for monotone span programs
• Improving the linear programming technique in the search for lower bounds in secret sharing
• Conditional disclosure of secrets via non-linear reconstruction
• On the information ratio of non-perfect secret sharing schemes
• Linear secret-sharing schemes for forbidden graph access structures
• Finding lower bounds on the complexity of secret sharing schemes by linear programming
• Superpolynomial lower bounds for monotone span programs
• Privacy-preserving data splitting: a combinatorial approach
• Secret sharing on the \(d\)-dimensional cube
• Local bounds for the optimal information ratio of secret sharing schemes
• Applications of matrix methods to the theory of lower bounds in computational complexity
• Secret Sharing and Statistical Zero Knowledge
• Secret Sharing Schemes for Dense Forbidden Graphs
• Testing and Reconstruction of Lipschitz Functions with Applications to Data Privacy
• Secret-Sharing for NP
• Secret Sharing, Rank Inequalities, and Information Inequalities
• Secret-Sharing Schemes: A Survey
• How to share a secret
• On secret sharing schemes, matroids and polymatroids
• Strongly exponential lower bounds for monotone computation
• Secret Sharing and Non-Shannon Information Inequalities

This page was built for publication: Local bounds for the optimal information ratio of secret sharing schemes