Ivan Damgard <[EMAIL PROTECTED]> writes: > At 13:43 +0200 15/05/08, Martin Geisler wrote: >>I have now benchmarked the comparison protocols using the >>ActiveRuntime class. The actively secure runtime has a preprocessing >>phase in which triples (a, b, c) where ab = c are generated. These >>are the results per comparison for 100 parallel comparisons done >>between three machines at DAIMI using a 65-bit prime modulus: > > Remember, however, that you cannot have active security with 3 > players using this technology! it requires t< n/3, so n=4, t=1 is > the smallest case that makes sense.
Ahh yes! You're right... I have now generated numbers with 4 machines for the active comparison (Toft05 version): Preprocessing: 2215 ms Online: 694 ms So it is still less than a second! :-) -- Martin Geisler _______________________________________________ viff-devel mailing list (http://viff.dk/) [email protected] http://lists.viff.dk/listinfo.cgi/viff-devel-viff.dk
