scholarly journals An Efficient Fine Grained Keyword Based Search Scheme in Fog Computing

2020 ◽  
Vol 8 (5) ◽  
pp. 602-606
Keyword(s):  
Keyword Search ◽  
Fog Computing ◽  
Network Congestion ◽  
Fine Grained ◽  
Cipher Text ◽  
Attribute Based Encryption ◽  
Key Word ◽  
Word Search ◽  
And Storage ◽  
The Internet Of Things

In fog computing outsources the encoded information to many mist hubs on the border of the internet of things (IOT) to reduce delay and network congestion. However, the existing cipher text recovery plan infrequently focus on the fog computing area and most of them still enforce high computational and capacity burden on asset constrained clients.In this writing paper, we tend to better recommended a lightweight small-grained cipher texts search (LFGS) framework in fog calculation by extending cipher text-policy attribute-based encryption (CP-ABE) and searchable encryption (SE) technologies, which can accomplish small-grained fingerprint plus key-word search concurrently. The LFGS can transfer semi calculation and storage burden from clients to picked fog nodes. Furthermore, the fundamental LFGS framework is enhanced to cope with conjunctive keyword search and attribute revise to keep away from returning unrelated search outcomes and unauthorized accesses.

scholarly journals A Lightweight Fine-Grained Search Scheme over Encrypted Data in Cloud-Assisted Wireless Body Area Networks

2019 ◽  
Vol 2019 ◽  
pp. 1-12 ◽  
Author(s):  
Mingsheng Cao ◽  
Luhan Wang ◽  
Zhiguang Qin ◽  
Chunwei Lou
Keyword(s):  
Keyword Search ◽  
Body Area Networks ◽  
Wireless Body Area Networks ◽  
Security And Privacy ◽  
Body Area ◽  
Encrypted Data ◽  
Fine Grained ◽  
Resource Limited ◽  
Attribute Based Encryption ◽  
Ciphertext Policy

The wireless body area networks (WBANs) have emerged as a highly promising technology that allows patients’ demographics to be collected by tiny wearable and implantable sensors. These data can be used to analyze and diagnose to improve the healthcare quality of patients. However, security and privacy preserving of the collected data is a major challenge on resource-limited WBANs devices and the urgent need for fine-grained search and lightweight access. To resolve these issues, in this paper, we propose a lightweight fine-grained search over encrypted data in WBANs by employing ciphertext policy attribute based encryption and searchable encryption technologies, of which the proposed scheme can provide resource-constraint end users with fine-grained keyword search and lightweight access simultaneously. We also formally define its security and prove that it is secure against both chosen plaintext attack and chosen keyword attack. Finally, we make a performance evaluation to demonstrate that our scheme is much more efficient and practical than the other related schemes, which makes the scheme more suitable for the real-world applications.

scholarly journals Secure Data Access Control with Cipher Text Update and Computation Outsourcing in Fog Computing for Internet of Things

2021 ◽  
Vol 12 (2) ◽  
pp. 1592-1597
Author(s):  
Shaik Jaffer Vali , Et. al.
Keyword(s):  
Access Control ◽  
Fog Computing ◽  
Information Access ◽  
Security Analysis ◽  
Data Access ◽  
The Novel ◽  
Fine Grained ◽  
Cipher Text ◽  
Data Access Control ◽  
Ciphertext Policy

Fog Computing is a region of Computer Science that is under steady construction and development, and related to data security, the worldview turns out to be more solid and secure for IoT's edge stages. The verification of limited memory devices has serious issues since memory utilization is high when applied with different models that have the motivation behind shared confirmation. In this paper, we propose the Novel cipher text-based encryption model (NCEM) which has an information access control plot dependent on Ciphertext-Policy it give information privacy, fine-grained control, and mysterious validation in a multi-authority fog computing framework. The sign cryption and plan cryption overhead for the client is altogether diminished by redistributing the bothersome calculation tasks to fog hubs. The proposed conspire is demonstrated to be secure in the standard model and can give trait repudiation and public unquestionable status. The security analysis, asymptotic multifaceted nature examination, and implementation results demonstrate that our construction can offset the security objectives with useful effectiveness in calculation.

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

Cryptography ◽  
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.

scholarly journals S×C4IoT: A Security-by-contract Framework for Dynamic Evolving IoT Devices

2022 ◽  
Vol 18 (1) ◽  
pp. 1-51
Author(s):  
Alberto Giaretta ◽  
Nicola Dragoni ◽  
Fabio Massacci
Keyword(s):  
Fog Computing ◽  
Life Cycles ◽  
Information Flows ◽  
Storage Space ◽  
Proof Of Concept ◽  
Human Beings ◽  
The Past ◽  
Iot Devices ◽  
And Storage ◽  
The Internet Of Things

The Internet of Things (IoT) revolutionised the way devices, and human beings, cooperate and interact. The interconnectivity and mobility brought by IoT devices led to extremely variable networks, as well as unpredictable information flows. In turn, security proved to be a serious issue for the IoT, far more serious than it has been in the past for other technologies. We claim that IoT devices need detailed descriptions of their behaviour to achieve secure default configurations, sufficient security configurability, and self-configurability. In this article, we propose S×C4IoT, a framework that addresses these issues by combining two paradigms: Security by Contract (S×C) and Fog computing. First, we summarise the necessary background such as the basic S×C definitions. Then, we describe how devices interact within S×C4IoT and how our framework manages the dynamic evolution that naturally result from IoT devices life-cycles. Furthermore, we show that S×C4IoT can allow legacy S×C-noncompliant devices to participate with an S×C network, we illustrate two different integration approaches, and we show how they fit into S×C4IoT. Last, we implement the framework as a proof-of-concept. We show the feasibility of S×C4IoT and we run different experiments to evaluate its impact in terms of communication and storage space overhead.

scholarly journals A Key-Policy Searchable Attribute-Based Encryption Scheme for Efficient Keyword Search and Fine-Grained Access Control over Encrypted Data

Electronics ◽  
2019 ◽  
Vol 8 (3) ◽  
pp. 265 ◽  
Author(s):  
Hui Yin ◽  
Yinqiao Xiong ◽  
Jixin Zhang ◽  
Lu Ou ◽  
Shaolin Liao ◽  
...  
Keyword(s):  
Access Control ◽  
Large Scale ◽  
Keyword Search ◽  
Data Access ◽  
Encryption Scheme ◽  
Encrypted Data ◽  
Fine Grained ◽  
Data Access Control ◽  
Attribute Based Encryption ◽  
Key Policy

Attribute based encryption is a promising technique that achieves flexible and fine-grained data access control over encrypted data, which is very suitable for a secure data sharing environment such as the currently popular cloud computing. However, traditional attribute based encryption fails to provide an efficient keyword based search on encrypted data, which somewhat weakens the power of this encryption technique, as search is usually the most important approach to quickly obtain data of interest from large-scale dataset. To address this problem, attribute based encryption with keyword search (ABKS) is designed to achieve fine-grained data access control and keyword based search, simultaneously, by an ingenious combination of attribute based encryption and searchable encryption. Recently, several ABKS schemes have been constructed in secure cloud storage system for data access control and keyword search. Nonetheless, each of these schemes has some defects such as impractical computation overhead and insufficient access policy expression. To overcome these limitations, in this paper, we design a Key-Policy Searchable Attribute-based Encryption Scheme (KPSABES) based on the full-blown key-policy attribute-based encryption proposed by Vipul Goyal et al. By novel design, our scheme not only inherits all advantages of that scheme but also achieves efficient and secure keyword search over encrypted data. We provide the detailed performance analyses and security proofs for our scheme. Extensive experiments demonstrated that our proposed scheme is superior in many aspects to the similar work.

scholarly journals Processing Optimization of Typed Resources with Synchronized Storage and Computation Adaptation in Fog Computing

2018 ◽  
Vol 2018 ◽  
pp. 1-13 ◽  
Author(s):  
Zhengyang Song ◽  
Yucong Duan ◽  
Shixiang Wan ◽  
Xiaobing Sun ◽  
Quan Zou ◽  
...  
Keyword(s):  
Cloud Computing ◽  
Fog Computing ◽  
Network Resources ◽  
Network Bandwidth ◽  
Computing Services ◽  
Processing Cost ◽  
Processing Optimization ◽  
Optimization Mechanism ◽  
And Storage ◽  
The Internet Of Things

Wide application of the Internet of Things (IoT) system has been increasingly demanding more hardware facilities for processing various resources including data, information, and knowledge. With the rapid growth of generated resource quantity, it is difficult to adapt to this situation by using traditional cloud computing models. Fog computing enables storage and computing services to perform at the edge of the network to extend cloud computing. However, there are some problems such as restricted computation, limited storage, and expensive network bandwidth in Fog computing applications. It is a challenge to balance the distribution of network resources. We propose a processing optimization mechanism of typed resources with synchronized storage and computation adaptation in Fog computing. In this mechanism, we process typed resources in a wireless-network-based three-tier architecture consisting of Data Graph, Information Graph, and Knowledge Graph. The proposed mechanism aims to minimize processing cost over network, computation, and storage while maximizing the performance of processing in a business value driven manner. Simulation results show that the proposed approach improves the ratio of performance over user investment. Meanwhile, conversions between resource types deliver support for dynamically allocating network resources.

Dynamic Policy Attribute Based Encryption and its Application in Generic Construction of Multi-Keyword Search

2019 ◽  
Vol 11 (4) ◽  
pp. 16-38 ◽  
Author(s):  
Mamta ◽  
Brij B. Gupta ◽  
Syed Taqi Ali
Keyword(s):  
Keyword Search ◽  
Policy Design ◽  
Transformation Method ◽  
Access Policy ◽  
Fine Grained ◽  
Security Issues ◽  
Constant Size ◽  
Attribute Based Encryption ◽  
Secret Keys ◽  
Dynamic Policy

Attribute based encryption (ABE) is an encryption technique which provides a good solution to the security issues in the cloud environment. Through ABE, a data owner can achieve the fine-grained sharing of data encrypted under attributes or an access policy which they possess. The relation among these attributes is represented by the access policy which is expressed as an access tree. In this article, the authors first present an ABE scheme which supports frequent changes in the access tree and hence, it is named a dynamic policy ABE. Also, the proposed scheme generates secret keys of constant size which can save bandwidth. The proposed scheme is based on key-policy design and supports monotonic access structure that consists of AND, OR and Threshold gates. Inspired by the proposed dynamic policy ABE scheme the authors then present a multi-keyword search scheme which inherits all the features of the proposed ABE scheme. Therefore, it provides a constant size trapdoor and support for fast search. The construction of a multi-keyword search scheme is generic in nature and any ABE scheme can be converted to the multi-keyword search scheme using the transformation method given in the paper. Finally, the proposed schemes are proven to be secure under Decisional Bilinear Diffie-Hellman (DBDH) assumption.

scholarly journals Secure Fine-Grained Keyword Search With Efficient User Revocation and Traitor Tracing in the Cloud

2020 ◽  
Vol 32 (4) ◽  
pp. 112-137
Author(s):  
Mamta ◽  
Brij B. Gupta
Keyword(s):  
Keyword Search ◽  
Policy Design ◽  
Security Model ◽  
Secret Key ◽  
Fine Grained ◽  
Multiple Data ◽  
Attribute Based Encryption ◽  
Data User ◽  
User Revocation ◽  
Access Rights

Fine-grained searching is an important feature in multi-user cloud environment and a combination of attribute-based encryption (ABE) and searchable encryption (SE) is used to facilitate it. This combination provides a powerful tool where multiple data owners can share their data with multiple data users in an independent and differential manner. In this article, the authors have used key-policy design framework of attribute-based encryption to construct the multi-keyword search scheme where access rights assigned to a data user are associated with his/her secret key. This leads to a situation where a data user can abuse his secret key to distribute it illegally to the unauthorized users to perform search over the shared data which is not intended for him/her. Therefore, to track such kind of key abusers the authors have embedded an extra functionality of tracing the traitors. For this purpose, each user is assigned a unique identity in the form of binary string where each bit represents an attribute related to his identity. In addition to the normal attributes, the access structure of a user also possesses identity-related attributes which are hidden from the user along with some normal attributes. Hence, the proposed scheme supports partial anonymity. Further, in the event of user revocation the proposed scheme efficiently handles the system update process by delegating the computationally intensive tasks to the cloud server. Finally, the proposed scheme is proved secure under Decisional Bilinear Diffie-Hellman (DBDH) assumption and decision linear assumption in the selective security model.

scholarly journals A Multi-User Ciphertext Policy Attribute-Based Encryption Scheme with Keyword Search for Medical Cloud System

2020 ◽  
Vol 11 (1) ◽  
pp. 63
Author(s):  
Han-Yu Lin ◽  
Yan-Ru Jiang
Keyword(s):  
Health Information ◽  
Keyword Search ◽  
Population Aging ◽  
Personal Health Record ◽  
Fine Grained ◽  
Attribute Based Encryption ◽  
Cryptographic Primitive ◽  
Cloud Server ◽  
Ciphertext Policy ◽  
Cloud Servers

Population aging is currently a tough problem of many countries. How to utilize modern technologies (including both information and medical technologies) to improve the service quality of health information is an important issue. Personal Health Record (PHR) could be regarded as a kind of health information records of individuals. A ciphertext policy attribute-based encryption (CP-ABE) is a cryptographic primitive for fine-grained access control of outsourced data in clouds. In order to enable patients to effectively store his medical records and PHR data in medical clouds, we propose an improved multi-user CP-ABE scheme with the functionality of keyword search which enables data users to seek for specific ciphertext in the cloud server by using a specific keyword. Additionally, we adopt an independent proxy server in the proposed system architecture to isolate the communication between clients and the cloud server, so as to prevent cloud servers from suffering direct attacks and also reduce the computational loading of cloud servers. Compared with the previous approach, the proposed encryption algorithm takes less running time and the ciphertext length is also relatively short. Moreover, the procedures of re-encryption and pre-decryption only require one exponentiation computation, respectively.

Sign in / Sign up

Export Citation Format

Share Document