Puncturable identity-based and attribute-based encryption from lattices

Abstract

The concept of puncturable encryption (PE) was introduced by Green and Miers at IEEE S&P, 2015. PE allows recipients to update their decryption keys to revoke decryption capability for selected messages without communicating with senders. From the first instantiation, PE shows its essence for many interesting applications, such as asynchronous messaging systems, group messaging systems, public-key watermarking schemes, secure cloud emails, and many more. To eliminate the necessity of having a costly certificate verification process, Wei et al. introduced puncturable identity-based encryption (PIBE) at ESORICS, 2019. Unfortunately, till today, there is no PIBE, which can withstand quantum attack. In this paper, we aim to fill this gap in the literature by presenting the first constructions of PIBE, for both selective and adaptive identity, which are secure in the standard model based on the hardness of learning with errors problem. Finally, we extend the design idea of selectively secure PIBE to provide the first construction of lattice-based puncturable key-policy attribute-based encryption (KP-PABE), which can facilitate fine-grained access mechanism with decryption revocation. Design ideas of proposed constructions can, also, be useful to construct other lattice-based expressive PE.