Mike Burmester's guest appearances

Mike Burmester

CERIAS Weekly Security Seminar - Purdue University

Ryan Henry

Cory Doctorow

Doug Smith

Larry Ponemon

George Heron

Laura Thomas

Eli Lilly

Stephen Elliott

Tony Sager

David Carroll

Jack Daniel

Joe Judge

Chris Reed

Richard III

John Richardson

OwlTail

Mobile ad hoc networks (MANETs) are collections of wireless mobile nodeswith links that are made or broken in an arbitrary way. Communication isachieved via routes whose node relay packets. Several routing algorithmshave 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 applicationsin 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 toachieve 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 InternationalAssociation for Cryptological Research and a Fellow of the Instituteof Mathematics and Applications.  

Mobile ad hoc networks (MANETs) are collections of wireless mobile nodes with 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.

Mike Burmester, Provable security in mobile ad hoc networks