DMCA
Foundations of Garbled Circuits (2012)
| Citations: | 50 - 4 self |
BibTeX
@MISC{Bellare12foundationsof,
author = {Mihir Bellare and Viet Tung Hoang and Phillip Rogaway},
title = { Foundations of Garbled Circuits},
year = {2012}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Garbled circuits, a classical idea rooted in the work of Andrew Yao, have long been understood as a cryptographic technique, not a cryptographic goal. Here we cull out a primitive corresponding to this technique. We call it a garbling scheme. We provide a provable-security treatment for garbling schemes, endowing them with a versatile syntax and multiple security definitions. The most basic of these, privacy, suffices for twoparty secure function evaluation (SFE) and private function evaluation (PFE). Starting from a PRF, we provide an efficient garbling scheme achieving privacy and we analyze its concrete security. We next consider obliviousness and authenticity, properties needed for private and verifiable outsourcing of computation. We extend our scheme to achieve these ends. We provide highly efficient blockcipher-based instantiations of both schemes. Our treatment of garbling schemes presages more efficient garbling, more rigorous analyses, and more
Keyphrases
garbled circuit title garbling scheme cryptographic goal efficient garbling scheme classical idea provable-security treatment cryptographic technique rigorous analysis andrew yao efficient garbling efficient blockcipher-based instantiation versatile syntax primitive corresponding next consider obliviousness concrete security multiple security definition private function evaluation verifiable outsourcing twoparty secure function evaluation
