Next, we show how our tools can be used to construct secure obfuscators for the functional re-encryption and multi-hop unidirectional re-encryption primitives. In the former case, we improve upon the efficiency of the only previously known construction that satisfies the stronger notion of collusion-resistant obfuscation (due to Chandran et al. - TCC 2012) and obtain a construction with input ciphertexts of constant length. In the latter case, we provide the first known obfuscation-based definition and construction; additionally, our scheme is the first scheme where the size of the ciphertexts does not grow with every hop.
Category / Keywords: public-key cryptography / re-encryption, average-case obfuscation Original Publication (in the same form): IACR-PKC-2014 Date: received 22 May 2015 Contact author: melissac at microsoft com Available format(s): PDF | BibTeX Citation Version: 20150525:144721 (All versions of this report) Short URL: ia.cr/2015/491