Skip to content. | Skip to navigation

Personal tools


Consider the world interacting

  • Logo CNRS
  • Logo ENSL
  • logo-enssib.jpg
You are here: Home / Agenda / évènements / Randomness, Everlasting Security, and Undetectability

Randomness, Everlasting Security, and Undetectability

Don Towsley - Dept. of Computer Science, U. Massachusetts
When Feb 24, 2017
from 10:00 to 11:00
Where Salles des conseils — Monod, ENS de Lyon
Add event to calendar vCal


Security and privacy are fundamental concerns in today’s world. These concerns have become particularly prominent with Snowden’s revelations of the presence of the NSA in our daily lives. These revelations have shown that traditional cryptographic techniques do not provide the security as was expected calling into question how security and privacy can be provided. In this talk we investigate how /randomness/ in the environment can be used to provide everlasting security and undetectability (privacy) in wireless networks.  In the first part of the talk we describe a practical way to harness this randomness to provide and improve the security of wireless communications. We introduce the notion of "dynamic secrets", information shared by two parties, Alice and Bob, engaged in communication and not available to an adversary, Eve. The basic idea is to dynamically generate a series of secrets from randomness present in the in wireless environment. These dynamic secrets exhibit interesting security properties and offer a robust alternative to cryptographic security protocols.  We present a simple algorithm for generating these secrets and using them to ensure secrecy.

In some situations, Alice and Bob may want not only to secure their communications but to keep it private.  In the second part of our talk we focus on the use of randomness to conceal any possible communications between Alice and Bob. Here the challenge is for Alice to communicate with Bob without an adversary, Willie the warden, ever realizing that the communication is taking place. Specifically, we establish that Alice can send O(\sqrt(t)) bits (and no more) to Bob in time  over a variety of wireless and optical channels.  Moreover, we report experimental results that corroborate these theoretical results and report on more recent developments.


Don Towsley holds a B.A. in Physics (1971) and a Ph.D. in Computer Science (1975) from University of Texas.  He is currently a Distinguished Professor at the University of Massachusetts in the College of Information & Computer Sciences.  He has held visiting positions at numerous universities and research labs. His research interests include networks and performance evaluation.

He currently serves as a Co-Editor-in-Chief of /ACM Transactions on Modeling and Performance Evaluation of Computer Systems (TOMPECS) /and previously as Editor-in-Chief of /IEEE/ACM Transactions on Networking/, and on numerous editorial boards./  /He has served as Program Co-chair of several conferences including INFOCOM 2009.//

He has received numerous awards including the 2007 IEEE Koji Kobayashi Award, 2007 ACM SIGMETRICS Achievement Award, and 2008 ACM SIGCOMM Achievement Award, and numerous paper awards including a 2008 ACM SIGCOMM Test-of-Time Paper Award and the 2012 ACM SIGMETRICS Test-of-Time Award.  Last, he has been elected Fellow of both the ACM and IEEE.