I think it deserves to be mentioned that you can do conditional
statements on secret values in some cases. A simple case is easy to
implement with the other primitives, but then of course you can be
annoying and start nesting them.
Citat af Sigurd Torkel Meldgaard :
Other nice 2. order o
Other nice 2. order operations are bitsplitting (and also
recombination of the bits) and multiplicative inverse (works only if
you can guarantee a non-zero element)
And when you have the bits you would also like logic negation, xor, and and or.
- Sigurd
On Tue, Aug 25, 2009 at 9:22 AM, Tord Ingo
If you boil down VIFF, or any MPC program you can boil it down to 5
primitives.
These primitives are
x + y = z Addition
x * y = z Multiplication
-x = z Negation
z = Share(x)Secret sharing
z = Reveal(x) Revealing of a secret sharing
My question is now: What are the sec
