📖
USING INTERNAL MySQL/InnoDB B-TREE INDEX NAVIGATION FOR DATA HIDING
Peter Fruhwirt, Peter Kieseberg, Edgar Weippl

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

Science & Mathematics Published 2015 Verification Pending

Overview & Synopsis

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.

Indexed from repository: HAL Open Science (hal.science)
Loading document from verified source...
Keyboard Shortcuts: ← / → for pages • + / - for zoom • 0 to fit width Powered by Mozilla PDF.js v3.11

Document Information

Document Title USING INTERNAL MySQL/InnoDB B-TREE INDEX NAVIGATION FOR DATA HIDING
Author / Organization Peter Fruhwirt, Peter Kieseberg, Edgar Weippl
Subject & Discipline Multidisciplinary Academic Open Research
Categories Science & Mathematics
Publication Year 2015
License / Rights Open Access / Creative Commons
Resource Verification Listed PDF (Verification Pending)
Original Host Website HAL Open Science (hal.science)
File Format application/pdf (Portable Document Format)
Language EN
Catalog ID DOC-51590
Original Source Link Visit Source Page on hal.science »