Colloquium Details

Security Protocols for Broadcast Communication

Author:	Adrian Perrig University of California, Berkeley
Date:	March 13, 2002
Time:	15:30
Location:	220 Deschutes

Note: Special Day

Abstract

Broadcast is an important mechanism for communication over the Internet and wireless networks. What are security challenges for broadcasts? We need to verify the authenticity of messages, to prevent spoofing or data injection. And, if broadcasts contain private or secret material, we need to make sure that only authorized parties can access the information.

It is difficult to make broadcast secure because

packets may get lost, but many broadcast applications do not retransmit them;
receivers often need to process data as packets arrive, rather than buffering data;
receivers are heterogeneous, with widely varying bandwidth and computation resources;
the group of receivers may be dynamic, with members joining and leaving the group at any time.

Previous security protocols cannot efficiently handle all of these conditions.

I will describe how I designed and built a suite of new efficient security protocol families to enable broadcast authentication (TESLA & BiBa), broadcast signature (HTSS & MESS), and key distribution for large dynamic groups (ELK). My protocols are efficient, scalable, and tolerate high packet loss. I will also discuss an implementation on a secure sensor network using nodes with sharply limited resources (8-bit microprocessor, 8-K ROM, 512 bytes RAM, limited battery life).

Biography

Adrian Perrig is a Ph.D. student in Computer Science at Carnegie Mellon University and is currently finishing his thesis at UC Berkeley. He earned his Bachelors degree in Computer Science from the Swiss Federal Institute of Technology in Lausanne (EPFL). Adrian's main research area is in security and applied cryptography, focusing on network security, security for sensor networks and mobile applications. More information about his research is available at: http://www.cs.berkeley.edu/~perrig