Recommendations
Cites work
- A FORBIDDEN MINOR CHARACTERIZATION OF MATROID PORTS
- A Mathematical Theory of Communication
- An explication of secret sharing schemes
- Characteristic-Dependent Linear Rank Inequalities With Applications to Network Coding
- How to share a secret
- scientific article; zbMATH DE number 3959442 (Why is no real title available?)
- scientific article; zbMATH DE number 1394291 (Why is no real title available?)
- scientific article; zbMATH DE number 3351601 (Why is no real title available?)
- Matroids Can Be Far from Ideal Secret Sharing
- Networks, Matroids, and Non-Shannon Information Inequalities
- New inequalities for subspace arrangements
- On characterization of entropy function via information inequalities
- On secret sharing schemes, matroids and polymatroids
- On secret sharing systems
- On secret-sharing matroids
- On the classification of ideal secret sharing schemes
- Theory of Cryptography
- Two Constructions on Limits of Entropy Functions
Cited in
(3)
This page was built for publication: Introduction to secret-sharing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5213649)