Grey-Box Steganography
From MaRDI portal
Publication:3010419
DOI10.1007/978-3-642-20877-5_38zbMath1260.94045OpenAlexW2145252377MaRDI QIDQ3010419
Maciej Liśkiewicz, Ulrich Wölfel, K. Ruediger Reischuk
Publication date: 1 July 2011
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-20877-5_38
Computing methodologies for image processing (68U10) Cryptography (94A60) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An information-theoretic model for steganography
- Upper and lower bounds on black-box steganography
- Learning decision trees from random examples
- Efficient noise-tolerant learning from statistical queries
- Advances in Cryptology - EUROCRYPT 2004
- Provably Secure Steganography and the Complexity of Sampling
- Theory of Cryptography
- Fast Software Encryption
- Public Key Cryptography - PKC 2006
This page was built for publication: Grey-Box Steganography