<?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: Birthmarks for GPL</title>
	<atom:link href="http://madisonian.net/2007/08/26/birthmarks-for-gpl/feed/" rel="self" type="application/rss+xml" />
	<link>http://madisonian.net/2007/08/26/birthmarks-for-gpl/</link>
	<description>a blog about law, tech, culture, and related things</description>
	<lastBuildDate>Sat, 11 Feb 2012 02:59:42 -0600</lastBuildDate>
	<generator>http://wordpress.org/?v=2.8.4</generator>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
		<item>
		<title>By: Bruce Boyden</title>
		<link>http://madisonian.net/2007/08/26/birthmarks-for-gpl/comment-page-1/#comment-224130</link>
		<dc:creator>Bruce Boyden</dc:creator>
		<pubDate>Mon, 27 Aug 2007 16:03:41 +0000</pubDate>
		<guid isPermaLink="false">http://madisonian.net/archives/2007/08/26/birthmarks-for-gpl/#comment-224130</guid>
		<description>I&#039;m curious why this works. Wouldn&#039;t two programs that do roughly the same thing, e.g., Word and WordPerfect, make a lot of the same API calls in the same order? But I notice there&#039;s barely any overlap between the various PNG and XML readers tested in the paper.</description>
		<content:encoded><![CDATA[<p>I&#8217;m curious why this works. Wouldn&#8217;t two programs that do roughly the same thing, e.g., Word and WordPerfect, make a lot of the same API calls in the same order? But I notice there&#8217;s barely any overlap between the various PNG and XML readers tested in the paper.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: James Grimmelmann</title>
		<link>http://madisonian.net/2007/08/26/birthmarks-for-gpl/comment-page-1/#comment-224129</link>
		<dc:creator>James Grimmelmann</dc:creator>
		<pubDate>Mon, 27 Aug 2007 05:25:30 +0000</pubDate>
		<guid isPermaLink="false">http://madisonian.net/archives/2007/08/26/birthmarks-for-gpl/#comment-224129</guid>
		<description>k-gram call sequence analysis can be surprisingly powerful; it does seem that a program&#039;s sequence of API calls is a reasonably hard-to-change property.  As an undergraduate, I saw a presentation of some of the &quot;computer immunology&quot; research cited by this paper: the reasoning goes that a novel sequence of API calls is evidence of a new program running (which could be a piece of malware).  This paper just inverts that logic: a familiar sequence of API calls is evidence that the &quot;new&quot; program is an old program in disguise.

I&#039;m surprised that they don&#039;t extend the binary nature of this &quot;birthmark&quot; to keep a statistical count of the sequences.  At least for programs executing similar tasks, it would seem that the frequency of a k-gram would be even more revealing that whether that sequence was executed at all.</description>
		<content:encoded><![CDATA[<p>k-gram call sequence analysis can be surprisingly powerful; it does seem that a program&#8217;s sequence of API calls is a reasonably hard-to-change property.  As an undergraduate, I saw a presentation of some of the &#8220;computer immunology&#8221; research cited by this paper: the reasoning goes that a novel sequence of API calls is evidence of a new program running (which could be a piece of malware).  This paper just inverts that logic: a familiar sequence of API calls is evidence that the &#8220;new&#8221; program is an old program in disguise.</p>
<p>I&#8217;m surprised that they don&#8217;t extend the binary nature of this &#8220;birthmark&#8221; to keep a statistical count of the sequences.  At least for programs executing similar tasks, it would seem that the frequency of a k-gram would be even more revealing that whether that sequence was executed at all.</p>
]]></content:encoded>
	</item>
</channel>
</rss>

