<?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: Microsoft to Delete IP Addresses From Bing Search Logs after 6 months</title>
	<atom:link href="http://michaelzimmer.org/2010/01/19/microsoft-to-delete-ip-addresses-from-bing-search-logs-after-6-months/feed/" rel="self" type="application/rss+xml" />
	<link>http://michaelzimmer.org/2010/01/19/microsoft-to-delete-ip-addresses-from-bing-search-logs-after-6-months/</link>
	<description>information ethics : privacy : new media : values in design : 2.0</description>
	<lastBuildDate>Thu, 26 Apr 2012 13:58:09 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.3.2</generator>
	<item>
		<title>By: Álvaro Del Hoyo</title>
		<link>http://michaelzimmer.org/2010/01/19/microsoft-to-delete-ip-addresses-from-bing-search-logs-after-6-months/comment-page-1/#comment-160476</link>
		<dc:creator>Álvaro Del Hoyo</dc:creator>
		<pubDate>Wed, 27 Jan 2010 12:40:01 +0000</pubDate>
		<guid isPermaLink="false">http://michaelzimmer.org/?p=1742#comment-160476</guid>
		<description>Michael,

Queries cookie ID is called MUID...have check on my web navigator and MUID structure is 32 characters combination of capital letters and numbers.

So knowinfg the way Microsoft is creating its own MUID and de-identification hashing algorithm guess could be possible to apply brute force until generate hash that correlates a particular hash on Bing queries log databases.

Regards</description>
		<content:encoded><![CDATA[<p>Michael,</p>
<p>Queries cookie ID is called MUID&#8230;have check on my web navigator and MUID structure is 32 characters combination of capital letters and numbers.</p>
<p>So knowinfg the way Microsoft is creating its own MUID and de-identification hashing algorithm guess could be possible to apply brute force until generate hash that correlates a particular hash on Bing queries log databases.</p>
<p>Regards</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Álvaro Del Hoyo</title>
		<link>http://michaelzimmer.org/2010/01/19/microsoft-to-delete-ip-addresses-from-bing-search-logs-after-6-months/comment-page-1/#comment-160475</link>
		<dc:creator>Álvaro Del Hoyo</dc:creator>
		<pubDate>Wed, 27 Jan 2010 12:31:05 +0000</pubDate>
		<guid isPermaLink="false">http://michaelzimmer.org/?p=1742#comment-160475</guid>
		<description>Hi there, Michael

http://download.microsoft.com/download/3/1/d/31df6942-ed99-4024-a0e0-594b9d27a31a/Privacy%20Protections%20in%20Microsoft%27s%20Ad%20Serving%20System%20and%20the%20Process%20of%20De-Identification.pdf

Do you know which is the structure of cookie ID assigned to queries on Bing?
Would it be feasible to apply brute force in combination with hash algorythm for de-identification process used?
Revert hash to cookie ID is not possible, but is it possible to generate same hash for a particular cookie ID? If lenght and complexity of cookie ID structure is simple, I believe would be easy to generate multiple hashes until creation of a particular one?

Which is your opinion?

Regards</description>
		<content:encoded><![CDATA[<p>Hi there, Michael</p>
<p><a href="http://download.microsoft.com/download/3/1/d/31df6942-ed99-4024-a0e0-594b9d27a31a/Privacy%20Protections%20in%20Microsoft%27s%20Ad%20Serving%20System%20and%20the%20Process%20of%20De-Identification.pdf" rel="nofollow">http://download.microsoft.com/download/3/1/d/31df6942-ed99-4024-a0e0-594b9d27a31a/Privacy%20Protections%20in%20Microsoft%27s%20Ad%20Serving%20System%20and%20the%20Process%20of%20De-Identification.pdf</a></p>
<p>Do you know which is the structure of cookie ID assigned to queries on Bing?<br />
Would it be feasible to apply brute force in combination with hash algorythm for de-identification process used?<br />
Revert hash to cookie ID is not possible, but is it possible to generate same hash for a particular cookie ID? If lenght and complexity of cookie ID structure is simple, I believe would be easy to generate multiple hashes until creation of a particular one?</p>
<p>Which is your opinion?</p>
<p>Regards</p>
]]></content:encoded>
	</item>
</channel>
</rss>

