The Tiled Bitmap Forensic Analysis Algorithm

Pavlou, Kyriacos E.; Snodgrass, Richard T.

doi:10.1109/tkde.2009.121

Cited by 20 publications

(10 citation statements)

References 7 publications

(18 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…An extensive presentation of an approach, performance limitations, tamper detection, threat model and other forensic analysis algorithms is discussed in paper [7], [9].Hash chain linking is discussed in more detail in paper [7].Tiled bitmap algorithm is refinement of polychromatic algorithm. The advantage of the Tiled Bitmap Algorithm is that it lays down a regular pattern (a "tile") of such chains over contiguous segments of the database [14]. The other advantage of the Tiled Bitmap Algorithm is that it can detect multiple corruption events that other previous algorithms can-not.…”

Section: Related Workmentioning

confidence: 99%

“…This made it possible to check the consistency of the data by comparing it to the values stored with the notarization service. In continuation with this method, algorithms were designed to further analyze an intrusion of database [14].…”

Section: Tiled Bitmap Algorithmmentioning

confidence: 99%

“…Due to this issue there is the need of the Forensic Analysis Algorithm. The authorized and unauthorized user detected by the Tiled Bitmap forensic analysis algorithm [14].The Forensic Analysis method is logically planned. During the Digital Analysis of the Database number of operation is executed and Forensic Analysis will take care whether this operation is executed in sequential manner or not.…”

Section: Different Forensic Stepsmentioning

confidence: 99%

“…The tiled bitmap algorithm [14] is the modified version of the polychromatic algorithm [15], the group of a sequence value (hash chain) and there is some time gap between these hashes chain and this hash chain coupled with this time gap and real validation interval. Below figure 4 shows the validation happens every 16 hours, during this time thousand even millions of transaction occur, and below figure 4 shows one 16-hour fragment (slice).time proceed from left to right with the hour shown as r = 0 to r = 15 and in second fragment hour 17 match up with r = 0. hour 28 match up with r = 11 and below figure4 also demonstrate a corruption event and in this corruption event the timestamp of tuple relation was changed from 31 to 28 hour.…”

Section: Fig 3: Audit Log Techniquementioning

confidence: 99%

See 3 more Smart Citations

Forensic Analysis Algorithm: By using the Tiled Bitmap with Audit Log Mechanism

Gawali¹,

Gupta²

2013

IJCA

View full text Add to dashboard Cite

The set of policies and the group of people need to access the valuable database by the authorized inter mediator, still the organizational employee also go through the authorized inter mediator. Cryptographic hashing is one of the best approach and work as a inter mediator. This paper show how to resolve when tampering arises in Database, what data was tampered and the identification of the person to tamper the data. These things are detected by using the forensic analysis. This paper presents a new forensic analysis algorithm, the tiled bitmap algorithm, which is more capable then the previous algorithm. It introduces the concept of a candidate set (all possible place of detected tampering(s)) and gives a full classification of the candidate set and its cardinality and prevent the intruder, the computing of the candidate set is also presented.There are certain cases happened in BANK and other sector where the data has been tamper by the assessor, outsider or by the employees of the organizations. The separate audit logs validate to observe and inspect the database along with the extra information and state of the data. Audit log play a central role in database. The space and time complexity is less in this forensic analysis algorithm.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Tiled Bitmap Algorithmmentioning

confidence: 99%

Section: Different Forensic Stepsmentioning

confidence: 99%

Section: Fig 3: Audit Log Techniquementioning

confidence: 99%

See 2 more Smart Citations

Forensic Analysis Algorithm: By using the Tiled Bitmap with Audit Log Mechanism

Gawali¹,

Gupta²

2013

IJCA

View full text Add to dashboard Cite

show abstract

“…We have also designed a series of forensic analysis algorithms of increasing complexity that allow an analyst to put tight bounds on the "where" and "when" of a detected tampering [9], [12], [10].…”

Section: Description Of Dragoonmentioning

confidence: 99%

Achieving Database Information Accountability in the Cloud

Pavlou

Snodgrass

2012

2012 IEEE 28th International Conference on Data Engineering Workshops

View full text Add to dashboard Cite

Abstract-Regulations and societal expectations have recently emphasized the need to mediate access to valuable databases. Fraud occurs when a person (mostly an insider) tampers illegally with a database. Data owners would like to be assured that such tampering has not occurred, or if it does, that it will be quickly discovered. The problem is exacerbated with data stored in cloud databases such as Amazon's Relational Database Service (RDS) or Microsoft's SQL Azure Database. In our previous work we have shown that information accountability across the enterprise is a viable alternative to information restriction for ensuring the correct storage, use, and maintenance of databases on extant DBMSes. We have developed a prototype audit system (DRAGOON) that employs cryptographic hashing techniques to support accountability in high-performance databases.Cloud databases present a new set of problems that make extending DRAGOON challenging. In this paper we discuss these problems and show how the DRAGOON architecture can be refined to provide a more practical and feasible information accountability solution for data stored in the cloud.

show abstract