%0 Conference Proceedings
%T USING INTERNAL MySQL/InnoDB B-TREE INDEX NAVIGATION FOR DATA HIDING
%+ SBA Research
%A Fruhwirt, Peter
%A Kieseberg, Peter
%A Weippl, Edgar
%Z Part 3: FORENSIC TECHNIQUES
%< avec comité de lecture
%( IFIP Advances in Information and Communication Technology
%B 11th IFIP International Conference on Digital Forensics (DF)
%C Orlando, FL, United States
%Y Gilbert Peterson
%Y Sujeet Shenoi
%3 Advances in Digital Forensics XI
%V AICT-462
%P 179-194
%8 2015-01-26
%D 2015
%R 10.1007/978-3-319-24123-4_11
%K Databases
%K data hiding
%K data deletion
%K index
%K InnoDB
%K MySQL
%Z Computer Science [cs]Conference papers
%X Large databases provide interesting environments for hiding data. These databases store massive amounts of diverse data, they are riddled with internal mechanisms and data pools for enhancing performance, and they contain complex optimization routines that constantly change portions of the underlying file environments. The databases are valuable targets for attackers who wish to manipulate search results or hide traces of data access or modification. Despite its importance, research on data hiding in databases is relatively sparse. This chapter describes several data hiding techniques in MySQL and demonstrates the impact of data deletion on forensic analysis.
%G English
%Z TC 11
%Z WG 11.9
%2 https://inria.hal.science/hal-01449058/document
%2 https://inria.hal.science/hal-01449058/file/978-3-319-24123-4_11_Chapter.pdf
%L hal-01449058
%U https://inria.hal.science/hal-01449058
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-AICT
%~ IFIP-TC
%~ IFIP-WG
%~ IFIP-TC11
%~ IFIP-DF
%~ IFIP-WG11-9
%~ IFIP-AICT-462