<?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 for Pomcor</title>
	<atom:link href="http://pomcor.com/comments/feed/" rel="self" type="application/rss+xml" />
	<link>http://pomcor.com</link>
	<description>Research in Web Technology</description>
	<lastBuildDate>Tue, 14 Feb 2012 05:18:00 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.2.1</generator>
	<item>
		<title>Comment on One-Click OpenID: A Solution to the NASCAR Problem by Francisco Corella</title>
		<link>http://pomcor.com/2012/02/13/one-click-openid-a-solution-to-the-nascar-problem/#comment-95</link>
		<dc:creator>Francisco Corella</dc:creator>
		<pubDate>Tue, 14 Feb 2012 05:18:00 +0000</pubDate>
		<guid isPermaLink="false">http://pomcor.com/?p=456#comment-95</guid>
		<description>If you read the whole paragraph you&#039;ll see we are in agreement.  In OAuth the relying party has to preregister with the identity provider.  That&#039;s a BAD thing, because the user cannot freely choose any identity provider.  Since the user cannot choose freely, the problem of how to communicate a free choice doesn&#039;t come up.  So an OAuth relying party just shows one or two buttons with the logos of the identity providers (social sites) that it supports.  And the user is redirected to the identity provider with a single click.  What I&#039;m proposing provides the same one-click simplicity in OpenID, without sacrificing the freedom of choice proviced by OpenID.

To summarize: I do like OpenID better than OAuth :-)
</description>
		<content:encoded><![CDATA[<p>If you read the whole paragraph you&#8217;ll see we are in agreement.  In OAuth the relying party has to preregister with the identity provider.  That&#8217;s a BAD thing, because the user cannot freely choose any identity provider.  Since the user cannot choose freely, the problem of how to communicate a free choice doesn&#8217;t come up.  So an OAuth relying party just shows one or two buttons with the logos of the identity providers (social sites) that it supports.  And the user is redirected to the identity provider with a single click.  What I&#8217;m proposing provides the same one-click simplicity in OpenID, without sacrificing the freedom of choice proviced by OpenID.</p>
<p>To summarize: I do like OpenID better than OAuth <img src='http://pomcor.com/wp-includes/images/smilies/icon_smile.gif' alt=':-)' class='wp-smiley' /> </p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on One-Click OpenID: A Solution to the NASCAR Problem by Andrew Arnott</title>
		<link>http://pomcor.com/2012/02/13/one-click-openid-a-solution-to-the-nascar-problem/#comment-94</link>
		<dc:creator>Andrew Arnott</dc:creator>
		<pubDate>Tue, 14 Feb 2012 04:30:00 +0000</pubDate>
		<guid isPermaLink="false">http://pomcor.com/?p=456#comment-94</guid>
		<description>&quot;OpenID. Unfortunately, this feature comes with a difficult challenge: how to provide the relying party with the information it needs to interact with the identity provider.  OAuth does not have this problem because the relying party has to preregister with the identity provider, ...&quot;  Wait what?  I think you&#039;ve got it backwards.  OpenID doesn&#039;t have the problems that OAuth has, because OpenID has discovery of Providers built-in, whereas OAuth has no such discovery built in.  </description>
		<content:encoded><![CDATA[<p>&#8220;OpenID. Unfortunately, this feature comes with a difficult challenge: how to provide the relying party with the information it needs to interact with the identity provider.  OAuth does not have this problem because the relying party has to preregister with the identity provider, &#8230;&#8221;  Wait what?  I think you&#8217;ve got it backwards.  OpenID doesn&#8217;t have the problems that OAuth has, because OpenID has discovery of Providers built-in, whereas OAuth has no such discovery built in.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Pros and Cons of U-Prove for NSTIC by Francisco Corella</title>
		<link>http://pomcor.com/2011/10/04/pros-and-cons-of-u-prove-for-nstic/#comment-93</link>
		<dc:creator>Francisco Corella</dc:creator>
		<pubDate>Sun, 23 Oct 2011 00:45:00 +0000</pubDate>
		<guid isPermaLink="false">http://pomcor.com/?p=321#comment-93</guid>
		<description>You could tell Pieter to make a .tar.gz file in addition to the .zip file and put it online so that the link works :-)</description>
		<content:encoded><![CDATA[<p>You could tell Pieter to make a .tar.gz file in addition to the .zip file and put it online so that the link works <img src='http://pomcor.com/wp-includes/images/smilies/icon_smile.gif' alt=':-)' class='wp-smiley' /> </p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Pros and Cons of U-Prove for NSTIC by Francisco Corella</title>
		<link>http://pomcor.com/2011/10/04/pros-and-cons-of-u-prove-for-nstic/#comment-92</link>
		<dc:creator>Francisco Corella</dc:creator>
		<pubDate>Sun, 23 Oct 2011 00:37:00 +0000</pubDate>
		<guid isPermaLink="false">http://pomcor.com/?p=321#comment-92</guid>
		<description>Thank you for the info and for the link to Rogaar&#039;s thesis.

Best regards,

Francisco Corella</description>
		<content:encoded><![CDATA[<p>Thank you for the info and for the link to Rogaar&#8217;s thesis.</p>
<p>Best regards,</p>
<p>Francisco Corella</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Pros and Cons of Idemix for NSTIC by Pim Vullers</title>
		<link>http://pomcor.com/2011/10/10/pros-and-cons-of-idemix-for-nstic/#comment-91</link>
		<dc:creator>Pim Vullers</dc:creator>
		<pubDate>Fri, 21 Oct 2011 07:21:00 +0000</pubDate>
		<guid isPermaLink="false">http://pomcor.com/?p=339#comment-91</guid>
		<description>Although I do not have actual figures for the performance of Idemix, I can tell that running the test cases provided with the library have an acceptable running time, i.e. at most a few seconds whereas I guess that the simple cases (without any of the advanced features) take less than a second.

After our success with the MULTOS implementation of U-Prove we have now started working on an implementation of Idemix on a smart card. Here, again, we take a different approach then the original developers of the technology. We intend to implement the real Idemix protocols on the card instead of the DAA derivatives. However, we limit ourselves to the same functionality as our U-Prove implementation, that is selective disclosure. This means that we do not work on the advanced features of the technology, but we hope to get some decent performance by focusing on the core functionality,

Kind regards,
Pim Vullers</description>
		<content:encoded><![CDATA[<p>Although I do not have actual figures for the performance of Idemix, I can tell that running the test cases provided with the library have an acceptable running time, i.e. at most a few seconds whereas I guess that the simple cases (without any of the advanced features) take less than a second.</p>
<p>After our success with the MULTOS implementation of U-Prove we have now started working on an implementation of Idemix on a smart card. Here, again, we take a different approach then the original developers of the technology. We intend to implement the real Idemix protocols on the card instead of the DAA derivatives. However, we limit ourselves to the same functionality as our U-Prove implementation, that is selective disclosure. This means that we do not work on the advanced features of the technology, but we hope to get some decent performance by focusing on the core functionality,</p>
<p>Kind regards,<br />
Pim Vullers</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Pros and Cons of U-Prove for NSTIC by Pim Vullers</title>
		<link>http://pomcor.com/2011/10/04/pros-and-cons-of-u-prove-for-nstic/#comment-90</link>
		<dc:creator>Pim Vullers</dc:creator>
		<pubDate>Thu, 20 Oct 2011 14:50:00 +0000</pubDate>
		<guid isPermaLink="false">http://pomcor.com/?p=321#comment-90</guid>
		<description>The correct link for [2] is http://rogaar.org/thesis/UProve10WithIntervalProofs.zip i.e. the link given in the thesis is wrong.</description>
		<content:encoded><![CDATA[<p>The correct link for [2] is <a href="http://rogaar.org/thesis/UProve10WithIntervalProofs.zip" rel="nofollow">http://rogaar.org/thesis/UProve10WithIntervalProofs.zip</a> i.e. the link given in the thesis is wrong.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Pros and Cons of U-Prove for NSTIC by Pim Vullers</title>
		<link>http://pomcor.com/2011/10/04/pros-and-cons-of-u-prove-for-nstic/#comment-89</link>
		<dc:creator>Pim Vullers</dc:creator>
		<pubDate>Thu, 20 Oct 2011 14:47:00 +0000</pubDate>
		<guid isPermaLink="false">http://pomcor.com/?p=321#comment-89</guid>
		<description>I can confirm that &quot;proving that a secret is contained in an interval&quot; has a large overhead. A Master student I supervised, Pieter Rogaar, implemented this functionality based on the C# U-Prove SDK. His thesis entitled &quot;Attributes and tokens in U-Prove: Interval proofs and use cases&quot; describes the underlying mathematics [1] as well as a usability study for U-Prove for several scenarios (focussing on IT-projects in The Netherlands). 

Improvements to the actual implementation [2] can be made depending on the encoding of the attribute and the definition of the interval, but an interval prove will still consume considerably more time than just showing the attribute.

Kind regards,
Pim Vullers

[1] http://www.jbisa.nl/download/?id=17674007&amp;download=1
[2] http://rogaar.org/thesis/UProve10WithIntervalProofs.tar.gz</description>
		<content:encoded><![CDATA[<p>I can confirm that &#8220;proving that a secret is contained in an interval&#8221; has a large overhead. A Master student I supervised, Pieter Rogaar, implemented this functionality based on the C# U-Prove SDK. His thesis entitled &#8220;Attributes and tokens in U-Prove: Interval proofs and use cases&#8221; describes the underlying mathematics [1] as well as a usability study for U-Prove for several scenarios (focussing on IT-projects in The Netherlands). </p>
<p>Improvements to the actual implementation [2] can be made depending on the encoding of the attribute and the definition of the interval, but an interval prove will still consume considerably more time than just showing the attribute.</p>
<p>Kind regards,<br />
Pim Vullers</p>
<p>[1] <a href="http://www.jbisa.nl/download/?id=17674007&#038;download=1" rel="nofollow">http://www.jbisa.nl/download/?id=17674007&#038;download=1</a><br />
[2] <a href="http://rogaar.org/thesis/UProve10WithIntervalProofs.tar.gz" rel="nofollow">http://rogaar.org/thesis/UProve10WithIntervalProofs.tar.gz</a></p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Pros and Cons of U-Prove for NSTIC by Christian Paquin</title>
		<link>http://pomcor.com/2011/10/04/pros-and-cons-of-u-prove-for-nstic/#comment-87</link>
		<dc:creator>Christian Paquin</dc:creator>
		<pubDate>Wed, 05 Oct 2011 14:27:00 +0000</pubDate>
		<guid isPermaLink="false">http://pomcor.com/?p=321#comment-87</guid>
		<description>Francisco,

Very interesting discussion, I’m looking forward to read the following posts. I’d like to provide high-level comments.

First, regarding multi-show unlinkability, note that we define a U-Prove “credential” as a batch of (renewable, as needed) U-Prove tokens. Given the efficiency of the U-Prove protocols (especially when using the ECC variant), this _has_ proven quite practical in web scenarios (as demonstrated by our last two technology previews, http://www.microsoft.com/u-prove).

Our current public specification describes a subset of fundamental features of the technology, carefully chosen to facilitate integration into existing identity systems (which are not equipped to make use of the more powerful minimal disclosure and revocation techniques). We are pursuing many initiatives to build the right feature set for the target scenarios. In particular, I’ll point you to the ABC4Trust project (https://abc4trust.eu/) where we are working (with IBM and other partners) to provide in a unified framework the missing features you mentioned.

Best regards,

Christian Paquin, Microsoft
</description>
		<content:encoded><![CDATA[<p>Francisco,</p>
<p>Very interesting discussion, I’m looking forward to read the following posts. I’d like to provide high-level comments.</p>
<p>First, regarding multi-show unlinkability, note that we define a U-Prove “credential” as a batch of (renewable, as needed) U-Prove tokens. Given the efficiency of the U-Prove protocols (especially when using the ECC variant), this _has_ proven quite practical in web scenarios (as demonstrated by our last two technology previews, <a href="http://www.microsoft.com/u-prove" rel="nofollow">http://www.microsoft.com/u-prove</a>).</p>
<p>Our current public specification describes a subset of fundamental features of the technology, carefully chosen to facilitate integration into existing identity systems (which are not equipped to make use of the more powerful minimal disclosure and revocation techniques). We are pursuing many initiatives to build the right feature set for the target scenarios. In particular, I’ll point you to the ABC4Trust project (<a href="https://abc4trust.eu/" rel="nofollow">https://abc4trust.eu/</a>) where we are working (with IBM and other partners) to provide in a unified framework the missing features you mentioned.</p>
<p>Best regards,</p>
<p>Christian Paquin, Microsoft</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Pros and Cons of U-Prove for NSTIC by Diskussion: &#8220;Pros and Cons of U-Prove for NSTIC&#8221; : Stephan Humer &#8211; Internetsoziologie</title>
		<link>http://pomcor.com/2011/10/04/pros-and-cons-of-u-prove-for-nstic/#comment-86</link>
		<dc:creator>Diskussion: &#8220;Pros and Cons of U-Prove for NSTIC&#8221; : Stephan Humer &#8211; Internetsoziologie</dc:creator>
		<pubDate>Wed, 05 Oct 2011 14:25:46 +0000</pubDate>
		<guid isPermaLink="false">http://pomcor.com/?p=321#comment-86</guid>
		<description>[...] (Quelle: pomcor.com) [...]</description>
		<content:encoded><![CDATA[<p>[...] (Quelle: pomcor.com) [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Pros and Cons of U-Prove for NSTIC by John Bradley</title>
		<link>http://pomcor.com/2011/10/04/pros-and-cons-of-u-prove-for-nstic/#comment-85</link>
		<dc:creator>John Bradley</dc:creator>
		<pubDate>Tue, 04 Oct 2011 21:12:00 +0000</pubDate>
		<guid isPermaLink="false">http://pomcor.com/?p=321#comment-85</guid>
		<description>Good analysis.  I made the same points to Craig before U-Prove was sent to stand in the R&amp;D corner at Microsoft.

I do in some cases U-Prove &amp; Idemix have benefits, though they tend to be oversold by there advocates.

Having worked on IMI (InfoCard) my concern is deploying and synchronizing clients across devices.   We are moving to a post PC world having a single desktop we access the net from is no longer the only problem to solve for.  

NSTIC needs to consider that having a choice of verifiably trustworthy Identity and attribute providers may be more practical than trying to solve the issue of IdP knowing where you use your credential through technology.

Regards
John B.
</description>
		<content:encoded><![CDATA[<p>Good analysis.  I made the same points to Craig before U-Prove was sent to stand in the R&amp;D corner at Microsoft.</p>
<p>I do in some cases U-Prove &amp; Idemix have benefits, though they tend to be oversold by there advocates.</p>
<p>Having worked on IMI (InfoCard) my concern is deploying and synchronizing clients across devices.   We are moving to a post PC world having a single desktop we access the net from is no longer the only problem to solve for.  </p>
<p>NSTIC needs to consider that having a choice of verifiably trustworthy Identity and attribute providers may be more practical than trying to solve the issue of IdP knowing where you use your credential through technology.</p>
<p>Regards<br />
John B.</p>
]]></content:encoded>
	</item>
</channel>
</rss>

