Geometry of Secure Computation

Explore the geometric framework for secure computation in this lecture by Hemanta Maji from Purdue University. Delve into the characterization of round and communication complexity for secure computation, focusing on the recent breakthrough in determining these complexities for randomized-output functions. Learn how this novel approach encodes candidate secure protocols as points and utilizes generalizations of convex hulls to derive complexity results. Gain insights into the connection between cryptography and geometry research, and understand how this innovative perspective helps solve a three-decade-old problem in the field of minimal complexity assumptions for cryptography.