> > > They also had a reference to some type of searching in encrypted data, > > without revealing the search string? Presumably I guess you present some > > encrypted string, and the algorithm tells you whether the string is present > > in the data without decrypting either? That could be useful. > > I read the paper they reference some time ago, and it is interesting > but 100% useless. Basically it is just encrypting every word as a > seperate block and having the searcher encrypt the search terms with > the same key (but modified heavily so as to not suffer from the > million holes in that version). The only application it might be > useful for are ASP like systems that keep the data secret from the > ASP itself (which would be a cool thing, though not very related to > what we are doing). >
Are you referring to Schneier's "Clueless Agents" paper (http://www.counterpane.com/clueless-agents.html)? You might also want to check out http://www.islandnet.com/~mskala/limdiff.html but I wouldn't trust it because it requires its own S-box construction. -- Justin Chapweske, Lead Swarmcast Developer, OpenCola Inc. http://www.sourceforge.net/projects/swarmcast/ _______________________________________________ Devl mailing list Devl at freenetproject.org http://www.uprizer.com/mailman/listinfo/devl
