An Efficient Scheme of Common Secure Indices for Conjunctive Keyword-Based Retrieval on Encrypted Data

Wang, Peishun; Wang, Huaxiong; Pieprzyk, Josef

doi:10.1007/978-3-642-00306-6_11

Cited by 26 publications

(61 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Wang et al [16] proposed an efficient scheme for conjunctive keyword-based search. In their solution, a searchable index is generated for each document that represents the keywords in those documents.…”

Section: Related Workmentioning

confidence: 99%

“…Via suitable application of cryptographic hash functions, they obtain indexes and trapdoors that allow secure searching for keywords in the index file. However, the original scheme in [16] also does not cope with the problem of ranking the query responses in a relevancy order.…”

Section: Related Workmentioning

confidence: 99%

“…Our previous work [1], inspired from Wang et al [16], utilizes a keyed hash function (HMAC) to map keywords in a subscriber's data to a sequence of r -bit indexes using a secret key known only to the IPTV. A similar approach exists in [17] for multi-keyword search over encrypted data.…”

Section: Related Workmentioning

confidence: 99%

“…The solution is inspired by the construction in [16]. The main idea is to represent each database record as a binary string referred to as index entry.…”

Section: Index Generationmentioning

confidence: 99%

“…The main idea is to represent each database record as a binary string referred to as index entry. Different from the method used in [16], we add ranking capability to the search method. To accommodate η-ranked search, each record is expanded to η index entries.…”

Section: Index Generationmentioning

confidence: 99%

See 4 more Smart Citations

A practical privacy-preserving targeted advertising scheme for IPTV users

Khayati

Örencik

Savaş

et al. 2015

Int. J. Inf. Secur.

View full text Add to dashboard Cite

In this work, we present a privacy-preserving scheme for targeted advertising via the Internet Protocol TV (IPTV). The scheme uses a communication model involving a collection of subscribers, a content provider (IPTV), advertisers and a semi-trusted server. To target potential customers, the advertiser can utilize not only demographic information of subscribers, but also their watching habits. The latter includes watching history, preferences for IPTV content and watching rate, which are periodically (e.g., weekly) published on a semi-trusted server (e.g., cloud server) along with anonymized demographics. Since the published data may leak sensitive information about subscribers, it is safeguarded using cryptographic techniques in addition to the anonymization of demographics. The techniques used by the advertiser, which can be manifested in its queries to the server, are considered (trade) secrets and therefore are protected as well. The server is oblivious to the published data and the queries of the advertiser as well as its own responses to these queries. Only a legitimate advertiser, endorsed with so-called trapdoors by the IPTV, can query the cloud server and access the query results. Even when some background information about users is available, query responses do not leak sensitive information about the IPTV users. The performance of the proposed scheme is evaluated with experiments, which show that the scheme is practical. The algorithms demonstrate both weak and strong scaling property and take advantage of high level of parallelism. The scheme can also be applied as a recommendation system.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

“…The solution is inspired by the construction in [16]. The main idea is to represent each database record as a binary string referred to as index entry.…”

Section: Index Generationmentioning

confidence: 99%

Section: Index Generationmentioning

confidence: 99%

See 3 more Smart Citations

A practical privacy-preserving targeted advertising scheme for IPTV users

Khayati

Örencik

Savaş

et al. 2015

Int. J. Inf. Secur.

View full text Add to dashboard Cite

show abstract

Document clustering for efficient and secure information retrieval from cloud

Handa

Krishna

Aggarwal

2019

Concurrency and Computation

View full text Add to dashboard Cite

Summary Organizations prefer using cloud for storing their data due to availability of cost‐effective storage. The outsourced data include sensitive information, so data is encrypted as maintaining confidentiality and privacy of the documents is of paramount importance. Retrieving the desired information from the cloud requires efficient searching, which involves submission of search query to the cloud server by the end‐user. As the search terms may include sensitive information of an organization, it is desired that the search query should not reveal any confidential information. The existing works are not suitable for big‐data scenario due to high search time required for large document collections, thereby leading to increased cloud usage cost. Thus, an efficient approach to perform search on encrypted data using clustering is proposed in this paper. As the proposed technique clusters the documents based on the relationship between the keywords, the search method involves searching documents within the relevant cluster in contrast to searching the entire dataset. An efficient ranking method is incorporated to rank the documents according to the relevance to search query using Term Frequency‐Inverse Document Frequency (tf‐idf) value of the keywords in the documents, which leads to reduced communication overheads due to reduction in unnecessary documents being downloaded. Moreover, an efficient query randomization approach is proposed so that two or more queries involving the same search terms appear distinct. Experimental results using real datasets demonstrate that our proposed multi‐keyword ranked search scheme on encrypted cloud data significantly reduce the number of comparisons and search time in comparison to the existing techniques while maintaining recall of 100% and precision of 82%.

show abstract

Searchable encryption: A survey on privacy‐preserving search schemes on encrypted outsourced data

Handa

Krishna

Aggarwal

2019

Concurrency and Computation

View full text Add to dashboard Cite

Outsourcing confidential data to cloud storage leads to privacy challenges that can be reduced using encryption. However, with encryption in place, the utilization of the data is reduced, which leads to reduced quality of experience of the users. To overcome this, searchable encryption (SE) schemes are utilized, which allow the end users to retrieve the relevant documents from the cloud, for which various researchers have worked utilizing different techniques. Despite the popularity of the searchable encryption schemes, most of the surveys either do not provide or present an incomplete taxonomy of SE schemes. Hence, in this paper, we attempt to present a complete taxonomy/classification of the searchable encryption schemes in terms of the type of search, type of index, results retrieved, implementation type, multiplicity of users, and the technique used. From the literature, it is observed that inner product similarity is widely adopted by researchers to compute the similarity of the query and the document index as it provides both conjunctive and disjunctive searching (ie, have better search capability) but requires high search time (ie, have lower search efficiency). On the other hand, schemes based on binary comparisons exist, which require less search time (ie, have better search efficiency) but support only conjunctive searching (ie, have limited search capability). Thus, a major conclusion drawn from our work is that there is an imbalance between search capability and search efficiency, ie, in the existing schemes, search capability can be improved at the cost of search time only. Therefore, we suggest that one direction where researchers should work on is to provide a balance between search capability and search efficiency.

show abstract

An Efficient Scheme of Common Secure Indices for Conjunctive Keyword-Based Retrieval on Encrypted Data

Cited by 26 publications

References 16 publications

A practical privacy-preserving targeted advertising scheme for IPTV users

A practical privacy-preserving targeted advertising scheme for IPTV users

Document clustering for efficient and secure information retrieval from cloud

Searchable encryption: A survey on privacy‐preserving search schemes on encrypted outsourced data

Contact Info

Product

Resources

About