Practical Insecurity for Effective Steganalysis

Barbier, Johann; Alt, Stéphanie

doi:10.1007/978-3-540-88961-8_14

Cited by 2 publications

(1 citation statement)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We assume a computationally bounded adversary running in a polynomial time, incapable of breaking the encryption algorithm without knowing the key used for encryption; however, the adversary is capable of breaking a steganographic scheme in a limited time T (n) where n is the size of the image being used. This assumption is reasonable since most steganographic techniques have been broken by effective steganalysis given enough resources [1] while breaking advanced encryption algorithms (e.g., AES [5]) is computationally infeasible for even the most powerful supercomputers.…”

Section: Threat Modelmentioning

confidence: 98%

Visual Honey Encryption

Yoon

Kim

et al. 2015

Proceedings of the 3rd ACM Workshop on Information Hiding and Multimedia Security

View full text Add to dashboard Cite

Honey encryption (HE) is a new technique to overcome the weakness of conventional password-based encryption (PBE). However, conventional honey encryption still has the limitation that it works only for binary bit streams or integer sequences because it uses a fixed distribution-transforming encoder (DTE). In this paper, we propose a variant of honey encryption called visual honey encryption which employs an adaptive DTE in a Bayesian framework so that the proposed approach can be applied to more complex domains including images and videos. We applied this method to create a new steganography scheme which significantly improves the security level of traditional steganography.

show abstract

Section: Threat Modelmentioning

confidence: 98%