Information hiding using matroid theory
From MaRDI portal
Publication:2040985
DOI10.1016/J.AAM.2021.102205OpenAlexW3156913782MaRDI QIDQ2040985FDOQ2040985
Authors: Yanyan Li 
Publication date: 15 July 2021
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2009.02991
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
Combinatorial aspects of matroids and geometric lattices (05B35) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)
Cites Work
- How to share a secret
- Generalized Hamming weights for linear codes
- Title not available (Why is that?)
- On the efficiency of local decoding procedures for error-correcting codes
- Locally decodable codes and private information retrieval schemes.
- General constructions for information-theoretic private information retrieval
- Quantization index modulation: a class of provably good methods for digital watermarking and information embedding
- Theory of Cryptography
- Title not available (Why is that?)
- Private information retrieval
- Higher support matroids
- A Survey of Single-Database Private Information Retrieval: Techniques and Applications
- The coset leader and list weight enumerator
- Dependencies among dependencies in matroids
Cited In (3)
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)
