Asymptotically optimal perfect steganographic systems
From MaRDI portal
Publication:734309
DOI10.1134/S0032946009020094zbMATH Open1173.94426OpenAlexW2154651642MaRDI QIDQ734309FDOQ734309
Authors: D. B. Ryabko, B. Ya. Ryabko
Publication date: 20 October 2009
Published in: Problems of Information Transmission (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0032946009020094
Recommendations
Cites Work
Cited In (14)
- Provably Secure Steganography and the Complexity of Sampling
- Hidden message via hypothesis testing and information — theoretic model
- An information-theoretic model for steganography
- On the universal steganography of optimal rate
- Perfectly Secure Steganography: Capacity, Error Exponents, and Code Constructions
- On application of hypothesis testing for steganography systems
- Constructing perfect steganographic systems
- Review of contemporary information-theoretical approaches to solving of main cryptography and steganography problems
- The elements of associative stegnanography theory
- Fisher Information Determines Capacity of ε-Secure Steganography
- Asymptotically Optimum Perfect Universal Steganography of Finite Memoryless Sources
- A one-time stegosystem and applications to efficient covert communication
- On steganographic system selection rule
- Coverings, centered codes, and combinatorial steganography
This page was built for publication: Asymptotically optimal perfect steganographic systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q734309)