Abstract
While there is some work on supraliminal steganography, its definition makes it problematic in several respects. We deconstruct and sharpen the definition to create assured supraliminal steganography. The taxonomy and definition of assured supraliminal steganography are illustrated by hiding messages in computer games. We discuss four steganographic computer game implementations, and present the results of an experiment needed to ascertain whether or not a supraliminal method is actually assured supraliminal steganography. The results showed that it was possible to embed assured supraliminal messages into the four game implementations, and extract the messages with no or minimal errors. © 2014 Springer International Publishing Switzerland.
Cite
CITATION STYLE
Mosunov, A., Sinha, V., Crawford, H., Aycock, J., De Castro, D. M. N., & Kumari, R. (2014). Assured supraliminal steganography in computer games. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8267 LNCS, pp. 245–259). Springer Verlag. https://doi.org/10.1007/978-3-319-05149-9_16
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
