Spectral approach to the communication complexity of multi-party key agreement

Geoffroy Caillat-Grenier, Andrei Romashchenko

We propose a linear algebraic method, rooted in the spectral properties of graphs, that can be used to prove lower bounds in communication complexity. Our proof technique effective…