A Secure Channel Free Public Key Encryption with Keyword Search Scheme without Random Oracle

Fang, Liming; Susilo, Willy; Ge, Chunpeng; Wang, Jiandong

doi:10.1007/978-3-642-10433-6_16

Cited by 60 publications

(50 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Keyword Guessing Attack We consider two existing schemes namely Baek et al [2] and Fang et al [10] as follows.…”

Section: Security Vulnerability In Existing Concrete Schemesmentioning

confidence: 99%

“…• (Fang et al [10].) An attacker A, who is neither the server nor the receiver, can perform an off-line keyword attack as follows: …”

Section: Security Vulnerability In Existing Concrete Schemesmentioning

confidence: 99%

“…To highlight our contribution, we provide the following summary as follows. We selected three schemes from [2,10,29] to represent the state-of-the-art of SCF-PEKS constructions.…”

Section: Our Contributionsmentioning

confidence: 99%

“…r , which are the same as the ciphertext from [10]. However, we note that this scheme is not secure against keyword guessing attack since the adversary can know the keyword from the trapdoor.…”

Section: Our Schemementioning

confidence: 99%

“…In 2007, Gu et al [14] proposed a more efficient SCF-PEKS scheme in the random oracle model. Recently Fang et al [10] proposed an SCF-PEKS scheme without random oracle. In SCF-PEKS, only the server (a designated tester) chosen by the receiver is able to perform a test to check the relationship between a ciphertext and a trapdoor.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Public key encryption with keyword search secure against keyword guessing attacks without random oracle

Fang

Susilo

et al. 2013

Information Sciences

Self Cite

195

View full text Add to dashboard Cite

. Public key encryption with keyword search secure against keyword guessing attacks without random oracle. Information Sciences, 238 221-241.Public key encryption with keyword search secure against keyword guessing attacks without random oracle AbstractThe notion of public key encryption with keyword search (PEKS) was put forth by Boneh et al. to enable a server to search from a collection of encrypted emails given a "trapdoor" (i.e., an encrypted keyword) provided by the receiver. The nice property in this scheme allows the server to search for a keyword, given the trapdoor. Hence, the verifier can merely use an untrusted server, which makes this notion very practical. Following Boneh et al. 's work, there have been subsequent works that have been proposed to enhance this notion. Two important notions include the so-called keyword guessing attack and secure channel free, proposed by Byun et al. and Baek et al., respectively. The former realizes the fact that in practice, the space of the keywords used is very limited, while the latter considers the removal of secure channel between the receiver and the server to make PEKS practical. Unfortunately, the existing construction of PEKS secure against keyword guessing attack is only secure under the random oracle model, which does not reflect its security in the real world. Furthermore, there is no complete definition that captures secure channel free PEKS schemes that are secure against chosen keyword attack, chosen ciphertext attack, and against keyword guessing attacks, even though these notions seem to be the most practical application of PEKS primitives. In this paper, we make the following contributions. First, we define the strongest model of PEKS which is secure channel free and secure against chosen keyword attack, chosen ciphertext attack, and keyword guessing attack. In particular, we present two important security notions namely IND-SCF-CKCA and IND-KGA. The former is to capture an inside adversary, while the latter is to capture an outside adversary. Intuitively, it should be clear that IND-SCF-CKCA captures a more stringent attack compared to IND-KGA. Second, we present a secure channel free PEKS scheme secure without random oracle under the well known assumptions, namely DLP, DBDH, SXDH and truncated q-ABDHE assumption. Our contributions fill the gap in the literature and hence, making the notion of PEKS Keywords without, against, random, oracle, secure, encryption, key, public, guessing, search, keyword, attacks AbstractThe notion of public key encryption with keyword search (PEKS) was put forth by Boneh et al. to enable a server to search from a collection of encrypted emails given a "trapdoor" (i.e., an encrypted keyword) provided by the receiver. The nice property in this scheme allows the server to search for a keyword, given the trapdoor. Hence, the verifier can merely use an untrusted server, which makes this notion very practical. Following Boneh et al.'s work, there have been subsequent works that have been proposed to enhance this notion. T...

show abstract

“…Keyword Guessing Attack We consider two existing schemes namely Baek et al [2] and Fang et al [10] as follows.…”

Section: Security Vulnerability In Existing Concrete Schemesmentioning

confidence: 99%

“…• (Fang et al [10].) An attacker A, who is neither the server nor the receiver, can perform an off-line keyword attack as follows: …”

Section: Security Vulnerability In Existing Concrete Schemesmentioning

confidence: 99%

“…To highlight our contribution, we provide the following summary as follows. We selected three schemes from [2,10,29] to represent the state-of-the-art of SCF-PEKS constructions.…”

Section: Our Contributionsmentioning

confidence: 99%

Section: Our Schemementioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Public key encryption with keyword search secure against keyword guessing attacks without random oracle

Fang

Susilo

et al. 2013

Information Sciences

Self Cite

195

View full text Add to dashboard Cite

show abstract

Enabling efficient and secure data sharing in cloud computing

Liu

et al. 2013

Concurrency and Computation

View full text Add to dashboard Cite

SUMMARYWith the rapid development of cloud computing, more and more data are being centralized into remote cloud server for sharing, which raises a challenge on how to keep them both private and accessible. Although searchable encryption provides an efficient solution to support keyword‐based search directly on encrypted data, considering its application in file sharing, existing work depends on key sharing among authorized users, which inevitably causes the risks of key exposure and abuse. In this paper, aiming at enabling efficient and secure data sharing in cloud computing, we provide a generic construction for this purpose. The proposed construction is full‐featured: (i) It enables authorized users to perform keyword‐based search directly on encrypted data without sharing the unique secret key; and (ii) it provides two‐layered access control to limit unauthorized user's access to the shared data. On the basis of the proposed generic construction, we utilize the existing techniques on identity‐based broadcast encryption and public key searchable encryption to instantiate a concrete construction. Copyright © 2013 John Wiley & Sons, Ltd.

show abstract

Privacy‐preserving data search and sharing protocol for social networks through wireless applications

Wang

Chen

2016

Concurrency and Computation

View full text Add to dashboard Cite

SUMMARYData search and sharing are two important functionalities in social networks. The social network users can form a peer-to-peer group and securely and flexibly search and share cloud data through wireless applications. When the number of users increases, the communication, storage, and computational overheads will be increased, and the quality of services such as searching and data sharing for clients could be affected. In order to solve these problems, we formalize an ID-based multi-user searchable encryption (IDB-MUSE) and formally define its security model, where the security notions accommodate indistinguishability against insider's keyword guessing attack, indistinguishability against chosen keyword attack, and indistinguishability against insider's identity guessing attack. We present an IDB-MUSE scheme, where the index and search trapdoor are of constant size. We formally prove its security properties. To improve the search efficiency, we divide the computation of the trapdoor into two phases, that is, the offline phase and the online phase. The computation cost for the online phase trapdoor remains constant with respect to the number of users. Based on the IDB-MUSE scheme, a privacy-preserving data search and sharing protocol is proposed, where only the authorized user can access the shared group data. It captures the properties of source authenticity, data and search pattern privacy-preserving, anonymity, and request unlinkability. The experimental results show that the protocol is practical for wireless applications. Copyright © 2016 John Wiley & Sons, Ltd.Received 11 December 2015; Revised 9 March 2016; Accepted 11 April 2016 KEY WORDS: social network; peer-to-peer group; searchable encryption; data sharing; insider attack; anonymity INTRODUCTIONData search and sharing are widely used in social networks. As there is no group manager, the users in social networks form a peer-to-peer group. With the popularity of wireless communication, users usually search and share their data through wireless devices, which offer great convenience and flexibility. However, the wireless devices usually have a limited storage. Therefore, the social networks users often outsource their data to cloud, for example, the dropbox [1], amazon cloud [2], google cloud [3], and others, because of their great advantages of the powerful computation capability, the abundant storage resource and the on demand high-quality services.As a common scenario shown in Figure 1, a group of social network users access and share the cloud data through their mobile phones, laptops, and smart watches. They can outsource their shared data on the cloud storage, while any authorized user in the social network can access the data through their mobile devices. The privacy protection and system performance are regarded as two major concerns when social network users retrieve and share the cloud data via these resource constrained mobile devices.As the data is outsourced to the cloud and the cloud server may be untrusted, it need to protect the dat...

show abstract

A Secure Channel Free Public Key Encryption with Keyword Search Scheme without Random Oracle

Cited by 60 publications

References 17 publications

Public key encryption with keyword search secure against keyword guessing attacks without random oracle

Public key encryption with keyword search secure against keyword guessing attacks without random oracle

Enabling efficient and secure data sharing in cloud computing

Privacy‐preserving data search and sharing protocol for social networks through wireless applications

Contact Info

Product

Resources

About