Keyword Field-Free Conjunctive Keyword Searches on Encrypted Data and Extension for Dynamic Groups

Wang, Peishun; Wang, Huaxiong; Pieprzyk, Josef

doi:10.1007/978-3-540-89641-8_13

Cited by 63 publications

(39 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Boneh and Waters have given a generalized scheme [29] for conjunction as well as for subset queries. Later on, a scheme with a refined form of a token (that is independent of specifying the keyword field position) is devised by Wang et al [13]. Subsequently, B. Zhang and F. Zhang [21] have improved the security flaws of [13] and defined a conjunctive-subset keyword search.…”

Section: Related Workmentioning

confidence: 99%

“…Later on, a scheme with a refined form of a token (that is independent of specifying the keyword field position) is devised by Wang et al [13]. Subsequently, B. Zhang and F. Zhang [21] have improved the security flaws of [13] and defined a conjunctive-subset keyword search. Other efficient constructions with the support of conjunctive keyword search operation are given in [22,23,30].…”

Section: Related Workmentioning

confidence: 99%

“…In public key settings, Hwang and Lee [9] have first introduced a storage efficient multiuser scheme. Subsequently, several other schemes [10,11,13,14,16] have proposed managing a group of users. However, a scheme in [11] supports the static groups of users, whereas the schemes discussed in [10,13,14] work for the dynamic groups of users.…”

Section: Related Workmentioning

confidence: 99%

“…There exist numerous Searchable Encryption schemes for a single user [4][5][6][7][8] as well as for multiple users [9][10][11][12][13]. Practically, any single-user Searchable Encryption scheme can be adapted to define a multiuser Searchable Encryption scheme at the cost of a ciphertext size linear to the number of users in the system.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Multiuser Searchable Encryption with Token Freshness Verification

Sharma¹,

Jinwala²

2017

Security and Communication Networks

View full text Add to dashboard Cite

A Multiuser Searchable Encryption (MUSE) can be defined with the notion of Functional Encryption (FE) where a user constructs a search token from a search key issued by an Enterprise Trusted Authority (ETA). In such scheme, a user possessing search key constructs search token at any time and consequently requests the server to search over encrypted data. Thus, an FE based MUSE scheme is not suitable for the applications where a log of search activities is maintained at the enterprise site to identify dishonest search query from any user. In addition, none of the existing searchable schemes provides security against token replay attack to avoid reuse of the same token. In this paper, therefore we propose an FE based scheme, Multiuser Searchable Encryption with Token Freshness Verification (MUSE-TFV). In MUSE-TFV, a user prepares one-time usable search token in cooperation with ETA and thus every search activity is logged at the enterprise site. Additionally, by verifying the freshness of a token, the server prevents reuse of the token. With formal security analysis, we prove the security of MUSE-TFV against chosen keyword attack and token replay attack. With theoretical and empirical analysis, we justify the effectiveness of MUSE-TFV in practical applications.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Multiuser Searchable Encryption with Token Freshness Verification

Sharma¹,

Jinwala²

2017

Security and Communication Networks

View full text Add to dashboard Cite

show abstract

“…These schemes cannot support dynamic groups, while Park et al [3] firstly proposed search schemes of dynamic groups, and their search schemes deal with membership changes without reencrypting documents for each change of membership. Later, Wang et al [15] built conjunctive keyword searches on encrypted data without keyword fields, and they applied these searches to the setting of dynamic groups.…”

Section: Related Workmentioning

confidence: 99%

PKIS: practical keyword index search on cloud datacenter

Park

Lee

2011

J Wireless Com Network

View full text Add to dashboard Cite

This paper highlights the importance of the interoperability of the encrypted DB in terms of the characteristics of DB and efficient schemes. Although most prior researches have developed efficient algorithms under the provable security, they do not focus on the interoperability of the encrypted DB. In order to address this lack of practical aspects, we conduct two practical approaches-efficiency and group search in cloud datacenter. The process of this paper is as follows: first, we create two schemes of efficiency and group search-practical keyword index search-I and II; second, we define and analyze group search secrecy and keyword index search privacy in our schemes; third, we experiment on efficient performances over our proposed encrypted DB. As the result, we summarize two major results: (1)our proposed schemes can support a secure group search without re-encrypting all documents under the group-key update and (2)our experiments represent that our scheme is approximately 935 times faster than Golle's scheme and about 16 times faster than Song's scheme for 10,000 documents. Based on our experiments and results, this paper has the following contributions: (1) in the current cloud computing environments, our schemes provide practical, realistic, and secure solutions over the encrypted DB and (2) this paper identifies the importance of interoperability with database management system for designing efficient schemes.

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

Keyword Field-Free Conjunctive Keyword Searches on Encrypted Data and Extension for Dynamic Groups

Cited by 63 publications

References 13 publications

Multiuser Searchable Encryption with Token Freshness Verification

Multiuser Searchable Encryption with Token Freshness Verification

PKIS: practical keyword index search on cloud datacenter

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

Contact Info

Product

Resources

About