New Broadcast Paradigm in collaborative environments ANY SOURCE P-BROADCAST (ASPB)

1. <S2>, <S4> Unique Public Key Detect compromised ID Pretend <S1>, <S5> AnyPCast: A Scalable Authentication Protocol for Any-Source P-Broadcast Illinois Center for Wireless Systems • Introduction Integrity Protection of Broadcast for mission critical applications in mobile ad hoc wireless networks Prior Arts: TESLA and its variations + Low communication and computation overhead + Scalability to a large number of receivers + Tolerance to packet loss. 3) Infrequent Public Key Authentication • Problem New Broadcast Paradigmincollaborative environments ANY SOURCE P-BROADCAST (ASPB) - Many broadcast sources - Packet reception from the source at the receivers is opportunistic Examples of ASPB Schemes: - Gossip - Mobility-assisted information diffusion - Rendezvous-point store and query Problem of Applying TESLA on ASPB Traffic 1) Hash chain commitment storage for profusesenders 2)Authentication delay deteriorates - Deterministic packet losses - ASPB Traffic • Experiment Assumption: Locality-P Traffic Model:Small world modelA node v chooses N*prandom nodes to send one packet per round. A node A is chosen with probability proportional to . d(A, v) is the hop distance from node v to node A System Configuration CAUSE: One hash chain is exclusively owned by one identity (device). • Motivation - AnyPCast Authentication Delay Hash Chain Pre-distribution & Sharing 2) Broadcast Authentication 1) Hash Chain Group Future Work + Online hash chain updating, + System reconfiguration + Location-aware hash chain group management Sign message MAC <S2>MAC <S4> • Conclusion <S2 > key recved Validate Signature MAC <S2> MAC <S4> AnyPCast: Broadcast Authentication Protocol • Scalable to a large number of senders • Reduces packet authentication delay in path failure and prob. Brdcsting: Mobile, Dynamic Topology, Random Traffic Pattern • Supports dynamic node addition <S4 > key recved Accept