Paper 2017/385

Garbled Circuits as Randomized Encodings of Functions: a Primer

Benny Applebaum

Abstract

Yao's garbled circuit construction is a central cryptographic tool with numerous applications. In this tutorial, we study garbled circuits from a foundational point of view under the framework of randomized encoding (RE) of Functions. We review old and new constructions of REs, present some lower-bounds, and describe some applications. We will also discuss new directions and open problems in the foundations of REs. This is a survey that appeared in a book of surveys in honor of Oded Goldreich's 60th birthday.

Metadata
Available format(s)
PDF
Category
Foundations
Publication info
Published elsewhere. Tutorials on the Foundations of Cryptography, Dedicated to Oded Goldreich
DOI
10.1007/978-3-319-57048-8_1
Keywords
randomized encodinggarbled circuits
Contact author(s)
benny applebaum @ gmail com
History
2017-05-04: received
Short URL
https://ia.cr/2017/385
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2017/385,
      author = {Benny Applebaum},
      title = {Garbled Circuits as Randomized Encodings of Functions: a Primer},
      howpublished = {Cryptology ePrint Archive, Paper 2017/385},
      year = {2017},
      doi = {10.1007/978-3-319-57048-8_1},
      note = {\url{https://eprint.iacr.org/2017/385}},
      url = {https://eprint.iacr.org/2017/385}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.