Garbling Gadgets for Boolean and Arithmetic Circuits

Explore a conference talk on advanced cryptographic techniques presented at the 23rd ACM Conference on Computer and Communications Security (CCS 2016). Delve into the concept of garbling gadgets for Boolean and arithmetic circuits, as explained by researchers from Columbia University and Oregon State University. Learn about old-fashioned garbling, garbled circuit properties, and their applications. Discover innovative approaches such as linear wire labels, addition gates, and projection gates. Examine the performance implications for both arithmetic and Boolean circuits, and gain insights into the maintenance and practical applications of these cryptographic methods. Engage with cutting-edge research in computer security and communications during this 20-minute presentation from a prestigious international conference held at the Hofburg Palace in Vienna, Austria.