Secure cloud storage with anonymous deduplication using ID-based key management

被引:3
|
作者
Gharib, Mohammed [1 ]
Fazli, MohammadAmin [2 ]
机构
[1] Inst Res Fundamental Sci, Tehran, Iran
[2] Sharif Univ Technol, Tehran, Iran
来源
JOURNAL OF SUPERCOMPUTING | 2023年 / 79卷 / 02期
关键词
Cloud storage; Deduplication; Anonymity;
D O I
10.1007/s11227-022-04751-6
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Cloud storage systems have been turned into the primary services of Internet users nowadays. While the application of such systems is exponentially increasing, deduplication algorithms help face scalability issues. Although source-side deduplication optimizes both storage and bandwidth, the main concern that deduplication algorithms suffer from is still data confidentiality. Message-locked encryption (MLE) is a well-known key management framework for secure deduplication to provide confidentiality. This framework is the basis of almost all the proposed secure deduplication solutions. Even though there are lots of literature works trying to provide secure deduplication algorithms, to the best of our knowledge, none of them provide an effective anonymity service for data owners. In this paper, we propose an N-anonymity algorithm to provide an effective anonymity service, capable of prohibiting even the cloud storage provider from knowing which users are storing the same data. The algorithm is analytically studied, and the results are validated by exhaustive implementations using real data. Furthermore, we propose an ID-based key management algorithm as the cornerstone of the secure cloud storage system. The proposed algorithm, which could be considered as an asymmetric extension of MLE, is easy to implement and compatible with the existed cloud architectures as well as the proposed anonymity-based deduplication system.
引用
收藏
页码:2356 / 2382
页数:27
相关论文
共 50 条
  • [21] An efficient secure key issuing protocol in ID-based cryptosystems
    Gangishetti, R
    Gorantla, MC
    Das, ML
    Saxena, A
    Gulati, VP
    ITCC 2005: INTERNATIONAL CONFERENCE ON INFORMATION TECHNOLOGY: CODING AND COMPUTING, VOL 1, 2005, : 674 - 678
  • [22] An ID-Based Anonymous Signcryption Scheme for Multiple Receivers Secure in the Standard Model
    Zhang, Bo
    Xu, Qiuliang
    ADVANCES IN COMPUTER SCIENCE AND INFORMATION TECHNOLOGY, PROCEEDINGS, 2010, 6059 : 15 - 27
  • [23] Provably secure and efficient anonymous ID-based authentication protocol for mobile devices using bilinear pairings
    Tsai, Jia-Lun
    Lo, Nai-Wei
    WIRELESS PERSONAL COMMUNICATIONS, 2015, 83 (02) : 1273 - 1286
  • [24] Provably secure and efficient anonymous ID-based authentication protocol for mobile devices using bilinear pairings
    Jia-Lun Tsai
    Nai-Wei Lo
    Wireless Personal Communications, 2015, 83 : 1273 - 1286
  • [25] Secure proof of storage with deduplication for cloud storage systems
    Shin, Youngjoo
    Koo, Dongyoung
    Hur, Junbeom
    Yun, Joobeom
    MULTIMEDIA TOOLS AND APPLICATIONS, 2017, 76 (19) : 19363 - 19378
  • [26] Secure Encrypted Data Deduplication for Cloud Storage against Compromised Key Servers
    Zhang, Yuan
    Xu, Chunxiang
    Cheng, Nan
    Shen, Xuemin
    2019 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM), 2019,
  • [27] Secure proof of storage with deduplication for cloud storage systems
    Youngjoo Shin
    Dongyoung Koo
    Junbeom Hur
    Joobeom Yun
    Multimedia Tools and Applications, 2017, 76 : 19363 - 19378
  • [28] An ID-based conference key agreement protocol for secure network communications
    Chang, CC
    Lin, IC
    PROCEEDINGS OF THE SECOND INTERNATIONAL CONFERENCE ON INFORMATION AND MANAGEMENT SCIENCES, 2002, 2 : 252 - 256
  • [29] Two provable secure ID-based group Key agreement protocols
    Miao, Fang
    Liang, Jun
    Yoo, Hyeong Seon
    Wei, Wei
    Journal of Computational Information Systems, 2007, 3 (05): : 1887 - 1892
  • [30] Forward Secure ID-based Group Key Agreement Protocol with Anonymity
    Park, Hyewon
    Kim, Zeen
    Kim, Kwangjo
    2009 THIRD INTERNATIONAL CONFERENCE ON EMERGING SECURITY INFORMATION, SYSTEMS, AND TECHNOLOGIES, 2009, : 274 - 279