\documentclass[11pt,twoside]{article}\makeatletter

\IfFileExists{xcolor.sty}%
  {\RequirePackage{xcolor}}%
  {\RequirePackage{color}}
\usepackage{colortbl}
\usepackage{wrapfig}
\usepackage{ifxetex}
\ifxetex
  \usepackage{fontspec}
  \usepackage{xunicode}
  \catcode`⃥=\active \def⃥{\textbackslash}
  \catcode`❴=\active \def❴{\{}
  \catcode`❵=\active \def❵{\}}
  \def\textJapanese{\fontspec{Noto Sans CJK JP}}
  \def\textChinese{\fontspec{Noto Sans CJK SC}}
  \def\textKorean{\fontspec{Noto Sans CJK KR}}
  \setmonofont{DejaVu Sans Mono}
  
\else
  \IfFileExists{utf8x.def}%
   {\usepackage[utf8x]{inputenc}
      \PrerenderUnicode{–}
    }%
   {\usepackage[utf8]{inputenc}}
  \usepackage[english]{babel}
  \usepackage[T1]{fontenc}
  \usepackage{float}
  \usepackage[]{ucs}
  \uc@dclc{8421}{default}{\textbackslash }
  \uc@dclc{10100}{default}{\{}
  \uc@dclc{10101}{default}{\}}
  \uc@dclc{8491}{default}{\AA{}}
  \uc@dclc{8239}{default}{\,}
  \uc@dclc{20154}{default}{ }
  \uc@dclc{10148}{default}{>}
  \def\textschwa{\rotatebox{-90}{e}}
  \def\textJapanese{}
  \def\textChinese{}
  \IfFileExists{tipa.sty}{\usepackage{tipa}}{}
\fi
\def\exampleFont{\ttfamily\small}
\DeclareTextSymbol{\textpi}{OML}{25}
\usepackage{relsize}
\RequirePackage{array}
\def\@testpach{\@chclass
 \ifnum \@lastchclass=6 \@ne \@chnum \@ne \else
  \ifnum \@lastchclass=7 5 \else
   \ifnum \@lastchclass=8 \tw@ \else
    \ifnum \@lastchclass=9 \thr@@
   \else \z@
   \ifnum \@lastchclass = 10 \else
   \edef\@nextchar{\expandafter\string\@nextchar}%
   \@chnum
   \if \@nextchar c\z@ \else
    \if \@nextchar l\@ne \else
     \if \@nextchar r\tw@ \else
   \z@ \@chclass
   \if\@nextchar |\@ne \else
    \if \@nextchar !6 \else
     \if \@nextchar @7 \else
      \if \@nextchar (8 \else
       \if \@nextchar )9 \else
  10
  \@chnum
  \if \@nextchar m\thr@@\else
   \if \@nextchar p4 \else
    \if \@nextchar b5 \else
   \z@ \@chclass \z@ \@preamerr \z@ \fi \fi \fi \fi
   \fi \fi  \fi  \fi  \fi  \fi  \fi \fi \fi \fi \fi \fi}
\gdef\arraybackslash{\let\\=\@arraycr}
\def\@textsubscript#1{{\m@th\ensuremath{_{\mbox{\fontsize\sf@size\z@#1}}}}}
\def\Panel#1#2#3#4{\multicolumn{#3}{){\columncolor{#2}}#4}{#1}}
\def\abbr{}
\def\corr{}
\def\expan{}
\def\gap{}
\def\orig{}
\def\reg{}
\def\ref{}
\def\sic{}
\def\persName{}\def\name{}
\def\placeName{}
\def\orgName{}
\def\textcal#1{{\fontspec{Lucida Calligraphy}#1}}
\def\textgothic#1{{\fontspec{Lucida Blackletter}#1}}
\def\textlarge#1{{\large #1}}
\def\textoverbar#1{\ensuremath{\overline{#1}}}
\def\textquoted#1{‘#1’}
\def\textsmall#1{{\small #1}}
\def\textsubscript#1{\@textsubscript{\selectfont#1}}
\def\textxi{\ensuremath{\xi}}
\def\titlem{\itshape}
\newenvironment{biblfree}{}{\ifvmode\par\fi }
\newenvironment{bibl}{}{}
\newenvironment{byline}{\vskip6pt\itshape\fontsize{16pt}{18pt}\selectfont}{\par }
\newenvironment{citbibl}{}{\ifvmode\par\fi }
\newenvironment{docAuthor}{\ifvmode\vskip4pt\fontsize{16pt}{18pt}\selectfont\fi\itshape}{\ifvmode\par\fi }
\newenvironment{docDate}{}{\ifvmode\par\fi }
\newenvironment{docImprint}{\vskip 6pt}{\ifvmode\par\fi }
\newenvironment{docTitle}{\vskip6pt\bfseries\fontsize{22pt}{25pt}\selectfont}{\par }
\newenvironment{msHead}{\vskip 6pt}{\par}
\newenvironment{msItem}{\vskip 6pt}{\par}
\newenvironment{rubric}{}{}
\newenvironment{titlePart}{}{\par }

\newcolumntype{L}[1]{){\raggedright\arraybackslash}p{#1}}
\newcolumntype{C}[1]{){\centering\arraybackslash}p{#1}}
\newcolumntype{R}[1]{){\raggedleft\arraybackslash}p{#1}}
\newcolumntype{P}[1]{){\arraybackslash}p{#1}}
\newcolumntype{B}[1]{){\arraybackslash}b{#1}}
\newcolumntype{M}[1]{){\arraybackslash}m{#1}}
\definecolor{label}{gray}{0.75}
\def\unusedattribute#1{\sout{\textcolor{label}{#1}}}
\DeclareRobustCommand*{\xref}{\hyper@normalise\xref@}
\def\xref@#1#2{\hyper@linkurl{#2}{#1}}
\begingroup
\catcode`\_=\active
\gdef_#1{\ensuremath{\sb{\mathrm{#1}}}}
\endgroup
\mathcode`\_=\string"8000
\catcode`\_=12\relax

\usepackage[a4paper,twoside,lmargin=1in,rmargin=1in,tmargin=1in,bmargin=1in,marginparwidth=0.75in]{geometry}
\usepackage{framed}

\definecolor{shadecolor}{gray}{0.95}
\usepackage{longtable}
\usepackage[normalem]{ulem}
\usepackage{fancyvrb}
\usepackage{fancyhdr}
\usepackage{graphicx}
\usepackage{marginnote}

\renewcommand{\@cite}[1]{#1}


\renewcommand*{\marginfont}{\itshape\footnotesize}

\def\Gin@extensions{.pdf,.png,.jpg,.mps,.tif}

  \pagestyle{fancy}

\usepackage[pdftitle={Secure Authentication \& Key Establishment protocol with perfect Forward Secrecy for Multi and Broad cast service in IEEE 802.16e},
 pdfauthor={}]{hyperref}
\hyperbaseurl{}

	 \paperwidth210mm
	 \paperheight297mm
              
\def\@pnumwidth{1.55em}
\def\@tocrmarg {2.55em}
\def\@dotsep{4.5}
\setcounter{tocdepth}{3}
\clubpenalty=8000
\emergencystretch 3em
\hbadness=4000
\hyphenpenalty=400
\pretolerance=750
\tolerance=2000
\vbadness=4000
\widowpenalty=10000

\renewcommand\section{\@startsection {section}{1}{\z@}%
     {-1.75ex \@plus -0.5ex \@minus -.2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\Large\bfseries}}
\renewcommand\subsection{\@startsection{subsection}{2}{\z@}%
     {-1.75ex\@plus -0.5ex \@minus- .2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\Large}}
\renewcommand\subsubsection{\@startsection{subsubsection}{3}{\z@}%
     {-1.5ex\@plus -0.35ex \@minus -.2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\large}}
\renewcommand\paragraph{\@startsection{paragraph}{4}{\z@}%
     {-1ex \@plus-0.35ex \@minus -0.2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\normalsize}}
\renewcommand\subparagraph{\@startsection{subparagraph}{5}{\parindent}%
     {1.5ex \@plus1ex \@minus .2ex}%
     {-1em}%
     {\reset@font\normalsize\bfseries}}


\def\l@section#1#2{\addpenalty{\@secpenalty} \addvspace{1.0em plus 1pt}
 \@tempdima 1.5em \begingroup
 \parindent \z@ \rightskip \@pnumwidth 
 \parfillskip -\@pnumwidth 
 \bfseries \leavevmode #1\hfil \hbox to\@pnumwidth{\hss #2}\par
 \endgroup}
\def\l@subsection{\@dottedtocline{2}{1.5em}{2.3em}}
\def\l@subsubsection{\@dottedtocline{3}{3.8em}{3.2em}}
\def\l@paragraph{\@dottedtocline{4}{7.0em}{4.1em}}
\def\l@subparagraph{\@dottedtocline{5}{10em}{5em}}
\@ifundefined{c@section}{\newcounter{section}}{}
\@ifundefined{c@chapter}{\newcounter{chapter}}{}
\newif\if@mainmatter 
\@mainmattertrue
\def\chaptername{Chapter}
\def\frontmatter{%
  \pagenumbering{roman}
  \def\thechapter{\@roman\c@chapter}
  \def\theHchapter{\roman{chapter}}
  \def\thesection{\@roman\c@section}
  \def\theHsection{\roman{section}}
  \def\@chapapp{}%
}
\def\mainmatter{%
  \cleardoublepage
  \def\thechapter{\@arabic\c@chapter}
  \setcounter{chapter}{0}
  \setcounter{section}{0}
  \pagenumbering{arabic}
  \setcounter{secnumdepth}{6}
  \def\@chapapp{\chaptername}%
  \def\theHchapter{\arabic{chapter}}
  \def\thesection{\@arabic\c@section}
  \def\theHsection{\arabic{section}}
}
\def\backmatter{%
  \cleardoublepage
  \setcounter{chapter}{0}
  \setcounter{section}{0}
  \setcounter{secnumdepth}{2}
  \def\@chapapp{\appendixname}%
  \def\thechapter{\@Alph\c@chapter}
  \def\theHchapter{\Alph{chapter}}
  \appendix
}
\newenvironment{bibitemlist}[1]{%
   \list{\@biblabel{\@arabic\c@enumiv}}%
       {\settowidth\labelwidth{\@biblabel{#1}}%
        \leftmargin\labelwidth
        \advance\leftmargin\labelsep
        \@openbib@code
        \usecounter{enumiv}%
        \let\p@enumiv\@empty
        \renewcommand\theenumiv{\@arabic\c@enumiv}%
	}%
  \sloppy
  \clubpenalty4000
  \@clubpenalty \clubpenalty
  \widowpenalty4000%
  \sfcode`\.\@m}%
  {\def\@noitemerr
    {\@latex@warning{Empty `bibitemlist' environment}}%
    \endlist}

\def\tableofcontents{\section*{\contentsname}\@starttoc{toc}}
\parskip0pt
\parindent1em
\def\Panel#1#2#3#4{\multicolumn{#3}{){\columncolor{#2}}#4}{#1}}
\newenvironment{reflist}{%
  \begin{raggedright}\begin{list}{}
  {%
   \setlength{\topsep}{0pt}%
   \setlength{\rightmargin}{0.25in}%
   \setlength{\itemsep}{0pt}%
   \setlength{\itemindent}{0pt}%
   \setlength{\parskip}{0pt}%
   \setlength{\parsep}{2pt}%
   \def\makelabel##1{\itshape ##1}}%
  }
  {\end{list}\end{raggedright}}
\newenvironment{sansreflist}{%
  \begin{raggedright}\begin{list}{}
  {%
   \setlength{\topsep}{0pt}%
   \setlength{\rightmargin}{0.25in}%
   \setlength{\itemindent}{0pt}%
   \setlength{\parskip}{0pt}%
   \setlength{\itemsep}{0pt}%
   \setlength{\parsep}{2pt}%
   \def\makelabel##1{\upshape ##1}}%
  }
  {\end{list}\end{raggedright}}
\newenvironment{specHead}[2]%
 {\vspace{20pt}\hrule\vspace{10pt}%
  \phantomsection\label{#1}\markright{#2}%

  \pdfbookmark[2]{#2}{#1}%
  \hspace{-0.75in}{\bfseries\fontsize{16pt}{18pt}\selectfont#2}%
  }{}
      \def\TheFullDate{2011-08-25 (revised: 25 August 2011)}
\def\TheID{\makeatother }
\def\TheDate{2011-08-25}
\title{Secure Authentication \& Key Establishment protocol with perfect Forward Secrecy for Multi and Broad cast service in IEEE 802.16e}
\author{}\makeatletter 
\makeatletter
\newcommand*{\cleartoleftpage}{%
  \clearpage
    \if@twoside
    \ifodd\c@page
      \hbox{}\newpage
      \if@twocolumn
        \hbox{}\newpage
      \fi
    \fi
  \fi
}
\makeatother
\makeatletter
\thispagestyle{empty}
\markright{\@title}\markboth{\@title}{\@author}
\renewcommand\small{\@setfontsize\small{9pt}{11pt}\abovedisplayskip 8.5\p@ plus3\p@ minus4\p@
\belowdisplayskip \abovedisplayskip
\abovedisplayshortskip \z@ plus2\p@
\belowdisplayshortskip 4\p@ plus2\p@ minus2\p@
\def\@listi{\leftmargin\leftmargini
               \topsep 2\p@ plus1\p@ minus1\p@
               \parsep 2\p@ plus\p@ minus\p@
               \itemsep 1pt}
}
\makeatother
\fvset{frame=single,numberblanklines=false,xleftmargin=5mm,xrightmargin=5mm}
\fancyhf{} 
\setlength{\headheight}{14pt}
\fancyhead[LE]{\bfseries\leftmark} 
\fancyhead[RO]{\bfseries\rightmark} 
\fancyfoot[RO]{}
\fancyfoot[CO]{\thepage}
\fancyfoot[LO]{\TheID}
\fancyfoot[LE]{}
\fancyfoot[CE]{\thepage}
\fancyfoot[RE]{\TheID}
\hypersetup{citebordercolor=0.75 0.75 0.75,linkbordercolor=0.75 0.75 0.75,urlbordercolor=0.75 0.75 0.75,bookmarksnumbered=true}
\fancypagestyle{plain}{\fancyhead{}\renewcommand{\headrulewidth}{0pt}}

\date{}
\usepackage{authblk}

\providecommand{\keywords}[1]
{
\footnotesize
  \textbf{\textit{Index terms---}} #1
}

\usepackage{graphicx,xcolor}
\definecolor{GJBlue}{HTML}{273B81}
\definecolor{GJLightBlue}{HTML}{0A9DD9}
\definecolor{GJMediumGrey}{HTML}{6D6E70}
\definecolor{GJLightGrey}{HTML}{929497} 

\renewenvironment{abstract}{%
   \setlength{\parindent}{0pt}\raggedright
   \textcolor{GJMediumGrey}{\rule{\textwidth}{2pt}}
   \vskip16pt
   \textcolor{GJBlue}{\large\bfseries\abstractname\space}
}{%   
   \vskip8pt
   \textcolor{GJMediumGrey}{\rule{\textwidth}{2pt}}
   \vskip16pt
}

\usepackage[absolute,overlay]{textpos}

\makeatother 
      \usepackage{lineno}
      \linenumbers
      
\begin{document}

             \author[1]{A.K.M. NAZMUS  SAKIB}

             \author[2]{Fariha Tasmin  Jaigirdar}

             \author[3]{Samiur  Rahman}

             \affil[1]{  }

\renewcommand\Authands{ and }

\date{\small \em Received: 18 July 2011 Accepted: 10 August 2011 Published: 25 August 2011}

\maketitle


\begin{abstract}
        


Many complicated authentication and encryption techniques have been embeddedMany complicated authentication and encryption techniques have been embedded into WiMAX but it still facing a lot of challenging situations. This paper shows that, GTEK Hash chain algorithm for Multi and Broadcast service of IEEE 802.16e facing a reduced forward secrecy problem. These vulnerabilities are the possibilities to forge key messages in Multiand Broadcast operation, which are susceptible to forgery and reveals important management information. In this paper, we also propose three UAKE protocols with PFS (Perfect Forward Secrecy) that are efficient and practical for mobile devices.

\end{abstract}


\keywords{Multi and Broadcast Service, IEEE 802.16e, Perfect Forward Secrecy, Authentication, Key  Establishment, Hash function.}

\begin{textblock*}{18cm}(1cm,1cm) % {block width} (coords) 
\textcolor{GJBlue}{\LARGE Global Journals \LaTeX\ JournalKaleidoscope\texttrademark}
\end{textblock*}

\begin{textblock*}{18cm}(1.4cm,1.5cm) % {block width} (coords) 
\textcolor{GJBlue}{\footnotesize \\ Artificial Intelligence formulated this projection for compatibility purposes from the original article published at Global Journals. However, this technology is currently in beta. \emph{Therefore, kindly ignore odd layouts, missed formulae, text, tables, or figures.}}
\end{textblock*}


\let\tabcellsep& 	 	 		 
\section[{INTRODUCTION}]{INTRODUCTION}\par
he Multicast and Broadcast service offers the possibility to distribute data to multiple M.S. with one single message. This saves cost and bandwidth. Broadcasted messages in IEEE 802.16e are encrypted symmetrically with a shared key \hyperref[b0]{[1]}. Every member in the group knows the key \& can decrypt the traffic. Message authentication is also based on the same shared key. This algorithm contains the vulnerability that every group member, besides decrypting and verifying broadcast messages, can also encrypt and authenticate messages as if they originate from the legitimate B.S \hyperref[b0]{[1,}\hyperref[b4]{3,}\hyperref[b5]{4,}\hyperref[b6]{5]}. Another aspect which is much more problematic is the distribution of the traffic encryption keys (GTEKs), when the optional Multicast and Broadcast Rekeying Algorithm (MBRA) is used \hyperref[b7]{[6]}. To transfer a GTEK to all group members it is broadcasted but encrypted with the key encryption key (GKEK). Due to broadcasting, the GKEK must also be a shared key and every group member knows it \hyperref[b0]{[1]}. Thus are adversary group member can use it to generate valid encrypted and authenticated GTEK key update command messages \& distribute an own GTEK \hyperref[b0]{[1]}. Every group member would establish the adversary's key as a valid next GTEK. \hyperref[b0]{[1]} Subsequently all traffic sent by the legitimate B.S can no longer be decrypted by the M.S. From M.Ss point of view only traffic from the adversary is valid. To force M.Ss to establish the adversary's key, there are several possibilities; If the implementation does not work properly, the key from the latter of two subsequently sent GTEK update command messages may overwrite the former one. Hence, the adversary just has to send its GTEK update command message after the B.S broadcasted a key update message. If the implementation follows the standard, the keys of both messages are accepted \hyperref[b0]{[1]}. To be sure the M.S will not establish the legitimate B.Ss key; an intruder could forge some part of the B.Ss GTEK update command message \hyperref[b0]{[1]}; Such a changed message would not be verified as correct and discarded by the M.Ss. After this, the adversary can send its own GTEK update command message which will be accepted \hyperref[b0]{[1,}\hyperref[b8]{7]}. In a unicast connection, this different keying material at the mobile station would be detected as the B.S cannot decrypt data sent by the M.S. This result in a TEK invalid message destined to the M.S which subsequently refreshes its keying material \hyperref[b0]{[1]}. Since the M.Bs is only unidirectional so; the B.S unable to detect that M.S has different GTEKs. 
\section[{II. SHARED KEY IN MULTICAST AND BROADCAST SERVICE}]{II. SHARED KEY IN MULTICAST AND BROADCAST SERVICE}\par
A shared key cannot be used as every group member can forge messages when having the current symmetric keys \hyperref[b0]{[1]}. Instead the GTEK update command message could be sent to each M.S in a unicast way like the GKEK update command message \hyperref[b0]{[1]}. The key should then be encrypted with the M.S related KEK which is only known by this individual M.S. The BS sends the GTEK update command message by itself when the current key's lifetime is going to expire \hyperref[b0]{[1]}. The Fig.  {\ref 1} shows this. Another solution is the use of public key cryptography. Here, the GTEK update command message remains broadcasted and encrypted with the shared key GKEK but is additionally signed by an asymmetric signature \hyperref[b0]{[1]}. M.Ss receiving a GTEK update command message can verify the signature of the B.S and subsequently decrypt the GTEK with the shared GKEK \hyperref[b0]{[1]}. The Fig.  {\ref 2} shows this method together with the unicasted GKEK update command message.\par
A third possibility is to generate GTEKs as part of a one way hash chaining function (Fig. \hyperref[fig_1]{3}). Here the B.S has to generate a random number which represents the initial key GTEK0 \hyperref[b0]{[1]}. Then the other GTEKs are generated by applying a one way hash function to previous GTEKs respectively. This is iterated n times. G GTEK0 = random () GTEK1 = f (GTEK0) GTEK2 = f (GTEK1) GTEKn = f (GTEKn-1) 
\section[{Way}]{Way}\par
To apply this algorithm, the key GKEK update command message has to be capable of transporting GKEK and GTEK keys together \hyperref[b0]{[1]}. The design of the key update command message already includes both keys so only a little modification is needed here. Additionally the GTEK state machine at B.S must generate the GTEK hash chain \& store all the keys. The GTEK state machine at M.S must add the functionality to authenticate GTEK keys by calculating the hash function and comparing it to the previous key \hyperref[b0]{[1]}. A drawback of this algorithm is that it has a reduced forward secrecy \hyperref[b0]{[1]}. This means a M.S joining the group can decrypt all broadcasted data since the last hash chain generation. If forward secrecy is crucial, the hash chain has to be regenerated each time a M.S enters the group \hyperref[b0]{[1]}. When using an asymmetric signature or a hash chain to authenticate the GTEK transfer, only one message is needed to update the keys of all M.S due to broadcasting \hyperref[b0]{[1]}. Thus the introduced traffic in these solutions is constant and does not depend on the number of members in the group \hyperref[b0]{[1]}. Another important fact is that, for unicasting the computing power requirement is very low. Because here the M.S just have to verify the HMAC \& save the keys \hyperref[b0]{[1]}. Also the use of a hash chain does not require much computation. Here the M.S has to calculate the hash function of the received key and compare it with the saved key \hyperref[b0]{[1]}.  
\section[{THE PROPOSED PROTOCOLS}]{THE PROPOSED PROTOCOLS}\par
In this section, we propose three user authentication with key establishment protocols (UAKE) satisfying: Class-1, Class-3, and Class-7 PFS. The proposed protocols only use one-way hash functions \& exclusive-or (XOR) operations. Each proposed protocol involves two phases: 1) the initialization phase 2) the user authentication with key establishment phase. Table  {\ref I} shows the notations used throughout our protocols.  Step 5.\par
As computes K = MD AS h (R AS ) and checks whether M AS\textunderscore MAC is the same with h(R AS || K). If they are the same, AS can obtain the session key K and then sends (ID MD , M MD , M MD MAC ) to MD.\par
Step 6.\par
After receiving (ID MD , M MD , M MD\textunderscore MAC ), MD computes K = M MD h (R MD ) and checks whether M MD\textunderscore MAC is the same with h(R MD || K). If they are the same, MD also can obtain K.\par
b) The Proposed UAKE Protocol with Class-7 PFS In this protocol, an attacker cannot get the previous session keys even if PW MD , S AS , and x are all disclosed. The process is explained below. 
\section[{i. The initialization phase:}]{i. The initialization phase:}\par
Before the protocol begins, S computes A MD = h(ID MD || x) and stores it in MD. Also, S computes A AS = h (ID AS || x) and sends it to AS via a secure channel.\par
ii. User authentication with key agreement phase:\par
Step 1. MD chooses a large prime p, a primitive The proposed protocols only use one-way hash protocols also provide three kinds of PFS to meet different requirements. Therefore, compared with Sun and Yeh's protocols, our protocols are more efficient and practical for mobile devices. Wherever Times is specified, Times Roman or Times New Roman may be used. If neither is available on your word processor, please use the font closest in appearance to Times. Avoid using bit-mapped fonts if possible. True-Type 1 or Open Type fonts are preferred. Please embed symbol fonts, as well, for math, etc. 
\section[{IV. SECURITY ANALYSIS AND DISCUSSIONS}]{IV. SECURITY ANALYSIS AND DISCUSSIONS}\par
In this section, we discuss some potential attacks which might occur on the proposed protocols. 
\section[{a) Replay attack}]{a) Replay attack}\par
The replay attack is an attack in which an attacker can use the previous eavesdropped messages to login the server without being detected \hyperref[b9]{[8]}. Now, we are going to demonstrate in this subsection that, the i. The proposed UAKE protocol with Class-1 PFS: After sending (ID MD , ID AS , M 1 , M 1\textunderscore MAC) to S , an attacker can get M MD in Step 4. However, the attacker can't have A MD = h(ID MD || x) that contains a secret key x protected by one-way hashing function. This also means that he cannot extract R MD to obtain K or PW MD by computing K = M MD R MD or PW MD = h(ID MD || R MD ) M 1\textunderscore MAC . Thus, this protocol can prevent the replay attack.\par
ii. The proposed UAKE protocol with Class-3 PFS:\par
An attacker replays (ID MD , ID AS , M 1 , M 1\textunderscore MAC ) to AS in Step 1 and receives (ID MD , M MD , M MD\textunderscore MAC ) in Step 5.\par
Because both A MD and R MD are unknown, the attacker cannot extract K or PW MD . As a result, the replay attack cannot be mounted in this protocol.\par
iii. The proposed UAKE protocol with Class-7 PFS:\par
Even if an attacker sends (ID MD , ID AS , M 1 , M 1\textunderscore MAC ) to AS in Step 1, he cannot obtain K or PW MD from AS's reply. Without A MD , the attacker cannot obtain g d by computing g d = M 1 A MD . Also, the attacker faces the discrete logarithm problem in computing d. Thus, it is quite impossible for the replay attack to occur in this protocol. 
\section[{b) Password guessing attack}]{b) Password guessing attack}\par
This attack refers to an intruder attempts to pass the authentication with certain guessed password \hyperref[b10]{[9,}\hyperref[b11]{10,}\hyperref[b12]{11]}. The following discussions show, how the proposed protocols can prevent the password guessing attack. to check whether M * 1\textunderscore MAC is the same with h(ID MD || R MD ) PW MD \hyperref[b10]{[9]}. The result is S will find the equation is not correct and then refuse the request. Moreover, the intruder has no extra information to verify the guessed password PW MD * . Therefore, the password guessing attack does not work in this protocol. Step 3. Thus, the password guessing attack is prevented.\par
iii. However, the attacker cannot further get the session key K by computing K = h(R MD ) M MD without A MD \hyperref[b13]{[12]} . Thus, this protocol can provide Class-1 PFS.\par
ii. The proposed UAKE protocol with Class-3 PFS:\par
When PW MD and S AS are disclosed, an attacker can obtain h(ID MD || R MD ) = M 1\textunderscore MAC PW MD and h(ID AS || R AS ) = M 2\textunderscore MAC S AS . However, the attacker still cannot know A MD and A AS , which are stored in MD and AS respectively  {\ref [16]}. Consequently, the attacker cannot extract R MD and R AS from M 1 = A MD R MD and M 2 = A AS R AS . That is, the attacker cannot get the session key K by computing K = M MD h(R MD ) or K = M AS h(R AS ). This protocol can provide Class-3 PFS [16].\par
iii. The proposed UAKE protocol with Class-7 PFS:\par
When PW MD , S AS and x are all disclosed, an attacker can obtain g d and g a by g d = M 1 h(ID MD || x) and g a = M 2 h(ID AS || x). Moreover, the attacker can derive k CS = M MD g d and k AS = M AS g a . To get the session key K = g ads , the attacker has to solve Diffie-Hellman problem  {\ref [16]}. Nevertheless, this is hard to be accomplished. Therefore, this protocol can provide Class-7 PFS.\par
V. 
\section[{CONCLUSION}]{CONCLUSION}\par
Secured data transmission is one of the prime aspects of wireless networks as they are much more vulnerable to security attacks. In this paper, we explore the possibility of key forgery in Multi-and Broadcast service. We proposed three UAKE protocols with PFS based upon one-way hash functions and XOR operations. The computation loads and power supply requirements are less, which make this protocol more efficient and suitable than other.\begin{figure}[htbp]
\noindent\textbf{12}\includegraphics[]{image-2.png}
\caption{\label{fig_0}Fig. 1 :Fig. 2 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{3}\includegraphics[]{image-3.png}
\caption{\label{fig_1}Fig. 3 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-4.png}
\caption{\label{fig_2}Global}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-5.png}
\caption{\label{fig_3}}\end{figure}
   \begin{figure}[htbp]
\noindent\textbf{1} \par 
\begin{longtable}{P{0.07900641025641025\textwidth}P{0.7709935897435897\textwidth}}
Notations\tabcellsep Description\\
MD\tabcellsep the mobile device\\
S\tabcellsep the authentication server\\
AS\tabcellsep the application server\\
ID MD\tabcellsep the identity of MD\\
ID S\tabcellsep the identity of S\\
ID AS\tabcellsep the identity of AS\\
x\tabcellsep a secret key held by the\\
\tabcellsep the password of MD\\
\tabcellsep the shared key between S and AS\\
\tabcellsep a secure one-way hash function\\
\tabcellsep string concatenation operation\\
\tabcellsep exclusive-or operation\end{longtable} \par
  {\small\itshape [Note: Secure Authentication \& Key Establishment Protocol with Perfect Forward Secrecy for Multi and Broad Cast Service in IEEE 802.16e © 2011 Global Journals Inc. (US)]} 
\caption{\label{tab_0}Table 1 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{} \par 
\begin{longtable}{P{0.85\textwidth}}
proposed protocols can successfully withstand the\\
replay attack.\\
2011\\
September\\
32\\
functions and XOR operations. Moreover, the proposed\end{longtable} \par
  {\small\itshape [Note: © 2011 Global Journals Inc. (US) Global Journal of Computer Science and Technology Volume XI Issue XVI Version I]} 
\caption{\label{tab_1}}\end{figure}
 			\footnote{© 2011 Global Journals Inc. (US) Global Journal of Computer Science and Technology Volume XI Issue XVI Version I} 		 		\backmatter  			  				\begin{bibitemlist}{1}
\bibitem[Hwang et al. ()]{b6}\label{b6} 	 		‘A simple remote user authentication protocol’.  		 			M S Hwang 		,  		 			C C Lee 		,  		 			Y L Tang 		.  	 	 		\textit{Mathematical and Computer Modelling}  		2002. 36 p. .  	 
\bibitem[Kwon et al. ()]{b9}\label{b9} 	 		‘An improvement of the password-based authentication protocol (K1P) on security against replay attacks’.  		 			T Kwon 		,  		 			M Kang 		,  		 			Jung 		,  		 			J Song 		.  	 	 		\textit{IEICE Transactions on Communications}  		1999. p. .  	 
\bibitem[Kuo ()]{b7}\label{b7} 	 		\textit{Analysis of 802.16e Multicast/Broadcast group privacy rekeying protocol},  		 			Ju-Yi Kuo 		.  		2006. Stanford University, CA, USA.  	 
\bibitem[Han et al.]{b8}\label{b8} 	 		\textit{Analysis of Mobile WiMAX security: vulnerabilities and Solutions},  		 			Tao Han 		,  		 			Ning Zhang 		,  		 			Kaiming Liu 		,  		 			Bihua Tang 		.  		 		 			Liu Key Lab Of Universal Wireless Communications, Ministry of Education (Beijing University of Posts and Telecommunications 		 	 
\bibitem[Kwon and Song ()]{b13}\label{b13} 	 		‘Authenticated key exchange protocols resistant to password guessing attacks’.  		 			T Kwon 		,  		 			J Song 		.  	 	 		\textit{IEE Proceedings Communications}  		1998. 145 p. .  	 
\bibitem[Global Journal of Computer Science and Technology Volume XI Issue XVI Version I]{b3}\label{b3} 	 		\textit{Global Journal of Computer Science and Technology Volume XI Issue XVI Version I},  		33 p. 2011.  	 
\bibitem[Bresson et al. ()]{b1}\label{b1} 	 		‘Mutual authentication and group key agreement for low-power mobile devices’.  		 			E Bresson 		,  		 			O Chevassut 		,  		 			A Essiari 		,  		 			D Pointcheval 		.  	 	 		\textit{Computer Communications}  		2004. 27 p. .  	 
\bibitem[Gong ()]{b10}\label{b10} 	 		‘Optimal authentication protocols resistant to password guessing attacks’.  		 			L Gong 		.  	 	 		\textit{Proceedings of The Eighth IEEE Computer Security Foundations Workshop},  				 (The Eighth IEEE Computer Security Foundations WorkshopIreland)  		1995. p. .  	 
\bibitem[Sun and Yeh ()]{b12}\label{b12} 	 		‘Password-based authentication and key distribution protocols with perfect forward secrecy’.  		 			H M Sun 		,  		 			H T Yeh 		.  	 	 		\textit{Journal of Computer and System Sciences}  		2006. 72 p. .  	 
\bibitem[Gong et al. ()]{b11}\label{b11} 	 		‘Protecting poorly chosen secrets from guessing attacks’.  		 			L Gong 		,  		 			M Lomas 		,  		 			R Needham 		,  		 			J Saltzer 		.  	 	 		\textit{IEEE Journal on Selected Areas in Communications}  		1993. 11 p. .  	 
\bibitem[Chien and Jan ()]{b4}\label{b4} 	 		‘Robust and simple authentication protocol’.  		 			H Y Chien 		,  		 			J K Jan 		.  	 	 		\textit{Computer Journal}  		2003. 46 p. .  	 
\bibitem[Secure Authentication & Key Establishment Protocol with Perfect Forward Secrecy for Multi and Broad Cast Service in IEEE 802 Global Journals Inc ()]{b2}\label{b2} 	 		‘Secure Authentication \& Key Establishment Protocol with Perfect Forward Secrecy for Multi and Broad Cast Service in IEEE 802’.  	 	 		\textit{Global Journals Inc}  		2011. US.  	 
\bibitem[Sakib and Kawsor ()]{b0}\label{b0} 	 		‘Shared key Vulnerability in IEEE 802.16e: Analysis \& Solution’.  		 			A K M Sakib 		,  		 			Mir Md Saki Kawsor 		.  	 	 		\textit{International Conference on Computer \& Information Technology},  				2010. IEEE.  	 
\bibitem[Sandirigama et al. ()]{b5}\label{b5} 	 		‘Simple and secure password authentication protocol (SAS)’.  		 			M Sandirigama 		,  		 			A Shimizu 		,  		 			M T Noda 		.  	 	 		\textit{IEICE Transactions on Communications}  		2000. p. .  	 
\end{bibitemlist}
 			 		 	 
\end{document}
