3 search results - page 1 / 1 » Round Complexity of Authenticated Broadcast with a Dishonest... |
FOCS
2007
IEEE
14 years 23 days ago
2007
IEEE
Broadcast among n parties in the presence of t ≥ n/3 malicious parties is possible only with some additional setup. The most common setup considered is the existence of a PKI an...
CRYPTO
2006
Springer
13 years 10 months ago
2006
Springer
Abstract. We consider the problem of random selection, where p players follow a protocol to jointly select a random element of a universe of size n. However, some of the players ma...
SP
2010
IEEE
13 years 4 months ago
2010
IEEE
Abstract--We consider resource-constrained broadcast authentication for n receivers in a static, known network topology. There are only two known broadcast authentication protocols...