Learn about a unified framework for succinct garbling schemes based on homomorphic secret sharing in this 35-minute conference talk by Rachel Lin from the University of Washington. Explore advanced cryptographic techniques that enable secure computation through efficient garbling methods, examining how homomorphic secret sharing can be leveraged to create more compact and practical garbled circuits. Discover the theoretical foundations and practical implications of this unified approach, including its applications in privacy-preserving computation protocols and its potential to improve the efficiency of secure multi-party computation systems.