Public Trace-and-Revoke Proxy Re-Encryption for Secure Data Sharing in Clouds
- 22 January 2024
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 19 (15566013) , 2919-2934
Abstract
Proxy re-encryption (PRE), as a promising cryptographic primitive for secure data sharing in clouds, has been widely studied for decades. PRE allows the proxies to use the re-encryption keys to convert ciphertexts computed under the delegator’s public key into ones that can be decrypted using the delegatees’ secret keys, without knowing anything about the underlying plaintext. This delegable property of decryption rights enables flexible cloud data sharing, but it raises an important issue: if some proxies reveal their re-encryption keys, or collude with some delegatees to create a pirate decoder, then anyone who gains access to the pirate decoder can decrypt all ciphertexts computed under the delegator’s public key without the delegator’s permission. This paper opens up a potentially new avenue of research to address the above (re-encryption) key abuse problem by proposing the first public trace-and-revoke PRE system, where the malicious delegatees and proxies involved in the generation of a pirate decoder can be identified by anyone who gains access to the pirate decoder, and their decryption capabilities can subsequently be revoked by the content distributor. Our construction is multi-hop, supports user revocation and public (black-box) traceability, and achieves significant efficiency advantages over previous constructions. Technically, our construction is a generic transformation from inner-product functional PRE (IPFPRE) that we introduce to trace-and-revoke PRE. In addition, we instantiate our generic construction of trace-and-revoke PRE from the Learning with Errors (LWE) assumption, which was widely believed to be quantum-resistant. This is achieved by proposing the first LWE-based IPFPRE scheme, which may be of independent interest. Finally, we conduct a comprehensive performance evaluation of our LWE-based trace-and-revoke PRE scheme, and the experimental results show that the proposed LWE-based trace-and-revoke PRE scheme is practical and outperforms current state-of-the-art traceable PRE schemes.Keywords
Funding Information
- National Natural Science Foundation of China (62302445, 62302173)
- Guangxi Natural Science Foundation (2022GXNSFBA035650)
- Australian Research Council (ARC) Laureate Fellowship (FL230100033)
- Young Teacher Cultivation Fund of South China Normal University (22KJ07)
This publication has 36 references indexed in Scilit:
- A universal qudit quantum processor with trapped ionsNature Physics, 2022
- Multi-Client Functional Encryption for Linear Functions in the Standard Model from LWE2019
- Tightly Secure Inner Product Functional Encryption: Multi-input and Function-Hiding Constructions2019
- Generic Traceable Proxy Re-encryption and Accountable Extension in Consensus Network2019
- Proxy Re-Encryption and Re-Signatures from Lattices2019
- Function-Hiding Inner Product Encryption Is Practical2018
- Full-Hiding (Unbounded) Multi-input Inner Product Functional Encryption from the k-Linear Assumption2018
- Multi-input Inner-Product Functional Encryption from Pairings2017
- Fully Secure Functional Encryption for Inner Products, from Standard Assumptions2016
- Simple Functional Encryption Schemes for Inner Products2015