Secure and Efficient Privacy-Preserving Identity-Based Batch Public Auditing with Proxy Processing

被引:1
作者
Zhao, Jining [1 ]
Xu, Chunxiang [1 ]
Chen, Kefei [2 ]
机构
[1] Univ Elect Sci & Technol China, Sch Comp Sci & Engn, Ctr Cyber Secur, Chengdu 610051, Sichuan, Peoples R China
[2] Hangzhou Normal Univ, Hangzhou Key Lab Cryptog & Network Secur, Hangzhou 311121, Zhejiang, Peoples R China
来源
KSII TRANSACTIONS ON INTERNET AND INFORMATION SYSTEMS | 2019年 / 13卷 / 02期
基金
中国国家自然科学基金; 国家重点研发计划;
关键词
Cloud computing; identity-based cryptography; public auditing; proxy; security analysis; PROVABLE DATA POSSESSION; DATA-STORAGE; VERIFICATION;
D O I
10.3837/tiis.2019.02.030
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
With delegating proxy to process data before outsourcing, data owners in restricted access could enjoy flexible and powerful cloud storage service for productivity, but still confront with data integrity breach. Identity-based data auditing as a critical technology, could address this security concern efficiently and eliminate complicated owners' public key certificates management issue. Recently, Yu et al. proposed an Identity-Based Public Auditing for Dynamic Outsourced Data with Proxy Processing (https://doi.org/10.3837/tiis.2017.10.019) It aims to offer identity-based, privacy-preserving and batch auditing for multiple owners' data on different clouds, while allowing proxy processing. In this article, we first demonstrate this scheme is insecure in the sense that malicious cloud could pass integrity auditing without original data. Additionally, clouds and owners are able to recover proxy's private key and thus impersonate it to forge tags for any data. Secondly, we propose an improved scheme with provable security in the random oracle model, to achieve desirable secure identity based privacy-preserving batch public auditing with proxy processing. Thirdly, based on theoretical analysis and performance simulation, our scheme shows better efficiency over existing identity-based auditing scheme with proxy processing on single owner and single cloud effort, which will benefit secure big data storage if extrapolating in real application.
引用
收藏
页码:1043 / 1063
页数:21
相关论文
共 31 条
[1]  
[Anonymous], 2000, LNCS
[2]  
Ateniese G, 2007, CCS'07: PROCEEDINGS OF THE 14TH ACM CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, P598
[3]   Provable Multicopy Dynamic Data Possession in Cloud Computing Systems [J].
Barsoum, Ayad F. ;
Hasan, M. Anwar .
IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, 2015, 10 (03) :485-497
[4]   Identity-based encryption from the Weil pairing [J].
Boneh, D ;
Franklin, M .
SIAM JOURNAL ON COMPUTING, 2003, 32 (03) :586-615
[5]   MR-PDP: Multiple-Replica Provable Data Possession [J].
Curtmola, Reza ;
Khan, Osama ;
Burns, Randal ;
Ateniese, Giuseppe .
28TH INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS, VOLS 1 AND 2, PROCEEDINGS, 2008, :411-+
[6]   Dynamic Provable Data Possession [J].
Erway, C. Chris ;
Kupcu, Alptekin ;
Papamanthou, Charalampos ;
Tamassia, Roberto .
ACM TRANSACTIONS ON INFORMATION AND SYSTEM SECURITY, 2015, 17 (04)
[7]   Toward Efficient Multi-Keyword Fuzzy Search Over Encrypted Outsourced Data With Accuracy Improvement [J].
Fu, Zhangjie ;
Wu, Xinle ;
Guan, Chaowen ;
Sun, Xingming ;
Ren, Kui .
IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, 2016, 11 (12) :2706-2716
[8]  
Gartner. com, 2017, GARTN FOR WORLDW PUB
[9]  
IDC. com, 2017, WORLDW PUBL CLOUD SE
[10]   MuR-DPA: Top-Down Levelled Multi-Replica Merkle Hash Tree Based Secure Public Auditing for Dynamic Big Data Storage on Cloud [J].
Liu, Chang ;
Ranjan, Rajiv ;
Yang, Chi ;
Zhang, Xuyun ;
Wang, Lizhe ;
Chen, Jinjun .
IEEE TRANSACTIONS ON COMPUTERS, 2015, 64 (09) :2609-2622