Timeline for Cryptographic hash with ability to ignore specific bits based on a hidden pattern?
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 30, 2015 at 9:13 | history | edited | otus | CC BY-SA 3.0 |
per comments
|
| Nov 30, 2015 at 9:11 | comment | added | otus | @RickyDemer, true, I'll mention that in an edit. Should be pretty clear whether a particular system works or not, though. | |
| Nov 30, 2015 at 9:08 | comment | added | user991 |
@otus: In addition to being deterministic, it would also need to be that E(x) homomorphic-and E(y) gives E(x&y), rather than something else that decrypts to x&y.
|
|
| Nov 30, 2015 at 9:04 | comment | added | user991 | @Dave: Are you aware that that one can implement bitwise-and by multiplying the corresponding bits? | |
| Nov 29, 2015 at 20:43 | vote | accept | Dave | ||
| Nov 29, 2015 at 20:43 | comment | added | Dave | OK, well I think you're right that homomorphic encryption is exactly what I'm looking for, so I'll mark this accepted. I'll just have to watch for improvements to the speed of the method. | |
| Nov 29, 2015 at 8:01 | comment | added | otus | @Dave, yes, you would likely need FHE which is indeed slow. I don't know any partially homomorphic system that would have bitwise AND. | |
| Nov 28, 2015 at 23:23 | comment | added | Dave |
I only need it to be secret for users who do not know any matches. Homomorphic encryption sounds interesting (so I've just spent an hour reading about it!) It looks like the quoted speeds for fully homomorphic methods are far too slow for what I need, whereas the existing partially homomorphic methods support addition or multiplication; none list bitwise operators. I'll search some more, but are there any you know of? Also I take your point about it being relatively weak, but I expect the length of the requirement to balance that out (it will be ~4096 bits or more)
|
|
| Nov 28, 2015 at 20:08 | history | answered | otus | CC BY-SA 3.0 |