<?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/"
	xmlns:georss="http://www.georss.org/georss" xmlns:geo="http://www.w3.org/2003/01/geo/wgs84_pos#" xmlns:media="http://search.yahoo.com/mrss/"
		>
<channel>
	<title>Comments on: About 33 Bits</title>
	<atom:link href="http://33bits.org/about/feed/" rel="self" type="application/rss+xml" />
	<link>http://33bits.org</link>
	<description>The End of Anonymized Data and What to Do About It</description>
	<lastBuildDate>Tue, 06 Dec 2011 23:45:54 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.com/</generator>
	<item>
		<title>By: Arvind</title>
		<link>http://33bits.org/about/#comment-1013</link>
		<dc:creator><![CDATA[Arvind]]></dc:creator>
		<pubDate>Fri, 12 Feb 2010 05:15:00 +0000</pubDate>
		<guid isPermaLink="false">#comment-1013</guid>
		<description><![CDATA[No, I&#039;m not implying that. Entropy is simply a mathematical construct that describes how much information there is to be gained from a piece of data. It says nothing about how easy it is to find data  about a person. The fact that is is easy to find auxiliary sources of data in order to determine someone&#039;s identity is an empirical observation.

&quot;Also there might only be 6billion humans on this earth but it doesn’t mean we can’t have 6000billion identities, right?&quot;

That is true; however - 

1. unless you make sure your behavior under each identity is completely independent of the others, your various identities can still be tied to each other.

2. the effort needed to create even a single believable alternate virtual identity is too high for most people to bother with.

3. going from 6 billion to 6000 billion identities only increases the entropy requirement from 33 to 43 bits, which is a negligible increase!]]></description>
		<content:encoded><![CDATA[<p>No, I&#8217;m not implying that. Entropy is simply a mathematical construct that describes how much information there is to be gained from a piece of data. It says nothing about how easy it is to find data  about a person. The fact that is is easy to find auxiliary sources of data in order to determine someone&#8217;s identity is an empirical observation.</p>
<p>&#8220;Also there might only be 6billion humans on this earth but it doesn’t mean we can’t have 6000billion identities, right?&#8221;</p>
<p>That is true; however &#8211; </p>
<p>1. unless you make sure your behavior under each identity is completely independent of the others, your various identities can still be tied to each other.</p>
<p>2. the effort needed to create even a single believable alternate virtual identity is too high for most people to bother with.</p>
<p>3. going from 6 billion to 6000 billion identities only increases the entropy requirement from 33 to 43 bits, which is a negligible increase!</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: anonymouscat</title>
		<link>http://33bits.org/about/#comment-1009</link>
		<dc:creator><![CDATA[anonymouscat]]></dc:creator>
		<pubDate>Fri, 12 Feb 2010 03:32:10 +0000</pubDate>
		<guid isPermaLink="false">#comment-1009</guid>
		<description><![CDATA[Arvind Sahib, 
when you say that you only require 33 bits of information and that my hometown contributes 16 or so bits, you are implying that getting more of the relevant bits is as easy as finding my hometown. Also there might only be 6billion humans on this earth but it doesn&#039;t mean we can&#039;t have 6000billion identities, right?]]></description>
		<content:encoded><![CDATA[<p>Arvind Sahib,<br />
when you say that you only require 33 bits of information and that my hometown contributes 16 or so bits, you are implying that getting more of the relevant bits is as easy as finding my hometown. Also there might only be 6billion humans on this earth but it doesn&#8217;t mean we can&#8217;t have 6000billion identities, right?</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Lars</title>
		<link>http://33bits.org/about/#comment-830</link>
		<dc:creator><![CDATA[Lars]]></dc:creator>
		<pubDate>Mon, 23 Nov 2009 09:37:28 +0000</pubDate>
		<guid isPermaLink="false">#comment-830</guid>
		<description><![CDATA[You probably should mention that it is 32.6 distinguished bytes of data. Although this should be clear to anybody ever having heard the term &#039;entropy&#039; in the computer science context, comments above show that this is not the case for all of your readers. 

The actual truth is, that you need only 33 bits to encode an unique identity for every person. Needing only 33 bits to identify everyone sounds freakish alarming (considering that my name above in ASCII already takes up 32 bits. But it could be a little more clear, that you need very special 33 bits.

Having said that, I envy you for having had the idea for that title, instead of me that is.]]></description>
		<content:encoded><![CDATA[<p>You probably should mention that it is 32.6 distinguished bytes of data. Although this should be clear to anybody ever having heard the term &#8216;entropy&#8217; in the computer science context, comments above show that this is not the case for all of your readers. </p>
<p>The actual truth is, that you need only 33 bits to encode an unique identity for every person. Needing only 33 bits to identify everyone sounds freakish alarming (considering that my name above in ASCII already takes up 32 bits. But it could be a little more clear, that you need very special 33 bits.</p>
<p>Having said that, I envy you for having had the idea for that title, instead of me that is.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Arvind</title>
		<link>http://33bits.org/about/#comment-615</link>
		<dc:creator><![CDATA[Arvind]]></dc:creator>
		<pubDate>Sun, 09 Aug 2009 21:44:42 +0000</pubDate>
		<guid isPermaLink="false">#comment-615</guid>
		<description><![CDATA[Thanks for your comment. This thread is too getting deep, I&#039;ve replied to you below.]]></description>
		<content:encoded><![CDATA[<p>Thanks for your comment. This thread is too getting deep, I&#8217;ve replied to you below.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Arvind</title>
		<link>http://33bits.org/about/#comment-614</link>
		<dc:creator><![CDATA[Arvind]]></dc:creator>
		<pubDate>Sun, 09 Aug 2009 21:43:43 +0000</pubDate>
		<guid isPermaLink="false">#comment-614</guid>
		<description><![CDATA[John,

It would indeed be good to have such a script; at the same time, I think limiting the rate at which an attacker can guess passwords has a far greater effect on password security than making the user choose stronger passwords.

The entropy of a password is only vaguely defined. It can only be measured relative to the algorithm that the attacker is going to use, which of course is unknown. I have a &lt;a href=&quot;http://www.cs.utexas.edu/~shmat/abstracts.html#pwd&quot; rel=&quot;nofollow&quot;&gt;paper&lt;/a&gt; on password cracking, which might help explain what I&#039;m talking about.]]></description>
		<content:encoded><![CDATA[<p>John,</p>
<p>It would indeed be good to have such a script; at the same time, I think limiting the rate at which an attacker can guess passwords has a far greater effect on password security than making the user choose stronger passwords.</p>
<p>The entropy of a password is only vaguely defined. It can only be measured relative to the algorithm that the attacker is going to use, which of course is unknown. I have a <a href="http://www.cs.utexas.edu/~shmat/abstracts.html#pwd" rel="nofollow">paper</a> on password cracking, which might help explain what I&#8217;m talking about.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: John</title>
		<link>http://33bits.org/about/#comment-613</link>
		<dc:creator><![CDATA[John]]></dc:creator>
		<pubDate>Sun, 09 Aug 2009 21:32:12 +0000</pubDate>
		<guid isPermaLink="false">#comment-613</guid>
		<description><![CDATA[Great work, very interesting Arvind.

Somewhat unrelated, but I&#039;m hoping someone comes up with a &quot;password meter&quot; that shows actual bits of entropy.

As you are no doubt aware, many folks choose, um, poorly.

http://www.webresourcesdepot.com/10-password-strength-meter-scripts-for-a-better-registration-interface/ has varying levels; some are graphically great, but some call back to servers for parts of their functionality.

I question the algorithms that are used to determine effectiveness; I&#039;m imagining things like the old Pgp versions that used to show a calculated entropy in bits (now you know how I found your site!) in real time, as you typed what you hoped was a good pass phrase.

&lt;a href=&quot;https://leveron.com/&quot; rel=&quot;nofollow&quot;&gt;Thanks, John&lt;/a&gt;]]></description>
		<content:encoded><![CDATA[<p>Great work, very interesting Arvind.</p>
<p>Somewhat unrelated, but I&#8217;m hoping someone comes up with a &#8220;password meter&#8221; that shows actual bits of entropy.</p>
<p>As you are no doubt aware, many folks choose, um, poorly.</p>
<p><a href="http://www.webresourcesdepot.com/10-password-strength-meter-scripts-for-a-better-registration-interface/" rel="nofollow">http://www.webresourcesdepot.com/10-password-strength-meter-scripts-for-a-better-registration-interface/</a> has varying levels; some are graphically great, but some call back to servers for parts of their functionality.</p>
<p>I question the algorithms that are used to determine effectiveness; I&#8217;m imagining things like the old Pgp versions that used to show a calculated entropy in bits (now you know how I found your site!) in real time, as you typed what you hoped was a good pass phrase.</p>
<p><a href="https://leveron.com/" rel="nofollow">Thanks, John</a></p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Arvind</title>
		<link>http://33bits.org/about/#comment-416</link>
		<dc:creator><![CDATA[Arvind]]></dc:creator>
		<pubDate>Sun, 24 May 2009 01:24:44 +0000</pubDate>
		<guid isPermaLink="false">#comment-416</guid>
		<description><![CDATA[Relax, she didn&#039;t say she was a computer scientist. It is perfectly reasonable for a non-CS/math/physics person not to be able to figure out entropy without any explanation.]]></description>
		<content:encoded><![CDATA[<p>Relax, she didn&#8217;t say she was a computer scientist. It is perfectly reasonable for a non-CS/math/physics person not to be able to figure out entropy without any explanation.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: george</title>
		<link>http://33bits.org/about/#comment-394</link>
		<dc:creator><![CDATA[george]]></dc:creator>
		<pubDate>Thu, 21 May 2009 09:20:41 +0000</pubDate>
		<guid isPermaLink="false">#comment-394</guid>
		<description><![CDATA[I can&#039;t believe that a doctoral student just asked about &quot;the math&quot; behind this. You don&#039;t even need to know about log2 in order to figure this out.

1 bit can hold two values
2 bits can hold four values
how many bits do you need  to hold 6 billion values?

One can just start entering powers of 2 in his calculator until his reaches that sum!.


I`m sorry if I come across as bashing but I&#039;m genuinely freaked out.]]></description>
		<content:encoded><![CDATA[<p>I can&#8217;t believe that a doctoral student just asked about &#8220;the math&#8221; behind this. You don&#8217;t even need to know about log2 in order to figure this out.</p>
<p>1 bit can hold two values<br />
2 bits can hold four values<br />
how many bits do you need  to hold 6 billion values?</p>
<p>One can just start entering powers of 2 in his calculator until his reaches that sum!.</p>
<p>I`m sorry if I come across as bashing but I&#8217;m genuinely freaked out.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Arvind</title>
		<link>http://33bits.org/about/#comment-209</link>
		<dc:creator><![CDATA[Arvind]]></dc:creator>
		<pubDate>Fri, 27 Mar 2009 18:19:20 +0000</pubDate>
		<guid isPermaLink="false">#comment-209</guid>
		<description><![CDATA[It&#039;s the logarithm of the world human population. Please see the &lt;a href=&quot;http://en.wikipedia.org/wiki/Entropy_(Information_theory)&quot; rel=&quot;nofollow&quot;&gt;definition of entropy&lt;/a&gt;. A quantity that has N possible values has an entropy of at most log_2(N) bits, by definition.]]></description>
		<content:encoded><![CDATA[<p>It&#8217;s the logarithm of the world human population. Please see the <a href="http://en.wikipedia.org/wiki/Entropy_(Information_theory)" rel="nofollow">definition of entropy</a>. A quantity that has N possible values has an entropy of at most log_2(N) bits, by definition.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Dianne Bltistein Solomon</title>
		<link>http://33bits.org/about/#comment-208</link>
		<dc:creator><![CDATA[Dianne Bltistein Solomon]]></dc:creator>
		<pubDate>Fri, 27 Mar 2009 18:03:02 +0000</pubDate>
		<guid isPermaLink="false">#comment-208</guid>
		<description><![CDATA[Hi..  I&#039;m a doctoral student at Nova Southeastern Universtiy working on privacy and ecommerce.  Just found your blog.  What&#039;s the math behind the 32.6 bits?]]></description>
		<content:encoded><![CDATA[<p>Hi..  I&#8217;m a doctoral student at Nova Southeastern Universtiy working on privacy and ecommerce.  Just found your blog.  What&#8217;s the math behind the 32.6 bits?</p>
]]></content:encoded>
	</item>
</channel>
</rss>
