Introduction to Secret-Sharing

DOI10.1007/978-3-319-31803-5_12zbMath1429.94069OpenAlexW2478112145MaRDI QIDQ5213649

Andreas Blass

Publication date: 4 February 2020

Published in: Dependence Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-31803-5_12

zbMATH Keywords

access structurepositive probabilityrandom stringideal schemeassistant manager

Mathematics Subject Classification ID

Other nonclassical logic (03B60) Authentication, digital signatures and secret sharing (94A62) Other applications of logic (03B80)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Mathematical Theory of Communication
• New inequalities for subspace arrangements
• On the classification of ideal secret sharing schemes
• An explication of secret sharing schemes
• On secret-sharing matroids
• Characteristic-Dependent Linear Rank Inequalities With Applications to Network Coding
• How to share a secret
• On secret sharing schemes, matroids and polymatroids
• Networks, Matroids, and Non-Shannon Information Inequalities
• Two Constructions on Limits of Entropy Functions
• A FORBIDDEN MINOR CHARACTERIZATION OF MATROID PORTS
• On characterization of entropy function via information inequalities
• On secret sharing systems
• Matroids Can Be Far from Ideal Secret Sharing
• Theory of Cryptography

This page was built for publication: Introduction to Secret-Sharing