Citat af Håvard Vegge :
Thanks for clarifying!
Guess there are a lot of different variations of the definitions,
notions, etc. regarding secret sharing and MPC...
One of my problems is that when running the included sort.py
protocol with n=5 and t=2, the sorting of the array fails:
Origin
Thanks for clarifying!
Guess there are a lot of different variations of the definitions,
notions, etc. regarding secret sharing and MPC...
One of my problems is that when running the included sort.py protocol
with n=5 and t=2, the sorting of the array fails:
Original array: [{33}, {61}, {95},
Citat af Håvard Vegge :
Hi!
I'm trying to do some basic benchmarks with different number of
players. A few questions:
1. Why have VIFF defined the threshold t to be the number of corrupt
players, while the classical literature defines it as "t
participants can reconstruct the message"?
