Re: [viff-devel] FW: Bug in ViFF

2008-10-06 Thread T . Toft
Hi all Today, Sebastiaan and I have been doing some serious thinking and looking into the VIFF code, and we feel convinced that we've found the bug. The problem lies entirely in the multiplication protocol. In Runtime.mul, products of shares are computed and shared. Then secure Lagrange

Re: [viff-devel] FW: Bug in ViFF

2008-10-06 Thread Martin Geisler
[EMAIL PROTECTED] writes: Hi all Today, Sebastiaan and I have been doing some serious thinking and looking into the VIFF code, and we feel convinced that we've found the bug. Great work, thanks to both of you for solving the mystery! I guess this bug is sufficiently grave that we should do

Re: [viff-devel] FW: Bug in ViFF

2008-10-06 Thread Martin Geisler
Martin Geisler [EMAIL PROTECTED] writes: That would be a good idea, also for performance. I suggest that we use a round-robin system where we determine the perticipating subset based on the current program counter. Code for this would look like this: diff --git a/viff/runtime.py

Re: [viff-devel] FW: Bug in ViFF

2008-10-06 Thread ivan
Hi, Tomas is right, of course. For the passive case, using the first 2t+1 players always works, and for the active case, we do not use the local-multiply-and-reshare method anyway. The current implementation of active security has a preprocessing step based on either PRSS or hyper invertible

Re: [viff-devel] FW: Bug in ViFF

2008-10-06 Thread Mikkel Krøigård
Tomas is right, of course. For the passive case, using the first 2t+1 players always works, and for the active case, we do not use the local-multiply-and-reshare method anyway. The thing is, I always just assumed that we always used the same set of shares, and it is kind of easy to miss if you

Re: [viff-devel] FW: Bug in ViFF

2008-10-03 Thread Martin Geisler
Hoogh, S.J.A. de [EMAIL PROTECTED] writes: Hi Sebastiaan I've looked at your code, and I don't understand the final part, the one which is supposed to calculate the sorted order of the millionaires: # We can establish the correct order of Millionaires 2 and 3. comparison

Re: [viff-devel] FW: Bug in ViFF

2008-10-01 Thread Hoogh, S.J.A. de
@viff.dk Subject: Re: FW: Bug in ViFF Hoogh, S.J.A. de [EMAIL PROTECTED] writes: Hi Sebastiaan, Thanks for giving VIFF some exercise! :-) Tomas Toft and I are using ViFF to analyze Toft's secure Linear Programming protocol. At the first sight everything seemed to work nicely, but when trying

Re: [viff-devel] FW: Bug in ViFF

2008-10-01 Thread Hoogh, S.J.A. de
Nope, Also with version 0.7 exactly the same problem occurs. Sincerely, Sebastiaan -Original Message- From: Martin Geisler [mailto:[EMAIL PROTECTED] Sent: woensdag 1 oktober 2008 9:39 To: Hoogh, S.J.A. de Cc: viff-devel@viff.dk Subject: Re: FW: Bug in ViFF Hoogh, S.J.A. de [EMAIL