Given the following situation, what sort of cryptographic construction am I looking for?
- Alice has a bitfield (vector, polynomial representation, etc.)
- Bob has a different bitfield of the same length
- Alice and Bob want to know the bitwise AND of their two bitfields without revealing the result to others and without revealing their personal bitfields to each other or anyone else
- Alice has
- Bob has
What would one do for Alice and Bob to know the result
0101 & 1100 = 0100 without revealing anything as stated above?
I imagine this would require some combination of zero-knowledge and homomorphic techniques, but I will be the first to admit that this is probably a bit out of my depth.