arrow
Return

Efficient and Provably Secure Data Selective Sharing and Acquisition in Cloud-Based Systems

delete2023-01-01
delete9
PRE
AI
K
Kan Yang *
J
Jiangang Shu *
R
Ruitao Xie
DOI:10.1109/TIFS.2022.3216956delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Towards the large amount of data generated every-day, data selective sharing and acquisition is one of the most significant data services in cloud-based systems, which enables data owners to selectively share their data to some particular users, and users to selectively acquire some interested data. How -ever, it is challenging to protect data security and user privacy during data selective sharing and selective acquisition, because cloud servers are curious about the data or user's interests, and even send data to some unauthorized users or some uninterested users. In this paper, we propose an efficient and provably secure Data selective Sharing and Acquisition (DSA) scheme for cloud-based systems. Specifically, we first formulate a generic data selective sharing and acquisition problem in cloud-based systems by identifying several design goals in terms of correctness, soundness, security and efficiency. Then, we propose the DSA scheme to enable data owners to control the access of their data in a fine-grained manner, and enable users to refine the data acquisition without revealing their interests. Technically, a brand new cryptographic framework is developed to integrate attribute-based encryption with searchable encryption. Finally, we prove that the proposed DSA scheme is correct, sound, secure in the random oracle model, and efficient in practice.
Keywords:
Cloud-based system
selective sharing
selective acquisition
access control
searchable encryption

Journal

IEEE Transactions on Information Forensics and Security cover
IEEE Transactions on Information Forensics and Security
IF:
8
Papers:
5.2K
Citations:
2.3W

Organization

S
shenzhen university
Scholars:
4.5W
Papers: 3.4W
Citations: 72
U
University of Memphis
Scholars:
3.4K
Papers: 3.2K
Citations: 3.8K