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.

An Efficient and Provable Secret Shared Key Computation for Cryptographic Protocol Across Insecure Channel

Abstract: Data exchange over public network requires for the most part an important security mechanism enabling to both sender and receiver the property that they can mutual authenticate using different identification parameters playing the vital role of secret shared key computation. Based on the decisional Diffie-Hellman assumptions, this paper presents a cryptographic calculation of the shared secret key enabling mutual authentication and confidentiality services over public, insecure networks. This protocol is efficient than "classical" Diffe-Hellman key exchange which provides no authentication at all and suffer from man-in-the-middle attack. To attain this, we first model the scheme with mathematical concept for exponential calculation using entity parameters and finally we simulate the work by Scyther tool to verify the provability of the sameness 'shared secret value. With the standards cryptographic assumptions, the simulation result reveals that the protocol is practical and provably-secure. Thus, the proposed cryptographic protocol is awfully, straightforward, valuable, and resilient to know attacks.

Security enhancement for 3- peke protocol using parallel message transmission technique

Abstract: It is easy to choose and memorize simple and meaningful vocabulary as secret passwords, but it is very hard to meet the requirement of security and efficiency. Hence chang and chang proposed a novel three party encrypted key exchange protocol without using the server’s public keys. The key exchange protocol has achieved great attention due to its simplicity and efficiency. It was claimed that the protocol was practically secure and efficient. On the other hand, the protocol resists all types of password guessing attacks, because the password is of low entropy. It was then Yoon and Yoo who demonstrated the vulnerability of chang and chang’s protocol regarding undetectable on line password guessing attacks. This paper presents an enhanced protocol to eliminate undetectable online password guessing attack proposed by Yoon and Yoo.it also proposed an enhanced protocol which could achieve better performance by requiring only four message transmission round and the performance is analyzed on a set of experiments.

Cryptanalysis of an authentication protocol

Abstract: Authentication protocols have applications in many fields. The security of authentication protocols is commonly based on cryptographic primitives. Constructing secure authentication protocols is not an easy challenge and there are a large number of authentication protocols that prove to be insecure. Wulf et al. have proposed a protocol by which an entity can authenticate in a distributed system environment without using any shared secret. This paper makes a brief analysis of the proposed protocol and shows how it can be broken. The protocol will be broken by using multiplicative inverses of the integers from Z/sub n/, where n is a prime number.