
<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
		>
<channel>
	<title>Comments on: NSRL (National Software Reference Library)</title>
	<atom:link href="http://viaforensics.com/computer-forensic-ediscovery-glossary/what-is-nsrl.html/feed/" rel="self" type="application/rss+xml" />
	<link>http://viaforensics.com/computer-forensic-ediscovery-glossary/what-is-nsrl.html</link>
	<description>innovative digital forensics and security</description>
	<lastBuildDate>Sun, 08 Jan 2012 22:18:00 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.2.1</generator>
<xhtml:meta xmlns:xhtml="http://www.w3.org/1999/xhtml" name="robots" content="noindex" />
	<item>
		<title>By: johnny</title>
		<link>http://viaforensics.com/computer-forensic-ediscovery-glossary/what-is-nsrl.html/comment-page-1/#comment-47</link>
		<dc:creator>johnny</dc:creator>
		<pubDate>Wed, 31 Dec 2008 02:26:09 +0000</pubDate>
		<guid isPermaLink="false">http://chicago-ediscovery.com/?p=318#comment-47</guid>
		<description>2cWdUu Thanks for good post</description>
		<content:encoded><![CDATA[<p>2cWdUu Thanks for good post</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Brian Deering</title>
		<link>http://viaforensics.com/computer-forensic-ediscovery-glossary/what-is-nsrl.html/comment-page-1/#comment-39</link>
		<dc:creator>Brian Deering</dc:creator>
		<pubDate>Tue, 16 Dec 2008 02:44:48 +0000</pubDate>
		<guid isPermaLink="false">http://chicago-ediscovery.com/?p=318#comment-39</guid>
		<description>HashKeeper, the predecessor of the NSRL, and the NSRL were created for different uses. HashKeeper was created to reduce the time required by those who conduct forensic examinations of seized hard drives.

HashKeeper stores hash values of “known to be good” files, such as those from an install of a software package, and hash values from “known to be bad files, such as those from child pornography, malware and planted files. When examiners compare the known to be bad hash values against the hash values from an unknown file system they can quickly and reliably focus their attentions on those files most likely to be probative. Matches against known to be good file hashes allow the examiner to reliably overlook those files on the unknown file system.

HashKeeper was intended to be open so that investigators could share their efforts with other investigators much the way law enforcement has been sharing their efforts for the last hundred years or so.

Provenance - HashKeeper was never intended to prove provenance. Provenance only becomes an issue in copyright crimes.

Admissibility – This is a curious issue. When known to be good hash values are used to eliminate files from an examination admissibility is a non-issue. In the American legal system, and I suspect the majority of legal systems, no one is required to prove the provenance or worry about admissibility of things not presented in court. As for matches with known to be bad files the match alone is meaningless (the whole probability thing). The responsibility still rests with the examiner to show that what’s being introduced is probative.

Specificity – HashKeeper started with MD5 hash values. MD5 is reliable. The likelihood of a false positive or false negative with MD5 is really, really, really small and then really, really smaller than that. Adding SHA-1 and CRC 32 to the comparisons makes an already absurdly unlikely event more absurdly unlikely. The benefit is unclear.</description>
		<content:encoded><![CDATA[<p>HashKeeper, the predecessor of the NSRL, and the NSRL were created for different uses. HashKeeper was created to reduce the time required by those who conduct forensic examinations of seized hard drives.</p>
<p>HashKeeper stores hash values of “known to be good” files, such as those from an install of a software package, and hash values from “known to be bad files, such as those from child pornography, malware and planted files. When examiners compare the known to be bad hash values against the hash values from an unknown file system they can quickly and reliably focus their attentions on those files most likely to be probative. Matches against known to be good file hashes allow the examiner to reliably overlook those files on the unknown file system.</p>
<p>HashKeeper was intended to be open so that investigators could share their efforts with other investigators much the way law enforcement has been sharing their efforts for the last hundred years or so.</p>
<p>Provenance &#8211; HashKeeper was never intended to prove provenance. Provenance only becomes an issue in copyright crimes.</p>
<p>Admissibility – This is a curious issue. When known to be good hash values are used to eliminate files from an examination admissibility is a non-issue. In the American legal system, and I suspect the majority of legal systems, no one is required to prove the provenance or worry about admissibility of things not presented in court. As for matches with known to be bad files the match alone is meaningless (the whole probability thing). The responsibility still rests with the examiner to show that what’s being introduced is probative.</p>
<p>Specificity – HashKeeper started with MD5 hash values. MD5 is reliable. The likelihood of a false positive or false negative with MD5 is really, really, really small and then really, really smaller than that. Adding SHA-1 and CRC 32 to the comparisons makes an already absurdly unlikely event more absurdly unlikely. The benefit is unclear.</p>
]]></content:encoded>
	</item>
</channel>
</rss>

