\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={RASCP: Providing for a Secure Group Communication Plane Using RFID},
 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{2012-01-15 (revised: 15 January 2012)}
\def\TheID{\makeatother }
\def\TheDate{2012-01-15}
\title{RASCP: Providing for a Secure Group Communication Plane Using RFID}
\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]{  ks}

             \author[2]{Dr. Somashekhar C  Desai}

             \author[3]{Chandramouli  H}

             \affil[1]{  JJT University}

\renewcommand\Authands{ and }

\date{\small \em Received: 6 December 2011 Accepted: 5 January 2012 Published: 15 January 2012}

\maketitle


\begin{abstract}
        


Predominantly large distributed networks currently provide support for group oriented protocols and applications. Regardless of the type of distributed network there is a need to provide communication privacy and data integrity to the information exchange amongst the group members.This paper introduces a protocol named RFID Authentication based Secure Communication Plane (RASCP). RASCP adopts the commutative RSA algorithm to maintain data integrity. The proposed protocol not only eliminates the overheads resulting from key distribution and key compromise attacks but also provide for information security in the presence of colluded group members. Radio Frequency Identification (RFID) tags is used for group member identification. The RACP protocol is compared with the RFID extended Secure Lock (RSL) group communication protocol and its efficiency in terms of the computational complexity involved is discussed in this paper.

\end{abstract}


\keywords{RFID, RFID security, RFID authentication secure group communication, cryptography, commutative rsa, secure plane, computational cost, sieve of eratost}

\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
FID systems and standards established by IEEE \hyperref[b0]{[1,}\hyperref[b1]{2]} are envisioned to be one of the most commonly used identification mechanisms in the near future \hyperref[b2]{[3]}. A RFID authentication system primarily consists of a tag and a reader with a database to store the tag details. Tags available are of several types and classes \hyperref[b0]{[1]} \hyperref[b1]{[2]} but the research work presented here considers the most commonly available passive RFID tags of class 0. A lot of research is ongoing to provide security to the existing standards and the technology involved in manufacturing and Radio Frequency (RF) communication systems in place. Currently there exist several threats to the existing RFID deployments like Denial of Service Attacks, RFID Tag Cloning, RFID Tag Tracing, Eavesdropping, Replay Attacks Data Forging, Invading Privacy Information and Hot-listing to name a few \hyperref[b2]{[3]}[4] \hyperref[b4]{[5]}[6] \hyperref[b6]{[7]}[8] \hyperref[b8]{[9]} \hyperref[b9]{[10]}. More often than not researchers have focused on the eliminating the threats that currently exist in the RFID technology and methods towards improving it. In the research work presented here the use of the existing RFID technology for identification is adopted. The proposed protocol i.e. ?????????? assumes that the RFID communication module considered is secure and free of the above mentioned defects/attacks.\par
Communication provisioning is considered as the basic essentials of any network. The prevalent large scale distributed networks existent provide support for various business, personal, commerce, banking, military, intelligence applications and services. These networks are prone to varied kind of attacks and data compromise issues. To counter the issue of data compromise cryptography is commonly used. Cryptographic algorithms could be broadly classified into two types namely Symmetric and Asymmetric type. The ?????????? protocol proposed utilizes the asymmetric commutative RSA Algorithm to provide for security. These algorithms are discussed in detail in the future sections of this paper.\par
The remaining paper is organized as follows. Section II discusses the commutative RSA algorithm. The Sieve of Eratosthenes prime number generation algorithm is discussed in the next section. The fourth section of the paper provides an in depth explanation of the proposed ??????????group communication scheme. The fifth section of the paper presents the RFID extended secure lock group communication scheme. The penultimate section of the paper discusses the experimental evaluation wherein the propose ?????????? and the ?????? are compared. The conclusion and the future work is discussed in the last section of the paper. 
\section[{II.}]{II.} 
\section[{Commutative rsa}]{Commutative rsa}\par
A secure plane is realizable provided the data communicated over the plane is protected and cannot be colluded.  
\section[{Prime number generation}]{Prime number generation}\par
Prime number generation functions and their application to the arena of cryptography have been extensively studied by researchers. The ???????? proposed in this paper utilizes the Sieve of Eratosthenes Algorithm \hyperref[b10]{[11]}   
\section[{IX. End For Each}]{IX. End For Each}\par
Using the Encryption and Decryption Key Pair Computation algorithm all the group members ? ?? ? ?? compute the encryption and decryption key pairs which enable to construct the envisioned secure communication plane. The ?????????? discussed eliminates the security arising from key exchange \hyperref[b13]{[14]}, negating key compromise \hyperref[b14]{[15]} external server maintenance for key management \hyperref[b15]{[16]} proving the efficiency in creating a secure communication plane. Let us consider ?? users of the group ?? that need to communicate securely and the secure communication group ?? ? is defined as?? ? = \{? 1 , ? 2 , ? 3 , ? ? . ? ?? \}\par
Where ?? ? ?? and ?? ? ? ??\par
The secure communication plane consisting of ?? group members communicate data by using a series of encryption and decryption operations. The commutative nature of the ?????? algorithm adopted in the ?????????? ensures that the data communicated is encrypted at least once i.e. the original data is encrypted and then only communicated over the plane thereby securing the data. The presence of any colluded users within the group represented by ? ?? , on intercepting the data would not be unable to determine the level of encryptions and decryption procedures performed on the data prior to his interception. In the case if the user ? ?? ? ?? intercepts the data after the first encryption, ? ?? would not be able to recover the data as the encryption and the  
\section[{XVI. End For}]{XVI. End For}\par
Using the Communication over Secure Plane Algorithm discussed above the ? ?????? is able to receive the data ?? sent by the user ? ???????? using ?? number of encryption and decryption functions. The algorithm also highlights the fact that the data ?? to be transmitted is not transmitted in the original form i.e. it is encrypted and transmitted there by securing the data.\par
The ??????????discussed utilizes the ???????? tags available with each group member ? ?? to construct the secure communication plane. The RFID tags are often used for identification and tracking. In ?????????? the RFID tags are used both for security provision and identification. As the ?????????? adopts multiple encryption and multiple decryptions to securely communicate data the overheads arising from this could be considered as a drawback of the ??????????. The ?????????? is evaluated with the Secure Lock secure group communication protocol in the subsequent section of this paper. 
\section[{V.}]{V.}\par
Rfid extended secure lock group communication scheme (??????)   The ?????? is a ???????? based extended Secure Lock protocol \hyperref[b16]{[17]}. The ?????? protocol considers a central server and a set of group members defined as?? ?????? = \{? 1 ?????? , ? 2 ?????? , ? 3 ?????? , ? ? . ? ?? ?????? \}\par
The ?????? protocol incorporates an asymmetric cryptographic algorithm to provide security. Let the Year private and public of a group member ? ?? ?????? ? ?? ?????? be represented as (?? ?????? ?? , ?? ?????? ?? ) . The central server also known as the security server establishes a set of ?? = |?? ?????? | pair wise relatively prime numbers ?? 1 , ? . , ?? ?? from the ???????? tags possessed using the Sieve of Eratosthenes Prime number generation algorithm. These numbers are then assigned to group members ? ?? ?????? ? ?? ?????? and are assumed to be public in nature. To establish a secure plane of for communication using the ?????? the server computes the following based on the a randomly selected key represented as ?? ?????? Colluded group members on decryption cannot obtain the lock ?? ?????? selected by the server accurately hence providing for security.\par
The Chinese remainder theorem utilized by the server provides protection by securing the group membership and group size. The use of the Chinese remainder theorem and asymmetric cryptographic schemes render the ?????? group communication scheme inefficient and are not scalable. 
\section[{VI.}]{VI.} 
\section[{Performance evaluation}]{Performance evaluation}\par
This ?????????? secure communication mechanism proposed in this paper is compared with the ?????? protocol in terms of the computational costs incurred. The computational cost incurred is proportional to the execution time observed. The ??????????and the ?????? systems were developed using C\#.Net on the Visual Studio 2010 Platform. The ???????? tags used were of type 0. The ???????? readers were integrated into the platform using VC++.Net. To evaluate the ?????????? and the ?????? secure group communication systems and to observe the computational costs the number of users in the group were varied from 5, 10, 20, 50, 70 and 100 users. The observations were monitored using log files maintained for every operation. The introduction of the ???????? tags into the ?????????? and ?????? can be considered as an overhead that exists in reading the tags and the average time observed in reading the RFID tags when the number of group members are varied from 5, 10,20,50,70 and 100 is as shown in Fig 1  {\ref .} It could be observed that the average of the overheads observed reduces as the number of users increase proving that the induction of the ???????? based security systems are scalable in nature and do not affect the responsiveness of the systems. The average time taken to read a ???????? tags was found to be about 0.76ms. The ?????? secure group communication system adopts the RSA Algorithm with a key strength of 1024 \hyperref[b19]{[19]} bits to incorporate secure transmissions amongst the group members. The ?????????? adopts the commutative RSA algorithm to construct a secure communication plane. The ?????? relies on a central server for key initialization, distribution using locks and the verifications is carried out by the group members. The experimental evaluation conducted considered the protocol initialization phase as the time taken to verify the group membership and derive the cryptographic keys. The computational overheads observed are as shown in Fig.  {\ref 2}. It could be observed that the overheads are reduced by about 99.43\% in the initialization phase in the ?????????? protocol. The ?????? considers a central server and the verification process of the group members. The overheads resulting from the group membership verification process for the ?????? scheme is as shown in Form the figures it is clear that the commutative RSA algorithm adopted in the ??????????is computationally less expensive when compared to the RSA cryptographic algorithm adopted in the ?????? group communication scheme ye providing security.  
\section[{Operations}]{Operations}\par
The experimental evaluation discussed in this paper prove that the proposed ?????????? group communication protocol introduced in this paper performs better than the existing ?????? scheme by reducing the computational overheads and yet providing security of the data transacted amongst the group members. 
\section[{VII.}]{VII.} 
\section[{Conclusion and future work}]{Conclusion and future work}\par
RFID devices are universally used for the purpose of identifications. Many researchers have focused on improving the security of RFID systems in place. This paper introduces a RFID Authentication based Secure Communication Plane (??????????) felicitating secure transmissions amongst group members. The ?????????? protocol adopts the commutative RSA algorithm to preserve the integrity of the data transacted over the communication plane. The RFID tags are used for the purpose of identification and for protocol initialization. The proposed ??????????scheme is compared with the ?????? secure group communication scheme. The ?????????? scheme proposed overcomes the drawbacks arising from key distribution, key compromise and external trusted server requirements, yet providing security in the presence of even colluded users. The experimental study conducted proves the efficiency of the proposed ?????????? over the ?????? group communication scheme. The future of the work presented here is to compare the RASCP scheme with other secure group communication schemes using RFID tags. \begin{figure}[htbp]
\noindent\textbf{1}\includegraphics[]{image-2.png}
\caption{\label{fig_1}Figure 1 :}\end{figure}
   \begin{figure}[htbp]
\noindent\textbf{} \par 
\begin{longtable}{P{0.7451318101933215\textwidth}P{0.03137082601054481\textwidth}P{0.02718804920913884\textwidth}P{0.008066783831282951\textwidth}P{0.038242530755711775\textwidth}}
\multicolumn{4}{l}{??????????\textunderscore ?? ???????? and ??????????\textunderscore ?? ???????? are computed using the following}\tabcellsep III.\\
\multicolumn{4}{l}{??????????\textunderscore ?? ???????? = ????????????\textunderscore ?? ?? ???????? ? × ???????????\textunderscore ?? ?? ???????? ??}\\
\multicolumn{4}{l}{??????????\textunderscore ?? ???????? = ????????????\textunderscore ?? ?? ???????? ? 1?}\\
\tabcellsep \tabcellsep \multicolumn{2}{l}{× ???????????\textunderscore ?? ?? ???????? ? 1??}\\
\multicolumn{4}{l}{From the above equations it is clear that}\\
\multicolumn{4}{l}{??????????\textunderscore ?? ?? ??????????\textunderscore ?? ?? ???????? = ??????????\textunderscore ?? ?? ???????? for ?? and ?? . The encryption key pair ???????? = ???????? and ??????????\textunderscore ?? ??}\\
\multicolumn{4}{l}{of ?? and ?? represented as}\\
( ??????????\textunderscore ?? ?? ( ??????????\textunderscore ?? ??\tabcellsep \multicolumn{3}{l}{???????? , ??????????\textunderscore ?? ?? ???????? , ??????????\textunderscore ?? ??}\tabcellsep ???????? ) and ???????? )\\
\multicolumn{4}{l}{is to be obtained.}\tabcellsep The ??????????\textunderscore ?? ???????? is\\
\multicolumn{4}{l}{obtained by randomly selecting numbers such that it is}\\
\multicolumn{4}{l}{a co prime of The decryption key pair of ?? and ?? is represented by}\\
\multicolumn{4}{l}{( ??????????\textunderscore ?? ?? ( ??????????\textunderscore ?? ?? ???????? , ??????????\textunderscore ?? ?? ???????? , ??????????\textunderscore ?? ?? ???????? ) and ???????? ) and parameter ??????????\textunderscore ?? ???????? is computed based on the the}\\
\multicolumn{3}{l}{following equation}\\
\multicolumn{3}{l}{??????????\textunderscore ?? ????????}\\
\multicolumn{4}{l}{= ( ??????????\textunderscore ?? ???????? ) ?1 ??????(??????????\textunderscore ?? ???????? )}\\
\multicolumn{4}{l}{The commutative RSA decryption operation on}\\
\multicolumn{4}{l}{the encrypted data ?? is defined}\\
\multicolumn{4}{l}{?????? ?? = ?? ?????????? \textunderscore ?? ???????? ??????(??????????\textunderscore ?? ???????? )}\\
\multicolumn{4}{l}{a) Commutative proof RSA Algorithm}\\
\multicolumn{4}{l}{The commutative property of the RSA algorithm}\\
\multicolumn{4}{l}{adopted in ?????????? can be proved if data ?? encrypted by}\\
\multicolumn{4}{l}{?? and then encrypted by ?? provides the same resultant}\\
\multicolumn{4}{l}{if the encryption is performed by ?? followed by the}\\
\multicolumn{4}{l}{encryption performed by ?? i.e.}\\
\multicolumn{4}{l}{?????? ?? (?????? ?? ?????? ?? ? ?? ?????????? \textunderscore ?? ?? ???????? ??????(??????????\textunderscore ?? ?? ?? ) ?? ) ? ?????? ?? (?????? ??}\tabcellsep ???????? )?\\
\multicolumn{4}{l}{? ?????? ?? ? ?? ?????????? \textunderscore ?? ?? ???????? ??????(??????????\textunderscore ?? ??}\tabcellsep ???????? ) ?\\
\multicolumn{4}{l}{???????? ? = ?? ??????????? \textunderscore ?? ?? ???????? × ?????????? \textunderscore ?? ?? ???????? ? ??????(??????????\textunderscore ?? ?? ?? ??????????? \textunderscore ?? ?? ???????? × ?????????? \textunderscore ?? ?? ???????? ? ????????????????? ?? ?? ???????? )}\\
\multicolumn{2}{l}{As ?????????? ?? ?? that}\tabcellsep \multicolumn{2}{l}{???????? = ??????????\textunderscore ?? ??}\tabcellsep ???????? it can be concluded\\
\multicolumn{4}{l}{???????? ? = ?? ??????????? \textunderscore ?? ?? ???????? × ?????????? \textunderscore ?? ?? ???????? ? ??????(??????????\textunderscore ?? ?? ?? ??????????? \textunderscore ?? ?? ???????? × ?????????? \textunderscore ?? ?? ???????? ? ????????????????? ?? ?? ???????? )}\\
And hence\tabcellsep \tabcellsep \\
\tabcellsep \multicolumn{2}{l}{?????? ?? (?????? ??}\tabcellsep ?? ) ? ?????? ?? (?????? ??\tabcellsep ?? )\end{longtable} \par
 
\caption{\label{tab_0}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{} \par 
\begin{longtable}{P{0.011540360404838312\textwidth}P{0.7901999506294741\textwidth}P{0.019303875586274995\textwidth}P{0.012589484078005432\textwidth}P{0.0060849173043692915\textwidth}P{0.008392989385336953\textwidth}P{0.0018884226117008146\textwidth}}
\tabcellsep \multicolumn{4}{l}{RASCP: Providing for a secure group communication plane using RFID}\tabcellsep \\
\tabcellsep ?? , used to obtain the\tabcellsep \tabcellsep \tabcellsep \tabcellsep \\
\tabcellsep parameters ??????????\textunderscore ?? ?? ???????? and ??????????\textunderscore ?? ?? ???????? using the\tabcellsep \tabcellsep \tabcellsep \tabcellsep \\
2012\tabcellsep Sieve of Eratosthenes Prime number generation algorithm. Each member of the group contributes towards the construction of the commutative RSA sets\tabcellsep \tabcellsep \tabcellsep \tabcellsep \\
Year\tabcellsep ??????????\textunderscore ?? and ??????????\textunderscore ?? defined as ??????????\textunderscore ?? =\tabcellsep in\tabcellsep \multicolumn{2}{l}{?? ?????? = \{2,3,4, ? ? ?? ?????? \}.}\tabcellsep Let\tabcellsep ??????1 =\\
68 Volume XII Issue XVI Version I ( D D D D ) E\tabcellsep \multicolumn{6}{l}{Algorithm 1: Sieve of Eratosthenes Prime number generation algorithm Input: User RFID based Number ?? ?????? Output: Prime Number Set ?? Algorithm: I. Initialize ?? ?????? = \{2,3,4, ? ? ?? ?????? \} II. Initialize Boolean set ?? ?????? = \{?? 1 , ?? 2 , ?? 3 , ? ? ?? ?? ?????? \} III. Initialize ?????? = 2 IV. Do V. Set the index of all the multiples of ??????1 to True i.e. ?? occurring between ?????? 2 and ?? ?????? . VI. IV. Rascp -rfid authentication based derived from ??????????\textunderscore ?? ?? ???????? and ??????????\textunderscore ?? ?? ???????? using the following algorithm Algorithm Name: Encryption and Decryption Key Pair Computation Input: I. ???????? III. ??????????\textunderscore ?? ?? ???????? Output: I. Encryption Key Pair ??????????? ?? ð?"°ð?"° ?? ???????? , ?????????? ?? ð?"°ð?"° ?? ???????? ? II. Decryption Key Pair ? ??????????\textunderscore ?? ð?"°ð?"° ?? ???????? , ??????????\textunderscore ?? ð?"°ð?"° ?? ???????? ? Algorithm I. For Each group member ? ?? ? ?? II. Compute ?????????? ?? ? ?? ???????? = ???????????? ?? ?? ???????? ? × ? ?????????? ?? ?? ???????? ?? III. Compute ?????????? ?? ? ?? ???????? = ???????????? ?? ?? ???????? ? 1? × ??????????? ?? ?? ???????? ? 1?? IV. Select random number using ??????????????(?????? ?????? , ??) | ?ð?"?ð?"? ?????? (?????? ?????? , ??????????\textunderscore ?? ???????? ) = 1 V. ??????????\textunderscore ?? ? ?? ???????? = ?????? ?????? VI. Compute length ??. ??????????????????????(The encryption and decryptions keys are to be \{??????????\textunderscore ?? 1 ???????? , ??????????\textunderscore ?? 2 ???????? , ? , ??????????\textunderscore ?? ?? ???????? \} and ??????????\textunderscore ?? = \{??????????\textunderscore ?? 1 ???????? , ??????????\textunderscore ?? 2 ???????? , ? , ??????????\textunderscore ?? ?? ???????? \} The algorithm used to construct the ??????????\textunderscore ?? and ??????????\textunderscore ?? sets is as mentioned below Algorithm Name: ??????????\textunderscore ?? and ??????????\textunderscore ?? construction Input: I. ?? ?? and length ?? ?? ?? Output: I. ??????????\textunderscore ?? II.??????????\textunderscore ?? Algorithm I. Initilize ??????????\textunderscore ?? = ? and ??????????\textunderscore ?? = ? II. For Each group member ? ?? ? ?? III. ?? ?? ?????? ?? , ?? ?? ?????? ?? = ??????????(?? ?? ?? , ???????? ?? ?? ) IV. ?? ???????? \textunderscore ?????? ???????? ?? = ????????????????????????? ?? ?????? ?? ? V. ?? ???????? \textunderscore ?????? ???????? ?? = ????????????????????????? ?? ?????? ?? ? VI. ??????????\textunderscore ?? ?? ???????? = ??????????????? ?? ?????? ?? ?????? ???????? ?? , ??? VII. ??????????\textunderscore ?? ?? ???????? = ??????????????? ?? ?????? ?? ?????? ???????? ?? , ??? VIII. ??????????\textunderscore ?? = ??????????\textunderscore ?? ? ??????????\textunderscore ?? ?? ???????? IX. ??????????\textunderscore ?? = ??????????\textunderscore ?? ? ??????????\textunderscore ?? ?? ???????? X. End For Each The function ??????????(??, ??) represents a splitting function that obtains the most significant bits and least significant bits of the number ?? of ???????? = ?????????? ?? ? ?? ?? ?????????? ?? ? ?? ???????? ? ?1 ???????? ?? ?????? ??????????? ?? ? ?? secure communication plane VII. Encryption key pair of the ? ?? ??? group member}\\
\tabcellsep \tabcellsep \multicolumn{3}{l}{is ??????????? ?? ? ?? VIII. Decryption key Pair of the ? ?? ???????? , ?????????? ?? ? ??}\tabcellsep \multicolumn{2}{l}{???????? ? ??? group member}\\
\tabcellsep \tabcellsep \tabcellsep is ??????????? ?? ? ??\tabcellsep ???????? , ?????????? ?? ? ??\tabcellsep ???????? ?\end{longtable} \par
  {\small\itshape [Note: ?????? = ?? ?????????? (??????, ?? ?????? , ?? ?????? ) VII. While (?????? 2 > ?? ?????? ) VIII. ?? = Set of all indexes of ?? ???????? ? ?? ?????? ? ?? ???????? = ?? Let us consider a set of users who would like to communicate securely represented by a set defined as ?? = \{? 1 , ? 2 , ? 3 , ? ? . ? ?? \} Group Member Set ?? = \{ð?"°ð?"° ?? , ð?"°ð?"° ?? , ð?"°ð?"° ?? , ? ? . ð?"°ð?"° ?? \} II.Group RFID Tag Associated with each Group Member ð?"°ð?"° ?? , ?? ?? and its data ????????]} 
\caption{\label{tab_1}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{} \par 
\begin{longtable}{}
\end{longtable} \par
 
\caption{\label{tab_3}}\end{figure}
 			\footnote{© 2012 Global Journals Inc. (US)Global Journal of Computer Science and Technology} 			\footnote{© 2012 Global Journals Inc. (US)} 			\footnote{RASCP: Providing for a secure group communication plane using RFID} 		 		\backmatter  			  				\begin{bibitemlist}{1}
\bibitem[44th Hawaii International Conference (2011)]{b18}\label{b18} 	 		\textit{44th Hawaii International Conference},  				Jan. 2011. p. .  	 
\bibitem[Paillard ()]{b11}\label{b11} 	 		‘A FULLY DISTRIBUTED PRIME NUMBERS GENERATION USING THE WHEEL SIEVE’.  		 			Gabriel Paillard 		.  	 	 		\textit{Parallel and Distributed Computing and Networks},  				2005. p. .  	 
\bibitem[Gries and Misra ()]{b10}\label{b10} 	 		‘A linear sieve algorithm for finding prime numbers’.  		 			D Gries 		,  		 			J Misra 		.  	 	 		\textit{Communications of the ACM}  		1978. 21  (12)  p. .  	 
\bibitem[Zou et al. ()]{b17}\label{b17} 	 		‘A New Scheme for Anonymous Secure Group Communication’.  		 			Xukai Zou 		,  		 			Mingrui Qi 		,  		 			Yan Sui 		.  	 	 		\textit{System Sciences (HICSS)},  				2011.  	 
\bibitem[Bruhadeshwar and Kulkarni ()]{b14}\label{b14} 	 		‘Balancing Revocation and Storage Trade-Offs in Secure Group Communication’.  		 			Bezawada Bruhadeshwar 		,  		 			Sandeep S Kulkarni 		.  	 	 		\textit{IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING}  		JANUARY-FEBRUARY 2011. 8  (1)  p. .  	 
\bibitem[Huang et al. (2010)]{b9}\label{b9} 	 		‘Hardware implementation of RFID mutual authentication protocol’.  		 			Y J Huang 		,  		 			C C Yuan 		,  		 			M K Chen 		,  		 			W C Lin 		,  		 			H C Teng 		.  	 	 		\textit{IEEE Trans. Ind. Electron}  		May 2010. 57  (5)  p. .  	 
\bibitem[Board ()]{b0}\label{b0} 	 		‘IEEE Standard for Smart Transducer Interface for Sensors and Actuators-Transducers to Radio Frequency Identification (RFID) Systems Communication Protocols and Transducer Electronic Data Sheet Formats’.  		 			Ieee-Sa Standards Board 		.  	 	 		\textit{IEEE Std}  		1451. IEEE Instrumentation and Measurement Society. p. .  	 
\bibitem[Victor et al. (2007)]{b13}\label{b13} 	 		\textit{Improving Satellite Multicast Security Scalability by Reducing Rekeying Requirements},  		 			P Victor 		,  		 			HubenkoJr 		,  		 			A Richard 		,  		 			Rusty O Raines 		,  		 			Barry E Baldwin 		,  		 			Robert F Mullins 		,  		 			Michael R Mills 		,  		 			Grimaila 		.  		July/August 2007. p. .  	 
\bibitem[Arjen and Lenstra]{b19}\label{b19} 	 		‘Key length. Handbook of Information Security’.  		 			K Arjen 		,  		 			Lenstra 		.  	 	 		\textit{Chief, Hossein Bidgoli},  				p. .  	 
\bibitem[Juels (2004)]{b8}\label{b8} 	 		‘Minimalist Cryptography for Low-Cost RFID Tags’.  		 			A Juels 		.  	 	 		\textit{Proc. Fourth Int'l Conf. Security in Comm. Networks (SCN '04)},  				 (Fourth Int'l Conf. Security in Comm. Networks (SCN '04))  		Sept. 2004.  	 
\bibitem[Karst and Wicker ()]{b15}\label{b15} 	 		\textit{On the Rekeying Load in Group Key Distributions Using Cover-Free Families},  		 			Nathaniel Karst 		,  		 			Stephen B Wicker 		.  		2011. IEEE.  	 
\bibitem[Crandall and Pomerance ()]{b12}\label{b12} 	 		\textit{Prime Numbers: a computational perspective},  		 			R Crandall 		,  		 			C Pomerance 		.  		2001. Springer Verlag.  	 
\bibitem[Molnar and Wagner (2004)]{b6}\label{b6} 	 		‘Privacy and Security in Library RFID: Issues, Practices, and Architectures’.  		 			D Molnar 		,  		 			D Wagner 		.  	 	 		\textit{Proc. 11th ACM Conf. Computer and Comm. Security (CCS '04)},  				 (11th ACM Conf. Computer and Comm. Security (CCS '04))  		Oct. 2004.  	 
\bibitem[Lee and Kim (2006)]{b4}\label{b4} 	 		‘Privacy Threats and Issues in Mobile RFID’.  		 			H Lee 		,  		 			J Kim 		.  	 	 		\textit{Proc. First Int'l Conf. Availability, Reliability and Security (ARES '06)},  				 (First Int'l Conf. Availability, Reliability and Security (ARES '06))  		Apr. 2006.  	 
\bibitem[Juels (2005)]{b5}\label{b5} 	 		\textit{RFID Security and Privacy: A Research Survey},  		 			A Juels 		.  		Sept. 2005.  	 	 (manuscript, RSA Laboratories) 
\bibitem[Alomair et al. ()]{b3}\label{b3} 	 		‘Scalable RFID Systems: A Privacy-Preserving Protocol with Constant-Time Identification’.  		 			Basel Alomair 		,  		 			Andrew Clark 		,  		 			Jorge Cuellar 		,  		 			Radha Poovendran 		.  	 	 		\textit{IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS}  		AUGUST 2012. 23  (8)  p. .  	 
\bibitem[Chiou and Chen (1989)]{b16}\label{b16} 	 		‘Secure broadcasting using the Secure Lock’.  		 			G H Chiou 		,  		 			W Chen 		.  	 	 		\textit{IEEE Transactions on Software Engineering}  		Aug. 1989. 15  (8)  p. .  	 
\bibitem[Weis (2003)]{b7}\label{b7} 	 		‘Security and Privacy Aspects of Low-Cost Radio Frequency Identification Systems’.  		 			S Weis 		.  	 	 		\textit{Proc. First Int'l Conf. Security in Pervasive Computing (SPC '03)},  				 (First Int'l Conf. Security in Pervasive Computing (SPC '03))  		Mar. 2003.  	 
\bibitem[Weis (2003)]{b2}\label{b2} 	 		‘Security and Privacy in Radio-Frequency Identification Devices’.  		 			S Weis 		.  	 	 		\textit{Mass. Inst. of Technology (MIT)}  		May 2003.  	 	 (master's thesis) 
\bibitem[Transducer to radio frequency identification (RFID) systems communication protocols and Transducer Electronic Data Sheet (TEDS) formats" ISO/IEC/IEEE21451-7]{b1}\label{b1} 	 		\textit{Transducer to radio frequency identification (RFID) systems communication protocols and Transducer Electronic Data Sheet (TEDS) formats" ISO/IEC/IEEE21451-7},  				 	 	 (First edition 2011-12-15) 
\end{bibitemlist}
 			 		 	 
\end{document}
