Our techniques result in constructions of attribute-based and (single key secure) functional encryption schemes where the secret key of a circuit C consists of C itself, plus poly(secp) additional bits. All of these constructions are based on the subexponential hardness of the learning with errors problem.
We also study the dual question of how short the garbled inputs can be, relative to the original input. We demonstrate a (different) reusable circuit garbling scheme, based on multilinear maps, where the size of the garbled input is the same as that of the original input, plus a poly(secp) factor. This improves on the result of Applebaum, Ishai, Kushilevitz and Waters (CRYPTO 2013) who showed such a result for single-use garbling. Similar to the above, this also results in attribute-based and (single key secure) functional encryption schemes where the size of the ciphertext encrypting an input x is the same as that of x, plus poly(secp) additional bits.Category / Keywords: Attribute-based Encryption, Functional Encryption, Reusable Garbled Circuits, Short Secret Key, Short Ciphertext Date: received 24 Oct 2013, last revised 24 Oct 2013 Contact author: sgorbunov at cs toronto edu Available format(s): PDF | BibTeX Citation Version: 20131024:202811 (All versions of this report) Discussion forum: Show discussion | Start new discussion