Cryptology ePrint Archive: Report 2016/1106

Functional Encryption for Quadratic Functions, and Applications to Predicate Encryption

Romain Gay

Abstract: We present a functional encryption scheme based on standard assumptions where ciphertexts are associated with a tuple of values (x 1 ,...,x n ) in Z p n, secret keys are associated with a degree-two polynomial, and the decryption of a ciphertext ct (x 1 ,...,x n )in Z p n with a secret key sk P in Z p [X 1 ,...,X n ],deg(P)≤2 recovers P(x 1 ,...,x n ), where the ciphertext contains only O(n) group elements. Our scheme, which achieves selective security based on pairings, also yields a new predicate encryption scheme that supports degree-two polynomial evaluation, generalizing both [24] and [9].

Category / Keywords: public-key cryptography / functional encryption, quadratic functions, predicate encryption

Date: received 23 Nov 2016

Contact author: rgay at di ens fr

Available format(s): PDF | BibTeX Citation

Version: 20161123:192008 (All versions of this report)

Short URL: ia.cr/2016/1106

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]