Difference between pages "File Carving Bibliography" and "User talk:Sanchez"

From Forensics Wiki
(Difference between pages)
Jump to: navigation, search
m (Basic Techniques)
 
m (Welcome!)
 
Line 1: Line 1:
==File Carving Bibliography==
+
'''Welcome to ''Forensics Wiki''!'''
'''In chronological order, oldest to most recent'''
+
We hope you will contribute much and well.
===Basic Techniques===
+
You will probably want to read the [[Help:Contents|help pages]].
 
+
Again, welcome and have fun! [[User:.FUF|.FUF]] 09:12, 1 December 2010 (PST)
<bibtex>
+
@INPROCEEDINGS{Shanmugasundaram02automaticreassembly,
+
    author = {Kulesh Shanmugasundaram},
+
    title = {Automatic Reassembly of Document Fragments via Data Compression},
+
    booktitle = {Presented at the 2nd Digital Forensics Research Workshop},
+
    year = {2002},
+
    pages = {152--159}
+
}
+
</bibtex>
+
 
+
[http://handle.dtic.mil/100.2/ADA432468 An analysis of disc carving techniques], Mikus, Nicholas A. " Master's Thesis, Naval Postgraduate School. March 2005.
+
 
+
Garfinkel, S., "Carving Contiguous and Fragmented Files with Fast Object Validation", Digital Forensics Workshop (DFRWS 2007), Pittsburgh, PA, August 2007.  http://www.simson.net/clips/academic/2007.DFRWS.pdf
+
 
+
===Sector Discrimination===
+
 
+
<bibtex>
+
@article{
+
  journal="Journal of Digital Forensic Practice", 
+
  publisher="Taylor & Francis",
+
  author="Yoginder Singh Dandass and Nathan Joseph Necaise and Sherry Reede Thomas",
+
  title="An Empirical Analysis of Disk Sector Hashes for Data Carving",
+
  year=2008,
+
  volume=2,
+
  issue=2,
+
  pages="95--106",
+
  abstract="Discovering known illicit material on digital storage devices is an important component of a digital forensic investigation. Using existing data carving techniques and tools, it is typically difficult to recover remaining fragments of deleted illicit files whose file system metadata and file headers have been overwritten by newer files. In such cases, a sector-based scan can be used to locate those sectors whose content matches those of sectors from known illicit files. However, brute-force sector-by-sector comparison is prohibitive in terms of time required. Techniques that compute and compare hash-based signatures of sectors in order to filter out those sectors that do not produce the same signatures as sectors from known illicit files are required for accelerating the process.
+
 
+
This article reports the results of a case study in which the hashes for over 528 million sectors extracted from over 433,000 files of different types were analyzed. The hashes were computed using SHA1, MD5, CRC64, and CRC32 algorithms and hash collisions of sectors from JPEG and WAV files to other sectors were recorded. The analysis of the results shows that although MD5 and SHA1 produce no false-positive indications, the occurrence of false positives is relatively low for CRC32 and especially CRC64. Furthermore, the CRC-based algorithms produce considerably smaller hashes than SHA1 and MD5, thereby requiring smaller storage capacities. CRC64 provides a good compromise between number of collisions and storage capacity required for practical implementations of sector-scanning forensic tools.",
+
  url="http://www.informaworld.com/10.1080/15567280802050436"
+
}
+
</bibtex>
+
 
+
[[Category:Bibliographies]]
+

Latest revision as of 12:12, 1 December 2010

Welcome to Forensics Wiki! We hope you will contribute much and well. You will probably want to read the help pages. Again, welcome and have fun! .FUF 09:12, 1 December 2010 (PST)