scholarly journals Geometric Authentication Mechanism for Enhancing Security in IoT Environment

Symmetry ◽  
2021 ◽  
Vol 13 (8) ◽  
pp. 1369
Author(s):  
Ming-Chin Chuang ◽  
Chia-Cheng Yen
Keyword(s):  
Error Detection ◽  
Mutual Authentication ◽  
Computational Cost ◽  
Security Level ◽  
Session Key ◽  
Authentication Mechanism ◽  
Server Overload ◽  
Low Computational Cost ◽  
Access Services ◽  
The Internet Of Things

In the Internet of things (IoT) environment, many applications access services through remote methods. In this paper, we designed a new geometric authentication mechanism to enhance security. The solution is based on geometric characteristics to achieve rapid authentication at low computational cost. In addition, we use the user’s biometrics to improve the security level of the system. Our solution meets the following security features: anonymity, resistance to forgery attacks and replay attacks, fast error detection, resistance to offline password guessing attacks, resistance to server overload attacks, mutual authentication, session key agreement, and flexibility in users choosing and changing their passwords easily.

scholarly journals An Optimized Protocol of M2M Authentication for Internet of Things (IoT)

2021 ◽  
Vol 13 (2) ◽  
pp. 29-38
Author(s):  
Mohamed M. Samy ◽  
◽  
Wagdy R. Anis. ◽  
Ahmed A. Abdel-Hafez ◽  
Haitham D. Eldemerdash
Keyword(s):  
Information Security ◽  
Internet Of Things ◽  
Production Systems ◽  
Mutual Authentication ◽  
Computational Cost ◽  
The Internet ◽  
Session Key ◽  
Industrial Iot ◽  
Control Production ◽  
The Internet Of Things

The Internet of Things (IoT) consists of sensors, networks, and services to connect and control production systems. Machine-to-Machine (M2M) communication technology is considered as a key underlying technology for building Industrial IoT environments where devices are enabled to exchange information with each other in an autonomous way without human intervention. Resource-Constrained Devices (RCD) have found an expanding demand in the Internet of Things (IoT) applications as these gadgets are essentially working with delicate information. Thus, information security has ended up vital for both makers and clients. However, the creation of defenseless gadgets still challenging regarding the restriction of involved assets especially with the attackers ‘continuous trials to misuse these restrictions chasing important information. Hence, connecting an open key crypto-system becomes a must to extend gadget proficiency and relieve the chance of touchy data loss. Deployments of Elliptic curve cryptography (ECC) are fundamentally an open key crypto-system with the basic distinction of speedier advancing capacity whereas yielding an assortment of distinctive approaches to the arrangement of the cryptographic calculation. We will submit a proposed protocol to overcome the demands of information security and the speed of data circulation. The proposed protocol is characterized by low computational cost, communication and storage overhead, while achieving mutual authentication, session key agreement, device’s identity confidentiality, and resistance against various attacks.

scholarly journals Elliptic Curve Signcryption-Based Mutual Authentication Protocol for Smart Cards

2020 ◽  
Vol 10 (22) ◽  
pp. 8291
Author(s):  
Anuj Kumar Singh ◽  
Arun Solanki ◽  
Anand Nayyar ◽  
Basit Qureshi
Keyword(s):  
Elliptic Curve ◽  
Smart Card ◽  
Mutual Authentication ◽  
Computational Cost ◽  
Authentication Protocol ◽  
Security Protocol ◽  
Smart Cards ◽  
Communication Overhead ◽  
Authentication Mechanism ◽  
Computational Overhead

In the modern computing environment, smart cards are being used extensively, which are intended to authenticate a user with the system or server. Owing to the constrictions of computational resources, smart card-based systems require an effective design and efficient security scheme. In this paper, a smart card authentication protocol based on the concept of elliptic curve signcryption has been proposed and developed, which provides security attributes, including confidentiality of messages, non-repudiation, the integrity of messages, mutual authentication, anonymity, availability, and forward security. Moreover, the analysis of security functionalities shows that the protocol developed and explained in this paper is secure from password guessing attacks, user and server impersonation, replay attacks, de-synchronization attacks, insider attacks, known key attacks, and man-in-the-middle attacks. The results have demonstrated that the proposed smart card security protocol reduces the computational overhead on a smart card by 33.3% and the communication cost of a smart card by 34.5%, in comparison to the existing efficient protocols. It can, thus, be inferred from the results that using elliptic curve signcryption in the authentication mechanism reduces the computational cost and communication overhead by a significant amount.

scholarly journals Password Based Client-Server-User Authenticated Key Agreement Mechanism for Cloud System

2019 ◽  
Vol 8 (4) ◽  
pp. 12839-12841
Keyword(s):  
Key Agreement ◽  
Identity Management ◽  
Mutual Authentication ◽  
Security Analysis ◽  
Impersonation Attack ◽  
Session Key ◽  
Replay Attack ◽  
Authentication Mechanism ◽  
Diffie Hellman ◽  
Cloud Server

The authentication is an essential concern in the cloud environment to restrict the unauthorized users to retrieve the files from cloud server. Moreover, authentication mechanisms are used to prevent illegal access of resources over insecure channel. Thus proposed work provides the strong and efficient authentication process in cloud computing environment by chebyshev polynomial based chaotic maps Diffie Hellman property. The proposed authentication mechanism does not disclose the identity of the user to CSP. Moreover proposed authentication mechanism enables mutual authentication, Identity management, and session-key agreement. The Proposed mechanism of security analysis includes the enabling mutual authentication and key agreement, restricting the impersonation attack, man in the middle attack and replay attack.

scholarly journals New Secure and Practical E-Mail Protocol with Perfect Forward Secrecy

Symmetry ◽  
2021 ◽  
Vol 13 (7) ◽  
pp. 1144
Author(s):  
Chien-Ding Lee ◽  
Tzung-Her Chen
Keyword(s):  
Key Management ◽  
Electronic Mail ◽  
Mutual Authentication ◽  
Computational Cost ◽  
The Internet ◽  
Security Level ◽  
Secret Key ◽  
Forward Secrecy ◽  
Perfect Forward Secrecy ◽  
E Mail

The invention of electronic mail (e-mail) has made communication through the Internet easier than before. However, because the fundamental functions of the Internet are built on opensource technologies, it is critical to keep all transmitted e-mail secure and secret. Most current e-mail protocols only allow recipients to check their e-mail after the recipients are authenticated by the e-mail server. Unfortunately, the subsequent e-mail transmission from the server to the recipient remains unprotected in the clear form without encryption. Sometimes, this is not allowed, especially in consideration of issues such as confidentiality and integrity. In this paper, we propose a secure and practical e-mail protocol with perfect forward secrecy, as well as a high security level, in which the session keys used to encrypt the last e-mail will not be disclosed even if the long-term secret key is compromised for any possible reason. Thus, the proposed scheme benefits from the following advantages: (1) providing mutual authentication to remove the threat of not only impersonation attacks, but also spam; (2) guaranteeing confidentiality and integrity while providing the service of perfect forward secrecy; (3) simplifying key management by avoiding the expense of public key infrastructure involvement; and (4) achieving lower computational cost while meeting security criteria compared to the related works. The security analysis and the discussion demonstrate that the proposed scheme works well.

The Optimization of the Key Exchange Protocol Based on Public Key Certificates in the Internet of Things

2013 ◽  
Vol 411-414 ◽  
pp. 629-633
Author(s):  
Cui Jie Zhao ◽  
Guo Zhen Wang
Keyword(s):  
Wireless Sensor Network ◽  
Mutual Authentication ◽  
Key Exchange ◽  
Public Key ◽  
Wireless Sensor ◽  
The Internet ◽  
Key Exchange Protocol ◽  
Optimization Scheme ◽  
Session Key ◽  
The Internet Of Things

We put forward exchange agreement certificate mutual authentication and the session key exchange protocol based on wireless sensor network, which is an improved version of the traditional certificate protocol. In the optimization scheme, the adversary cannot obtain the secret value, and each session process generates a different key, so as to ensure the safety of the encrypted information transmission between nodes.

scholarly journals Rechained: Sybil-Resistant Distributed Identities for the Internet of Things and Mobile Ad Hoc Networks

Sensors ◽  
2021 ◽  
Vol 21 (9) ◽  
pp. 3257
Author(s):  
Arne Bochem ◽  
Benjamin Leiding
Keyword(s):  
Internet Of Things ◽  
Ad Hoc ◽  
Upper And Lower Bounds ◽  
Colored Petri Nets ◽  
Security Level ◽  
Internet Connectivity ◽  
Mobile Ad Hoc ◽  
Hoc Networks ◽  
Detection Schemes ◽  
The Internet Of Things

Today, increasing Internet of Things devices are deployed, and the field of applications for decentralized, self-organizing networks keeps growing. The growth also makes these systems more attractive to attackers. Sybil attacks are a common issue, especially in decentralized networks and networks that are deployed in scenarios with irregular or unreliable Internet connectivity. The lack of a central authority that can be contacted at any time allows attackers to introduce arbitrary amounts of nodes into the network and manipulate its behavior according to the attacker’s goals, by posing as a majority participant. Depending on the structure of the network, employing Sybil node detection schemes may be difficult, and low powered Internet of Things devices are usually unable to perform impactful amounts of work for proof-of-work based schemes. In this paper, we present Rechained, a scheme that monetarily disincentivizes the creation of Sybil identities for networks that can operate with intermittent or no Internet connectivity. We introduce a new revocation mechanism for identities, tie them into the concepts of self-sovereign identities, and decentralized identifiers. Case-studies are used to discuss upper- and lower-bounds for the costs of Sybil identities and, therefore, the provided security level. Furthermore, we formalize the protocol using Colored Petri Nets to analyze its correctness and suitability. Proof-of-concept implementations are used to evaluate the performance of our scheme on low powered hardware as it might be found in Internet of Things applications.

scholarly journals Computing Expectiles Using k-Nearest Neighbours Approach

Symmetry ◽  
2021 ◽  
Vol 13 (4) ◽  
pp. 645
Author(s):  
Muhammad Farooq ◽  
Sehrish Sarfraz ◽  
Christophe Chesneau ◽  
Mahmood Ul Hassan ◽  
Muhammad Ali Raza ◽  
...  
Keyword(s):  
Computational Cost ◽  
Real Life ◽  
Distance Measures ◽  
Computational Time ◽  
High Dimensional ◽  
Test Error ◽  
Nearest Neighbours ◽  
Comparable Performance ◽  
Asymmetric Least Squares ◽  
Low Computational Cost

Expectiles have gained considerable attention in recent years due to wide applications in many areas. In this study, the k-nearest neighbours approach, together with the asymmetric least squares loss function, called ex-kNN, is proposed for computing expectiles. Firstly, the effect of various distance measures on ex-kNN in terms of test error and computational time is evaluated. It is found that Canberra, Lorentzian, and Soergel distance measures lead to minimum test error, whereas Euclidean, Canberra, and Average of (L1,L∞) lead to a low computational cost. Secondly, the performance of ex-kNN is compared with existing packages er-boost and ex-svm for computing expectiles that are based on nine real life examples. Depending on the nature of data, the ex-kNN showed two to 10 times better performance than er-boost and comparable performance with ex-svm regarding test error. Computationally, the ex-kNN is found two to five times faster than ex-svm and much faster than er-boost, particularly, in the case of high dimensional data.

scholarly journals Directional TGV-Based Image Restoration under Poisson Noise

2021 ◽  
Vol 7 (6) ◽  
pp. 99
Author(s):  
Daniela di Serafino ◽  
Germana Landi ◽  
Marco Viola
Keyword(s):  
Computed Tomography ◽  
Image Restoration ◽  
Gaussian Noise ◽  
Computational Cost ◽  
Data Fitting ◽  
Poisson Noise ◽  
Glass Fibres ◽  
Leibler Divergence ◽  
Generalized Variation ◽  
Low Computational Cost

We are interested in the restoration of noisy and blurry images where the texture mainly follows a single direction (i.e., directional images). Problems of this type arise, for example, in microscopy or computed tomography for carbon or glass fibres. In order to deal with these problems, the Directional Total Generalized Variation (DTGV) was developed by Kongskov et al. in 2017 and 2019, in the case of impulse and Gaussian noise. In this article we focus on images corrupted by Poisson noise, extending the DTGV regularization to image restoration models where the data fitting term is the generalized Kullback–Leibler divergence. We also propose a technique for the identification of the main texture direction, which improves upon the techniques used in the aforementioned work about DTGV. We solve the problem by an ADMM algorithm with proven convergence and subproblems that can be solved exactly at a low computational cost. Numerical results on both phantom and real images demonstrate the effectiveness of our approach.

scholarly journals An optimal and low computational cost fractional Newton-type method for solving nonlinear equations

2021 ◽  
pp. 107650
Author(s):  
Giro Candelario ◽  
Alicia Cordero ◽  
Juan R. Torregrosa ◽  
María P. Vassileva
Keyword(s):  
Nonlinear Equations ◽  
Computational Cost ◽  
Type Method ◽  
Low Computational Cost
Sign in / Sign up

Export Citation Format

Share Document