Skip to main content

SSO, SAML, Oauth

 

Authentication - who are you 

    Authenticate - Identity Confirmed --> Grant Access

                            -Identity Not confirmed --> Reject / 401 (Unauthorization)

Basic Auth Methods 

    - 1. Basic -2.  Api keys -3. Session

Basic - Authorization: Basic (credentials (username:password) - base64 encoded)

Digest Authentication - username:password with md5 encription 











------------------------------------------------------------

Authorization - if you can access or perform the task - authorize to do it








-----------------------------------------------------------

SAML - Security Assertion Markup Language

(XML based framework for exchanging data between two system for Authentication and Authorization 


through - SSO, OIDC WS-F


Key Component of SAML -

1. Service Provider 2. Identity Provider


Identity Provider (IdP):- popular provider 

Google, Google Workspace (Business/Commercial)

Microsoft, Okta, auth0

 Service Provider - works on SAML protocol 

         Salesforce, Microsoft 365, Google Workspaces

SAML Assertion - XML document exchanged between IdP & Service Provider

--------------------------------------

OAuth (usually for third party access)

- works with JWT (Json Web Token)



Comments

Post a Comment

Popular posts from this blog

API Basics

 
Post a Comment
Read more

Algorithm solving Common Patterns & Techniques

  These are targeted data manipulation strategies used to handle arrays, strings, and linked lists efficiently. Two Pointers : Uses two reference pointers to iterate through a data structure simultaneously, typically from opposite ends or at different speeds (Fast & Slow pointers). Sliding Window : Maintains a subset of data (a "window") over a sequential structure to track running statistics without recalculating the whole set. Prefix Sum : Pre-computes and stores cumulative sums of an array to allow for \(O(1)\) constant-time range sum queries. Dynamic Programming (DP ): Dynamic programming is an optimization technique used to solve problems by breaking them down into simpler subproblems and storing the results of these subproblems to avoid redundant computations. It is particularly effective for problems exhibiting overlapping subproblems and optimal substructure. Greedy Algorithm Breadth-First Search (BFS) / Depth-First Search (DFS) : Systematic graph and tree travers...
Post a Comment
Read more