Verifiable, Fair and Privacy-Preserving Broadcast Authorization for Flexible Data Sharing in Clouds
- 2 December 2022
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 18 (15566013) , 683-698
Abstract
The cloud-based data sharing technology with cryptographic primitives enables data owners to outsource data into paradigms and privately share information with arbitrary recipients without geographic barriers. However, we argue that most of existing efforts for outsourced data sharing are either inefficient, inflexible, or incompletely secure due to the following problems: (1) lack of efficient strategies for dynamically designating target ciphertexts to multiple recipients; (2) how to hide the identity of the recipient and (3) how to verify the correctness of outsourced ciphertext transformation without any denial. To the best of our knowledge, no previous work has thoroughly explored the above three issues, motivating us to design such an efficient and comprehensively secure outsourced data sharing mechanism. We design VF-PPBA, the first Verifiable, Fair and Privacy-preserving Broadcast Authorization framework for flexible data sharing in clouds. In more detail, we first invent a new primitive, privacy-preserving multi-recipient broadcast proxy re-encryption (PPMR-BPRE), which enables the authorization of a given ciphertext to different recipients with efficient ciphertext transformation, and further guarantees that any malicious adversary deduces nothing about the identity of the recipient. Then, we present VF-PPBA for flexible data sharing with PPMR-BPRE as the underlying structure, which in addition to inheriting all the functionalities of PPMR-BPRE, is capable of supporting the verifiability of the outcome correctness of the outsourced conversion task, and being immune to the malicious accusation if the outsourcing outcome is correctly completed. We formalize the adversarial models and render comprehensively strict security proofs to prove the security of our proposed solutions. Its performance is also validated via experimental simulations to showcase the practicability and effectiveness.Keywords
Funding Information
- Nanyang Technological University (NTU)-DESAY SV Research Program (2018-0980)
- NTU Start-Up Grant
This publication has 45 references indexed in Scilit:
- Conditional Identity-Based Broadcast Proxy Re-Encryption and Its Application to Cloud EmailIEEE Transactions on Computers, 2015
- Attribute-Based Encryption With Efficient Verifiable Outsourced DecryptionIEEE Transactions on Information Forensics and Security, 2015
- Adaptively Secure Identity-Based Broadcast Encryption With a Constant-Sized CiphertextIEEE Transactions on Information Forensics and Security, 2015
- Cloud ComputingACM Computing Surveys, 2014
- Charm: a framework for rapidly prototyping cryptosystemsJournal of Cryptographic Engineering, 2013
- Identity-Based Broadcast Encryption with Constant Size Ciphertexts and Private Keys2007
- Anonymous Hierarchical Identity-Based Encryption (Without Random Oracles)2006
- Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys2005
- Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and Extensions2005
- Identity-Based Encryption from the Weil Pairing2001