New Ways to Garble Arithmetic Circuits

Explore innovative techniques for garbling arithmetic circuits in this lecture by Rachel Lin from the University of Washington. Delve into the advancements made since the work of Applebaum, Ishai, and Kushilevitz, which introduced arithmetic variants of Yao's garbled circuits. Learn about new methods that improve efficiency, modularity, and functionality in arithmetic circuit garbling. Discover the first constant-rate arithmetic garbled circuit for large integer computation based on the Decisional Composite Residuosity assumption. Examine a modular construction for arithmetic garbling over any integer modulus using DCR or Learning With Errors. Investigate a variant supporting both arithmetic and Boolean computations while maintaining constant rate for the arithmetic portion. Compare these new approaches to previous methods that relied on indistinguishability obfuscation or were limited to circuits with small depth. Gain insights into the latest developments in cryptographic techniques for secure computation and data privacy.