f.dk
> http://lists.viff.dk/listinfo.cgi/viff-devel-viff.dk
________
Janus Dam Nielsen
Research and Innovationspecialist, PhD.
CENTRE FOR IT-SECURITY
THE ALEXANDRA INSTITUTE LTD.
T +45 40 83 09 10
E janus.niel...@alexandra.dk
W alexandra.
se,
> the protocol is insecure. So that line of code is fine, provided the runtime
> checks that the field or fields you use are large enough and refuses to
> run if not. If this check is not done, that's where the bug is instead :-)
>
> regards, Ivan
>
>
> On 21/04
eshold]
# Go backwards from threshold-1 down to 0
for j in range(threshold-1, -1, -1):
____________
Janus Dam Nielsen
Research and Innovationspecialist, PhD.
CENTRE FOR IT-SECURITY
THE ALEXANDRA INSTITUTE LTD.
T +45 40 83 09 10
E janus.n
restrictions on the NaCl code.
____________
Janus Dam Nielsen
Research and Innovationspecialist, PhD.
CENTRE FOR IT-SECURITY
THE ALEXANDRA INSTITUTE LTD.
T +45 42 22 93 56
E janus.niel.
Some good old-fashioned code review coming up... :-)
Great!
/rev/736ad1d97024
changeset: 1361:736ad1d97024
user: Janus Dam Nielsen
date: Wed Oct 28 14:53:51 2009 +0100
summary: Generate_config_files:Added support NaCl implementation
of Paillier.
There's a space missing
/listinfo.cgi/viff-devel-viff.dk
Janus Dam Nielsen
Research and Innovationspecialist, PhD.
CENTRE FOR IT-SECURITY
THE ALEXANDRA INSTITUTE LTD.
T +45 42 22 93 56
E janus.niel...@alexandra.dk
W alexandra.dk
Hi Marcel and Viff,
I would have expected you to upgrade your config files to the new
setup instead of modifying VIFF to accept legacy config files, that
cannot be generated any more?
Janus Dam Nielsen
Research and Innovationspecialist
regards,
Marcel
___
viff-devel mailing list (http://viff.dk/)
viff-devel@viff.dk
http://lists.viff.dk/listinfo.cgi/viff-devel-viff.dk
____________
Janus Dam Nielsen
Research and Innovationspecialist, PhD.
CENTRE FOR IT-SECURITY
s go ahead and speed up the preprocessing. :)
____
Janus Dam Nielsen
Research and Innovationspecialist, PhD.
CENTRE FOR IT-SECURITY
THE ALEXANDRA INSTITUTE LTD.
T +45 42 22 93 56
E janus.niel...@alexandra.dk
W al
On 21/10/2009, at 20.28, Marcel Keller wrote:
Martin Geisler wrote:
Janus Dam Nielsen writes:
Hi Marcel,
I am not opposed to your suggestion. However I would like to point
out
that in VIFF you compute on shares and not field elements!
Well, we've actually made the outer ru
://viff.dk/.
___
viff-devel mailing list (http://viff.dk/)
viff-devel@viff.dk
http://lists.viff.dk/listinfo.cgi/viff-devel-viff.dk
Janus Dam Nielsen
Research and Innovationspecialist, PhD.
CENTRE FOR
ds,
Marcel
___
viff-devel mailing list (http://viff.dk/)
viff-devel@viff.dk
http://lists.viff.dk/listinfo.cgi/viff-devel-viff.dk
____
Janus Dam Nielsen
Research and Innovationspecialist, PhD.
CENTRE FOR IT-SECURITY
THE ALEXANDRA INSTITUTE LTD.
T
You're not trying to parse the command line, right? (we have
optparse for that)
I believe that the commandline arguments should be general to all
runtimes.
____________
Janus Dam Nielsen
Research and Innovationspecialist, PhD.
CENTRE FOR IT-SECURI
A solution is to wrap the deferred in a datastructure, like an object,
list, set, or what ever you prefer.
On 10/08/2009, at 23.40, Martin Geisler wrote:
Janus Dam Nielsen writes:
Hi Martin
Thanks for your thoughts on this.
You're welcome, it took a me a while to figure out wha
erred from a
callback in combination with holding on to a reference to it in the
callback.
On 05/08/2009, at 11.47, Martin Geisler wrote:
Janus Dam Nielsen writes:
As you see when player 1 adds a share to the value list, the current
result of the share is 13. However when player 1 comes
lease schedule or something similar?
I don't think there is a release schedule, but at least once every
three months or so.
____
Janus Dam Nielsen
R&D SCIENTIST, PhD.
CENTRE FOR IT-SECURITY
THE ALEXANDRA INSTITUTE LTD.
T +45 42 22 93 5
tions please let me know.
Kind regards,
-Marc
Wed, Jul 29, 2009 at 01:42:09PM +0200, Janus Dam Nielsen wrote:
Hi Marc
I have successfully compiled and run test.py and time.sh.
The results where:
[fagid...@fiona:~/./PyPaillier]$ ./time.sh
Encrypting:
10 loops, best of 3: 132 mse
Hi VIFF'ers,I have a small class and a unit test for it. The unittest fails, but this is not the real issue. The issue is the strange behavior I see during execution.During execution I see output similar to this:>>>Seeding random generator with random seed 5590test_dealer DealerTest test_next_t
ng,
-Marc
____
Janus Dam Nielsen
R&D SCIENTIST, PhD.
CENTRE FOR IT-SECURITY
THE ALEXANDRA INSTITUTE LTD.
T +45 42 22 93 56
E janus.niel...@alexandra.dk
W alexandra.dk
___
viff-deve
Hi Marc,
How is your work on the homomorphic encryption coming along, do you
have an estimate for the completion of the implementation?
Janus Dam Nielsen
R&D SCIENTIST, PhD.
CENTRE FOR IT-SECURITY
THE ALEXANDRA INSTITUTE LTD.
T +4
of patches and
even
though I had some style-complaints, I think this is great!
Let me know if you have comments for the other patches.
____________
Janus Dam Nielsen
R&D SCIENTIST, PhD.
CENTRE FOR IT-SECURITY
THE ALEXANDRA INSTITUTE LTD.
ly. gather_shares ignores errors.
____________
Janus Dam Nielsen
R&D SCIENTIST, PhD.
CENTRE FOR IT-SECURITY
THE ALEXANDRA INSTITUTE LTD.
T +45 42 22 93 56
E janus.niel..
# HG changeset patch
# User Janus Dam Nielsen
# Date 1245395036 -7200
# Node ID a07740da4582869d11ead0f56ae055965aa2b4b0
# Parent 07a8329e75322d482dae15186422dd75e9ddb653
Implementation of the basic multiplication command.
diff --git a/viff/orlandi.py b/viff/orlandi.py
--- a/viff/orlandi.py
# HG changeset patch
# User Janus Dam Nielsen
# Date 1245395107 -7200
# Node ID 57f6d76d82e375b77293bcc6d54eeb6242686079
# Parent 4c46e8eeb719682da1a91b7ad96e7e902363e204
importeret rettelse triple_test.patch
diff --git a/viff/orlandi.py b/viff/orlandi.py
--- a/viff/orlandi.py
+++ b/viff
# HG changeset patch
# User Janus Dam Nielsen
# Date 1245395070 -7200
# Node ID cd787f04de1f3be2e7c969e963ed7bcd94f81305
# Parent a07740da4582869d11ead0f56ae055965aa2b4b0
Implementation of the leak tolerant multiplication command.
diff --git a/viff/orlandi.py b/viff/orlandi.py
--- a/viff
# HG changeset patch
# User Janus Dam Nielsen
# Date 1245395102 -7200
# Node ID 4c46e8eeb719682da1a91b7ad96e7e902363e204
# Parent ad19cc189a5bf04ba37c0a9e25600040585cc1e9
Implementation of the TripleGen protocol.
diff --git a/viff/orlandi.py b/viff/orlandi.py
--- a/viff/orlandi.py
+++ b/viff
# HG changeset patch
# User Janus Dam Nielsen
# Date 1245395100 -7200
# Node ID ad19cc189a5bf04ba37c0a9e25600040585cc1e9
# Parent cd787f04de1f3be2e7c969e963ed7bcd94f81305
Added a variant of the encryption method which takes a random value as argument.
diff --git a/viff/paillier.py b/viff
# HG changeset patch
# User Janus Dam Nielsen
# Date 1245394917 -7200
# Node ID 4c4228af583fc965fb0722c5b051ffa213152f62
# Parent 85ae7883768d8367baf57cf3b6647707cb1d9b1d
Implementation of subtraction command.
diff --git a/viff/orlandi.py b/viff/orlandi.py
--- a/viff/orlandi.py
+++ b/viff
# HG changeset patch
# User Janus Dam Nielsen
# Date 1245394940 -7200
# Node ID 07a8329e75322d482dae15186422dd75e9ddb653
# Parent 4c4228af583fc965fb0722c5b051ffa213152f62
Implementation of input and shift commands.
diff --git a/viff/orlandi.py b/viff/orlandi.py
--- a/viff/orlandi.py
+++ b/viff
# HG changeset patch
# User Janus Dam Nielsen
# Date 1245394853 -7200
# Node ID 85ae7883768d8367baf57cf3b6647707cb1d9b1d
# Parent 1eb98ef76446e9ef06d8d94e31748fe5cfd2ba82
Implementation of addition command.
diff --git a/viff/orlandi.py b/viff/orlandi.py
--- a/viff/orlandi.py
+++ b/viff
# HG changeset patch
# User Janus Dam Nielsen
# Date 1245394849 -7200
# Node ID f780a9ea514acb7de9d70022a8845938599696c8
# Parent 15c0283f7cb6dad3d7a41e9095bb4fd18a30d909
Implemented secret sharing command.
diff --git a/viff/orlandi.py b/viff/orlandi.py
--- a/viff/orlandi.py
+++ b/viff
# HG changeset patch
# User Janus Dam Nielsen
# Date 1245394850 -7200
# Node ID 29c28d1a8e5f5647fe97d7b01f5924f3ef006301
# Parent f780a9ea514acb7de9d70022a8845938599696c8
Implementation of the open command.
diff --git a/viff/orlandi.py b/viff/orlandi.py
--- a/viff/orlandi.py
+++ b/viff
# HG changeset patch
# User Janus Dam Nielsen
# Date 1245394852 -7200
# Node ID 1eb98ef76446e9ef06d8d94e31748fe5cfd2ba82
# Parent 29c28d1a8e5f5647fe97d7b01f5924f3ef006301
Implementation of random share command.
diff --git a/viff/orlandi.py b/viff/orlandi.py
--- a/viff/orlandi.py
+++ b/viff
This patchbomb contains partial implementation of the Orlandi runtime.
The patches implements the basic and advanced commands along with the
triple_gen and triple_test commands.
The patches are partial implementations in the sense that the commitments are
not implemented correctly, pending an im
# HG changeset patch
# User Janus Dam Nielsen
# Date 1245394848 -7200
# Node ID 15c0283f7cb6dad3d7a41e9095bb4fd18a30d909
# Parent 8ec45943c12ab91430d03a8895aabc6f64fe7a37
importeret rettelse orlandi_implementation.patch
diff --git a/viff/orlandi.py b/viff/orlandi.py
new file mode 100644
from completing it.
____
Janus Dam Nielsen
R&D SCIENTIST, PhD.
CENTRE FOR IT-SECURITY
THE ALEXANDRA INSTITUTE LTD.
T +45 42 22 93 56
E janus.niel...@alexandra.dk
W ale
he c implementation is also of large value
to us.
____________
Janus Dam Nielsen
R&D SCIENTIST, PhD.
CENTRE FOR IT-SECURITY
THE ALEXANDRA INSTITUTE LTD.
T +45 42 22 93 56
E janus.niel...@alexandra.dk
W alexandra.dk
___
New submission from Janus Dam Nielsen :
the sha module is deprecated as of Python 2.6.1
/Users/fagidiot/Documents/viff/viff/prss.py:46: DeprecationWarning: the
sha module is deprecated; use the hashlib module instead
import sha
We should change to the hashlib module instead
Hi
For your information.
I am using VIFF with Python version 2.6.1 and it shows the following
warning:
/Users/fagidiot/Documents/viff/viff/prss.py:46: DeprecationWarning:
the sha module is deprecated; use the hashlib module instead
import sha
--
Janus Dam Nielsen
R&D Scien
I have experienced the same problem/issue.
--
Janus Dam Nielsen
R&D Scientist
Alexandra Instituttet
janus.niel...@alexandra.dk
On 23/03/2009, at 15.42, Thomas P Jakobsen wrote:
Hi all,
When I execute the attached VIFF protocol on three servers I would
expect all three to ask me to p
can be
corrupt. I think a protocol of Bracha has in fact already been
implemented in VIFF
regards, Ivan
Quoting Janus Dam Nielsen :
New submission from Janus Dam Nielsen :
I would like to see a broadcast method in the Runtime class. The
purpose of the broadcast method should be to
New submission from Janus Dam Nielsen :
I would like to see a broadcast method in the Runtime class. The
purpose of the broadcast method should be to distribute a public value
among all parties (or some subset of parties).
A case: All parties in a computation needs to read a value from
New submission from Janus Dam Nielsen :
Add a parameter to specify the keysize in the script generate-config-
file.py
--
assignedto: jdn
keyword: simple
messages: 308
nosy: jdn, mg
status: in-progress
title: Specify keysize for generate-config-file.py
type: wish
160 bit
--
Janus
Den 21/09/2008 kl. 17.02 skrev Claudio Orlandi:
Could everyone specify the size of the field and the size of the
secret keys used?
Otherwise it's quite hard to understand the performance reported.
Regards,
Claudio
On Sun, Sep 21, 2008 at 4:59 PM, Adam Langley
<[EMAIL PROT
Hi,
I have made some tests of ElGamal encryption in Python (with some
nontrivial amount of help from Martin thanks)
First test was in bare Python, here an encryption took
time for 1 enc time for 4*10^6 enc
Python : 0,002980 sec : approx. 3 hours and 20 min
GMPY : 0,0
In the paper on page two, lower left, we write that each server
party execute identical copies of the server program inn lock-step.
Based on this assumption it is reasonable to consider the server as
having a single well-defined state. However in Viff this is no
longer true due to parallelism. B
Hi Martin,
I am confused about the notion of security via adversary traces
presented in those papers. It is described via two properties:
* Identity Property: a public state P can only lead to one other
public state P', regardless of the secret state.
* Commutative Property: computing on sec
Hi again,
While reading the progress repot I also looked at the code of the
compiler to get a feeling for what it can and cannot do.
Please correct me if I'm wrong, but it seems to go through a number of
standard phases not related to cryptography. Then there are these
three phases:
Yes there
less.
If the choice comes to removing two multiplication then I think it is
preferable to not removing them.
--
Janus
Den 17/07/2008 kl. 14.08 skrev Martin Geisler:
Janus Dam Nielsen <[EMAIL PROTECTED]> writes:
If there are any other ideas for optimizations you would like to see
in
If there are any other ideas for optimizations you would like to see
in a compiler for Viff then now is the time to come forward.
--
Janus
Den 15/07/2008 kl. 16.49 skrev Martin Geisler:
Janus Dam Nielsen <[EMAIL PROTECTED]> writes:
Hi again,
Heres the fruit of half a day
Den 15/07/2008 kl. 16.49 skrev Martin Geisler:
> Janus Dam Nielsen <[EMAIL PROTECTED]> writes:
>
>> Hi again,
>>
>> Heres the fruit of half a days work :)
>>
>> Analyzing the expression:
>> sint n = (a * y + (1 - a) * x);
>>
>>
Hi again,
Heres the fruit of half a days work :)
Analyzing the expression:
sint n = (a * y + (1 - a) * x);
Yields the following results:
Final result:
((a * y )+ ((1 - a )* x )) cost: 30
(((a * y )+ x )- (x * a )) cost: 30
(((a * y )+ x )- (a * x )) cost: 30
(((a * y )- (a * x ))+ x ) cos
--
Janus
Den 15/07/2008 kl. 12.16 skrev Martin Geisler:
Janus Dam Nielsen <[EMAIL PROTECTED]> writes:
Den 11/07/2008 kl. 22.02 skrev Martin Geisler:
Right, good point! We should do that. Maybe a smart compiler could
do the necessary deductions automatically? [...]
I am not aware
1) Rather than
x = (a * (y + (1 - a) * x)
you want
x = (a * (y - x) + x)
so you shave off a superfluous mult for each assignment.
Right, good point! We should do that. Maybe a smart compiler could do
the necessary deductions automatically? So it would go from
x = a * y + (1 - a) * x
See below...
--
Janus
Den 11/07/2008 kl. 22.02 skrev Martin Geisler:
[EMAIL PROTECTED] writes:
Hi everybody,
1) Rather than
x = (a * (y + (1 - a) * x)
you want
x = (a * (y - x) + x)
so you shave off a superfluous mult for each assignment.
Right, good point! We should do that. M
> Another big project
Ahmm is Viff a big project :)
--
Janus
Den 24/04/2008 kl. 9.21 skrev Martin Geisler:
> Martin Geisler <[EMAIL PROTECTED]> writes:
>
>> Hi everybody,
>>
>> I have been playing around with a new system for documenting VIFF.
>> It is called Sphinx and has been developed for d
> The idea is the viff.dk will display the latest code and documentation
> whereas each release will contain a copy of the code and documentation
> as it was at the point of release. That way people should be able to
> always obtain API docs for their code, whether it being new or old. I
> would o
for now, so the
commit messages are just more spam mails I have to delete.
--
Janus
--
Janus
Den 22/02/2008 kl. 9.36 skrev Martin Geisler:
> Janus Dam Nielsen <[EMAIL PROTECTED]> writes:
>
>> Well with all the messages and information you guys generate
>> anyway, I
Martin Geisler:
> Janus Dam Nielsen <[EMAIL PROTECTED]> writes:
>
>> I would very much prefer not to get these messages.
>
> Do you mean the messages concerning the homepage?
>
> I really like the idea of publishing such a short summary when changes
> are made -- esp
I would very much prefer not to get these messages.
--
Janus
Den 20/02/2008 kl. 15.57 skrev viff-devel@viff.dk:
> http://hg.viff.dk/viff.dk/rev/ec341fb94853
> changeset: 36:ec341fb94853
> user: Martin Geisler <[EMAIL PROTECTED]>
> date: Wed Feb 20 13:00:49 2008 +0100
> summary: Filt
ameter. How
to do this, I don't know. I just like it.
--
Janus
Den 15/02/2008 kl. 10.21 skrev Martin Geisler:
> Janus Dam Nielsen <[EMAIL PROTECTED]> writes:
>
>>>> I think that having parametrized tests is good, however I just
>>>> wanted to point
I haven't looked at the code. I just wanted to make sure you didn't
shoot yourself in the foot unintentionally :)
--
Janus
Den 15/02/2008 kl. 1.57 skrev Martin Geisler:
> Janus Dam Nielsen <[EMAIL PROTECTED]> writes:
>
>> I think that having parametrized t
I think that having parametrized tests is good, however I just wanted
to point out that defining the parameters in the Runtime class/object
might not be suffienciently expressive to what we want. We might
would like a kind of grouping/system of tests so that it is easy to
run the tests with
I thing to consider.
Does it make sense to run all unit tests with the same configuations
of players and thresholds. That is, for all protocols p, is p
executed with x players and threshold t is p welldefined?
I suspect, out of the blue air, that this is not the case. I am I
right or am I w
Ohh so it is Turing complete? :)
--
Janus
Den 01/02/2008 kl. 1.52 skrev Martin Geisler:
> Janus Dam Nielsen <[EMAIL PROTECTED]> writes:
>
>> Den 31/01/2008 kl. 14.21 skrev Martin Geisler:
>>
>>> If you just want to select between two methods, then this also
Den 31/01/2008 kl. 14.21 skrev Martin Geisler:
> If you just want to select between two methods, then this also works:
>
> class Comb(Base, Mix1, Mix2):
> foo = Mix1.foo
Brilliant!
--
Janus
___
viff-devel mailing list (http://viff.dk/)
viff-de
> Yes, that would be annoying. But with mixin classes there is nothing
> that prevents us from naming the method the same in the different
> classes. The programmer would then have to pick only one class --
> mixing
> two classes that both define compare() would result in one of the two
> method
s Toft happens to
> invent an even faster comparison, compareToft08() ... which I guess is
> not unlikely ;). The programmer will then have to rewrite his
> application, changing all calls to compareToft07() to compareToft08()
> in order to use the fastest available comparison.
>
> Best
Hi Martin,
I am not so confident with the code base that I can judge which
methods goes into which classes. So I am just going to tell you about
cohesion. In OO programming one should strive to achieve as high a
degree of cohesion for each class as possible. That is each class
should serve
Hi Martin,
That is great news!
> As expected, the time per multiplication stayed constant when I varied
> the number of multiplications -- with the parallel scheduling there
> is a
> huge difference between doing 100 and doing 1000 multiplications (a
> factor of four in a test I did).
Do you h
[ Hi Janus, I'm resending this mail to the list since it looks like it
was meant to go there (if people who know Danish write to me in
English, I assume they meant to send the mail to the public). ]
--
Janus
Den 08/12/2007 kl. 2.50 skrev Martin Geisler:
> Janus Dam Nielsen <[EMAI
By the way I really like this way of looking at the computations as
just observing on the results, it has some huge advantages in a
parallel world! Good work Martin!
--
Janus
Den 07/12/2007 kl. 14.34 skrev Martin Geisler:
> Janus Dam Nielsen <[EMAIL PROTECTED]> writes:
>
>
> Janus Dam Nielsen <[EMAIL PROTECTED]> writes:
>
> I de-top-posted your mail, see below.
>
>>> One would probably represent the expression tree explicitly and
>>> evaluate it starting with the leaf nodes.
>>>
>>> If all nodes are asso
After some more thought, then I just consider this an instance of the
observer visitor. Maybe with some threads if you want some stuff done
i parallel.
--
Janus
Den 07/12/2007 kl. 13.31 skrev Martin Geisler:
> Janus Dam Nielsen <[EMAIL PROTECTED]> writes:
>
> Hi Janus, thank
I will take a look at it when I get home tonight. My initial though,
without having read your post, is that: Yes you can do it in Java but
it won't be pretty.
--
Janus
Den 07/12/2007 kl. 3.28 skrev Martin Geisler:
> Martin Geisler <[EMAIL PROTECTED]> writes:
>
> Hi Janus -- I'm CCing you si
75 matches
Mail list logo
