 Full-Text PDF |
||
| Paper Title | : | Improved Tiled Bitmap Forensic Analysis Algorithm |
| Author Name | : | C. D. Badgujar, G. N. Dhanokar |
| Abstract | : | In Computer network world, the needs for security and proper systems of control are obvious and find out the intruders who do the modification and modified data. Nowadays Frauds that occurs in companies are not only by outsiders but also by insiders. Insider may perform illegal activity & try to hide illegal activity. Companies would like to be assured that such illegal activity i.e. tampering has not occurred, or if it does, it should be quickly discovered. Mechanisms now exist that detect tampering of a database, through the use of cryptographically-strong hash functions. This paper contains a survey which explores the various beliefs upon database forensics through different methodologies using forensic algorithms and tools for investigations. Forensic analysis algorithms are used to determine who, when, and what data had been tampered. Tiled Bitmap Algorithm 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. Improved tiled bitmap algorithm will cover come the drawbacks of existing tiled bitmap algorithm. |
| Keywords | : | Temporal databases, EDNS, DBMS. |
| Cite this article | : | C. D. Badgujar, G. N. Dhanokar " Improved Tiled Bitmap Forensic Analysis Algorithm " ,ICETT-2012 ,Page No : 55-59. |
ACCENTS Journals
A Unit of ACCENTS(Publisher of Peer Reviewed Open Access Journals)
