Goals for Authentication and Key Establishment

Boyd, Colin; Mathuria, Anish

doi:10.1007/978-3-662-09527-0_2

Cited by 16 publications

(24 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Man-in-the-middle attack means that an active attacker intercepts the communication line between a legal user and the server and uses some means to successfully masquerade as both the server to the user and the user to the server [31]. From the above analysis, we know that our protocol could provide mutual authentication.…”

Section: Man-in-the-middle Attacksmentioning

confidence: 93%

“…In the on-line password guessing attack, the adversary tries to use guessed passwords iteratively to pass the verification of the server in an online manner. While in off-line password attack, the adversary intercepts messages exchanged between the user and the server, and then iteratively guesses the user's password and verifies whether his guess is correct or not in an off-line manner [31]. It is well known that the online password guessing attacks can be easily thwarted by limiting the number of continuous login attempts within a short period.…”

Section: Of H (K a ) Or H (K B ) Where K A = T R A (Y ) = T R A ×R Bmentioning

confidence: 99%

“…Replay attacks A replay attack is an offensive action in which an adversary impersonates or deceives another legitimate participant through the reuse of information obtained in a protocol [31]. The proposed protocol can resist the replay attacks.…”

Section: Of H (K a ) Or H (K B ) Where K A = T R A (Y ) = T R A ×R Bmentioning

confidence: 99%

“…Mutual authentication Mutual authentication means that both client and server are authenticated to each other within the same protocol [31]. In our protocol, the user A and the server B authenticate each other by checking the correctness of V 1 and V 2 separately.…”

Section: Of H (K a ) Or H (K B ) Where K A = T R A (Y ) = T R A ×R Bmentioning

confidence: 99%

See 3 more Smart Citations

A secure chaotic maps-based key agreement protocol without using smart cards

Gong

Shi

2012

Nonlinear Dyn

View full text Add to dashboard Cite

To guarantee secure communication, many maps-based key agreement protocols have been proposed. Due to inherent tamper-resistance, most of them are based on smart cards. Unfortunately, the cost of cards and readers makes these protocols costly. In the real world, common storage devices, such as universal serial bus (USB) thumb drives, portable HDDs, mobile phones, and laptop or desktop PCs, are widely used, and they are much cheaper or more convenient for storing user authentication information. These devices do not provide tamper-resistance; it is a challenge to design a secure authentication protocol using these kinds of memory devices. In this paper, we will propose a maps-based key agreement protocol without using smart cards. According to our analysis, the proposed protocol guarantees mutual authentication, and also resists different attacks. Therefore, our protocol is suitable even for practical applications.

show abstract

Section: Man-in-the-middle Attacksmentioning

confidence: 93%

Section: Of H (K a ) Or H (K B ) Where K A = T R A (Y ) = T R A ×R Bmentioning

confidence: 99%

Section: Of H (K a ) Or H (K B ) Where K A = T R A (Y ) = T R A ×R Bmentioning

confidence: 99%

Section: Of H (K a ) Or H (K B ) Where K A = T R A (Y ) = T R A ×R Bmentioning

confidence: 99%

See 2 more Smart Citations

A secure chaotic maps-based key agreement protocol without using smart cards

Gong

Shi

2012

Nonlinear Dyn

View full text Add to dashboard Cite

show abstract

“…Cryptography relies upon two components, an algorithm and a key -ideally a strong algorithm and a key combination should be difficult to break. Thus the cornerstone of secure cryptosystems is key establishment which is the process by which two (or more) entities establish a shared secret key for subsequent secure communications [1]. Key establishment includes both key agreement and key transport [2].…”

Section: Introductionmentioning

confidence: 99%

Analysis of Neural Synchronization Using Genetic Approach for Secure Key Generation

Santhanalakshmi

Sangeeta

Patra

2015

Communications in Computer and Information Science

View full text Add to dashboard Cite

Abstract. Cryptography depends on two components, an algorithm and a key. Keys are used for encryption of information as well as in other cryptographic schemes such as digital signature and message authentication codes. Neural cryptography is a way to create shared secret key. Key generation in Tree Parity Machine neural network is done by mutual learning. Neural networks receive common inputs to synchronize using a suitable learning rule. Because of this effect neural synchronization can be used to construct a cryptographic key-exchange protocol. Faster synchronization of the neural network has been achieved by generating the optimal weights for the sender and receiver from a genetic process. In this paper the performance of the genetic algorithm has been analysed by varying the neural network and genetic parameters.

show abstract

On the design of a secure user authentication and key agreement scheme for wireless sensor networks

Kumari

Das

Wazid

et al. 2016

Concurrency and Computation

View full text Add to dashboard Cite

Summary A wireless sensor network (WSN) typically consists of a large number of resource‐constrained sensor nodes and several control or gateway nodes. Ensuring the security of the asymmetric nature of WSN is challenging, and designing secure and efficient user authentication and key agreement schemes for WSNs is an active research area. For example, in 2016, Farash et al. proposed a user authentication and key agreement scheme for WSNs. However, we reveal previously unpublished vulnerabilities in their scheme, which allow an attacker to carry out sensor node spoofing, password guessing, user/sensor node anonymity, and user impersonation attacks. We then present a scheme, which does not suffer from the identified vulnerabilities. To demonstrate the practicality of the scheme, we evaluate the scheme using NS‐2 simulator. We then prove the scheme secure using Burrows–Abadi–Needham logic. Copyright © 2016 John Wiley & Sons, Ltd.

show abstract

Goals for Authentication and Key Establishment

Cited by 16 publications

References 0 publications

A secure chaotic maps-based key agreement protocol without using smart cards

A secure chaotic maps-based key agreement protocol without using smart cards

Analysis of Neural Synchronization Using Genetic Approach for Secure Key Generation

On the design of a secure user authentication and key agreement scheme for wireless sensor networks

Contact Info

Product

Resources

About