2020/07/13 by Willy Susilo, Susilo, Willy, Dung Hoang Duong +5
Computer Science · #Complexity and Algorithms in Graphs #Cryptographic Implementations and Security #Cryptography and Data Security #Cryptography and Security (cs.CR) #FOS: Computer and information sciences
paper · pdf · doi:10.48550/arxiv.2007.06353
openalex publication_date 2020/07/13 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Puncturable encryption (PE), proposed by Green and Miers at IEEE S&P 2015, is\na kind of public key encryption that allows recipients to revoke individual\nmessages by repeatedly updating decryption keys without communicating with\nsenders. PE is an essential tool for constructing many interesting\napplications, such as asynchronous messaging systems, forward-secret zero\nround-trip time protocols, public-key watermarking schemes and forward-secret\nproxy re-encryptions. This paper revisits PEs from the observation that the\npuncturing property can be implemented as efficiently computable functions.\nFrom this view, we propose a generic PE construction from the fully\nkey-homomorphic encryption, augmented with a key delegation mechanism (DFKHE)\nfrom Boneh et al. at Eurocrypt 2014. We show that our PE construction enjoys\nthe selective security under chosen plaintext attacks (that can be converted\ninto the adaptive security with some efficiency loss) from that of DFKHE in the\nstandard model. Basing on the framework, we obtain the first post-quantum\nsecure PE instantiation that is based on the learning with errors problem,\nselective secure under chosen plaintext attacks (CPA) in the standard model. We\nalso discuss about the ability of modification our framework to support the\nunbounded number of ciphertext tags inspired from the work of Brakerski and\nVaikuntanathan at CRYPTO 2016.\n