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.

Advanced Features in Protocol Verification: Theory, Properties, and Efficiency in Maude-NPA

Abstract: The area of formal analysis of cryptographic protocols has been an active one since the mid 80's. The idea is to verify communication protocols that use encryption to guarantee secrecy and that use authentication of data to ensure security. Formal methods are used in protocol analysis to provide formal proofs of security, and to uncover bugs and security flaws that in some cases had remained unknown long after the original protocol publication, such as the case of the well known Needham-Schroeder Public Key (NSPK) protocol. In this thesis we tackle problems regarding the three main pillars of protocol verification: modelling capabilities, verifiable properties, and efficiency. This thesis is devoted to investigate advanced features in the analysis of cryptographic protocols tailored to the Maude-NPA tool. This tool is a model-checker for cryptographic protocol analysis that allows the incorporation of different equational theories and operates in the unbounded session model without the use of data or control abstraction. An important contribution of this thesis is relative to theoretical aspects of protocol verification in Maude-NPA. First, we define a forwards operational semantics, using rewriting logic as the theoretical framework and the Maude programming language as tool support. This is the first time that a forwards rewriting-based semantics is given for Maude-NPA. Second, we also study the problem that arises in cryptographic protocol analysis when it is necessary to guarantee that certain terms generated during a state exploration are in normal form with respect to the protocol equational theory. We also study techniques to extend Maude-NPA capabilities to support the verification of a wider class of protocols and security properties. First, we present a framework to specify and verify sequential protocol compositions in which one or more child protocols make use of information obtained from running a parent protocol. Second, we present a theoretical framework to specify and verify protocol indistinguishability in Maude-NPA. This kind of properties aim to verify that an attacker cannot distinguish between two versions of a protocol: for example, one using one secret and one using another, as it happens in electronic voting protocols. Finally, this thesis contributes to improve the efficiency of protocol verification in Maude-NPA. We define several techniques which drastically reduce the state space, and can often yield a finite state space, so that whether the desired security property holds or not can in fact be decided automatically, in spite of the general undecidability of such problems.

Brute Force Vulnerability Testing Technology Based on Data Mutation

Abstract: Protocol plays a profound role among networked computers in security issues. With the development of computer network engineering, protocol has become increasingly intricate in both data format and interaction behavior, which means that more potential defects exist in protocol software implementations. These factors make protocol vulnerable to malicious attacks and raise the security requirements to an ever high level. After over ten-year progress, however, the vulnerability testing methods have not been unified to an agreement. Especially, the problems in automated test cases generation remain to be solved. This paper proposes a novel brute force vulnerability testing technique, generating test data by mutating captured protocol messages. And to formalize the perturbing process, regular expression is introduced into the approach for constructing test case templates. In addition, a multi-protocol test tool called PVD is developed to implement the test system architecture. Finally, the authors carry on a complete vulnerability testing campaign on Asterisk 1.4 SIP (Session Initiation Protocol) server, as the result, finding a number of protocol defects and achieving fairly efficient test results.

Efficient three-party encrypted key exchange using trapdoor functions

Abstract: Three-party encrypted key exchange (3PEKE) enables two communicating parties to securely exchange confidential and authenticated information over an insecure network via a trusted server. This investigation presents a novel efficient and secure 3PEKE protocol using a super-poly-to-one trapdoor function. The proposed protocol employs the Diffie–Hellman key exchange and adopts the technique that the clients can publicly exchange the factors for generating the session key without the help of the server to reduce the numbers of transmissions. A round-efficient version of the proposed 3PEKE protocol is also described. Compared with related approaches, the proposed protocol not only retains security requirements and possesses lower computational cost but also has fewer transmissions and realizes the lower bounds of communications. Copyright © 2013 John Wiley & Sons, Ltd.

Formal verification of a key establishment protocol for EPC gen2 RFID systems: work in progress

Abstract: The EPC Class-1 Generation-2 (Gen2 for short) is a standard Radio Frequency Identification (RFID) technology that has gained a prominent place on the retail industry. The Gen2 standard lacks, however, of verifiable security functionalities. Eavesdropping attacks can, for instance, affect the security of monitoring applications based on the Gen2 technology. We are working on a key establishment protocol that aims at addressing this problem. The protocol is applied at both the initial identification phase and those remainder operations that may require security, such as password protected operations. We specify the protocol using the High Level Protocol Specification Language (HLPSL). Then, we verify the secrecy property of the protocol using the AVISPA model checker tool. The results that we report show that the current version of the protocol guarantees sensitive data secrecy under the presence of a passive adversary.

Routing based authentication for mobile ad hoc network in home environment

Abstract: This paper proposes the ad hoc authentication protocol for user convenience and guest authentication in a home environment. To improve the delay performance, an authentication protocol was implemented into the ad hoc routing algorithm. The proposed protocol was evaluated through three analyses. The correctness of the proposed protocol was proved via the GNY analysis. According to the security analysis, the proposed protocol was shown to be resistant to various attacks. For the performance analysis, the protocol was implemented on the laptop using the Linux operating system and transmission time was measured. The analysis results show that the proposed protocol provides a secure home network environment without significant performance degradation.