Designated Cloud Server Public Key Encryption with Keyword Search from Lattice in the Standard Model

2018 ◽  
Vol 27 (2) ◽  
pp. 304-309 ◽  
Author(s):  
Xiaojun Zhang ◽  
Chunxiang Xu ◽  
Run Xie ◽  
Chunhua Jin
Keyword(s):  
Standard Model ◽  
Keyword Search ◽  
Public Key ◽  
Public Key Encryption ◽  
Cloud Server ◽  
The Standard Model

Lattice-based completely non-malleable public-key encryption in the standard model

2012 ◽  
Vol 71 (2) ◽  
pp. 293-313 ◽  
Author(s):  
Reza Sepahi ◽  
Ron Steinfeld ◽  
Josef Pieprzyk
Keyword(s):  
Standard Model ◽  
Public Key ◽  
Public Key Encryption ◽  
The Standard Model

scholarly journals A Multi-User Public Key Encryption with Multi-Keyword Search out of Bilinear Pairings

Sensors ◽  
2020 ◽  
Vol 20 (23) ◽  
pp. 6962
Author(s):  
Shuo Zhang ◽  
Qiaoyan Wen ◽  
Wenmin Li ◽  
Hua Zhang ◽  
Zhengping Jin
Keyword(s):  
Keyword Search ◽  
Daily Life ◽  
Bilinear Pairings ◽  
User Model ◽  
Public Key ◽  
Public Key Encryption ◽  
Private Cloud ◽  
Important Data ◽  
Cloud Server ◽  
Iot Devices

Internet of Things (IoT) and cloud computing are adopted widely in daily life and industrial production. Sensors of IoT equipment gather personal, sensitive and important data, which is stored in a cloud server. The cloud helps users to save cost and collaborate. However, the privacy of data is also at risk. Public-key encryption with keyword search (PEKS) is convenient for users to use the data without leaking privacy. In this article, we give a scheme of PEKS for a multi-user to realize the multi-keyword search at once and extend it to show a rank based on keywords match. The receiver can finish the search by himself or herself. With private cloud and server cloud, most users’ computing can be outsourced. Moreover, the PEKS can be transferred to a multi-user model in which the private cloud is used to manage receivers and outsource. The store cloud and the private cloud both obtain nothing with the keyword information. Then our IoT devices can easily run these protocols. As we do not use any pairing operations, the scheme is under more general assumptions that means the devices do not need to take on the heavy task of calculating pairing.

Public-Key Encryption In The Standard Model Against Strong Leakage Adversary

2020 ◽  
Vol 63 (12) ◽  
pp. 1904-1914
Author(s):  
Janaka Alawatugoda
Keyword(s):  
Standard Model ◽  
Building Blocks ◽  
Public Key ◽  
Log P ◽  
Encryption Scheme ◽  
Public Key Encryption ◽  
Security Parameter ◽  
The Standard Model ◽  
Encryption Schemes ◽  
Leakage Resilient

Abstract Over the years, security against adaptively chosen-ciphertext attacks (CCA2) is considered as the strongest security definition for public-key encryption schemes. With the uprise of side-channel attacks, new security definitions are proposed, addressing leakage of secret keys together with the standard CCA2 definition. Among the new security definitions, security against continuous and after-the-fact leakage-resilient CCA2 can be considered as the strongest security definition, which is called as security against (continuous) adaptively chosen-ciphertext leakage attacks (continuous CCLA2). In this paper, we present a construction of a public-key encryption scheme, namely LR-PKE, which satisfies the aforementioned security definition. The security of our public-key encryption scheme is proven in the standard model, under decision BDH assumption. Thus, we emphasize that our public-key encryption scheme LR-PKE is (continuous) CCLA2-secure in the standard model. For our construction of LR-PKE, we have used a strong one-time signature scheme and a leakage-resilient refreshing protocol as underlying building blocks. The leakage bound is $0.15n\log p -1$ bits per leakage query, for a security parameter $k$ and a statistical security parameter $n$, such that $\log p \geq k$ and $n$ is a function of $k$. It is possible to see that LR-PKE is efficient enough to be used for real-world usage.

scholarly journals Public Key Encryption with Keyword Search from Lattices in Multiuser Environments

2016 ◽  
Vol 2016 ◽  
pp. 1-7 ◽  
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.

ISEkFT

2019 ◽  
Vol 12 (3) ◽  
pp. 133-153 ◽  
Author(s):  
Mamta ◽  
Brij B. Gupta ◽  
Syed Taqi Ali
Keyword(s):  
Keyword Search ◽  
Public Key ◽  
Public Key Encryption ◽  
The Public ◽  
Fuzzy Search ◽  
Cloud Server ◽  
Fuzzy Keyword Search ◽  
Identity Based ◽  
Guessing Attack ◽  
Overall Reliability

Public-key encryption with keyword search (PEKS) is a well-known technique which allows searching on encrypted data using the public key system. However, this technique suffers from the keyword guessing attack (KGA). To address this problem, a modified version of PEKS called public key encryption with fuzzy keyword search (PEFKS) has been introduced where each keyword is associated with an exact search trapdoor (EST) and a fuzzy search trapdoor (FST) which is provided to the cloud server. PEFKS prevents KGA in such a way that two or maximum three keywords share the same FST. Hence, even if the cloud server knows the FST it cannot link it to the corresponding keyword. But, with a probability of 1/3 the malicious cloud server can still guess the keyword corresponding to FST. Therefore, in this article, the authors present an approach which can improve the security of the PEFKS technique by reducing the probability of guessing the keyword to 1/k where k is the number of keywords that share the same FST, thus enhancing the overall reliability. In addition, the authors have used an identity-based encryption (IBE) as an underlying technique to construct the searchable encryption scheme and proved its security in the standard model.

Sign in / Sign up

Export Citation Format

Share Document