USING INTERNAL MySQL/InnoDB B-TREE INDEX NAVIGATION FOR DATA HIDING - Advances in Digital Forensics XI Access content directly
Conference Papers Year : 2015

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

Peter Fruhwirt
  • Function : Author
Peter Kieseberg
  • Function : Author
Edgar Weippl
  • Function : Author

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.
Fichier principal
Vignette du fichier
978-3-319-24123-4_11_Chapter.pdf (381.98 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01449058 , version 1 (30-01-2017)

Licence

Attribution

Identifiers

Cite

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⟩
90 View
510 Download

Altmetric

Share

Gmail Facebook X LinkedIn More