Efficient Data Sharing With Privacy Preservation Over Lattices for Secure Cloud Storage

被引:5
作者
Wang, Fenghe [1 ]
Wang, Junquan [1 ]
Shi, Shaoquan [2 ]
机构
[1] Shandong Jianzhu Univ, Sch Sci, Jinan 250101, Peoples R China
[2] Shandong Jianzhu Univ, Sch Comp Sci, Jinan 250101, Peoples R China
来源
IEEE SYSTEMS JOURNAL | 2022年 / 16卷 / 02期
基金
中国国家自然科学基金;
关键词
Receivers; Cloud computing; Lattices; Encryption; Data privacy; Security; Law; Cloud storage; data sharing; identity-based broadcast encryption (IBBE); lattice; privacy preservation; ATTRIBUTE-BASED ENCRYPTION; BROADCAST ENCRYPTION; POLICY;
D O I
10.1109/JSYST.2021.3077236
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Data sharing is a basic data processing mechanism in the cloud storage. Data confidentiality and the receiver privacy are two important requirements of data-sharing systems. Because the data owner does not wish anyone who is not authorized to access the shared data and the authenticated data receiver also does not wish anyone else to know that he/she has accessed the shared data from the data owner. Broadcast encryption gives a possible solution to these requirements of data-sharing systems. This article constructs a data-sharing system over lattice by designing an efficient identity-based broadcast encryption (IBBE) scheme which achieves the data confidentiality and the identity privacy simultaneously. Besides the data owner, no one knows the identities of the authenticated data receivers in the proposed data-sharing system. Data confidentiality is achieved by the indistinguishability under the selective identity and the chosen ciphertext attacks (IND-sID-CCA) of the proposed IBBE scheme. It is proven in the random oracle model that the IND-sID-CCA security is based on the hardness of the learning with errors problem which can resist the quantum attacks. Inherited from the proposed IBBE scheme, the proposed data-sharing system also has several other characters which are suitable to the practical application. The most important feature is that all the public parameters size, private key size, and the ciphertext length are constant for any data receivers set in the proposed system. Hence, the proposed system adapts to the situation of large receiver group. Moreover, the proposed data-sharing system supports efficient member joining. When a new user asks to access the uploaded data, the existing receiver does not need to update his/her private key. The decryption cost of the existing receiver will remain unchanged when the outsourced data have been updated. Detailed performance analysis and a simulated experiment of the designed core algorithm are given by using Java program on a personal computer Intel Core i7-8700 K (3.7 GHz), 32 G RAM which verifies the design results in this article.
引用
收藏
页码:2507 / 2517
页数:11
相关论文
共 44 条
[1]   Optimal Broadcast Encryption from Pairings and LWE [J].
Agrawal, Shweta ;
Yamada, Shota .
ADVANCES IN CRYPTOLOGY - EUROCRYPT 2020, PT I, 2020, 12105 :13-43
[2]   Generating Shorter Bases for Hard Random Lattices [J].
Alwen, Joel ;
Peikert, Chris .
THEORY OF COMPUTING SYSTEMS, 2011, 48 (03) :535-553
[3]  
Behnia Rouzbeh, 2018, IEEE T DEPEND SECURE, V17, P1269
[4]  
Bi, 2010, CRYPTOLOGY EPRINT AR, V288
[5]  
Brakerski Z., 2020, IACR CRYPTOL EPRINT, V191
[6]  
Cash D, 2010, LECT NOTES COMPUT SC, V6110, P523
[7]   Adaptively secure certificate-based broadcast encryption and its application to cloud storage service [J].
Chen, Liqing ;
Li, Jiguo ;
Lu, Yang ;
Zhang, Yichen .
INFORMATION SCIENCES, 2020, 538 :273-289
[8]  
Delerablée C, 2007, LECT NOTES COMPUT SC, V4833, P200
[9]  
Fazio N, 2012, LECT NOTES COMPUT SC, V7293, P225, DOI 10.1007/978-3-642-30057-8_14
[10]  
Fiat A., 1994, Advances in Cryptology-CRYPTO'93, P480, DOI DOI 10.1007/3-540-48329-2