Welcome to the resource topic for 2016/563
Title:
Garbling Scheme for Formulas with Constant Size of Garbled Gates
Authors: Carmen Kempka, Ryo Kikuchi, Susumu Kiyoshima, Koutarou Suzuki
Abstract:We provide a garbling scheme which creates garbled circuits of a very small constant size (four bits per gate) for circuits with fan-out one (formulas). For arbitrary fan-out, we additionally need only two ciphertexts per additional connection of each gate output wire. We make use of a trapdoor permutation for which we define a generalized notion of correlation robustness. We show that our notion is implied by PRIV-security, a notion for deterministic (searchable) encryption. We prove our scheme secure in the programmable random oracle model.
ePrint: https://eprint.iacr.org/2016/563
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .