NODE 431955e1Re: NYT/CyberTimes on CWD article
norm@netcom.com (Norman Hardy)Sun, 7 Jul 1996 08:52:53 +0800
At 9:17 AM 7/6/96, Declan McCullagh wrote:
>"We are writers, not crytographers."
>
>-Declan
....
This seems to be an application for Bloom filters.
See page bottom of page 561 in Knuth's "Searching and Sorting", First Edition.
(Vol 3 of Art of Computer Programming)
With a Bloom filter you can hide which URLs you reject yet quickly rejecting
particular URLs.
Compute SHA(URL) yielding 160 bits. Divide that into 16 ten bit quantities
b[i], for 0<=i< 10.
Reject the access if P[b[i]] = 1 for each i. P is an array of 1024 bits
computed by someone
with the index prohibitorum. (pardon my Latin)
Yes, this excludes 1/1024 "falsely accused" URLs, but you get the idea.
NODE f70d084aRe: NYT/CyberTimes on CWD article
Simon Spero <ses@tipper.oit.unc.edu>Sun, 7 Jul 1996 23:46:11 +0800
Actually, no matter what scheme you use, you are always vulnerable to a
quite practical brute force attack- simply treat the filter as an oracle,
and feed it the result of a 'web-crawl'.
Simon
---
Cause maybe (maybe) | In my mind I'm going to Carolina
you're gonna be the one that saves me | - back in Chapel Hill May 16th.
And after all | Email address remains unchanged
You're my firewall - | ........First in Usenet.........