Grey-box public-key steganography
From MaRDI portal
Publication:4922136
DOI10.1007/978-3-642-38236-9_27zbMATH Open1382.94164OpenAlexW23505904MaRDI QIDQ4922136FDOQ4922136
Authors: Hirotoshi Takebe, Keisuke Tanaka
Publication date: 28 May 2013
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-38236-9_27
Recommendations
Cites Work
- Title not available (Why is that?)
- The Prisoners’ Problem and the Subliminal Channel
- Advances in Cryptology – CRYPTO 2004
- Advances in Cryptology - CRYPTO 2003
- Upper and lower bounds on black-box steganography
- Advances in Cryptology - EUROCRYPT 2004
- Provably Secure Steganography and the Complexity of Sampling
- Theory of Cryptography
- Automata, Languages and Programming
- Public Key Cryptography - PKC 2006
- An information-theoretic model for steganography
- Provably Secure Steganography
- Grey-box steganography
Cited In (1)
This page was built for publication: Grey-box public-key steganography
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4922136)