Skip to Main content Skip to Navigation

Public-key encryption, revisited : tight security and richer functionalities

Romain Gay 1, 2, 3 
Abstract : Our work revisits public-key encryption in two ways: 1) we provide stronger security guarantee that typical public-key encryption, which handles many users than can collude to perform sophisticated attacks. This is necessary when considering widely deployed encryption schemes, where many sessions are performed concurrently, as in the case on the Internet; 2) we consider so-called functional encryption, introduced by Boneh, Sahai, Waters in 2011, that permits fine-grained access to the encrypted data. It generalizes traditional public-key encryption is that a master secret key is used to generate so-called functional decryption keys, each of which is associated with a particular function. An encryption of a message m, together with a functional decryption key associated with the function f, decrypts the value f(m), without revealing any additional information about the encrypted message m.
Document type :
Complete list of metadata
Contributor : ABES STAR :  Contact
Submitted on : Friday, November 5, 2021 - 9:26:10 AM
Last modification on : Friday, June 24, 2022 - 3:34:05 AM


Version validated by the jury (STAR)


  • HAL Id : tel-03416070, version 2



Romain Gay. Public-key encryption, revisited : tight security and richer functionalities. Cryptography and Security [cs.CR]. Université Paris sciences et lettres, 2019. English. ⟨NNT : 2019PSLEE078⟩. ⟨tel-03416070v2⟩



Record views


Files downloads