Tord Ingolf Reistad <[EMAIL PROTECTED]> writes: Hi Tord
> 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). > > 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. Great, I will certainly love to see this protocol implemented in VIFF! I don't think I will have time now, but if nobody has done it when I get back from Switzerland, I will take a look at it then. Thank you for sending out this code -- it would be great if VIFF could become a sort of standard "laboratory" for quickly testing new protocol proposals. -- Martin Geisler _______________________________________________ viff-devel mailing list (http://viff.dk/) [email protected] http://lists.viff.dk/listinfo.cgi/viff-devel-viff.dk
