Coursera Spring Sale
40% Off Coursera Plus Annual!
Grab it
Learn about BitGC, a computationally efficient rate-one garbling scheme in this 33-minute conference talk by Xiao Wang from Northwestern University at the Simons Institute. Discover how this innovative approach to secure computation utilizes ring-RLWE with key-dependent message security, requiring only one bit per gate for stitching information alongside a SWHE-encrypted seed. Explore the computational process involving homomorphic expansion of the seed through a low-depth pseudorandom generator and two additional multiplication levels to construct garbled tables, eliminating the need for bootstrapping operations typically required in fully homomorphic encryption. Gain insights into recent implementation progress and advances in this efficient garbling technique that significantly reduces communication overhead in secure multi-party computation protocols.
