scholarly journals Se-PKSE: Secure Public-Key Searchable Encryption for Cloud-Assisted Lightweight Platforms

2021 ◽  
Author(s):  
Israt Jahan Mouri ◽  
Muhammad Ridowan ◽  
Muhammad Abdullah Adnan
Keyword(s):  
Keyword Search ◽  
Comprehensive Evaluation ◽  
Searchable Encryption ◽  
Public Key ◽  
Cloud Data ◽  
Interactive Search ◽  
Search Mechanism ◽  
Iot Devices ◽  
Index Tree ◽  
Data Usability

Abstract Since more and more data from lightweight platforms like IoT devices are being outsourced to the cloud, the need to ensure privacy while retaining data usability is important. Encrypting documents before uploading to the cloud, ensures privacy but reduces data usability. Searchable encryption, specially public-key searchable encryption (PKSE), allows secure keyword search in the cloud over encrypted documents uploaded from IoT devices. However, most existing PKSE schemes focus on returning all the files that match the queried keyword, which is not practical. To achieve a secure, practical, and efficient keyword search, we design a dynamic ranked PKSE framework over encrypted cloud data named \textit{Secure Public-Key Searchable Encryption} (Se-PKSE). We leverage a partially homomorphically encrypted index tree structure that provides sub-linear ranked search capability and allows dynamic insertion/deletion of documents without the owner storing any document details. An interactive search mechanism is introduced between the user and the cloud to eliminate trapdoors from the search request to ensure search keyword privacy and forward privacy. Finally, we implement a prototype of Se-PKSE and test it in the Amazon EC2 for practicality using the RFC dataset. The comprehensive evaluation demonstrates that Se-PKSE is efficient and secure for practical deployment.

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.

scholarly journals Tree-Based Public Key Encryption with Conjunctive Keyword Search

2021 ◽  
Vol 2021 ◽  
pp. 1-16
Author(s):  
Yu Zhang ◽  
Lei You ◽  
Yin Li
Keyword(s):  
Keyword Search ◽  
Public Key ◽  
Index Structure ◽  
Experimental Result ◽  
Public Key Encryption ◽  
Practical Applications ◽  
Result Show ◽  
Searchable Public Key Encryption ◽  
Predicate Encryption ◽  
Index Tree

Searchable public key encryption supporting conjunctive keyword search is an important technique in today’s cloud environment. Nowadays, previous schemes usually take advantage of forward index structure, which leads to a linear search complexity. In order to obtain better search efficiency, in this paper, we utilize a tree index structure instead of forward index to realize such schemes. To achieve the goal, we first give a set of keyword conversion methods that can convert the index and query keywords into a group of vectors and then present a novel algorithm for building index tree based on these vectors. Finally, by combining an efficient predicate encryption scheme to encrypt the index tree, a tree-based public key encryption with conjunctive keyword search scheme is proposed. The proposed scheme is proven to be secure against chosen plaintext attacks and achieves a sublinear search complexity. Moreover, both theoretical analysis and experimental result show that the proposed scheme is efficient and feasible for practical applications.

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

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

scholarly journals A Multi-Keyword Searchable Encryption Scheme Based on Probability Trapdoor over Encryption Cloud Data

Information ◽  
2020 ◽  
Vol 11 (8) ◽  
pp. 394
Author(s):  
Yuan Ping ◽  
Wei Song ◽  
Zhili Zhang ◽  
Weiping Wang ◽  
Baocang Wang
Keyword(s):  
Keyword Search ◽  
Rapid Development ◽  
Data Retrieval ◽  
Computing Methods ◽  
Searchable Encryption ◽  
Encryption Scheme ◽  
Privacy Concerns ◽  
Cloud Data ◽  
And Performance ◽  
Cloud Servers

With the rapid development of cloud computing, massive data are transferred to cloud servers for storage and management savings. For privacy concerns, data should be encrypted before being uploaded. In the encrypted-domain (ED), however, many data computing methods working in the plain-domain are no longer applicable. Data retrieval has become a significant obstacle to cloud storage services. To break through this limitation, we propose a multi-keyword searchable encryption scheme by introducing probability trapdoors. Firstly, a keywords probability trapdoor is established to ensure that the scheme can resist indistinguishable attacks. Based on the keywords trapdoor, we present the keywords vector to make the scheme realize multi-keyword search in the process of data retrieval in the ED. Both security and performance analysis confirm the advantages of the proposed scheme in terms of search functionality and complexity.

scholarly journals A Secure Key Aggregate Searchable Encryption with Multi Delegation in Cloud Data Sharing Service

2021 ◽  
Vol 11 (19) ◽  
pp. 8841
Author(s):  
JoonYoung Lee ◽  
MyeongHyun Kim ◽  
JiHyeon Oh ◽  
YoungHo Park ◽  
KiSung Park ◽  
...  
Keyword(s):  
Data Sharing ◽  
Keyword Search ◽  
Personal Information ◽  
Formal Analysis ◽  
Searchable Encryption ◽  
Third Party ◽  
Security Evaluation ◽  
Cloud Data ◽  
Delegation Of Authority ◽  
Data Owner

As the amount of data generated in various distributed environments is rapidly increasing, cloud servers and computing technologies are attracting considerable attention. However, the cloud server has privacy issues, including personal information and requires the help of a Trusted Third Party (TTP) for data sharing. However, because the amount of data generated and value increases, the data owner who produces data must become the subject of data sharing. In this study, we use key aggregate searchable encryption (KASE) technology, which enables keyword search, to efficiently share data without using TTP. The traditional KASE scheme approach only discusses the authority delegation from the data owner to another user. The traditional KASE scheme approach only discusses delegation of authority from the data owner to another user. However, if the delegated entity cannot perform time-critical tasks because the shared data are unavailable, the delegate must further delegate the rights given to other users. Consequently, this paper proposes a new KASE scheme that enables multi-delegation without TTP and includes an authentication technique between the user and the server. After that, we perform informal and formal analysis using BAN logic and AVISPA for security evaluation, and compare the security and performance aspects with existing schemes.

scholarly journals Efficient Boolean Keywords Search over Encrypted Cloud Data in Public Key Setting

2020 ◽  
Vol 2020 ◽  
pp. 1-15
Author(s):  
Yu Zhang ◽  
Wei He ◽  
Yin Li
Keyword(s):  
Cloud Computing ◽  
Vector Space ◽  
Experimental Analysis ◽  
Keyword Search ◽  
Public Key ◽  
Public Key Encryption ◽  
Data Confidentiality ◽  
Cloud Data ◽  
Searchable Public Key Encryption ◽  
Query Operations

Searchable public key encryption- (SPE-) supporting keyword search plays an important role in cloud computing for data confidentiality. The current SPE scheme mainly supports conjunctive or disjunctive keywords search which belongs to very basic query operations. In this paper, we propose an efficient and secure SPE scheme that supports Boolean keywords search, which is more advanced than the conjunctive and disjunctive keywords search. We first develop a keyword conversion method, which can change the index and Boolean keywords query into a group of vectors. Then, through applying a technique so-called dual pairing vector space to encrypt the obtained vectors, we propose a concrete scheme proven to be secure under chosen keyword attack. Finally, we put forward a detailed theoretical and experimental analysis to demonstrate the efficiency of our scheme.

Performance and Scalability Assessment for Non-Certificate-Based Public Key Management in VANETs

2012 ◽  
Vol 6 (1) ◽  
pp. 33-56 ◽  
Author(s):  
Pei-Yuan Shen ◽  
Maolin Tang ◽  
Vicky Liu ◽  
William Caelli
Keyword(s):  
Key Management ◽  
Vehicular Ad Hoc Networks ◽  
Ad Hoc ◽  
Comprehensive Evaluation ◽  
Public Key ◽  
Secure Messaging ◽  
Evaluation Of Performance ◽  
Management Regime ◽  
Verification Process ◽  
Hoc Networks

Current research in secure messaging for Vehicular Ad hoc Networks (VANETs) focuses on employing a digital certificate-based Public Key Cryptosystem (PKC) to support security. However, the security overhead of such a scheme creates a transmission delay and introduces a time-consuming verification process to VANET communications. This paper proposes a non-certificate-based public key management for VANETs. A comprehensive evaluation of performance and scalability of the proposed public key management regime is presented, which is compared with a certificate-based PKC by employing a number of quantified analyses and simulations. In this paper, the authors demonstrate that the proposal can maintain security and assert that it can improve overall performance and scalability at a lower cost, compared with certificate-based PKC. The proposed scheme adds a new dimension to key management and verification services for VANETs.

Sign in / Sign up

Export Citation Format

Share Document