Date(s) - 15 Nov 2017
1:10 PM - 2:00 PM
3043 ECpE Building Addition
Speaker: Mohammadreza Khalili Shoja, ECpE Graduate Student
Adviser: George Amariucai and Zhengdao Wang
Title: Secret Key Establishment from Common Randomness Represented as Complex Correlated Random Processes: Practical Algorithms and Theoretical Limits
Abstract: Establishing secret common randomness between two or multiple devices in a network resides at the root of communication security. Secret key establishment from common randomness has been traditionally investigated under certain limiting assumptions, of which the most ubiquitous appears to be that the information available to all parties comes in the form of independent and identically distributed (i.i.d.) samples of some correlated random variables. Unfortunately, models employing the i.i.d assumption are often not accurate representations of real scenarios. In this talk, I will introduce Sibling Hidden Markov Model (SHMM) to overcome the aforementioned problem. Also, I will talk about KERMAN protocol which is an algorithm to establish secret-common-randomness for ad-hoc networks, which works by harvesting randomness directly from the network routing metadata.