Efficient Public Key Encryption with Disjunctive Keywords Search Using the New Keywords Conversion Method

Public key encryption with disjunctive keyword search (PEDK) is a public key encryption scheme that allows disjunctive keyword search over encrypted data without decryption. This kind of scheme is crucial to cloud storage and has received a lot of attention in recent years. However, the efficiency of the previous scheme is limited due to the selection of a less efficient converting method which is used to change query and index keywords into a vector space model. To address this issue, we design a novel converting approach with better performance, and give two adaptively secure PEDK schemes based on this method. The first one is built on an efficient inner product encryption scheme with less searching time, and the second one is constructed over composite order bilinear groups with higher efficiency on index and trapdoor construction. The theoretical analysis and experiment results verify that our schemes are more efficient in time and space complexity as well as more suitable for the mobile cloud setting compared with the state-of-art schemes.

Download Full-text

A CIPHERTEXT-POLICY ATTRIBUTE-BASED SEARCHABLE ENCRYPTION SCHEME IN NON-INTERACTIVE MODEL

Journal of Computer Science and Cybernetics ◽

10.15625/1813-9663/0/0/13667 ◽

2019 ◽

Vol 35 (3) ◽

pp. 233-249

Author(s):

Van Anh Trinh ◽

Viet Cuong Trinh

Keyword(s):

Keyword Search ◽

Public Key ◽

Communication Overhead ◽

Encryption Scheme ◽

Public Key Encryption ◽

Encrypted Data ◽

Attribute Based Encryption ◽

Encrypt Data ◽

Cryptographic Primitive ◽

Ciphertext Policy

We address the problem of searching on encrypted data with expressive searching predicate and multi-writer/multi-reader, a cryptographic primitive which has many concrete application scenarios such as cloud computing, email gateway application and so on. In this paper, we propose a public-key encryption with keyword search scheme relied on the ciphertext-policy attribute-based encryption scheme. In our system, we consider the model where a user can generate trapdoors by himself/herself, we thus can remove the Trusted Trapdoor Generator which can save the resource and communication overhead. We also investigate the problem of combination of a public key encryption used to encrypt data and a public-key encryption with keyword search used to encrypt keywords, which can save the storage of the whole system

Download Full-text

Conjunctive and Disjunctive Keyword Search over Encrypted Mobile Cloud Data in Public Key System

Mobile Information Systems ◽

10.1155/2018/3839254 ◽

2018 ◽

Vol 2018 ◽

pp. 1-11 ◽

Cited By ~ 6

Author(s):

Yu Zhang ◽

Yin Li ◽

Yifan Wang

Keyword(s):

Vector Space ◽

Keyword Search ◽

Vector Space Model ◽

Public Key ◽

Inner Product ◽

Mobile Cloud ◽

Encryption Scheme ◽

Public Key Encryption ◽

Cloud Data ◽

Space Model

The searchable encryption scheme can perform keywords search operation directly over encrypted data without decryption, which is crucial to cloud storage, and has attracted a lot of attention in these years. However, it is still an open problem to develop an efficient public key encryption scheme supporting conjunctive and a disjunctive keyword search simultaneously. To achieve this goal, we introduce a keyword conversion method that can transform the query and index keywords into a vector space model. Through applying a vector space model to a predicate encryption scheme supporting inner product, we propose a novel public key encryption scheme with conjunctive and disjunctive keyword search. The experiment result demonstrates that our scheme is more efficient in both time and space as well as more suitable for the mobile cloud compared with the state-of-art schemes.

Download Full-text

A CIPHERTEXT-POLICY ATTRIBUTE-BASED SEARCHABLE ENCRYPTION SCHEME IN NON-INTERACTIVE MODEL

Journal of Computer Science and Cybernetics ◽

10.15625/1813-9663/35/3/13667 ◽

2019 ◽

Vol 35 (3) ◽

pp. 233-249

Author(s):

Van Anh Trinh ◽

Viet Cuong Trinh

Keyword(s):

Keyword Search ◽

Public Key ◽

Communication Overhead ◽

Encryption Scheme ◽

Public Key Encryption ◽

Encrypted Data ◽

Attribute Based Encryption ◽

Encrypt Data ◽

Cryptographic Primitive ◽

Ciphertext Policy

Download Full-text

An ElGamal-like Secure Channel Free Public Key Encryption with Keyword Search Scheme

International Journal of Foundations of Computer Science ◽

10.1142/s0129054119500047 ◽

2019 ◽

Vol 30 (02) ◽

pp. 255-273 ◽

Cited By ~ 2

Author(s):

Min-Shiang Hwang ◽

Cheng-Chi Lee ◽

Shih-Ting Hsu

Keyword(s):

Keyword Search ◽

Bilinear Pairing ◽

Public Key ◽

Encryption Scheme ◽

Public Key Encryption ◽

Keyword Guessing Attack ◽

Elgamal Cryptosystem ◽

Guessing Attack ◽

Secure Channel

The idea of public key encryption with keyword search (PEKS), proposed by Boneh et al., enables one to send a trapdoor containing a encrypted keyword to query data without revealing the keyword. In Boneh et al.’s design, the trapdoor has to be transferred through a secure channel, which is both costly and inefficient. Baek et al. then proposed an efficient secure channel free public key encryption scheme with keyword search (SCF-PEKS). After that, vast amounts of research have focused on the protection against the off-line keyword guessing attack (OKGA) by enhancing the model. However, most of the PEKS/SCF-PEKS schemes developed so far are constructed by applying bilinear pairing and are susceptible to off-line keyword guessing attacks. In this paper, we propose a new SCF-PEKS scheme based on the ElGamal cryptosystem. The proposed scheme is not only secure against off-line keyword guessing attacks but also improves the efficiency.

Download Full-text

Public Key Encryption with Keyword Search from Lattices in Multiuser Environments

Mathematical Problems in Engineering ◽

10.1155/2016/6549570 ◽

2016 ◽

Vol 2016 ◽

pp. 1-7 ◽

Cited By ~ 1

Author(s):

Daini Wu ◽

Xiaoming Wang ◽

Qingqing Gan

Keyword(s):

Data Privacy ◽

Keyword Search ◽

Random Oracle Model ◽

Random Oracle ◽

Public Key ◽

Public Key Encryption ◽

Encrypted Data ◽

Cloud Server ◽

Learning With Errors ◽

Multiuser Environments

A public key encryption scheme with keyword search capabilities is proposed using lattices for applications in multiuser environments. The proposed scheme enables a cloud server to check if any given encrypted data contains certain keywords specified by multiple users, but the server would not have knowledge of the keywords specified by the users or the contents of the encrypted data, which provides data privacy as well as privacy for user queries in multiuser environments. It can be proven secure under the standard learning with errors assumption in the random oracle model.

Download Full-text

Key Aggregate Cryptosystem in Data Sharing in Cloud Performance

International Journal of Innovative Technology and Exploring Engineering - Special Issue ◽

10.35940/ijitee.k2571.0981119 ◽

2019 ◽

Vol 8 (11) ◽

pp. 3434-3437

Keyword(s):

Data Sharing ◽

Cloud Storage ◽

Public Key ◽

Encryption Scheme ◽

Public Key Encryption ◽

Cloud Platform ◽

Fixed Size ◽

The People ◽

Share Data

Sharing data using cloud storage has become a prominent part of a lives therefore, it is necessary to be able to share data to the people we choose and which data we choose. In this article, Key Aggregate Cryptosystem scheme, a public key encryption scheme which produces fixed-size cipher texts [1], is studied comprehensively along with its application in sharing data by users across cloud platform. KAC provides efficient and flexible delegation of keys for sharing selective data using single aggregated key without compromising on other data stored in cloud. The scheme is implemented using python file integrated in the backend of a website, which is in Django and the cloud storage used is Amazon S3. The data is stored in buckets and can be accessed using the website. Users can also upload and download their data from the website, or even share after uploading on the cloud.

Download Full-text

Privacy-Preserving and Efficient Public Key Encryption with Keyword Search Based on CP-ABE in Cloud

Cryptography ◽

10.3390/cryptography4040028 ◽

2020 ◽

Vol 4 (4) ◽

pp. 28

Author(s):

Yunhong Zhou ◽

Shihui Zheng ◽

Licheng Wang

Keyword(s):

Access Control ◽

Data Privacy ◽

Keyword Search ◽

Good Method ◽

Privacy Preserving ◽

Public Key ◽

Public Key Encryption ◽

Encrypted Data ◽

Fine Grained ◽

Attribute Based Encryption

In the area of searchable encryption, public key encryption with keyword search (PEKS) has been a critically important and promising technique which provides secure search over encrypted data in cloud computing. PEKS can protect user data privacy without affecting the usage of the data stored in the untrusted cloud server environment. However, most of the existing PEKS schemes concentrate on data users’ rich search functionalities, regardless of their search permission. Attribute-based encryption technology is a good method to solve the security issues, which provides fine-grained access control to the encrypted data. In this paper, we propose a privacy-preserving and efficient public key encryption with keyword search scheme by using the ciphertext-policy attribute-based encryption (CP-ABE) technique to support both fine-grained access control and keyword search over encrypted data simultaneously. We formalize the security definition, and prove that our scheme achieves selective indistinguishability security against an adaptive chosen keyword attack. Finally, we present the performance analysis in terms of theoretical analysis and experimental analysis, and demonstrate the efficiency of our scheme.

Download Full-text

SPEKS: Forward Private SGX-Based Public Key Encryption with Keyword Search

Applied Sciences ◽

10.3390/app10217842 ◽

2020 ◽

Vol 10 (21) ◽

pp. 7842

Author(s):

Hyundo Yoon ◽

Soojung Moon ◽

Youngki Kim ◽

Changhee Hahn ◽

Wonjun Lee ◽

...

Keyword(s):

Keyword Search ◽

Information Leakage ◽

Computation Time ◽

Public Key ◽

Public Key Encryption ◽

Encrypted Data ◽

Performance Improvements ◽

Security Proof ◽

Processing Cost ◽

Definition Of

Public key encryption with keyword search (PEKS) enables users to search over encrypted data outsourced to an untrusted server. Unfortunately, updates to the outsourced data may incur information leakage by exploiting the previously submitted queries. Prior works addressed this issue by means of forward privacy, but most of them suffer from significant performance degradation. In this paper, we present a novel forward private PEKS scheme leveraging Software Guard Extension (SGX), a trusted execution environment provided by Intel. The proposed scheme presents substantial performance improvements over prior work. Specifically, we reduce the query processing cost from O(n) to O(1), where n is the number of encrypted data. According to our performance analysis, the overall computation time is reduced by 80% on average. Lastly, we provide a formal security definition of SGX-based forward private PEKS, as well as a rigorous security proof of the proposed scheme.

Download Full-text

Pairing-Free Identity-Based Encryption with Authorized Equality Test in Online Social Networks

International Journal of Foundations of Computer Science ◽

10.1142/s0129054119400185 ◽

2019 ◽

Vol 30 (04) ◽

pp. 647-664

Author(s):

Libing Wu ◽

Yubo Zhang ◽

Kim-Kwang Raymond Choo ◽

Debiao He

Keyword(s):

Social Networking ◽

Online Social Networks ◽

Keyword Search ◽

Public Key ◽

Encryption Scheme ◽

Public Key Encryption ◽

Identity Based Encryption ◽

Identity Based ◽

Equality Test ◽

Chosen Ciphertext Attack

Online social networking applications have become more and more popular in the advance of the technological age. Much of our personal information has been disclosed in social networking activities and privacy-preserving still remains a research challenge in social network. Public key encryption scheme with equality test(PKEET), which is an extension of public key encryption with keyword search (PEKS), seems to be a solution. PKEET enables the tester to check whether two given ciphertexts are derived from the same plaintext. Recently, Zhu et al. proposed a pairing-free public key encryption scheme with equality test based on the traditional public key cryptosystem. However, it suffers from certificates management issue. In this paper, we propose a pairing-free identity-based encryption scheme with authorized equality test(PF-IBEAET). The PF-IBEAET scheme also provides fine-grained authorizations. We prove that the scheme is one way secure against chosen identity and chosen ciphertext attack (OW-ID-CCA) and indistinguishable against chosen-identity and chosen-ciphertext attack (IND-ID-CCA) in the random oracle model (ROM). Performance analysis shows that the scheme achieves a better performance than similar schemes.

Download Full-text

Distributed Searchable Asymmetric Encryption

Indonesian Journal of Electrical Engineering and Computer Science ◽

10.11591/ijeecs.v4.i3.pp684-694 ◽

2016 ◽

Vol 4 (3) ◽

pp. 684

Author(s):

Shoulin Yin ◽

Lin Teng ◽

Jie Liu

Keyword(s):

Keyword Search ◽

The Other ◽

Public Key ◽

Search Pattern ◽

Public Key Encryption ◽

Information Protection ◽

Encrypted Data ◽

Private Key ◽

Asymmetric Encryption ◽

Encryption Decryption

Searchable asymmetric encryption (SAE) can also be called Public Key Encryption with Keyword Search (PEKS), which allows us to search the keyword on the data of having been encrypted. The essence of Asymmetric searchable encryption is that users exchange the data of encryption, one party sends a ciphertext with key encryption, the other party with another key receives the ciphertext. Encryption key is not the same as the decryption key, and cannot deduce another key from any one of the key, thus it greatly enhances the information protection, and can prevent leakage the user's search criteria—Search Pattern. Secure schemes of SAE are practical, sometimes, however the speed of encryption/decryption in Public-key encryption is slower than private key. In order to get higher efficiency and security in information retrieval, in this paper we introduce the concept of distributed SAE, which is useful for security and can enable search operations on encrypted data. Moreover, we give the proof of security.

Download Full-text