Information hiding using matroid theory
From MaRDI portal
Publication:2040985
Recommendations
- On secret-sharing matroids
- Information-theoretic analysis of information hiding
- scientific article; zbMATH DE number 1953869
- Secure information hiding based on computationally intractable problems
- Efficient information hiding based on theory of numbers
- A representation of a family of secret sharing matroids
- Common information, matroid representation, and secret sharing for matroid ports
- A note on matroids, codes and information theory
- Compositional Methods for Information-Hiding
Cites work
- scientific article; zbMATH DE number 5009196 (Why is no real title available?)
- scientific article; zbMATH DE number 5047784 (Why is no real title available?)
- A Survey of Single-Database Private Information Retrieval: Techniques and Applications
- Dependencies among dependencies in matroids
- General constructions for information-theoretic private information retrieval
- Generalized Hamming weights for linear codes
- Higher support matroids
- How to share a secret
- Locally decodable codes and private information retrieval schemes.
- On the efficiency of local decoding procedures for error-correcting codes
- Private information retrieval
- Quantization index modulation: a class of provably good methods for digital watermarking and information embedding
- The coset leader and list weight enumerator
- Theory of Cryptography
Cited in
(4)
This page was built for publication: Information hiding using matroid theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2040985)