Results 11 to 20 of about 9,135 (286)
Blind Functional Encryption [PDF]
, 2020 Functional encryption (FE) gives the power to retain control of sensitive information and is particularly suitable in several practical real-world use cases. Using this primitive, anyone having a specific functional decryption key (derived from some master secret key) could only obtain the evaluation of an authorized function f over a message m, given ...
Canard, Sébastien +2 more
openaire +3 more sources
Functional Encryption for Randomized Functionalities [PDF]
, 2015 In this work, we present the first definitions and constructions for functional encryption supporting randomized functionalities. The setting of randomized functionalities require us to revisit functional encryption definitions by, for the first time, explicitly adding security requirements for dishonest encryptors, to ensure that they cannot ...
Vipul Goyal +3 more
openaire +4 more sources
Incompressible Functional Encryption. [PDF]
IACR Cryptol. ePrint Arch.Incompressible encryption (Dziembowski, Crypto'06; Guan, Wichs, Zhandry, Eurocrypt'22) protects from attackers that learn the entire decryption key, but cannot store the full ciphertext. In incompressible encryption, the attacker must try to compress a ciphertext within pre-specified memory bound S before receiving the secret key.
Rishab Goyal +3 more
core +7 more sources
Hierarchical Functional Encryption. [PDF]
, 2017 Functional encryption provides fine-grained access control for encrypted data, allowing each user to learn only specific functions of the encrypted data. We study the notion of hierarchical functional encryption, which augments functional encryption with delegation capabilities, offering significantly more expressive access control.
Brakerski, Zvika +5 more
openaire +4 more sources
Controlled Functional Encryption [PDF]
Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security, 2014 Motivated by privacy and usability requirements in various scenarios where existing cryptographic tools (like secure multi-party computation and functional encryption) are not adequate, we introduce a new cryptographic tool called Controlled Functional Encryption (C-FE).
Muhammad Naveed 0001 +6 more
openaire +2 more sources
Receiver‐ and sender‐deniable functional encryption [PDF]
IET Information Security, 2018 Deniable encryption, first introduced by Canetti et al . 1997, allows equivocation of encrypted communication. In this work, the authors generalise its study to functional encryption (FE).
De Caro A., Iovino V., O'Neill A.
openaire +5 more sources
Unclonable Functional Encryption [PDF]
CoRRIn a functional encryption (FE) scheme, a user that holds a ciphertext and a function key can learn the result of applying the function to the plaintext message. Security requires that the user does not learn anything beyond the function evaluation. We extend this notion to the quantum setting by providing definitions and a construction for a quantum ...
Arthur Mehta, Anne Müller
openaire +4 more sources
Functional Encryption: Definitions and Challenges [PDF]
, 2011 We initiate the formal study of functional encryption by giving precise definitions of the concept and its security. Roughly speaking, functional encryption supports restricted secret keys that enable a key holder to learn a specific function of encrypted data, but learn nothing else about the data.
Dan Boneh, Amit Sahai, Brent Waters
openaire +4 more sources
On the Relationship between Functional Encryption, Obfuscation, and Fully Homomorphic Encryption [PDF]
, 2013 We investigate the relationship between Functional Encryption FE and Fully Homomorphic Encryption FHE, demonstrating that, under certain assumptions, a Functional Encryption scheme supporting evaluation on two ciphertexts implies Fully Homomorphic Encryption.
Joël Alwen +6 more
openaire +3 more sources
Functional encryption: definitional foundations and multiparty transformations [PDF]
, 2022 Classical cryptographic primitives do not allow for any fine-grained access control over encrypted data. From an encryption of some data x, a decryptor, who is in possession of a decryption key, can either obtain the whole data x or nothing. The notion
Waldner, Hendrik
core +1 more source