<?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"
	>
<channel>
	<title>Comments on: What is Homomorphic Encryption, and Why Should I Care?</title>
	<atom:link href="http://blogs.teamb.com/craigstuntz/2010/03/18/38566/feed/" rel="self" type="application/rss+xml" />
	<link>http://blogs.teamb.com/craigstuntz/2010/03/18/38566/</link>
	<description>C# • Entity Framework • Functional Programming • MVC • Web</description>
	<pubDate>Sat, 11 Feb 2012 15:22:52 +0000</pubDate>
	<generator>http://wordpress.org/?v=2.6.2</generator>
		<item>
		<title>By: Cuneyt Sina Koca</title>
		<link>http://blogs.teamb.com/craigstuntz/2010/03/18/38566/#comment-40930</link>
		<dc:creator>Cuneyt Sina Koca</dc:creator>
		<pubDate>Thu, 02 Feb 2012 22:26:28 +0000</pubDate>
		<guid isPermaLink="false">http://blogs.teamb.com/craigstuntz/?p=38566#comment-40930</guid>
		<description>Hi Craig,
Thanks for the article, I gained a lot from it.
At the end of the article you mention writing a new article which includes your code and insights about it. Is this new article available?</description>
		<content:encoded><![CDATA[<p>Hi Craig,<br />
Thanks for the article, I gained a lot from it.<br />
At the end of the article you mention writing a new article which includes your code and insights about it. Is this new article available?</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: &#187; Craig Stuntz&#8217;s Weblog : What is Homomorphic Encryption, and Why Should I Care? James&#39; Blog</title>
		<link>http://blogs.teamb.com/craigstuntz/2010/03/18/38566/#comment-33846</link>
		<dc:creator>&#187; Craig Stuntz&#8217;s Weblog : What is Homomorphic Encryption, and Why Should I Care? James&#39; Blog</dc:creator>
		<pubDate>Fri, 16 Sep 2011 02:11:16 +0000</pubDate>
		<guid isPermaLink="false">http://blogs.teamb.com/craigstuntz/?p=38566#comment-33846</guid>
		<description>[...] http://blogs.teamb.com/craigstuntz/2010/03/18/38566/ [...]</description>
		<content:encoded><![CDATA[<p>[...] <a href="http://blogs.teamb.com/craigstuntz/2010/03/18/38566/" rel="nofollow">http://blogs.teamb.com/craigstuntz/2010/03/18/38566/</a> [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: The Great Geek Manual &#187; Tech Round-Up: August 13, 2011</title>
		<link>http://blogs.teamb.com/craigstuntz/2010/03/18/38566/#comment-32769</link>
		<dc:creator>The Great Geek Manual &#187; Tech Round-Up: August 13, 2011</dc:creator>
		<pubDate>Mon, 15 Aug 2011 03:15:28 +0000</pubDate>
		<guid isPermaLink="false">http://blogs.teamb.com/craigstuntz/?p=38566#comment-32769</guid>
		<description>[...] as &#8216;cryptography&#8217;s holy grail&#8217;, Homomorphic Encryption/Computation is a form of encryption where specific algebraic operations on [...]</description>
		<content:encoded><![CDATA[<p>[...] as &#8216;cryptography&#8217;s holy grail&#8217;, Homomorphic Encryption/Computation is a form of encryption where specific algebraic operations on [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Homomorphic encryption: Can it save cloud computing? &#124; TechRepublic</title>
		<link>http://blogs.teamb.com/craigstuntz/2010/03/18/38566/#comment-28437</link>
		<dc:creator>Homomorphic encryption: Can it save cloud computing? &#124; TechRepublic</dc:creator>
		<pubDate>Mon, 09 May 2011 14:54:42 +0000</pubDate>
		<guid isPermaLink="false">http://blogs.teamb.com/craigstuntz/?p=38566#comment-28437</guid>
		<description>[...] decrypted locally to reveal the final answer of 5.   On his blog site, Craig Stuntz offers another layman&#8217;s explanation of homomorphic encryption, allowing me to better grasp the concept. He included the following [...]</description>
		<content:encoded><![CDATA[<p>[...] decrypted locally to reveal the final answer of 5.   On his blog site, Craig Stuntz offers another layman&#8217;s explanation of homomorphic encryption, allowing me to better grasp the concept. He included the following [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Nirali</title>
		<link>http://blogs.teamb.com/craigstuntz/2010/03/18/38566/#comment-25774</link>
		<dc:creator>Nirali</dc:creator>
		<pubDate>Thu, 24 Mar 2011 06:56:57 +0000</pubDate>
		<guid isPermaLink="false">http://blogs.teamb.com/craigstuntz/?p=38566#comment-25774</guid>
		<description>HI Craig,

This is indeed a very nice article . I am doing research on Gentry's scheme and the Math Primer you have posted might be really helpful too since the protocol is a lil complicated to understand.</description>
		<content:encoded><![CDATA[<p>HI Craig,</p>
<p>This is indeed a very nice article . I am doing research on Gentry&#8217;s scheme and the Math Primer you have posted might be really helpful too since the protocol is a lil complicated to understand.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Tracking recent research in biometrics &#124; peephal.com</title>
		<link>http://blogs.teamb.com/craigstuntz/2010/03/18/38566/#comment-19685</link>
		<dc:creator>Tracking recent research in biometrics &#124; peephal.com</dc:creator>
		<pubDate>Fri, 29 Oct 2010 17:35:40 +0000</pubDate>
		<guid isPermaLink="false">http://blogs.teamb.com/craigstuntz/?p=38566#comment-19685</guid>
		<description>[...] perform matching, compromising the privacy protections. An interesting topic at this conference was homomorphic encryption, a method that allows biometric matching to be done while the data is encrypted. For example, if a [...]</description>
		<content:encoded><![CDATA[<p>[...] perform matching, compromising the privacy protections. An interesting topic at this conference was homomorphic encryption, a method that allows biometric matching to be done while the data is encrypted. For example, if a [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Raphael L. Castro</title>
		<link>http://blogs.teamb.com/craigstuntz/2010/03/18/38566/#comment-16217</link>
		<dc:creator>Raphael L. Castro</dc:creator>
		<pubDate>Thu, 06 May 2010 08:54:45 +0000</pubDate>
		<guid isPermaLink="false">http://blogs.teamb.com/craigstuntz/?p=38566#comment-16217</guid>
		<description>I'd like to say thank you for this nice article and I'd like to know, if there is any problems with the link "Continue reading.." or is just my mystake that I can't get in there?

&lt;blockquote&gt;&lt;em&gt;&lt;strong&gt;Response:&lt;/strong&gt; Sorry; the link was broken. I fixed it. Thanks for mentioning it!&lt;/em&gt;&lt;/blockquote&gt;

</description>
		<content:encoded><![CDATA[<p>I&#8217;d like to say thank you for this nice article and I&#8217;d like to know, if there is any problems with the link "Continue reading.." or is just my mystake that I can&#8217;t get in there?</p>
<blockquote><p><em><strong>Response:</strong> Sorry; the link was broken. I fixed it. Thanks for mentioning it!</em></p></blockquote>
]]></content:encoded>
	</item>
	<item>
		<title>By: Craig Stuntz&#8217;s Weblog : A Math Primer for Gentry&#8217;s Fully Homomorphic Encryption</title>
		<link>http://blogs.teamb.com/craigstuntz/2010/03/18/38566/#comment-15606</link>
		<dc:creator>Craig Stuntz&#8217;s Weblog : A Math Primer for Gentry&#8217;s Fully Homomorphic Encryption</dc:creator>
		<pubDate>Thu, 08 Apr 2010 18:07:52 +0000</pubDate>
		<guid isPermaLink="false">http://blogs.teamb.com/craigstuntz/?p=38566#comment-15606</guid>
		<description>[...] couple of weeks ago, I wrote What Is Homomorphic Encryption, and Why Should I Care? In that post, I promised to share my C# implementation of the algorithm from Craig Gentry&#8217;s [...]</description>
		<content:encoded><![CDATA[<p>[...] couple of weeks ago, I wrote What Is Homomorphic Encryption, and Why Should I Care? In that post, I promised to share my C# implementation of the algorithm from Craig Gentry&#8217;s [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Marian Iskander</title>
		<link>http://blogs.teamb.com/craigstuntz/2010/03/18/38566/#comment-15588</link>
		<dc:creator>Marian Iskander</dc:creator>
		<pubDate>Wed, 07 Apr 2010 22:47:17 +0000</pubDate>
		<guid isPermaLink="false">http://blogs.teamb.com/craigstuntz/?p=38566#comment-15588</guid>
		<description>Imagine the benefits that we can get if such fully homomorphic systems trully exist while being practically efficient to implement and use. Imagine how this boost the cloud computing in the market since now more companies can rely on outsourcing their data, doing all different types of data aggregation and computations on the encrypted data, without having to worry about their privacy !! Amazing.. As if you can have your own crypto processor running under your fingertip.. I wish Bruce Schneier can talk more about the security aspects of this new and leave the practicallity issues to be resolved later.</description>
		<content:encoded><![CDATA[<p>Imagine the benefits that we can get if such fully homomorphic systems trully exist while being practically efficient to implement and use. Imagine how this boost the cloud computing in the market since now more companies can rely on outsourcing their data, doing all different types of data aggregation and computations on the encrypted data, without having to worry about their privacy !! Amazing.. As if you can have your own crypto processor running under your fingertip.. I wish Bruce Schneier can talk more about the security aspects of this new and leave the practicallity issues to be resolved later.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Craig Stuntz</title>
		<link>http://blogs.teamb.com/craigstuntz/2010/03/18/38566/#comment-15297</link>
		<dc:creator>Craig Stuntz</dc:creator>
		<pubDate>Tue, 23 Mar 2010 21:55:05 +0000</pubDate>
		<guid isPermaLink="false">http://blogs.teamb.com/craigstuntz/?p=38566#comment-15297</guid>
		<description>Thank you, Robert. My next post on this subject, which I hope to have up next week, will be an introduction to the mathematics used in Gentry's scheme, and I should be able to examine the circuits approach to algorithms more precisely then.

Thanks again for pointing this out.</description>
		<content:encoded><![CDATA[<p>Thank you, Robert. My next post on this subject, which I hope to have up next week, will be an introduction to the mathematics used in Gentry&#8217;s scheme, and I should be able to examine the circuits approach to algorithms more precisely then.</p>
<p>Thanks again for pointing this out.</p>
]]></content:encoded>
	</item>
</channel>
</rss>

