Secure Computation and Low-Complexity Cryptography

Explore the efficiency frontiers of secure computation in this lecture that examines how to minimize computational costs under various optimization metrics. Delve into the fundamental question of how efficient secure computation can be, while discovering how this pursuit naturally leads to broader questions about low-complexity cryptography that hold independent theoretical and practical significance. Learn about the intersection between secure computation protocols and cryptographic primitives designed for minimal computational overhead, gaining insights into both the theoretical foundations and practical implications of optimizing cryptographic systems for efficiency.