<?xml version="1.0" encoding="utf-8"?>
<rss xmlns:content="http://purl.org/rss/1.0/modules/content/" version="2.0">
  <channel>
    <title><![CDATA[[SecurityRatty] tag: pake]]></title>
    <link>http://securityratty.com/tag/pake</link>
    <description></description>
    <pubDate>Thu, 29 May 2008 16:31:05 +0000</pubDate>
    <generator>iRatty Engine</generator>
    <docs>http://blogs.law.harvard.edu/tech/rss</docs>
    <item>
      <title><![CDATA[J-PAKE: From Dining Cryptographers to Jugglers]]></title>
      <link>http://securityratty.com/article/5711bc23c0cf0bd0754ba94dcb9b97cb</link>
      <guid>http://securityratty.com/article/5711bc23c0cf0bd0754ba94dcb9b97cb</guid>
      <description><![CDATA[Password Authenticated Key Exchange (PAKE) is one of the central topics in cryptography. It aims to address a practical security problem: how to establish secure communication between two parties...]]></description>
      <content:encoded><![CDATA[<p>Password Authenticated Key Exchange (PAKE) is one of the central topics in cryptography. It aims to address a practical security problem: how to establish secure communication between two parties solely based on their shared password without requiring a Public Key Infrastructure (PKI).</p>
<p>The solution to the above problem is very useful in practice &#8212; in fact, so useful that it spawns a lot &#8220;fights&#8221; over patents. Many techniques were patented, including the well-known Encrypted Key Exchange (EKE) and Simple Password Exponential  Key Exchange (SPEKE). A secondary problem is technical; both the EKE and SPEKE protocols have subtle but worrying technical limitations (see the <a href="http://grouper.ieee.org/groups/1363/passwdPK/submissions/hao-ryan-2008.pdf">paper</a> for details).</p>
<p>At the 16th Workshop on Security Protocols held in April 2008, Cambridge, UK, I presented a new solution  (joint work with Peter Ryan) called Password Authenticated Key Exchange by Juggling (or J-PAKE). The essence of the protocol design inherits from the earlier work on <a href="http://www.lightbluetouchpaper.org/2006/04/05/av-net-a-new-solution-to-the-dining-cryptographers-problem/">solving the Dining Cryptographers problem</a>; we adapted the same juggling technique to the two-party case to solve the PAKE problem. To our best knowledge, this design is significantly different from all past PAKE solutions.</p>
<p>Intuitively, the J-PAKE protocol works like a juggling game between two people &#8212; if we regard a public key as a &#8220;ball&#8221;. In round one, each person throws two ephemeral public keys (&#8221;balls&#8221;) to each other. In round 2, each person combines the available public keys and the password to form a new public key, and throws the new &#8220;ball&#8221; to each other.</p>
<p>After round 2, the two parties can securely compute a common session key, if they supplied the same passwords. Otherwise, the protocol leaks nothing more than: &#8220;the supplied passwords at two sides are not the same&#8221;. In other words, one can prove his knowledge of the password without revealing it. A Java implementation of the protocol on a MacBook Pro laptop shows that the total computation time at each side is merely 75 ms.</p>
<p>We hope this protocol is of usefulness to security engineers. For example, compared with SSL/TLS, J-PAKE is potentially much more resistant against phishing attacks, not to mention that it is PKI-free. Since this protocol is the result of an academic research project, we didn&#8217;t &#8212; and have no intention to &#8212; patent it. As explained in the <a href="http://grouper.ieee.org/groups/1363/passwdPK/submissions/hao-ryan-2008.pdf">paper</a>, J-PAKE even has technical advantages over the patented EKE and SPEKE in terms of security, with comparable efficiency. It has been submitted as a follow-up to the <a href="http://grouper.ieee.org/groups/1363/passwdPK/1363.2a-submissions.html">future extension of IEEE P1363.2</a>.</p>
<p>We believe the PAKE research is important and has strong practical relevance. This post is to facilitate discussions on this subject. The paper can be viewed <a href="http://grouper.ieee.org/groups/1363/passwdPK/submissions/hao-ryan-2008.pdf">here</a>. Any comments or questions are welcome.</p>
]]></content:encoded>
      <pubDate>Thu, 29 May 2008 16:31:05 +0000</pubDate>
      <category domain="http://securityratty.com/tag/pake">pake</category>
      <category domain="http://securityratty.com/tag/past pake solutions">past pake solutions</category>
      <category domain="http://securityratty.com/tag/pake research">pake research</category>
      <category domain="http://securityratty.com/tag/j-pake protocol">j-pake protocol</category>
      <category domain="http://securityratty.com/tag/j-pake">j-pake</category>
      <category domain="http://securityratty.com/tag/protocol">protocol</category>
      <category domain="http://securityratty.com/tag/protocol design inherits">protocol design inherits</category>
      <category domain="http://securityratty.com/tag/security">security</category>
      <category domain="http://securityratty.com/tag/practical security">practical security</category>
      <source url="http://www.lightbluetouchpaper.org/2008/05/29/j-pake/">J-PAKE: From Dining Cryptographers to Jugglers</source>
    </item>
  </channel>
</rss>
