EAP(Extensible Authentication Protocol) in Network Security

 

EAP(Extensible Authentication Protocol)

EAP (Extensible Authentication Protocol) is an authentication framework used to verify the identity of a user or device before allowing secure network access. 

It is not a single fixed authentication method; instead, it supports multiple authentication techniques.

Features of EAP
EAP can support different authentication methods, such as:

  • Password-based authentication
  • Digital certificates
  • Smart cards
  • One-Time Passwords (OTP)
  • Biometrics

These methods are used to verify identity before providing secure access.

The main advantage of EAP is its extensible nature. New authentication technologies can be supported by using suitable EAP methods without replacing the underlying network infrastructure.

EAP is commonly used in:
  • Wireless networks
  • VPNs
  • Enterprise networks
  • Mobile networks

1. EAP-TLS (Transport Layer Security)

EAP-TLS is a certificate-based authentication method that uses digital certificates instead of passwords.

Working

  • Both the client and server authenticate each other using digital certificates.
  • No password needs to be transmitted over the network.
  • It provides strong security during authentication.
  • Encrypted communication is supported during the authentication process.

Real-Life Example

EAP-TLS can be used in a corporate Wi-Fi network where employee laptops are provided with digital certificates.

Large organizations can use this method to ensure that only authorized devices can access the network.


2. PEAP (Protected EAP)

PEAP creates an encrypted tunnel before transmitting the user's credentials.

Working

  • PEAP establishes a secure tunnel.
  • The username and password are protected inside this tunnel.
  • A digital certificate is required by the server.
  • It provides secure password-based authentication.

Real-Life Example

PEAP is commonly used in college and office Wi-Fi login systems.

When students enter their username and password to connect to campus Wi-Fi, PEAP can protect these credentials during authentication.


3. EAP-TTLS (Tunneled Transport Layer Security)

EAP-TTLS first establishes a secure encrypted tunnel between the client and server.

Working

  • A secure encrypted tunnel is created between the client and server.
  • User credentials are transmitted securely inside the tunnel.
  • It supports different inner authentication methods.
  • The server certificate is used to establish secure communication.

Real-Life Example

EAP-TTLS can be used in university campus networks.

Educational institutions can use this method to authenticate students and staff securely.


4. EAP-SIM (Subscriber Identity Module)

EAP-SIM uses the SIM card for identity verification.

Working

  • The user does not need to manually enter a password.
  • Authentication is performed automatically using SIM credentials.

Real-Life Example

When a mobile phone connects to a mobile network after a SIM card is inserted, SIM-based authentication can be used to verify the subscriber.

Telecommunication providers use this method for subscriber authentication.


5. EAP-AKA (Authentication and Key Agreement)

EAP-AKA is an advanced authentication method based on SIM/USIM credentials.

Working

  • It uses subscriber credentials for authentication.
  • It generates secure session keys.
  • It is used in modern mobile networks such as 3G, 4G and 5G.

Real-Life Example

When a smartphone securely connects to a 4G or 5G mobile network, EAP-AKA can be used for authentication and secure communication between the mobile device and the network.



Read Next Topic:IEEE 802.1x Port based Network Access

Handwritten Notes-Download PDF

Video Explanation-Watch on YouTube

Comments

Post a Comment

Popular posts from this blog

B+ Tree in DBMS | B+ Tree in Data Structure

    B+  Tree A B+ Tree is a self-balancing multi-way search tree   All leaf nodes are present at the same level . Actual data records are stored only in the leaf nodes . Internal nodes contain only search keys . It is mainly used for efficient searching and sequential access . B+ Tree supports efficient range queries . Structure of B+ Tree Consider a B+ Tree node containing keys and children: Number of Keys Number of Children 1 2 2 3 3 4 In general, Number of children = Number of keys + 1 The leaf nodes are connected sequentially using links( Linked List ). Rules of B+ Tree For a B+ Tree of order m : At most: A node can have at most m children . A node can contain at most m − 1 keys. At least: An internal node must have at least [ m/2 ] children . An internal node must contain at least [ m/2 ] − 1 keys . Insertion...
Read more

Normalization in DBMS,(1NF,2NF,3NF,BCNF,4NF,5NF)

                      Normalization in DBMS Normalization divides a large table into smaller , logically related tables and connects them using appropriate keys. The main purpose of normalization is to reduce unnecessary duplication of data and prevent problems that may occur when data is inserted, updated, or deleted. 1. First Normal Form (1NF) A relation is said to be in First Normal Form (1NF) when every attribute contains a single, indivisible value . Conditions of   1 NF Each cell must contain only one value. Multiple values should not be stored in the same field. ·         Example Customer Items Purchased Gowsi Rice, Dal Tamil Soap ·   Here, the Items Purchased column contains more than one value for Gowsi . ·   Therefore, the table is not in 1 NF . Converting it into 1NF. ...
Read more

Hashing in Data Structure | Collision Resolution Techniques | Hashing in DBMS

  Hashing in DBMS Hashing is a technique used to map data elements (keys) to specific locations in a hash table using a hash function. It allows insertion and retrieval of data efficiently     Hash Function A hash function converts a key into a hash code (index) , which is used to store and retrieve the data from a hash table.                                 h(k)=k mod m Where: k → Key m → Hash table size h(k) → Hash index  Hash Table A hash table is a data structure that stores data in an array format . Each position in the table is called a bucket , and the position is accessed using the hash function. Example Consider Keys                   (k) = 11, 18, 20, 25, 29, 33 Hash table size (m) = 7 Hash function:    h(k)=k mod m                     ...
Read more