[PDF] Top 20 A Definitional Framework for Functional Encryption

... public-key encryption scheme achieves the same goal of providing access control for a repository, but access would be all-or-nothing: If one knows the secret key, then one can decrypt, otherwise one ... See full document

... public-key encryption indeed requires a very high extra cost: even in the bounded model, the cost grows proportionally with the number of ...inner-product functional encryption, we can hope for a ... See full document

... herself to be seen by people from her network, on her own terms, according to her preferred story, and to her identity claims. Reporting on it came about as two of the authors explored different approaches for analysis ... See full document

... the functional keys are designed such that every ciphertext-functional key pair gives rise to a unique instantiation of single-ciphertext single-key private ... See full document

... public-key encryption, we consider a similar model for functional encryption and introduce the notion of Multi-Authority Functional Encryption ... See full document

... traditional encryption schemes, decryption control is all or nothing: the sender encrypts its message under a particular key, and anyone with the corresponding secret key can recover the mes- ...contrast, ... See full document

... achieve functional encryption in the context of computing a function defined over multiple plaintexts given their corresponding ciphertexts, or further, given their ciphertexts each encrypted under a ... See full document

... obfuscating the function f using an indistinguishability obfuscator [BGI + 01]. We show how to modify this construction to achieve our notion of functional encryption for randomized function- alities by ... See full document

... size, encryption time is O(m)poly(κ), decryption time is O(m + |f ...for encryption and decyrption remains an important open problem (unless we assume non-falsifiable assumptions such as diO, as we will see ... See full document

... a functional encryption scheme supporting a TDP that reveals the corresponding trapdoor along with the decryption ...for functional encryption should reject schemes that fail to preserve the ... See full document

... based encryption (IBE) [Sha84, BF01, Coc01, BW06] [GPV08, CHKP10, ABB10a, ABB10b] threshold functions [SW05], membership checking [BW07], boolean formulas [GPSW06, BSW07, LOS + 10], inner product functions [KSW08, ... See full document

... underlying functional encryption scheme is “compact” [AJ15, BV15] in the sense that the efficiency of its encryption algorithm de- pends only on the security parameter and on length of the plaintext ... See full document

... pseudo-randomness. By a standard information-theoretic argument, this means that the length of the ciphertext plus the secret keys must grow with q. To obtain a lower bound on the ciphertext size, we carefully exploit ... See full document

... The solution to this problem is to restrict the number of occurrences of symbols in transitions and strings during system setup. We adapt a technique previously used by Lewko et.al. [LOS + 10] in the context of ... See full document

... GGHRSW functional encryption system is that it only offers a selective proof of security where the attacker must declare the challenge messages before seeing the parameters of the FE ... See full document

... HEtest framework by describing our evaluation of the IBM submission to the SPAR project, which is largely based on the open-source HElib implementation [12, ...homomorphic encryption software with only ... See full document

... The proof consists of two main steps. We first state and prove a master theorem that shows hardness in the generic bilinear group model for a broad family of interactive decisional problems, notably a family which ... See full document

... (symmetric-key) functional encryption with a succinct en- cryption ...(succinct) functional encryption or obfuscation [AGVW13, BGI + ... See full document

... of functional encryption is that of predicate encryption (PE, for short) which are defined for functionalities whose message space X consists of two subspaces I and M called respectively index space ... See full document

... achieve security even when these terms are leaked in the secret keys. More specifically, these previous approaches use a security paradigm called Dual System Encryption, introduced by [37], where the security ... See full document