Using internal MySQL/InnoDB B-tree index navigation for data hiding

7Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

This article is free to access.

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.

Cite

CITATION STYLE

APA

Fruhwirt, P., Kieseberg, P., & Weippl, E. (2015). Using internal MySQL/InnoDB B-tree index navigation for data hiding. In IFIP Advances in Information and Communication Technology (Vol. 462, pp. 179–194). Springer New York LLC. https://doi.org/10.1007/978-3-319-24123-4_11

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free