Secret Sharing Schemes for (k, n)-Consecutive Access Structures

DOI10.1007/978-3-030-00434-7_23zbMath1518.94113OpenAlexW2889508571MaRDI QIDQ6104673

Germán Sáez, Javier Herranz

Publication date: 28 June 2023

Published in: Cryptology and Network Security (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-00434-7_23

zbMATH Keywords

information ratesecret-sharing schemesideal access structures

Mathematics Subject Classification ID

Cryptography (94A60) Information theory (general) (94A15) Authentication, digital signatures and secret sharing (94A62)

Cites Work

• Ideal multipartite secret sharing schemes
• Perfect secret sharing schemes on five participants
• Hierarchical threshold secret sharing
• Hypergraph decomposition and secret sharing
• On the classification of ideal secret sharing schemes
• Geometric secret sharing schemes and their duals
• Tight bounds on the information rate of secret sharing schemes
• Improving the linear programming technique in the search for lower bounds in secret sharing
• 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
• Secret sharing schemes on access structures with intersection number equal to one
• A secret sharing scheme based on cellular automata
• Secret sharing schemes with bipartite access structure
• Optimal Information Rate of Secret Sharing Schemes on Trees
• How to share a secret
• Characterizing Ideal Weighted Threshold Secret Sharing
• Decomposition constructions for secret-sharing schemes
• Ideal Hierarchical Secret Sharing Schemes

This page was built for publication: Secret Sharing Schemes for (k, n)-Consecutive Access Structures