The tiled bitmap forensic analysis algorithm

Kyriacos E. Pavlou, Richard Thomas Snodgrass

Research output: Contribution to journalArticle

11 Citations (Scopus)

Abstract

Tampering of a database can be detected through the use of cryptographically strong hash functions. Subsequently, applied forensic analysis algorithms can help determine when, what, and perhaps ultimately who and why. This paper presents a novel forensic analysis algorithm, the Tiled Bitmap Algorithm, which is more efficient than prior forensic analysis algorithms. It introduces the notion of a candidate set (all possible locations of detected tampering(s)) and provides a complete characterization of the candidate set and its cardinality. An optimal algorithm for computing the candidate set is also presented. Finally, the implementation of the Tiled Bitmap Algorithm is discussed, along with a comparison to other forensic algorithms in terms of space/time complexity and cost. An example of candidate set generation and proofs of the theorems and lemmata and of algorithm correctness can be found in the appendix, which can be found on the Computer Society Digital Library at http://doi.ieeecomputersociety.org/10.1109/TKDE.2009.121.

Original languageEnglish (US)
Article number4912205
Pages (from-to)590-601
Number of pages12
JournalIEEE Transactions on Knowledge and Data Engineering
Volume22
Issue number4
DOIs
StatePublished - Apr 2010

Fingerprint

Hash functions
Digital libraries
Costs

Keywords

  • And protection
  • Database management
  • Integrity
  • Security
  • Temporal databases

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Information Systems
  • Computer Science Applications

Cite this

The tiled bitmap forensic analysis algorithm. / Pavlou, Kyriacos E.; Snodgrass, Richard Thomas.

In: IEEE Transactions on Knowledge and Data Engineering, Vol. 22, No. 4, 4912205, 04.2010, p. 590-601.

Research output: Contribution to journalArticle

@article{0c125786b1f14784ad616ec39e3f6e81,
title = "The tiled bitmap forensic analysis algorithm",
abstract = "Tampering of a database can be detected through the use of cryptographically strong hash functions. Subsequently, applied forensic analysis algorithms can help determine when, what, and perhaps ultimately who and why. This paper presents a novel forensic analysis algorithm, the Tiled Bitmap Algorithm, which is more efficient than prior forensic analysis algorithms. It introduces the notion of a candidate set (all possible locations of detected tampering(s)) and provides a complete characterization of the candidate set and its cardinality. An optimal algorithm for computing the candidate set is also presented. Finally, the implementation of the Tiled Bitmap Algorithm is discussed, along with a comparison to other forensic algorithms in terms of space/time complexity and cost. An example of candidate set generation and proofs of the theorems and lemmata and of algorithm correctness can be found in the appendix, which can be found on the Computer Society Digital Library at http://doi.ieeecomputersociety.org/10.1109/TKDE.2009.121.",
keywords = "And protection, Database management, Integrity, Security, Temporal databases",
author = "Pavlou, {Kyriacos E.} and Snodgrass, {Richard Thomas}",
year = "2010",
month = "4",
doi = "10.1109/TKDE.2009.121",
language = "English (US)",
volume = "22",
pages = "590--601",
journal = "IEEE Transactions on Knowledge and Data Engineering",
issn = "1041-4347",
publisher = "IEEE Computer Society",
number = "4",

}

TY - JOUR

T1 - The tiled bitmap forensic analysis algorithm

AU - Pavlou, Kyriacos E.

AU - Snodgrass, Richard Thomas

PY - 2010/4

Y1 - 2010/4

N2 - Tampering of a database can be detected through the use of cryptographically strong hash functions. Subsequently, applied forensic analysis algorithms can help determine when, what, and perhaps ultimately who and why. This paper presents a novel forensic analysis algorithm, the Tiled Bitmap Algorithm, which is more efficient than prior forensic analysis algorithms. It introduces the notion of a candidate set (all possible locations of detected tampering(s)) and provides a complete characterization of the candidate set and its cardinality. An optimal algorithm for computing the candidate set is also presented. Finally, the implementation of the Tiled Bitmap Algorithm is discussed, along with a comparison to other forensic algorithms in terms of space/time complexity and cost. An example of candidate set generation and proofs of the theorems and lemmata and of algorithm correctness can be found in the appendix, which can be found on the Computer Society Digital Library at http://doi.ieeecomputersociety.org/10.1109/TKDE.2009.121.

AB - Tampering of a database can be detected through the use of cryptographically strong hash functions. Subsequently, applied forensic analysis algorithms can help determine when, what, and perhaps ultimately who and why. This paper presents a novel forensic analysis algorithm, the Tiled Bitmap Algorithm, which is more efficient than prior forensic analysis algorithms. It introduces the notion of a candidate set (all possible locations of detected tampering(s)) and provides a complete characterization of the candidate set and its cardinality. An optimal algorithm for computing the candidate set is also presented. Finally, the implementation of the Tiled Bitmap Algorithm is discussed, along with a comparison to other forensic algorithms in terms of space/time complexity and cost. An example of candidate set generation and proofs of the theorems and lemmata and of algorithm correctness can be found in the appendix, which can be found on the Computer Society Digital Library at http://doi.ieeecomputersociety.org/10.1109/TKDE.2009.121.

KW - And protection

KW - Database management

KW - Integrity

KW - Security

KW - Temporal databases

UR - http://www.scopus.com/inward/record.url?scp=77649266194&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77649266194&partnerID=8YFLogxK

U2 - 10.1109/TKDE.2009.121

DO - 10.1109/TKDE.2009.121

M3 - Article

VL - 22

SP - 590

EP - 601

JO - IEEE Transactions on Knowledge and Data Engineering

JF - IEEE Transactions on Knowledge and Data Engineering

SN - 1041-4347

IS - 4

M1 - 4912205

ER -