USING INTERNAL MySQL/InnoDB B-TREE INDEX NAVIGATION FOR DATA HIDING

Abstract : 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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [14 references]  Display  Hide  Download

https://hal.inria.fr/hal-01449058
Contributor : Hal Ifip <>
Submitted on : Monday, January 30, 2017 - 9:13:16 AM
Last modification on : Friday, December 1, 2017 - 1:16:43 AM

File

978-3-319-24123-4_11_Chapter.p...
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Peter Fruhwirt, Peter Kieseberg, Edgar Weippl. USING INTERNAL MySQL/InnoDB B-TREE INDEX NAVIGATION FOR DATA HIDING. 11th IFIP International Conference on Digital Forensics (DF), Jan 2015, Orlando, FL, United States. pp.179-194, ⟨10.1007/978-3-319-24123-4_11⟩. ⟨hal-01449058⟩

Share

Metrics

Record views

123

Files downloads

328