Hi all
Tord Ingolf Reistad wrote:
As you are discussing implementing the algorithm from ICITS07, I have
improved on that to get a very effective algorithm. For p = 2^l - 1 and
using psaudorandom secret sharing. The comparison can be done in 5
rounds and 5l multiplications. The algorithm has never been published,
but attached is a java implementation of the algorithm. (There might be
an error in the faun in algorithm as that is not tested).
As I said, the best, *published* algorithm I know is from ICITS07. :-)
Btw, does the 5*l multiplications-solution allow arbitrary input from
the field or only (l-1)-bit? If it's full-field then I *really* need to
see it.
Unfortunately I do not have a phyton implementation of it, as I am bad
at programming in phyton, on the other hand I am working on a java
implementation of MPC, which should be ready in a month. If anyone else
want to try to implement it in phyton I will be more than happy to help.
To understand the code please start with the function
public Share comparisonRestricted(Share a, Share b)
and please observe that many small functions on the top are just
returning values instead of shares, this is for test purposes.
I'll take a look at it and perhaps try a python port if time permits.
Regards,
Tomas
_______________________________________________
viff-devel mailing list (http://viff.dk/)
[email protected]
http://lists.viff.dk/listinfo.cgi/viff-devel-viff.dk
