scholarly journals A LIGHTWEIGHT AUTHENTICATION TECHNIQUE FOR SECURE COMMUNICATION OF EDGE/FOG DATA-CENTERS

2020 ◽  
Vol 2 (1) ◽  
pp. 76-81
Author(s):  
Muktar Yahuza ◽  
Yamani Idna Bin Idris ◽  
Ainuddin Wahid Bin Abdul Wahab ◽  
Mahdi A. Musa ◽  
Adamu Abdullahi Garba
Keyword(s):  
Load Balancing ◽  
Secure Communication ◽  
Secret Key ◽  
End User ◽  
Resource Constrained ◽  
Key Escrow ◽  
Academic Researchers ◽  
Cloud Datacenter ◽  
Lightweight Authentication ◽  
Data Centres

Edge computing has significantly enhanced the capabilities of cloud computing. Edge data-centres are used for storing data of the end-user devices. Secure communication between the legitimate edge data-centres during the load balancing process has attracted industrial and academic researchers. Recently, Puthal et al. have proposed a technique for authenticating edge datacenters to enable secure load balancing. However, the resource-constraint nature of the edge data-centres is ignored. The scheme is characterized by complex computation and memory intensive cryptographic protocol. It is also vulnerable to key escrow attack because the secret key used for encrypting and decrypting of the communicated messages is been created by the trusted cloud datacenter. Additionally, the key sharing phase of their algorithm is complex. Therefore, to address the highlighted challenges, this paper proposed a lightweight key escrow-less authentication algorithm that will ensure secure communication of resource-constrained edge data-centres during the load balancing process. The security capability of the proposed scheme has been formally evaluated using the automatic cryptographic analytical tool ProVerif. The relatively low computation and communication costs of the proposed scheme compared to the benchmark schemes proved that it is lightweight, thus suitable for resource-constrained edge datacenters.      

scholarly journals Clique Size in Sensor Networks with Key Pre-Distribution Based on Transversal Design

2005 ◽  
Vol 1 (3-4) ◽  
pp. 345-354 ◽  
Author(s):  
Dibyendu Chakrabarti ◽  
Subhamoy Maitra ◽  
Bimal Roy
Keyword(s):  
Sensor Networks ◽  
Distributed Computing ◽  
Secure Communication ◽  
Sensor Nodes ◽  
Transversal Design ◽  
Secret Key ◽  
Distributed Sensor Networks ◽  
Distributed Sensor

Key pre-distribution is an important area of research in Distributed Sensor Networks (DSN). Two sensor nodes are considered connected for secure communication if they share one or more common secret key(s). It is important to analyse the largest subset of nodes in a DSN where each node is connected to every other node in that subset (i.e., the largest clique). This parameter (largest clique size) is important in terms of resiliency and capability towards efficient distributed computing in a DSN. In this paper, we concentrate on the schemes where the key pre-distribution strategies are based on transversal design and study the largest clique sizes. We show that merging of blocks to construct a node provides larger clique sizes than considering a block itself as a node in a transversal design.

scholarly journals A Load Balancing Algorithm for the Data Centres to Optimize Cloud Computing Applications

IEEE Access ◽  
2021 ◽  
pp. 1-1
Author(s):  
Dalia Abdulkareem Shafiq ◽  
NZ Jhanjhi ◽  
Azween Abdullah ◽  
Mohammed A AlZain
Keyword(s):  
Cloud Computing ◽  
Load Balancing ◽  
Load Balancing Algorithm ◽  
Data Centres

scholarly journals Security Analysis of Discrete-Modulated Continuous-Variable Quantum Key Distribution over Seawater Channel

2019 ◽  
Vol 9 (22) ◽  
pp. 4956 ◽  
Author(s):  
Xinchao Ruan ◽  
Hang Zhang ◽  
Wei Zhao ◽  
Xiaoxue Wang ◽  
Xuan Li ◽  
...  
Keyword(s):  
Quantum Key Distribution ◽  
Secure Communication ◽  
Security Analysis ◽  
Finite Size ◽  
Key Distribution ◽  
Continuous Variable ◽  
Heterodyne Detection ◽  
Secret Key ◽  
Transmission Distance ◽  
Better Than

We investigate the optical absorption and scattering properties of four different kinds of seawater as the quantum channel. The models of discrete-modulated continuous-variable quantum key distribution (CV-QKD) in free-space seawater channel are briefly described, and the performance of the four-state protocol and the eight-state protocol in asymptotic and finite-size cases is analyzed in detail. Simulation results illustrate that the more complex is the seawater composition, the worse is the performance of the protocol. For different types of seawater channels, we can improve the performance of the protocol by selecting different optimal modulation variances and controlling the extra noise on the channel. Besides, we can find that the performance of the eight-state protocol is better than that of the four-state protocol, and there is little difference between homodyne detection and heterodyne detection. Although the secret key rate of the protocol that we propose is still relatively low and the maximum transmission distance is only a few hundred meters, the research on CV-QKD over the seawater channel is of great significance, which provides a new idea for the construction of global secure communication network.

scholarly journals Evaluating Modern Data Centre Transport Protocols in OMNeT++/INET

10.29007/h27x ◽  
2019 ◽  
Author(s):  
Mohammed Alasmar ◽  
George Parisis
Keyword(s):  
Load Balancing ◽  
Simulation Model ◽  
Network Topology ◽  
Transport Protocol ◽  
Data Transport ◽  
Transport Protocols ◽  
Data Centre ◽  
Evaluation Platform ◽  
Data Centres

In this paper we present our work towards an evaluation platform for data centre transport protocols. We developed a simulation model for NDP1, a modern data transport protocol in data centres, a FatTree network topology and per-packet ECMP load balancing. We also developed a data centre environment that can be used to evaluate and compare data transport protocols, usch as NDP and TCP. We describe how we integrated our model with the INET Framework and present example simulations to showcase the workings of the developed framework. For that, we ran a comprehensive set of experiments and studied different components and parameters of the developed models.

An Implementation of Trusted Key Management Protocol (TKMP) in Wireless Network

2020 ◽  
Vol 17 (12) ◽  
pp. 5243-5249
Author(s):  
R. Jayaprakash ◽  
B. Radha
Keyword(s):  
Load Balancing ◽  
Wireless Network ◽  
Key Management ◽  
Secure Communication ◽  
Homomorphic Encryption ◽  
Selection Procedure ◽  
Communication Technologies ◽  
Path Selection ◽  
Management Protocol ◽  
Key Management Protocol

The Trusted Key Management Protocol (TKMP) provides one of the most secure communication technologies in MANET cluster-based data protection. For security reasons, TKMP is a trusted key that can be sent to all nodes in the communication cluster. This document introduces the Trusted Key Management Protocol (TKMP) feature to improve the quality of secure communications over a cluster-based wireless network. The proposed TKMP execution process includes CBPPRS (Cluster Based Privacy Preserving Routing Selection), LBCPR (Load Balancing Cluster Based Privacy Routing) and DLBPS (Dynamic Load Balancing Privacy Path Selection) procedure. To lock the data from the malicious node, the Paillier Cryptosystem (PC) encrypts packets with homomorphic encryption. The trust score makes it easier to update routing information and improves network throughput. The experimental results show that the proposed TKMP method works better than the other Trust-ECC method.

Dynamic Task Assignment with Load Balancing in Cloud Platform

2016 ◽  
pp. 363-385
Author(s):  
Subhadarshini Mohanty ◽  
Prashant Kumar Patra ◽  
Subasish Mohapatra
Keyword(s):  
Cloud Computing ◽  
Load Balancing ◽  
User Satisfaction ◽  
Task Assignment ◽  
Heterogeneous Data ◽  
Hybrid Technique ◽  
Cloud Platform ◽  
Dynamic Task ◽  
Data Centres ◽  
Task Assignment Problem

Load balancing is one of the major issue in cloud computing. Load balancing helps in achieving maximum resource utilization and user satisfaction. This mechanism transparently transfer load from heavily loaded process to under loaded process. In this paper we have proposed a hybrid technique for solving task assignment problem in cloud platform. PSO based heuristic has been developed to schedule random task in heterogeneous data centres. Here we have also used variants of Particle Swarm Optimization(PSO) which gives better result than PSO and other heuristics for load balancing in cloud computing environment.

Load Balancing Aware Multiparty Secure Group Communication for Online Services in Wireless Mesh Networks

2011 ◽  
Vol 1 (3) ◽  
pp. 15-29
Author(s):  
Neeraj Kumar
Keyword(s):  
Load Balancing ◽  
Wireless Mesh Networks ◽  
Secure Communication ◽  
Mesh Networks ◽  
Group Communication ◽  
Handheld Devices ◽  
Online Services ◽  
Efficient Manner ◽  
Secure Group Communication ◽  
Wireless Mesh

The internet offers services for users which can be accessed in a collaborative shared manner. Users control these services, such as online gaming and social networking sites, with handheld devices. Wireless mesh networks (WMNs) are an emerging technology that can provide these services in an efficient manner. Because services are used by many users simultaneously, security is a paramount concern. Although many security solutions exist, they are not sufficient. None have considered the concept of load balancing with secure communication for online services. In this paper, a load aware multiparty secure group communication for online services in WMNs is proposed. During the registration process of a new client in the network, the Load Balancing Index (LBI) is checked by the router before issuing a certificate/key. The certificate is issued only if the value of LBI is less than a predefined threshold. The authors evaluate the proposed solution against the existing schemes with respect to metrics like storage and computation overhead, packet delivery fraction (PDF), and throughput. The results show that the proposed scheme is better with respect to these metrics.

Sign in / Sign up

Export Citation Format

Share Document