Download now Free registration required
The authors consider resource-constrained broadcast authentication for n receivers in a static, known network topology. There are only two known broadcast authentication protocols that do not use asymmetric cryptography, one-time signatures, multi-receiver MACs, or time synchronization,. Both these protocols require three passes of a message front traversing the network. They investigate whether this amount of interaction can be improved efficiently for specific common topology classes, namely, linear topologies, tree topologies and fully connected topologies. They also prove new lower bounds for round complexity, or the maximum number of consecutive interactions in a protocol.
- Format: PDF
- Size: 535.9 KB