3 ms·
There aren't really any methods which can do it with reasonable overhead; if you'd like to read some of the literature this seems like a good starting point: ht
by Eridrus 9y ago
There aren't really any methods which can do it with reasonable overhead; if you'd like to read some of the literature this seems like a good starting point: https://www.semanticscholar.org/paper/Encrypted-Search-Kamara/87a20d866a507f13b7a2fdd912d456badab21439 https://www.semanticscholar.org/paper/Encrypted-Search-Kamar...
- ge96 9y agoThanks this is where I am/need to start. Finally though a real "back end processing" task to code for.
- ge96 9y agoActually I realize my question specifically targets real time searching/search in general and that PDF you linked talks about search. Though partly related I mean how long would you have to wait to display content for it to be queried, matched, decoded, then added to the page. I realize this is a vague question and I'm not actually looking for an answer. Just wondering how you'd approach/quantify that. As opposed to real time searching where every key stroke may be 50ms apart or at least the delay per stroke as a bounce/throttle. Ahhh I'm rambling sorry. Take Hacker News for example, if all of this content is encrypted, why doesn't it take a few seconds for pages to load/decrypt?