Otway–Rees protocol

About: Otway–Rees protocol is a research topic. Over the lifetime, 1975 publications have been published within this topic receiving 40569 citations.

Formal verification of security protocol with B method

Abstract: Security Protocols are fundamental building block of many important applications These protocols are used to achieve various security requirements such as confidentially, authentication, integrity etc of the applications These protocols must be tested for their functional correctness before they are used In many of the protocol errors have been detected, in spite of investing lot of time in their design Modified Needham Schroeder Symmetric Key Protocol is a security protocol that incorporates an exchange of messages between two or more agents, for establishing a cryptographic key, and authenticating the identities of the agents Authentication protocol has to be designed in such a way that makes it robust against replay attacks by any intruder In this paper, use of formal methods for verification of correction of modified Needham-Schroeder Symmetric Key Protocol is demonstrated B method has been used for developing specification of modified Needham-Schroeder Symmetric Key protocol and thereafter specifications are model checked using proB model checker The specifications are free from deadlock and satisfy the behaviour or properties of the system expressed as invariants It is verified that specifications leaves no spaces for the replay attack

An Improved Authentication Protocol of TETRA

Abstract: An authentication protocol for TETRA with authentication algorithm running in HLR instead of VLR is presented in this paper. The proposed protocol can effectively avoid the generation of an open attack for known text once the communication security between VLR and HLR can not be guaranteed.It is good for roaming between networks, meets the requirements for the independence of the authentication algorithm. The proposed protocol can improve the security of actual digital trunked system.

Research on the Cyclic Shift Lightweight Mutual Authentication Protocol

Abstract: The security and privacy has become key issues in the RFID systemThe information to be transmitted needs to rotate left according to the random number generated by reader,a cyclic shift of the lightweight mutual authentication protocol(CSLMAP) is put forward on the basis of Lightweight Mutual Authentication Protocol(LMAP),and then GYN logic is used to prove the safety of the proposed protocolThe result shows that the new protocol solves the problem of security and privacy in the Lightweight Mutual Authentication Protocol,and improves the efficiency of the authentication protocol,thus reducing the cost of the application of tags

Avoiding Key Off-Set attack in a Pairing-Free Certificateless Key Agreement Protocol based on ECC

Abstract: key establishment protocol allows entities to establish a common secret key to ensure secure communications over an insecure public network. This paper proposes two new two- party key agreement protocols. Both protocols do not involve bilinear pairings. The first protocol is a certificate-based key agreement protocol that is more efficient than (1) due to its dependence on the elliptic curve discrete logarithm problem and the second is an extension to a certificateless key agreement protocol. Both protocols depend on the use of an authentication message to check that the shared session key is equal for both entities before using it. This authentication message prevents the key off-set attack that is valid for the Haiyan-Sun protocol (2). The security analysis of the second protocol is discussed. The proposed certificateless key agreement protocol is compared with other protocols in literature (2,3,4) and it requires minimal computational cost. Moreover, this protocol is implemented using the Mathematica (7) program.

An Authentication Protocol for Wireless Ad Hoc Networks with Embedded Certificates

Abstract: Wireless ad hoc networks may be configured as a fixed topology of sensors or allowed to migrate as mobile nodes. The flexibility of these networks, therefore, provides opportunities for their deployment in real-time and in adverse situations as encountered in civil and military applications. These advantages are, unfortunately, curtailed by the unconstrained nature of these networks in providing a trusted level of connectivity. The establishment of secret keys and the authentication of trusted ad hoc group nodes are essential elements for a secure network. In this paper, we develop an authentication protocol for wireless ad hoc networks that is derived from a canonical splitting of timeand frequency-space (channel) over which information propagates under the constraint of a collisionavoidance protocol.