Paper 2017/976

Improvements for Gate-Hiding Garbled Circuits

Mike Rosulek

Abstract

Garbled circuits have been highly optimized for practice over the last several years. Today's most efficient constructions treat different types of gates (e.g., AND vs XOR) differently; as such, they leak the type of each gate. In many applications of garbled circuits, the circuit itself is public, so such leakage is tolerable. In other settings, however, it is desirable to hide the type of each gate. In this paper we consider optimizing garbled circuits for the gate-hiding case. We observe that the best state-of-the-art constructions support only a limited class of gate functions, which turns out to undermine their improvements in several settings. These state-of-the-art constructions also require a non-minimal hardness assumption. We introduce two new gate-hiding constructions of garbled circuits. Both constructions achieve the same communication complexity as the best state-of-the-art schemes, but support a more useful class of boolean gates and use only the minimal assumption of a secure PRF.

Metadata
Available format(s)
PDF
Category
Cryptographic protocols
Publication info
Published elsewhere. Major revision. Indocrypt 2017
Keywords
garbled circuitsYao's protocolprivate function evaluation
Contact author(s)
rosulekm @ eecs oregonstate edu
History
2017-10-05: received
Short URL
https://ia.cr/2017/976
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2017/976,
      author = {Mike Rosulek},
      title = {Improvements for Gate-Hiding Garbled Circuits},
      howpublished = {Cryptology ePrint Archive, Paper 2017/976},
      year = {2017},
      note = {\url{https://eprint.iacr.org/2017/976}},
      url = {https://eprint.iacr.org/2017/976}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.