Secure and efficient data‐sharing in clouds. (14th October 2014)

• Record Type: Journal Article
• Authors: Zhang, Jiang; Zhang, Zhenfeng; Mustafee, Navonil; Bessis, Nik; Barolli, Leonard; Chen, Xiaofeng; Xhafa, Fatos
• Is Part Of: Concurrency and computation. Volume 27:Number 8(2015:Jun.)
• Page Start: 2125
• Page End: 2143
• Publication Date: 2014-10-14
• Subjects: Parallel processing (Electronic computers) -- Periodicals; Parallel computers -- Periodicals; 004.35
• DOI: 10.1002/cpe.3395
• Languages: English
• ISSNs: 1532-0626

Abstract

<abstract abstract-type="main" id="cpe3395-abs-0001"> <title>Summary</title> <p id="cpe3395-para-0001">With the rapid development of cloud computing, cloud storage has become a cost‐effective solution for many users with the demand of data storage. However, there are still two main concerns for users with sensitive/private data: (1) Is it secure to store private data in public cloud storages? (2) Is there an efficient way to share private data with other specified users? In the past years, several papers in the literature have used proxy re‐encryption (PRE) to address these two concerns, where the efficiency of the underlying PRE scheme is usually a bottleneck of the overall performance of cloud storages. In this paper, we dedicate to design a secure and practical PRE scheme for cloud‐based data‐sharing. First, we discuss a 'pitfall' in the security proof of several existing PREs. Then, we give a general framework for proving the chosen ciphertext attacks (CCA) security of single‐hop unidirectional PRE schemes. Finally, we propose a practical PRE scheme that is proven secure against CCA under the computational Diffie–Hellman problem in the random oracle model. We evaluate the performance of our PRE scheme both in theoretical comparisons with related schemes and in implementations at several security levels. The results indicate that our scheme can be practical in cloud‐based data‐sharing. Copyright © 2014 John Wiley &amp; Sons, Ltd.</p> </abstract>