CCA-Secure Inner-Product Functional Encryption from Projective Hash Functions

Specifically, we construct the first efficient verifiable IPE (VIPE) scheme according to the inner- product functionality of Katz, Sahai and Waters [EUROCRYPT 2008].. To instantiate

Under the assumption of the existence of an IND-CPA secure functional encryption scheme for all circuits (FE4C), there exists a NM-CPA secure CHES secure against adversaries that

schemes that support an unbounded number of functional keys; such works in- vestigate generic theoretical implications/separations between different kinds of primitives — such

In this section, we show that assuming a CRIND-Secure (in the standard model) MI-FE scheme for p-TM 2 (2-inputs Turing machines with run time equal to a polynomial p) for any

[31] noted that an impossibility result of [8] implies that, even in the simpler case of identity-based encryption, “full” receiver deniability inherently requires that a receiver

In this part we derive a key encapsulation mechanism from the usual attribute- based encryption, we define the homomorphic-policy property and the associated security notions, and

However, as far as the target function can be computed (from public information) from the outputted function of the pirate decoder, then the traitors can still be traced. We

Organization. Section 2 recalls some standard notation together with the syntax and security definitions for func- tional encryption schemes. Section 3 presents our constructions