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.
Type de document :
Communication dans un congrès
Gilbert Peterson; Sujeet Shenoi. 11th IFIP International Conference on Digital Forensics (DF), Jan 2015, Orlando, FL, United States. IFIP Advances in Information and Communication Technology, AICT-462, pp.179-194, 2015, Advances in Digital Forensics XI. 〈10.1007/978-3-319-24123-4_11〉
Liste complète des métadonnées

Littérature citée [14 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01449058
Contributeur : Hal Ifip <>
Soumis le : lundi 30 janvier 2017 - 09:13:16
Dernière modification le : vendredi 1 décembre 2017 - 01:16:43

Fichier

978-3-319-24123-4_11_Chapter.p...
Fichiers produits par l'(les) auteur(s)

Licence


Distributed under a Creative Commons Paternité 4.0 International License

Identifiants

Citation

Peter Fruhwirt, Peter Kieseberg, Edgar Weippl. USING INTERNAL MySQL/InnoDB B-TREE INDEX NAVIGATION FOR DATA HIDING. Gilbert Peterson; Sujeet Shenoi. 11th IFIP International Conference on Digital Forensics (DF), Jan 2015, Orlando, FL, United States. IFIP Advances in Information and Communication Technology, AICT-462, pp.179-194, 2015, Advances in Digital Forensics XI. 〈10.1007/978-3-319-24123-4_11〉. 〈hal-01449058〉

Partager

Métriques

Consultations de la notice

46