https://nick-black.com/dankwiki/index.php?action=history&feed=atom&title=Lamport%27s_Hash 2026-07-11T15:34:51Z Revision history for this page on the wiki MediaWiki 1.46.0 https://nick-black.com/dankwiki/index.php?title=Lamport%27s_Hash&diff=892&oldid=prev 2009-08-18T23:39:16Z

<p></p> <table style="background-color: #fff; color: #202122;" data-mw-interface=""> <col class="diff-marker" /> <col class="diff-content" /> <col class="diff-marker" /> <col class="diff-content" /> <tr class="diff-title" lang="en"> <td colspan="2" style="background-color: #fff; color: #202122; text-align: center;">← Older revision</td> <td colspan="2" style="background-color: #fff; color: #202122; text-align: center;">Revision as of 23:39, 18 August 2009</td> </tr><tr><td colspan="2" class="diff-lineno" id="mw-diff-left-l4">Line 4:</td> <td colspan="2" class="diff-lineno">Line 4:</td></tr> <tr><td class="diff-marker"></td><td style="background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><br></td><td class="diff-marker"></td><td style="background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><br></td></tr> <tr><td class="diff-marker"></td><td style="background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>[[Category:Leslie Lamport Eponyms]]</div></td><td class="diff-marker"></td><td style="background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>[[Category:Leslie Lamport Eponyms]]</div></td></tr> <tr><td colspan="2" class="diff-side-deleted"></td><td class="diff-marker" data-marker="+"></td><td style="color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div><ins style="font-weight: bold; text-decoration: none;">[[Category:Computer Science Eponyms]]</ins></div></td></tr> <!-- diff cache key wikidb:diff:1.41:old-839:rev-892:php=table --> </table>

Dank https://nick-black.com/dankwiki/index.php?title=Lamport%27s_Hash&diff=839&oldid=prev 2009-08-07T07:22:29Z

<p></p> <table style="background-color: #fff; color: #202122;" data-mw-interface=""> <col class="diff-marker" /> <col class="diff-content" /> <col class="diff-marker" /> <col class="diff-content" /> <tr class="diff-title" lang="en"> <td colspan="2" style="background-color: #fff; color: #202122; text-align: center;">← Older revision</td> <td colspan="2" style="background-color: #fff; color: #202122; text-align: center;">Revision as of 07:22, 7 August 2009</td> </tr><tr><td colspan="2" class="diff-lineno" id="mw-diff-left-l2">Line 2:</td> <td colspan="2" class="diff-lineno">Line 2:</td></tr> <tr><td class="diff-marker"></td><td style="background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>&lt;blockquote&gt;&quot;Without public key cryptography, it&#039;s difficult to protect against both eavesdropping and server database reading with a single protocol, although is is easy to do one or another...an elegant protocol by [http://research.microsoft.com/users/lamport/ Leslie Lamport] can claim to accomplish this feat.&quot;&lt;/blockquote&gt;</div></td><td class="diff-marker"></td><td style="background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>&lt;blockquote&gt;&quot;Without public key cryptography, it&#039;s difficult to protect against both eavesdropping and server database reading with a single protocol, although is is easy to do one or another...an elegant protocol by [http://research.microsoft.com/users/lamport/ Leslie Lamport] can claim to accomplish this feat.&quot;&lt;/blockquote&gt;</div></td></tr> <tr><td class="diff-marker"></td><td style="background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>[http://research.microsoft.com/users/lamport/pubs/password.pdf Published in 1981], implemented as S/KEY by [http://citeseer.ist.psu.edu/cache/papers/cs/5967/ftp:zSzzSzftp.mcc.ac.ukzSzpubzSzsecurityzSzPAPERSzSzPASSWORDzSzSKEY.pdf/haller94skey.pdf Haller et al in 1994], and standardized as RFC 1938 in 05-1996.</div></td><td class="diff-marker"></td><td style="background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>[http://research.microsoft.com/users/lamport/pubs/password.pdf Published in 1981], implemented as S/KEY by [http://citeseer.ist.psu.edu/cache/papers/cs/5967/ftp:zSzzSzftp.mcc.ac.ukzSzpubzSzsecurityzSzPAPERSzSzPASSWORDzSzSKEY.pdf/haller94skey.pdf Haller et al in 1994], and standardized as RFC 1938 in 05-1996.</div></td></tr> <tr><td colspan="2" class="diff-side-deleted"></td><td class="diff-marker" data-marker="+"></td><td style="color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div><ins style="font-weight: bold; text-decoration: none;"></ins></div></td></tr> <tr><td colspan="2" class="diff-side-deleted"></td><td class="diff-marker" data-marker="+"></td><td style="color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div><ins style="font-weight: bold; text-decoration: none;">[[Category:Leslie Lamport Eponyms]]</ins></div></td></tr> <!-- diff cache key wikidb:diff:1.41:old-87:rev-839:php=table --> </table>

Dank https://nick-black.com/dankwiki/index.php?title=Lamport%27s_Hash&diff=87&oldid=prev 2009-01-28T07:32:14Z

<p>1 revision</p> <table style="background-color: #fff; color: #202122;" data-mw-interface=""> <col class="diff-marker" /> <col class="diff-content" /> <col class="diff-marker" /> <col class="diff-content" /> <tr class="diff-title" lang="en"> <td colspan="2" style="background-color: #fff; color: #202122; text-align: center;">← Older revision</td> <td colspan="2" style="background-color: #fff; color: #202122; text-align: center;">Revision as of 07:32, 28 January 2009</td> </tr><tr><td colspan="4" class="diff-notice" lang="en"><div class="mw-diff-empty">(No difference)</div> </td></tr> <!-- diff cache key wikidb:diff:1.41:old-86:rev-87 --> </table>

WikiSysop https://nick-black.com/dankwiki/index.php?title=Lamport%27s_Hash&diff=86&oldid=prev 2008-11-18T10:19:35Z

<p></p> <p><b>New page</b></p><div>From &#039;&#039;[http://www.pearsonhighered.com/academic/product/0,,0130460192,00%2Ben-USS_01DBC.html Network Security: Private Communication in a Public World]&#039;&#039; 2nd Edition, p225:<br /> &lt;blockquote&gt;&quot;Without public key cryptography, it&#039;s difficult to protect against both eavesdropping and server database reading with a single protocol, although is is easy to do one or another...an elegant protocol by [http://research.microsoft.com/users/lamport/ Leslie Lamport] can claim to accomplish this feat.&quot;&lt;/blockquote&gt;<br /> [http://research.microsoft.com/users/lamport/pubs/password.pdf Published in 1981], implemented as S/KEY by [http://citeseer.ist.psu.edu/cache/papers/cs/5967/ftp:zSzzSzftp.mcc.ac.ukzSzpubzSzsecurityzSzPAPERSzSzPASSWORDzSzSKEY.pdf/haller94skey.pdf Haller et al in 1994], and standardized as RFC 1938 in 05-1996.</div>

Dank