On Fri, Mar 05, 2004 at 07:43:10 -0700,
Matt Davies <matt@mattdavies.net> wrote:
> And how does one account for key information? If one encrypts any information
> deemed worthy to be a key then you have to decrypt the entire database to find
> particular information.
It depends on what kinds of searches you do. If they are searches for
equals, you can use one way hashes and still have efficient searches.
"Transluscent Databases" has some other tricks in it along these lines.
