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

Efficient and Provably Secure Data Selective Sharing and Acquisition in Cloud-Based Systems
复制标题

DOI:
10.1109/tifs.2022.3216956
复制
发表时间:
2023
影响因子:
6.8
通讯作者:
Kan Yang;Jiangang Shu;Ruitao Xie
Kan Yang;Jiangang Shu;Ruitao Xie
中科院分区:
计算机科学1区
文献类型:
--
作者:
Kan Yang;Jiangang Shu;Ruitao Xie

文献摘要

相似文献

针对每天产生的大量数据,数据选择性共享和获取是基于云的系统中最重要的数据服务之一,它使数据所有者能够选择性地将其数据共享给某些特定用户,并且用户能够选择性地获取一些感兴趣的数据。然而,在数据选择性共享和选择性获取过程中,保护数据安全和用户隐私具有挑战性,因为云服务器对数据或用户的兴趣感到好奇,甚至将数据发送给一些未经授权的用户或一些不感兴趣的用户。在本文中,我们为基于云的系统提出了一种高效且可证明安全的数据选择性共享和获取(${\sf DSA}$)方案。具体来说,我们首先通过确定正确性、健全性、安全性和效率方面的几个设计目标,制定基于云的系统中的通用数据选择性共享和获取问题。然后,我们提出${\sf DSA}$方案,使数据所有者能够以细粒度的方式控制其数据的访问,并使用户能够在不泄露自己利益的情况下细化数据获取。从技术上讲,开发了一种全新的密码框架,将基于属性的加密与可搜索加密相结合。最后,我们证明所提出的${\sf DSA}$方案在随机预言模型中是正确的、合理的、安全的,并且在实践中是高效的。
Towards the large amount of data generated everyday, 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. However, 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 ( ${\sf 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 ${\sf 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 ${\sf DSA}$ scheme is correct, sound, secure in the random oracle model, and efficient in practice.