Digital Forensics. Dr. Bhavani Thuraisingham The University of Texas at Dallas Lecture #11 Detection and Analysis of Database Tampering September 29, 2008. Outline: Review of Two Papers.
Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.
Dr. Bhavani Thuraisingham
The University of Texas at Dallas
Detection and Analysis of Database Tampering
September 29, 2008
TYPE = BDB
AUDITABLE = 1
of hash values. For each successively more powerful forensic analysis algorithm, we provide a formal/diagrammatic analysis of its forensic strength.
The above-mentioned algorithm is the monochromatic algorithm; they also consider the RGB algorithm and the polychromatic algorithm. This last algorithm can efficiently extract a good deal of information concerning a corruption event.
terms of the temporal-spatial dimensions of a database.
They have found these diagrams to be very helpful in understanding
and communicating the many forensic algorithms
Consider the simplest case. During validation, they
have detected a corruption event. Though they don’t know it (yet), assume that this corruption event is a single-locus CE. Furthermore, assume that the CE just altered the data of a tuple; no timestamps were changed.