TY - GEN
T1 - Proofs of the undecidability of stegananalysis techniques
AU - Gutierrez-Cardenas, Juan
N1 - Publisher Copyright:
© Springer Nature Switzerland AG 2020.
PY - 2020
Y1 - 2020
N2 - Steganalysis comprises a set of techniques that strive to find concealed information within diverse types of digital media. On the contrary, Steganography involves a group of methods that, by manipulation of a cover object, aims to hide information to make it imperceptible. Current Steganalysis techniques suffer from a certain degree of failure in the detection of a payload and, frequently, the impossibility to discover if a media hides some information. In this chapter, we prove that the detection of hidden material within a media, or a Steganalysis procedure, is an undecidable problem. Our proof comprises two sets of tests: first, we demonstrate the undecidability by the principle of Diagonalization of Cantor, and second, we applied a reduction technique based on the undecidability of malware detection. For this part, we outline the hypothesis that there exists a similitude between Steganography techniques and the generation of an innocuous computer virus. Both demonstrations proved that Steganalysis procedures are undecidable problems.
AB - Steganalysis comprises a set of techniques that strive to find concealed information within diverse types of digital media. On the contrary, Steganography involves a group of methods that, by manipulation of a cover object, aims to hide information to make it imperceptible. Current Steganalysis techniques suffer from a certain degree of failure in the detection of a payload and, frequently, the impossibility to discover if a media hides some information. In this chapter, we prove that the detection of hidden material within a media, or a Steganalysis procedure, is an undecidable problem. Our proof comprises two sets of tests: first, we demonstrate the undecidability by the principle of Diagonalization of Cantor, and second, we applied a reduction technique based on the undecidability of malware detection. For this part, we outline the hypothesis that there exists a similitude between Steganography techniques and the generation of an innocuous computer virus. Both demonstrations proved that Steganalysis procedures are undecidable problems.
KW - Reduction technique
KW - Steganalysis
KW - Steganography
KW - Undecidability
UR - https://hdl.handle.net/20.500.12724/11610
UR - https://www.mendeley.com/catalogue/acb4b340-8674-3843-97ca-95ac3e327084/
U2 - 10.1007/978-3-030-48149-0_17
DO - 10.1007/978-3-030-48149-0_17
M3 - Articulo (Contribución a conferencia)
AN - SCOPUS:85091273422
SN - 9783030481483
T3 - EAI/Springer Innovations in Communication and Computing
SP - 229
EP - 241
BT - Data Analysis and Optimization for Engineering and Computing Problems - Proceedings of the 3rd EAI International Conference on Computer Science and Engineering and Health Services, COMPSE 2019
A2 - Vasant, Pandian
A2 - Litvinchev, Igor
A2 - Marmolejo-Saucedo, Jose Antonio
A2 - Rodriguez-Aguilar, Roman
A2 - Martinez-Rios, Felix
PB - Springer Science and Business Media Deutschland GmbH
T2 - 3rd EAI International Conference on Computer Science and Engineering and Health Services, COMPSE 2019
Y2 - 28 November 2019 through 29 November 2019
ER -