Events - Colloquia & Seminars

CCIS Colloquium Spring 2007

On Perfectly reliable and secure message transmission in a synchronous network.

Speaker: C.Pandu Rangan

Affiliation: IIT, Madras, India

Date: Monday, May 21, 2007

Talk: 4:00 p.m. - 5:00 p.m., 366 WVH

Abstract

In the Perfectly reliable message transmission problem (PRMT) a sender S wishes to send a message $m$ reliably to a receiver R in an insecure synchronous network. Here the insecurity of the system is modeled via an adversary who has infinite computing power and controls the behaviour of certain number of nodes of the network. We begin our talk with a brief description of the taxonomy of the models existing in the literature and then survey the recent progress in this area in a unified fashion. We discuss some recent progress made on structural, combinatorial and complexity theoretic aspects related to these problems. We conclude after touching upon some interesting and key open problems in this area.

Brief Biography

C.Pandu Rangan is currently a Professor at Dept of Computer Science and Engg, IIT, Madras, India. His areas of interests include algorithms, data structures, graph theory, randomised algorithms and cryptology. He has served on the board of directors of IACR (International Association of Cryptologic Research) and he is currently on the editorial board of LNCS. He was inducted as a fellow of the Indian National Academy of Engineering(INAE) in 2006.