Multiparty secret key generation is a fundamental problem studied in information theoretic security. In this setting, multiple parties possess correlated random variables and wish to generate a group secret key using public communication. The protocol for key generation must guarantee that an eavesdropper who has access to the public communication obtains (almost) no information about the key. In this talk, I will present a lattice-based protocol for generating a secret key from correlated Gaussian sources. I will also present two computationally efficient lattice coding schemes for this problem, and briefly mention their applicability in other problems of communication and security.
Shashank received his MSc and PhD from the Department of Electrical Communication Engineering, Indian Institute of Science in 2017. He was a recipient of the TCS research fellowship. Currently, he is a postdoctoral fellow at the Chinese University of Hong Kong. His research interests include information theory and coding, particularly lattice codes and communication in the presence of adversaries, graphical models, and variational methods for inference problems.