Chic Encryption Algorithm Design

Bob and Alice have a bit that they want to keep private. Each of them wants to know what is logical And their two bit strings will not tell the other or anyone else their actual bit strings ... how can they do this? Keep in mind that even if both of them hold And their two bit strings, they still will not be able to accurately calculate the string of the other person (unless, of course, one of their strings was equal to 1 s).

I know that I saw something similar before in some key voting system / system, but I couldn’t remember the details. It should be something like making a private random key, xor it and using it somehow ... but I could not figure it out. Any smart encryption people out there?

+5
source share
1 answer

I think you are looking for homomorphic encryption in which you can perform calculations on encrypted values ​​without ever revealing what encrypted values ​​are. This includes a much more general set of problems than just calculating bitwise AND.

Hope this helps!

0
source

All Articles