"Claudio Orlandi" <[EMAIL PROTECTED]> writes:
(I send your off-list reply back on track)
> Where is a description of the new protocol?
"Use the source, Luke!" :-)
It is just the normal passive multiplication protocol where I have cut
away all the work that is not needed: we only need 2t+1 share
Where is a description of the new protocol?
> The good question is now how we can get the best of both worlds so
> that the case with (n, t) = (3, 1) remains fast.
What about "if n=3 then RunOldProtocol else RunNewProtocol"? :)
--
Claudio Orlandi
PhD student,
Department of Computer Science, Tur
Martin Geisler <[EMAIL PROTECTED]> writes:
> 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 l
