Coursera Flash Sale
40% Off Coursera Plus for 3 Months!
Grab it
Explore advanced techniques for extending Yao's Garbled Circuit (GC) beyond traditional Boolean circuit limitations in this comprehensive lecture on secure multiparty computation. Learn how recent developments have enabled asymptotically-efficient methods to augment GC with support for more expressive computational primitives including arithmetic gates, random access memory, and lookup tables. Discover compilation techniques that transform arithmetic gates and random access memory into simple operations easily implementable within garbled circuits. Focus on GC methods achievable through symmetric key cryptography using only random oracles, understanding how these advances maintain the constant-round communication advantage of traditional garbled circuits while dramatically expanding their computational expressiveness for secure multiparty computation protocols.
