Timeline for Indexing encrypted data for efficient searching
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 17, 2017 at 13:14 | history | edited | CommunityBot |
replaced http://security.stackexchange.com/ with https://security.stackexchange.com/
|
|
| Nov 6, 2014 at 16:21 | vote | accept | Slicedpan | ||
| Nov 6, 2014 at 16:21 | |||||
| Nov 6, 2014 at 16:20 | comment | added | Slicedpan | Cool. Appreciate the help, cheers. | |
| Nov 6, 2014 at 16:17 | comment | added | Tom Leek | "Padding with a secret value before hashing" really means computing a MAC, so you may as well do it correctly. Use HMAC, which is a deterministic MAC. Using HMAC to generate a search key is equivalent to the "deterministic encryption" solution, except that it uses up an extra column (in particular, if you can search the MAC values then you still leak whether two source values are identical or not). | |
| Nov 6, 2014 at 16:05 | comment | added | Slicedpan | Thanks for the reply, much food for thought here. Do you think that padding the plaintext with a secret value before hashing would do anything to prevent the possible use of bruteforce attacks? (Assuming of course that an attacker would not have access to the secret) | |
| Nov 6, 2014 at 15:35 | history | answered | Tom Leek | CC BY-SA 3.0 |