22 November 2017 in IEEE Access
Cloud storage has been gaining tremendous popularity, which provides facilitative data storage and sharing services for distributed clients. To maximize the availability and reliability, some customers may store multiple replicas of critical data on cloud servers. However, cloud servers may collude to make it look like they are storing multiple copies of data, whereas in fact they only store a single copy. Currently, several multi-replica provable data possession schemes have been proposed to provide verifications to ensure that all the outsourced copies are actually stored and maintained intact. For these schemes with third-party verifications, correctly choosing public keys of data owners relies on Public Key Infrastructure (PKI), which is complicated and resource consuming. In this paper, we propose a novel identity-based public multi-replica provable data possession scheme, namely IDPMR-PDP, to provide third-party verification of outsourced data with multiple replicas without PKI. We also introduce a formal security model of identity-based public multi-replica PDP schemes and prove that IDPMR-PDP is secure against malicious cloud servers and privacy-preserving against curious verifiers under this model. Meanwhile, our analyses and simulation results demonstrate that IDPMR-PDP realizes efficient integrity verification.
13 April 2020 in IEEE Access
Every day social multimedia applications generate millions of images. To handle such huge amount of images, an optimal solution is using the public cloud, since it has powerful storage capability. Images usually contain a wealth of sensitive information, therefore social service providers need not only to provide services such as retrieval and sharing but also to protect the privacies of the images. In this paper, we propose a privacy-preserving scheme for content-based image retrieval and sharing in social multimedia applications. First, the users extract visual features from the images, and perform locality-sensitive hashing functions on visual features to generate image profile vectors. We then model the retrieval on the images as the equality search on the image profile vectors. To enable accurate and efficient retrieval, we design the secure index structure based on cuckoo hashing, which has constant lookup time. To meet the requirements of dynamic image updating, we enrich our service with image insertion and deletion. In order to reduce the key management overhead and the access control overhead in social applications, we process keys using secret sharing techniques to enable the users holding similar images to query and decrypt images independently. Finally we implement the prototype of the proposed scheme, and perform experiments over encrypted image databases.
1 December 2018 in Frontiers of Information Technology & Electronic Engineering
Private set intersection (PSI) allows two parties to compute the intersection of their private sets while revealing nothing except the intersection. With t
12 March 2020 in IEEE Access
Substring searching on gene sequence data is widely used for analyzing the association between a list of gene mutations and a specific disease. As substring search usually has a high computational cost, deploying it in the cloud has become a popular solution. Moreover, the cloud allows easier data sharing among medical organizations. Since the gene data contains private information, medical organizations usually outsource encrypted gene data to the cloud and selectively share with others. Most existing solutions for the privacy-preserving substring search problem are based on searchable encryption. However, they mainly focus on single-source gene data, not suitable for handling multi-source gene data because of some practical weaknesses. In this paper, we propose a cryptographic scheme that supports privacy-preserving substring search on multi-source encrypted gene data. The cloud can authorize queriers with access control and perform substring searches over the multi-source encrypted gene data for them. Despite the outsourced gene data is encrypted with different keys, but the authorized querier can issue a substring search only uses its own key. We adopt the composite order bilinear map as the primary underlying cryptographic primitive of our scheme. We mainly focus on protecting the privacy of the outsourced gene data and the substring queries, and we provide a security analysis under the honest-but-curious model. We also perform experiments on different datasets and analyze the experimental results in terms of computation cost and communication cost. The analyses show that our scheme is secure and efficient for substring search on multi-source encrypted gene data.
29 May 2019 in Concurrency and Computation: Practice and Experience
24 February 2016 in Concurrency and Computation: Practice and Experience