Grey-Box Public-Key Steganography

DOI10.1007/978-3-642-38236-9_27zbMath1382.94164OpenAlexW23505904MaRDI QIDQ4922136

Keisuke Tanaka, Hirotoshi Takebe

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

zbMATH Keywords

public-key cryptographyprovable securitysteganography

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Unnamed Item
• An information-theoretic model for steganography
• Upper and lower bounds on black-box steganography
• Grey-Box Steganography
• Provably Secure Steganography
• The Prisoners’ Problem and the Subliminal Channel
• Advances in Cryptology - EUROCRYPT 2004
• Advances in Cryptology – CRYPTO 2004
• Advances in Cryptology - CRYPTO 2003
• Provably Secure Steganography and the Complexity of Sampling
• Theory of Cryptography
• Automata, Languages and Programming
• Public Key Cryptography - PKC 2006

This page was built for publication: Grey-Box Public-Key Steganography