Cryptology ePrint Archive: Report 2013/403

Function-Private Subspace-Membership Encryption and Its Applications

Dan Boneh and Ananth Raghunathan and Gil Segev

Abstract: Boneh, Raghunathan, and Segev (CRYPTO '13) have recently put forward the notion of function privacy and applied it to identity-based encryption, motivated by the need for providing predicate privacy in public-key searchable encryption. Intuitively, their notion asks that decryption keys reveal essentially no information on their corresponding identities, beyond the absolute minimum necessary. While Boneh et al. showed how to construct function-private identity-based encryption (which implies predicate-private encrypted keyword search), searchable encryption typically requires a richer set of predicates.

In this paper we significantly extend the function privacy framework. First, we introduce the new notion of subspace-membership encryption, a generalization of inner-product encryption, and formalize a meaningful and realistic notion for capturing its function privacy. Then, we present a generic construction of a function-private subspace-membership encryption scheme based on any inner-product encryption scheme. Finally, we show that function-private subspace-membership encryption can be used to construct function-private identity-based encryption. These are the first generic constructions of function-private encryption schemes based on non-function-private ones, resolving one of the main open problems posed by Boneh, Raghunathan, and Segev.

Category / Keywords: public-key cryptography / Function privacy, functional encryption.

Original Publication (with minor differences): IACR-ASIACRYPT-2013

Date: received 19 Jun 2013, last revised 11 Feb 2014

Contact author: ananthr at cs stanford edu

Available format(s): PDF | BibTeX Citation

Version: 20140211:170907 (All versions of this report)

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]