University of Cambridge > > Isaac Newton Institute Seminar Series > Foundations of Garbled Circuits

Foundations of Garbled Circuits

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Mustapha Amrani.

Semantics and Syntax: A Legacy of Alan Turing

Garbled circuits, a classical idea rooted in the work of A. Yao, have generally been understood as a cryptographic technique, not a cryptographic goal. Here we treat garbled circuits as a proper cryptographic primitive, giving a syntax for a “garbling scheme” and formalizing several security notions for such schemes. The most basic of our notions, “privacy”, suffices for the classical goals of two-party secure function evaluation (SFE) and private function evaluation (PFE). We provide a simple and efficient garbling scheme achieving privacy, this built from a block cipher, and we analyze its concrete security. We next consider the “authenticity” and “obliviousness” of a garbling scheme, extending the blockcipher-based protocol to achieve these ends, too. Our treatment of garbling schemes solidifies notions that have been swirling around the literature for years, and promises a more modular approach to designing and using garbling sc hemes in the future.

This talk is part of the Isaac Newton Institute Seminar Series series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2024, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity