Mike Burmester - Florida State
Students: Spring 2025, unless noted otherwise, sessions will be virtual on Zoom.
Provable security in mobile ad hoc networks
Feb 15, 2006
Download: MP4 Video Size: 199.5MBWatch on YouTube
Abstract
Mobile ad hoc networks (MANETs) are collections of wireless mobile nodeswith links that are made or broken in an arbitrary way. Communication is
achieved via routes whose node relay packets. Several routing algorithms
have been proposed in the literature. These focus mainly on efficiency with security relegated to weak adversary models.
In this talk we consider the security of distributed MANET applications
in malicious adversary models. We model a MANET by a stochastic finite state machine that is subject to mobility, medium and markovian constraints and describe an adversary structure that addresses the malicious attacks that are particular to MANETS (wormhole attacks, Sybil attacks, packet dropping, selfishness). We then show how the traditional cryptographic framework for provable security can be adapted to this particular adversary structure.
Finally we consider two complementary approaches that can be used to
achieve provably secure routing in our adversary model: a reactive approach that traces malicious behavior and a proactive approach that tolerates malicious behavior.
About the Speaker
Mike Burmester is a professor at Florida State University since 2001.
Earlier, he was at Royal Holloway, London University.
He got his BSc from Athens University and PhD from Rome University.
His research interests include key distribution, privacy, anonymity,
network security and watermarking. He is a member of the International
Association for Cryptological Research and a Fellow of the Institute
of Mathematics and Applications.
Earlier, he was at Royal Holloway, London University.
He got his BSc from Athens University and PhD from Rome University.
His research interests include key distribution, privacy, anonymity,
network security and watermarking. He is a member of the International
Association for Cryptological Research and a Fellow of the Institute
of Mathematics and Applications.