Abstract
Yao’s garbled circuit (GC) 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 also discuss new directions and open problems in the foundations of REs.
This paper subsumes the short survey [3].
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this chapter
Cite this chapter
Applebaum, B. (2017). Garbled Circuits as Randomized Encodings of Functions: a Primer. In: Lindell, Y. (eds) Tutorials on the Foundations of Cryptography. Information Security and Cryptography. Springer, Cham. https://doi.org/10.1007/978-3-319-57048-8_1
Download citation
DOI: https://doi.org/10.1007/978-3-319-57048-8_1
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-57047-1
Online ISBN: 978-3-319-57048-8
eBook Packages: Computer ScienceComputer Science (R0)