would be to first encrypt each document word-by-word (this can lead to really big documents because of paddings), then the client would transmit the document together with the encrypted words as plain text. In this way, the search engine indexes meaningless words which points to the encrypted documents (you can use two different algorithms and/or keys for word-by-word encryption and for documents). For searching your client encrypts the keywords (asking for the encryption key) and once you have a link you have to decrypt the document.
There should be some weak link in this chain, but I don't find any: be the first to claim my two cents.
There is a project (i think it's a bit stopped) called entity; on entity the definition of the interface is in xml and the methods can be writing in python, perl, javascript. More info on: http://www.advogato.org/proj/Entity/
Slashdot Mirror
would be to first encrypt each document word-by-word (this can lead to really big documents because of paddings), then the client would transmit the document together with the encrypted words as plain text. In this way, the search engine indexes meaningless words which points to the encrypted documents (you can use two different algorithms and/or keys for word-by-word encryption and for documents). For searching your client encrypts the keywords (asking for the encryption key) and once you have a link you have to decrypt the document.
There should be some weak link in this chain, but I don't find any: be the first to claim my two cents.
http://www.youtube.com/watch?v=doQvWsJRCPs
Web page of the conference
You can search: latex math
And you get this: LaTeX: Math into LaTeX Short Course
There is a project (i think it's a bit stopped) called entity; on entity the definition of the interface is in xml and the methods can be writing in python, perl, javascript. More info on: http://www.advogato.org/proj/Entity/
Aren't those stories related: ... & SCO Fires back ...?
Microsoft Proclaims