Self-updatable encryption: Time constrained access control with hidden attributes and better efficiency

• Published in: Theoretical computer science Vol. 667; pp. 51 - 92
• Main Authors: Lee, Kwangsu, Choi, Seung Geol, Lee, Dong Hoon, Park, Jong Hwan, Yung, Moti
• Format: Journal Article
• Language: English
• Published: Elsevier B.V 08.03.2017
• Subjects: Attribute-based encryption; Cloud storage; Key evolving systems; Predicate encryption; Public-key encryption; Revocation; Self-updatable encryption; Public-key encryption; Cloud storage; Attribute-based encryption; Predicate encryption; Self-updatable encryption; Revocation; Key evolving systems
• ISSN: 0304-3975; 1879-2294
• DOI: 10.1016/j.tcs.2016.12.027

Revocation and key evolving paradigms are central issues in cryptography, and in PKI in particular. A novel concern related to these areas was raised in the recent work of Sahai, Seyalioglu, and Waters (CRYPTO 2012) who noticed that revoking past keys should at times (e.g., the scenario of cloud storage) be accompanied by revocation of past ciphertexts (to prevent unread ciphertexts from being read by revoked users). They introduced revocable-storage attribute-based encryption (RS-ABE) as a good access control mechanism for cloud storage. RS-ABE protects against the revoked users not only the future data by supporting key-revocation but also the past data by supporting ciphertext-update, through which a ciphertext at time T can be updated to a new ciphertext at time T+1using only the public key. Motivated by this pioneering work, we ask whether it is possible to have a modular approach, which includes a primitive for time managed ciphertext update as a primitive. We call encryption which supports this primitive a “self-updatable encryption” (SUE). We then suggest a modular cryptosystems design methodology based on three sub-components: a primary encryption scheme, a key-revocation mechanism, and a time-evolution mechanism which controls the ciphertext self-updating via an SUE method, coordinated with the revocation (when needed). Our goal in this is to allow the self-updating ciphertext component to take part in the design of new and improved cryptosystems and protocols in a flexible fashion. Specifically, we achieve the following results: We first introduce a new cryptographic primitive called self-updatable encryption (SUE), realizing a time-evolution mechanism. In SUE, a ciphertext and a private key are associated with time. A user can decrypt a ciphertext if its time is earlier than that of his private key. Additionally, anyone (e.g., a cloud server) can update the ciphertext to a ciphertext with a newer time. We also construct an SUE scheme and prove its full security under static assumptions. Following our modular approach, we present a new RS-ABE scheme with shorter ciphertexts than that of Sahai et al. and prove its security. The length efficiency is mainly due to our SUE scheme and the underlying modularity. We apply our approach to predicate encryption (PE) supporting attribute-hiding property, and obtain a revocable-storage PE (RS-PE) scheme that is selectively-secure. We further demonstrate that SUE is of independent interest, by showing it can be used for timed-release encryption (and its applications), and for augmenting key-insulated encryption with forward-secure storage. •A new cryptographic primitive called self-updatable encryption is introduced to realize a time-evolution mechanism.•A revocable-storage attribute-based encryption scheme with shorter ciphertexts was proposed by following our modular approach.•A revocable-storage predicate encryption scheme that additionally supports attribute-hiding property is presented.