Martin Geisler <[EMAIL PROTECTED]> writes: > Running three players on my home computer gives these results: > > Before: 1309 ms per comparison with 100 parallel comparisons > After: 324 ms per comparison with 100 parallel comparisons > > That is a factor of four! I measured similar improvements earlier > today when using three different machines at DAIMI.
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: +--------+---------+----------------------+ | | Passive | Active | +--------+---------+----------------------+ | Toft05 | 389 ms | 590-632 ms (2-3 sek) | +--------+---------+----------------------+ | Toft07 | 368 ms | 690-774 ms (3-5 sek) | +--------+---------+----------------------+ The numbers matched on all three players in the passive case, but in the active case one player was always slower at the proprocessing (in parenthesis), but faster at the online processing. The other two players behaved the other way around. With these results we can now securely compare a 32-bit number in a 65-bit prime field in less than one second online, even in the presence of an active adversary! -- Martin Geisler _______________________________________________ viff-devel mailing list (http://viff.dk/) [email protected] http://lists.viff.dk/listinfo.cgi/viff-devel-viff.dk
