<html>
<head>
<meta content="text/html; charset=ISO-8859-1"
http-equiv="Content-Type">
</head>
<body bgcolor="#FFFFFF" text="#000000">
<font face="DejaVu Sans Mono"><a class="moz-txt-link-freetext" href="http://www.xkcd.cm/936">http://www.xkcd.cm/936</a><br>
<br>
</font><br>
On 04/08/2012 08:10 AM, Jeffrey Burdges wrote:
<blockquote
cite="mid:A8B0DA56-E708-4A31-A10E-4E684A123648@gmail.com"
type="cite">
There is an enormous risk of a rainbow table attack on the key
space by a malicious server, but maybe you could move the
proof-of-work to the key space side to reduce this. An independent
source picks a new key seed every n months, thus forcing the
searcher to hash their searches using all previous seeds, but
preventing the server from using rainbow tables as effectively. I
would also be interested in working on such a weakly secure search
infrastructure project. I'm rather surprised that nobody has built
this or similar yet actually, it's trivial conceptually and not
too hard to implement. Jeff Burdges
_______________________________________________
tahoe-dev mailing list
<a class="moz-txt-link-abbreviated" href="mailto:tahoe-dev@tahoe-lafs.org">tahoe-dev@tahoe-lafs.org</a>
<a class="moz-txt-link-freetext" href="https://tahoe-lafs.org/cgi-bin/mailman/listinfo/tahoe-dev">https://tahoe-lafs.org/cgi-bin/mailman/listinfo/tahoe-dev</a>
</blockquote>
</body>
</html>