scholarly journals Wireless Authentication in chi-Spaces

2003 ◽  
Vol 10 (10) ◽  
Author(s):  
Federico Crazzolara ◽  
Giuseppe Milicia
Keyword(s):  
Life Cycle ◽  
Low Power ◽  
Programming Language ◽  
Security Protocols ◽  
Authentication Protocol ◽  
Security Protocol ◽  
Wireless Devices ◽  
Formal Calculus

The chi-Spaces framework provides a set of tools to support every step of the security protocol's life-cycle. The framework includes a simple, yet powerful programming language which is an implementation of the Security Protocol Language (SPL). SPL is a formal calculus designed to model security protocols and prove interesting properties about them. In this paper we take an authentication protocol suited for low-power wireless devices and derive a chi-Spaces implementation from its SPL model. We study the correctness of the resulting implementation using the underlying SPL semantics of chi-Spaces.

scholarly journals Formal Methods in Information Security

2015 ◽  
Vol 14 (4) ◽  
pp. 5621-5631
Author(s):  
AJAYI ADEBOWALE ◽  
NICULAE GOGA ◽  
OTUSILE OLUWABUKOLA ◽  
ABEL SAMUEL
Keyword(s):  
Life Cycle ◽  
Formal Methods ◽  
Nuclear Energy ◽  
State Of The Art ◽  
Security Protocols ◽  
Security Protocol ◽  
Secure Information ◽  
Industrial Projects ◽  
Industrial Use ◽  
Industrial Adoption

Formal methods use mathematical models for analysis and verification at any part of the program life-cycle. The use of formal methods is admitted, recommended, and sometimes prescribed in safety-and security-related standards dealing, e.g., with avionics, railways, nuclear energy, and secure information systems. This paper describes the state of the art in the industrial use of formal methods ininformation security with a focus on verification of security protocols. Given the vast scope of available solutions, attention has been focused just on the most popular and most representative ones, without exhaustiveness claims. We describe some of the highlights of our survey by presenting a series of industrial projects, and we draw some observations from these surveys and records of experience. Based on this, we discuss issues surrounding the industrial adoption of formal methods in security protocol engineering.

scholarly journals Formal Verification of CHAP PPP authentication Protocol for Smart City/Safe City Applications.

2022 ◽  
Vol 2161 (1) ◽  
pp. 012046
Author(s):  
R Pradeep ◽  
N R Sunitha
Keyword(s):  
Formal Verification ◽  
Smart City ◽  
Smart Cities ◽  
Mathematical Proof ◽  
Security Protocols ◽  
Authentication Protocol ◽  
Security Protocol ◽  
Metropolitan Region ◽  
Security Systems ◽  
Point To Point

Abstract A smart city is a technologically advanced metropolitan region with several connected devices that collects data using various electronic technologies, voice activation methods, and sensors. The information obtained from the data is utilised to efficiently manage assets, resources, and services; in turn, the data is used to enhance operations throughout the city. Achieving security for smart cities is one of the major challenges as the number of connected devices increases the vulnerability also increases. The security of a smart city system depends on the reliability of the security protocols used by the security systems. To design and develop a highly secure system for a smart city the security protocols used must be highly reliable. To prove the reliability of a security protocol the validation technique is not desirable because of its several drawbacks, these drawbacks can be overcome using the formal verification technique which provides the mathematical proof for its correctness. In this work, The Challenge-Handshake Authentication Protocol Point-to-Point (CHAP PPP) which is more commonly used in PPP authentication of smart cities is formally verified using the well-known verification technique known as the model checking technique. The Scyther model checker is the tool used to build the abstract security protocol model.

scholarly journals Model Checking M2M and Centralised IOT authentication Protocols.

2022 ◽  
Vol 2161 (1) ◽  
pp. 012042
Author(s):  
H Rekha ◽  
M. Siddappa
Keyword(s):  
Model Checking ◽  
High Reliability ◽  
Security Protocols ◽  
Authentication Protocol ◽  
Good Choice ◽  
Security Protocol ◽  
Security Requirements ◽  
Authentication Protocols ◽  
Security Properties ◽  
Functional Correctness

Abstract It is very difficult to develop a perfect security protocol for communication over the IoT network and developing a reliable authentication protocol requires a detailed understanding of cryptography. To ensure the reliability of security protocols of IoT, the validation method is not a good choice because of its several disadvantages and limitations. To prove the high reliability of Cryptographic Security Protocols(CSP) for IoT networks, the functional correctness of security protocols must be proved secure mathematically. Using the Formal Verification technique we can prove the functional correctness of IoT security protocols by providing the proofs mathematically. In this work, The CoAP Machine to Machine authentication protocol and centralied IoT network Authentication Protocol RADIUS is formally verified using the well-known verification technique known as model checking technique and we have used the Scyther model checker for the verification of security properties of the respective protocols. The abstract protocol models of the IoT authentication protocols were specified in the security protocol description language and the security requirements of the authentication protocols were specified as claim events.

Data Security in Wired and Wireless Systems

2019 ◽  
pp. 1213-1240
Author(s):  
Abhinav Prakash ◽  
Dharma Prakash Agarwal
Keyword(s):  
Wireless Network ◽  
Data Security ◽  
Security Protocols ◽  
Wireless Systems ◽  
Main Tool ◽  
Security Protocol ◽  
Network Data ◽  
Wireless Technologies ◽  
Secured Communication ◽  
Different Parts

The issues related to network data security were identified shortly after the inception of the first wired network. Initial protocols relied heavily on obscurity as the main tool for security provisions. Hacking into a wired network requires physically tapping into the wire link on which the data is being transferred. Both these factors seemed to work hand in hand and made secured communication somewhat possible using simple protocols. Then came the wireless network which radically changed the field and associated environment. How do you secure something that freely travels through the air as a medium? Furthermore, wireless technology empowered devices to be mobile, making it harder for security protocols to identify and locate a malicious device in the network while making it easier for hackers to access different parts of the network while moving around. Quite often, the discussion centered on the question: Is it even possible to provide complete security in a wireless network? It can be debated that wireless networks and perfect data security are mutually exclusive. Availability of latest wideband wireless technologies have diminished predominantly large gap between the network capacities of a wireless network versus a wired one. Regardless, the physical medium limitation still exists for a wired network. Hence, security is a way more complicated and harder goal to achieve for a wireless network (Imai, Rahman, & Kobara, 2006). So, it can be safely assumed that a security protocol that is robust for a wireless network will provide at least equal if not better level of security in a similar wired network. Henceforth, we will talk about security essentially in a wireless network and readers should assume it to be equally applicable to a wired network.

A Mutual Authentication Protocol with Resynchronisation Capability for Mobile Satellite Communications

2013 ◽  
pp. 35-51
Author(s):  
Ioana Lasc ◽  
Reiner Dojen ◽  
Tom Coffey
Keyword(s):  
Denial Of Service ◽  
Mutual Authentication ◽  
Security Analysis ◽  
Service Condition ◽  
Satellite Communications ◽  
Authentication Protocol ◽  
Security Protocol ◽  
New Type ◽  
Mobile Satellite ◽  
Mutual Authentication Protocol

Many peer-to-peer security protocols proposed for wireless communications use one-time shared secrets for authentication purposes. This paper analyses online update mechanisms for one-time shared secrets. A new type of attack against update mechanisms, called desynchronisation attack, is introduced. This type of attack may lead to a permanent denial of service condition. A case study demonstrates the effectiveness of desynchronisation attacks against a security protocol for mobile satellite communications. A new mutual authentication protocol for satellite communications, incorporating a resynchronisation capability, is proposed to counter the disruptive effects of desynchronisation attacks. The new protocol has an esynchronisation phase that is initiated whenever desynchronisation is suspected. Thus, the possibility of causing permanent denial of service conditions by mounting desynchronisation attacks is eliminated. A security analysis of the proposed protocol establishes its resistance against attacks like replay attacks, dictionary attacks, and desynchronisation 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.

Analysis of Low Power Consumption Techniques on FPGA for Wireless Devices

2016 ◽  
Vol 95 (2) ◽  
pp. 353-364 ◽  
Author(s):  
Gaurav Verma ◽  
Manish Kumar ◽  
Vijay Khare ◽  
Bishwajeet Pandey
Keyword(s):  
Power Consumption ◽  
Low Power ◽  
Low Power Consumption ◽  
Wireless Devices

scholarly journals Abstract interpretation of temporal concurrent constraint programs

2014 ◽  
Vol 15 (3) ◽  
pp. 312-357 ◽  
Author(s):  
MORENO FALASCHI ◽  
CARLOS OLARTE ◽  
CATUSCIA PALAMIDESSI
Keyword(s):  
Abstract Interpretation ◽  
Data Flow ◽  
Reactive Systems ◽  
Security Protocols ◽  
Denotational Semantics ◽  
Security Protocol ◽  
Mobile Systems ◽  
Abstract Domains ◽  
Concurrent Constraint Programming ◽  
Abstract Semantics

AbstractTimed Concurrent Constraint Programming (tcc) is a declarative model for concurrency offering a logic for specifying reactive systems, i.e., systems that continuously interact with the environment. The universaltccformalism (utcc) is an extension oftccwith the ability to express mobility. Here mobility is understood as communication of private names as typically done for mobile systems and security protocols. In this paper we consider the denotational semantics fortcc, and extend it to a “collecting” semantics forutccbased on closure operators over sequences of constraints. Relying on this semantics, we formalize a general framework for data flow analyses oftccandutccprograms by abstract interpretation techniques. The concrete and abstract semantics that we propose are compositional, thus allowing us to reduce the complexity of data flow analyses. We show that our method is sound and parametric with respect to the abstract domain. Thus, different analyses can be performed by instantiating the framework. We illustrate how it is possible to reuse abstract domains previously defined for logic programming to perform, for instance, a groundness analysis fortccprograms. We show the applicability of this analysis in the context of reactive systems. Furthermore, we also make use of the abstract semantics to exhibit a secrecy flaw in a security protocol. We also show how it is possible to make an analysis which may show thattccprograms are suspension-free. This can be useful for several purposes, such as for optimizing compilation or for debugging.

Sign in / Sign up

Export Citation Format

Share Document