VIFF

It appears that the VIFF repository is down as none of the downloads appear to work and I cannot checkout the repository. Is there a time frame for getting this working? Mike

I cannot find GMPY for python 2.5 and openssl 0.9.8g for python 2.5.If someone has links or files then please mail them ASAP at bharti_mitr< at >yahoo.co.in.If anyother installations work other than those mentioned at viff.dk then too please tell. Thanks

Hi, I tried to test the millionaires.py, but when I tried it, the console shows that: I am Millionaire 3 and I am worth 194 millions. *** bad data from Player 1: unpack requires a string argument of length 5 *** aborting! *** all protocols ... [More] disconnected Unhandled Error Traceback (most recent call last): Failure: twisted.internet.error.ConnectionLost: Connection to the other side was lost in a non-clean fashion. I run it on localhost with different port number. I tried several programs and find out that whenever I use comparison(>= or <=), the same error shows up. Could you please inform me whether you have any ideas about this? Thank you very much. Best, Hongda [Less]

I'm looking through the malicious model protocol and reading over the PhD dissertation document and one thing is not clear. The document mentions a byzantine agreement protocol, but never describes how it is implemented. Looking at the planned work ... [More] page, it seems that the BA protocol is not implemented. Is this true? If so, I'd like to take a stab at implementing it. Any recommendations on where to start? If not true, is there any documentation for the protocol and where in the code is it contained? Thanks! Mike [Less]

Hi Nick, According to the code, the modulus has to be at least 2^(l+2) + 2^(l+k), where l is bit length + 1 (default: 33), and k is the security parameter (default: 30). So the modulus has to be at least around 2^64. Best regards, Marcel Am 06.11.2012 17:56, schrieb Nick La Rooy:

I am looking to sort some large numbers securely, and have already run into overflows. Does anyone have any ballpark figures for how large numbers compared in the Toft07 runtime can be? Many thanks, Nick

Hi Abdelrahaman, I can only think of Martin Geisler's PhD dissertation, which is referred to in the bibliography: http://viff.dk/doc/bibliography.html However, I consider the documentation to be quite extensive. All functions considered necessary ... [More] are explained, and there is a listing of the modules: http://viff.dk/doc/modindex.html If you're looking for example code with explanations, have a look at beginner.py in the apps directory. Best regards, Marcel Keller On 07/09/2012 06:08 PM, Abdelrahaman Aly wrote: [Less]

Hi Abdelrahaman, VIFF works with finite fields of prime order p. Computing in such a field corresponds to integer computation with computing modulo p after every operation. Therefore, -1 is the same as p-1. You can call signed() on a field ... [More] element to get the representation in [-p/2,p). Best regards, Marcel On 06/29/2012 04:20 PM, Abdelrahaman Aly wrote: [Less]

Hey Guys sorry bother, but I was wondering if there is a way to handle negative values? I am doing some subtractions with shares and having some negative values as a result but It always end up out of bounds. Thanks in advance. Abdelrahaman Aly C.O.R.E- U.C.L

New submission from Satvik Chauhan <mystic.satvik< at >gmail.com>: [([1], [100]), ([2], [100]), ([3], [100]), ([4], [100]), ([5], [100]), ([6], [100]), ([7], [100]), ([8], [100]), ([9], [100]), ([10], [100])] Traceback (most recent ... [More] call last): File "<stdin>", line 1, in <module> File "/usr/local/lib/python2.7/dist-packages/viff-1.0- py2.7.egg/viff/shamir.py", line 121, in recombine vector.append(reduce(operator.mul, factors)) TypeError: reduce() of empty sequence with no initial value [100] ---------- messages: 319 nosy: satvikc status: unread title: Shamir secret sharing fails when a single share given to recombine type: bug ____________________________________ VIFF Issue Tracker <tracker< at >viff.dk> <http://tracker.viff.dk/issue85> ____________________________________ [Less]