International Conference on the Theory and Application of Cryptology and Information Security

Advances in Cryptology -- ASIACRYPT 2015 pp 758-782

Garbling Scheme for Formulas with Constant Size of Garbled Gates

  • Carmen Kempka
  • Ryo Kikuchi
  • Susumu Kiyoshima
  • Koutarou Suzuki
Conference paper

DOI: 10.1007/978-3-662-48797-6_31

Part of the Lecture Notes in Computer Science book series (LNCS, volume 9452)
Cite this paper as:
Kempka C., Kikuchi R., Kiyoshima S., Suzuki K. (2015) Garbling Scheme for Formulas with Constant Size of Garbled Gates. In: Iwata T., Cheon J. (eds) Advances in Cryptology -- ASIACRYPT 2015. Lecture Notes in Computer Science, vol 9452. Springer, Berlin, Heidelberg

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.

Keywords

Garbled circuits Constant size of garbled gates Correlation robustness PRIV-security 

Copyright information

© International Association for Cryptologc Research 2015

Authors and Affiliations

  • Carmen Kempka
    • 1
  • Ryo Kikuchi
    • 1
  • Susumu Kiyoshima
    • 1
  • Koutarou Suzuki
    • 1
  1. 1.NTT Secure Platform LaboratoriesTokyoJapan

Personalised recommendations