Substring Position Search over Encrypted Cloud Data Supporting Efficient Multi-User Setup

Strizhov, Mikhail; Osman, Zachary; Ray, Indrajit

doi:10.3390/fi8030028

Cited by 11 publications

(11 citation statements)

References 31 publications

(73 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, the authors did not measure the accuracy of the proposed scheme and the effect that the dummy keywords had on the precision. In [22], authors propose a multi-keyword SE encryption scheme and use homomorphic encryption for the index generation and the trapdoor generation. Although, due to the inefficiency of homomorphic encryption the scheme cannot be deployed onto a real world but they have implemented their scheme using multi-threading.…”

Section: Multi-abstractementioning

confidence: 99%

A parallelized disjunctive query based searchable encryption scheme for big data

Tahir

Steponkus

Ruj

et al. 2020

Future Generation Computer Systems

View full text Add to dashboard Cite

Searchable Encryption (SE) allows a client to search over large amounts of encrypted data outsourced to the Cloud. Although, this helps to maintain the confidentiality of the outsourced data but achieving privacy is a difficult and resource intensive task. With the increase in the query effectiveness, i.e., by shifting from single keyword SE to multikeyword SE there is a notable drop in the efficiency. This motivates to make use of the advances in the multi-core architectures and multiple threads where the search can be delegated across different threads to perform search in a parallel fashion. The proposed scheme is based on probabilistic trapdoors that are formed by making use of the property of modular inverses. The use of probabilistic trapdoors helps resist distinguishability attacks. The rigorous security analysis helps us to appreciate the advantage of having a probabilistic trapdoor. Furthermore, to validate the performance of the proposed scheme, it is implemented and deployed onto the British Telecommunication's Public Cloud offering and tested over a real speech corpus. The implementation is also extended to anticipate the performance gain by using the multi-core architecture that helps to maintain the lightweight property of the scheme.

show abstract

Section: Multi-abstractementioning

confidence: 99%

A parallelized disjunctive query based searchable encryption scheme for big data

Tahir

Steponkus

Ruj

et al. 2020

Future Generation Computer Systems

View full text Add to dashboard Cite

show abstract

“…Leontiadis and Li [22] proposed a single-user scheme that achieves optimal storage cost for the cloud. Strizhov et al [23] proposed a substring position search scheme and can support multi-user based on the distributed broadcast encryption scheme and a multiparty key exchange protocol. In order to achieve stronger security such as access pattern hidden, and at the same time solving the substring search problem, Yu et al [24] proposed a single-user scheme that prevents the access pattern leakage by fully homomorphic encryption and burrows wheeler transform.…”

Section: ) Searchable Encryption For Substring Searchmentioning

confidence: 99%

Privacy-Preserving Substring Search on Multi-Source Encrypted Gene Data

et al. 2020

View full text Add to dashboard Cite

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. INDEX TERMS Composite order bilinear map, data privacy, gene data, substring search.

show abstract

“…The relevance of substring search queries for a variety of realworld applications fostered several research efforts to privately compute such queries. Some of these solutions [10,26,46] achieve bandwidth and computational costs depending only on m and o q , and require only a few communication rounds between the data owner and the untrusted server. Nonetheless, these solutions leak…”

Section: Introductionmentioning

confidence: 99%