http://qs1969.pair.com?node_id=363596


in reply to Re: Super Search searches scratchpads which are not public
in thread Super Search searches scratchpads which are not public

Well, with regex searches, and enough hits to the host, you could use binary searching to figure out the exact text of the scratchpad. Presuming printables (and newline) only, it'd take only 6 or 7 hits per character you wanted to guess. Look for /^[a-m]/ and if that fails, look for /^[n-z]/, otherwise look for /^[a-h]/ and so on. As you get each letter, you add it to the beginning: /^v[a-m]/.

So, yes, this is a leak, but a slow leak.

Hmm. That'd be an interesting article about why not to allow regex searches against text you can't eventually see. >>todo.

-- Randal L. Schwartz, Perl hacker
Be sure to read my standard disclaimer if this is a reply.

Replies are listed 'Best First'.
Re: *Re^2: Super Search searches scratchpads which are not public
by ambrus (Abbot) on Jun 12, 2004 at 13:38 UTC

    How can you do a regexp search? I thought that super-search would allow only fixed text.

        Not that it matters, but you might want to look again. I'm pretty sure you only have the power to use a regex on titles.

        - tye