Claudio Orlandi [EMAIL PROTECTED] writes:
Good morning Claudio!
One of the two is not a real issues: in fact we can implement this
in VIFF as a symmetric protocol. Basically we just run 2
multiplication at once :)
Okay, I'll see about implementing this soon.
The asymmetry should actually no
It seems ok to me.
I just think that we can improve effiency (and security) a bit if we
do like this:
P1 computes:
- A1= Enc(a1), B1=Enc(b1)
- Send A1,B1 to P2
P2 computes:
- C1=A1^b2 * B1^a2 * Enc(r) // r random in [0, 2p^2 + 2^k] k security parameter
- c2= a2b2 - (r mod p) mod p
- Send C1 to P1
Claudio Orlandi [EMAIL PROTECTED] writes:
Hi Claudio
if you are interested just in passive security for the 2 party case
you can implement the following protocol for multiplication.
You never commented on my implementation of your multiplication
protocol -- is there anything I should know
Ivan Bjerre Damgaard [EMAIL PROTECTED] writes:
Isn't a mail list for patches a strange place to put something like
this El Gamal protocol you just mailed about? If you had not by
chance sent this to more people, you might not have received
Claudio's useful comment.
You're right, I'm pretty
