[viff-devel] Mystery of the quadratic running time solved?

[Marcel Keller]

Hello friends of VIFF,

I've now run the benchmark of actively secure multiplications with 
hyperinvertible matrices together with my hack. Here are my results 
(column 1 and 2) compared to the results in the paper "Asynchronous 
Multiparty Computation: Theory and Implementation" (column 3 and 4):

(n,t)	online	preprocessing	online	preprocessing
(4,1)	5	18		4	20
(7,2)	7	30		6	42
(10,3)	9	43		8	82
(13,4)	12	56		10	136

The preprocessing time now seems to be linear whereas the online time is 
slightly increased. I didn't benchmark bigger thresholds because it's 
difficult enough find 13 camels which are not hard ridden yet. I think I 
  also fixed the increased online time, but I couldn't test the fix 
thoroughly because the active adversaries continuously change the 
corrupted camels.

Again, there are two patches in the attachement, and again, the patch 
for VIFF is against the current tip of my repository: 
http://hg.viff.dk/mkeller/rev/e2759515f57f

Best regards,
Marcel

-------------- next part --------------
A non-text attachment was scrubbed...
Name: twisted-hack.patch
Type: text/x-patch
Size: 1287 bytes
Desc: not available
URL: <http://lists.viff.dk/pipermail/viff-devel-viff.dk/attachments/20090306/61fdea06/attachment.bin>
-------------- next part --------------
A non-text attachment was scrubbed...
Name: viff-twisted-hack2.patch
Type: text/x-patch
Size: 4561 bytes
Desc: not available
URL: <http://lists.viff.dk/pipermail/viff-devel-viff.dk/attachments/20090306/61fdea06/attachment-0001.bin>