New answers tagged data-privacy
4
As Mark has said, it's, in theory, a solvable problem (we know how to do it; the known methods are not simple).
However, by tweaking things around a bit, we can make this problem easy.
My solution is based on Pedersen commitments; those are based on a large prime-sized group (where the discrete log problem is difficult) and two group members $g$ and $h$ (...
1
You are looking for the notion of a additively-homomorphic signature.
In general, a homomorphism is a function which "respects an operation", meaning:
$$f : A\to B,\qquad f(a_0+a_1) = f(a_0)\oplus f(a_1)$$
here, I use $+, \oplus$ to write two (potentially different) "addition operations". So an additive homomorphism behaves well with ...
Top 50 recent answers are included