On Tue, Oct 28, 2008 at 7:55 PM, Leichter, Jerry
[EMAIL PROTECTED] wrote:
2. The Byzantine model. Failed modules can do anything
including cooperating by exchanging arbitrary
information and doing infinite computation.
So in the Byzantine model I can
This isn't enough. Somehow, you have to state that the values emitted
on demand in any given round i (where a round consists of exactly one
demand on all N member and produces a single output result) cannot
receive any input from any other members. Otherwise, if N=2 and member
0 produces true
The Skein team has announced its submission to the NIST hash competition:
http://www.schneier.com/skein.html
s.
-
The Cryptography Mailing List
Unsubscribe by sending unsubscribe cryptography to [EMAIL PROTECTED]