\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={LH-Cipher: A Linear Hierarchical Cipher approach for Data},
 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 2012-05-15 (revised: January 2012 15 May 2012)}
\def\TheID{\makeatother }
\def\TheDate{2012-01 2012-05-15}
\title{LH-Cipher: A Linear Hierarchical Cipher approach for Data}
\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]{M  Sadanandam}

             \affil[1]{  KAKATIYA UNIVERSITY}

\renewcommand\Authands{ and }

\date{\small \em Received: 15 April 2012 Accepted: 1 May 2012 Published: 15 May 2012}

\maketitle


\begin{abstract}
        


Dividing the data into blocks and there by arranging the blocks in hierarchal order is termed as a linear hierarchical cipher approach for data .The encryption code, a access id code for each level based on the propagation code is generated in this technique. However the level propagation code and the access-id code of previous hierarchy level are matching with upper hierarchical level .The access-id code is set based on the time sensing key and a time seed, and the time seed updates with respect to the encryption pulse. By simply modifying and inversing the data security it is possible to decrease the number of key volume.

\end{abstract}


\keywords{}

\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
ith the growth in communication technology, there have been lot many positives but to counterfeit a lot many techniques to misuse this technology have also been growing. It is important to make data protected from all such malpractice \hyperref[b1]{[2]}. Of all the methods of protecting the data, encryption is the most effective one. In this technique the data is simply hidden and later it is recovered by de-encryption. \hyperref[b0]{[1]}.to encrypt a data, a specific process or pattern is followed which may include mathematical operations, shifting and substitute techniques .after the data is encrypted it is termed as ciphertext \hyperref[b2]{[3]}.with the help of key based algorithms it is possible to encrypt the data and this key based encryption technique is classified as symmetric and asymmetric. The former uses only a single key for both encryption and de-encryption where as the later uses two different keys each for encryption and deencryption. There are number of key based Encryption techniques viz. DES, RSA, Elliptic curve, and several other mathematical methods \hyperref[b3]{[4,}\hyperref[b4]{5]}. The wireless communication systems have seen a rapid development in recent times as such Wireless Sensor Network, Bluetooth, zigbee are the most recent ones. The WSN finds its application in monitoring systems especially security concerns.\par
The WSN constantly sends the information about the state of the object being monitored to the control room that enables collection of related information. 
\section[{II.}]{II.} 
\section[{RELATED WORK}]{RELATED WORK}\par
Multilevel cryptosystems saw a steady growth in recent times. The following are some of the proposed multilevel encryption methods explored in table \hyperref[tab_0]{1}.\par
The models \hyperref[b0]{[1,}\hyperref[b1]{2]} provide multi level ciphering but the final result so obtained is not generic and databases specific .Linear hierarchical cipher based data encryption and decryption is generic and considers the heterogynous in each level to overcome the drawbacks of the proposed AES and elliptical curve method \hyperref[b2]{[3,}\hyperref[b3]{4,}\hyperref[b4]{5]}. 
\section[{III.}]{III.} 
\section[{LINEAR HIERARCHICAL CIPHER APPROACH}]{LINEAR HIERARCHICAL CIPHER APPROACH}\par
To ensure data protection in wireless communication encryption is the best technique but today we have lot many users accessing different levels of data. A multi user system has an access to different data levels. For each level we have an encrypted key which is used to de-encrypt and access it. However as the number of levels increases it get difficult to manage with the multiple keys .Hence forth managing the encryption with key technique is termed difficult. It is important to know that the keys are changed every time and hence data security is still ensured .Since the keys used are to be changed each time both level-based keys and time-based keys are to be altered each time.\par
To resolve the above problem of managing both the time based and level based keys at a time a data encryption technique is explained in detail. As stated earlier the data is initially partitioned into different level. While encrypting the data a specific level we also consider the encryption code of the previous level .Thus the user can de-encrypt the data easily from the already de-encrypted data levels however the data security still holds good. Firstly the data is divided into different levels and each level is related to at least one user. Then we encrypt each level by using the encryption key of each level based on the level propagation code and a access-id code of each level. However the level propagation code and the access-id code of one level are generated based on the level propagation code and the access-id code of previous level (the access-id code is produced based on the time propagation code and a time seed). The time seed has to be periodically altered. Then the encrypted data is transferred to the user. This method also includes the generation of encryption code for each level and also other authorized levels based on the level propagation and access id codes and then again decrypting the data at respective levels. 
\section[{IV.}]{IV.} 
\section[{ENCRYPTION APPROACH}]{ENCRYPTION APPROACH}\par
? Divide data into multitude data blocks ? Generate access-id key of the highest level of the hierarchy ? Sequentially generate the access-id keys of the other levels of the hierarchy using FIPS-180-1 hash standard. ? Generate encryption key of the each hierarchical level based on level propagation and access-id keys of each level ? Encrypt the data block each level using corresponding encryption key ? Send encrypted data-block to data storage V. 
\section[{DECRYPTION APPROACH}]{DECRYPTION APPROACH}\par
? Authenticate the user according to user key and find user position in hierarchy ? if authentication succeed then ? generate an access-id key for the hierarchy level of the user ? send encrypted data blocks to the authorized levels ? Encryption time and access-id key to the In the paper we elicit a new concept of linear hierarchical cipher based encryption considering a data storage and one encryption module. The data storage generates levels based on the different user approaching for the data access. This also produces the time propagation code, a time seed and a level propagation code based on the propagation codes of the previous levels. With the help of encryption key ,the encryption module encrypts the data with the help of time propagation code, the time seed, and the level propagation code of each level, and thus generates the access-id key (based on the accessed code of previous level) according to the time propagation key and the time seed. All the encrypted data is stored by the data storage. The decryption module finds the related encrypted data block in the related authorized level and then produces the encryption codes to access that level data block with the help of level propagation codes and access id codes .It then decrypts the encrypted data blocks with the help of the propagation level and access id codes which could be generated with the help of previous level codes The data storage also considers the variation in the encryption code with the time with the help of time seed and thus generates the access-id code for each level considering the encryption periods .\par
? decryption module generates propagation keys for current level and other authorized levels of the hierarchy ? decryption module generates access-id keys of the authorized levels of the hierarchy by using access-id key of the current level ? Respectively decrypts the corresponding encrypted data-blocks according to the level propagation keys and access-id keys of the authorized levels by decryption module VI. EMBLEMATIC MODEL OF LH-CIPHER is not in the context of proposal and therefore will not be discussed here. However, it should be understood that the LH-Cipher is not limited only to an ad hoc network; rather it may also be deployed in other constrained device communication environments, such as IEEE802.11 family standard device based networks.\par
The control device accepts the egress data of the encrypted modules as input and stores in data storage. A generic data access device with a database can be data storage.\par
As a part of its functionality the data storage controller groups the authorized users into multiple levels so as to manage these users and the data to be accessed by these users based on the users level. It is precise that a user of a level can access more data than a user of its lower levels. In other words, the users in upper level groups will have high end rights when compared to users in lower level groups. An upper level user can decrypt and access the data assigned to his group level and all lower group levels but it is not true in vice versa.\par
In order to manage the rights of preceding users of diverse levels, the data storage generates a level propagation key for each of the levels to encrypt the data. In particular, the level propagation key of a level is generated according to the level propagation key of its upper level so that the data can be managed based on the user levels.\par
Let consider that in the selected emblematic model, the data storage groups three different users u1, u2 and u3 into three levels, wherein the u1 belongs to the first level which has the highest right, the u2 belongs to a second level which has the second highest right, and the u3 belongs to a third level which has the lowest right.\par
The data storage randomly generate a group key K (g)1 for the users of the first level that also considered as top level and then sequentially generates group keys K (g)2, K (g)3 for the other two levels through a fips-180-1 standard hashing technique, as shown below:K (g)i =F(h) l?1 ( K (g)1 ),\par
Where in F(h) is a hash function and l represents the level (i.e. l=1..3). The Eq1 represents the FIPS-180-1 standard hashing function that is using to generate the group keys K (g)2 and K (g)3 of the other two level.\par
Next, the data storage respectively generates a level propagation key \{PK (m,l) , 'm' is node identification code and 'l' is level id.\} for each level according to the Wherein f (e) is the encryption function, and l represents the level id.\par
In the selected emblematic model, the encryption function is any standard encryption function of choice, as a part experimental results we opt to the advanced encryption standard (AES).\par
group keys \{K (g)1 ,K (g)2 ,K (g)3 ?K (g)n \} of the levels and an identification code of the encryption module through the fallowing function. 
\section[{PK (m,l) =f (e) ( K l ,m ),}]{PK (m,l) =f (e) ( K l ,m ),}\par
It should be mentioned that in the selected emblematic model, the node identification codes are used as one of the factors for generating the level propagation keys because a different level propagation key is provided to each of the node in selected network. However, if the situation of multiple nodes is not considered or every node uses the same level propagation then as an alternative the group key can be used as the level propagation key.\par
The data storage also generates a access-id key(A k ) and a time seed besides the level propagation keys. The access-id key(A k ) and the access time as seed are used for generating an access identification key(AI k ) for each encryption period. In the selected emblematic model, a different access identification key(AI k ) is used during each encryption period so that the data to be encrypted can have forward and backward data security. Therefore, a user with expired authorization unable to use his original key to access the data, and can avoid a new authoritative user from accessing data that encrypted in past.\par
For example, the data storage generates the access-id key\{A (k)m , m is device id\} by using a primary key K (p) and an identification code of the wireless sensor through a sixth function. In the selected emblematic model, the encryption function used as shown below:A (k)m =f (e) ( K (p) ,m ),\par
Wherein f (e) is the encryption function. In the selected emblematic model, the encryption function is an standard model of our choice.\par
Similarly, in the selected emblematic model, the identification codes of the nodes involved are used as one of the factors for generating the access-id key(A k ) because a different access-id key(A k ) is provided to each node involved. However, if the situation of multiple nodes is not considered or each of the nodes uses the same access-id key(A k ), the primary key K (p) can be directly used as the access-id key.\par
The data storage generates a user key for each of the users and assigns the user key K (u)m to the user while assigning the group key to the user. This user key will be generated with the help of fallowing equation represents an encryption function. K (u)m =f (e) (K (p) ,m) , wherein m is user identification. m is user identification The primary key K (p) of the data storage is generated randomly. Besides, the data storage generates a different access identification seed S T corresponding to different encryption periods T. In the selected emblematic model, the S T corresponding to the current encryption period is generated according to the K (p) and the other parameter of choice such as current date or timestamp.\par
As described above, all encryption modules are used for encrypting the data to be transmitted by corresponding nodes.\par
The process of encryption fallows.\par
The first encryption module receives the access-id key(A k ), the time seed S T , and the level propagation key \{K (L)l , l is level identifier\} of each level from the data storage, wherein l represents the level. In the selected emblematic model, the data storage broadcasts a new time seed S T at certain intervals to the all encryption modules to allow them to generate the access identification keys of the current encryption period T according to the new time seed and the access-id key. Access Identification Key can be generated using the fallowing function.\par
AI k(m,T) =f (h) ( A K(m) , S T ), wherein f (h) is the hash function.\par
The process of AI k generation is sequential, that is the first encryption module generates the access identification key of the second level according to the access identification key of the first level and finally generates the access identification key of the third level according to the access identification key(AI k ) of the second level.\par
The first encryption module divides a data to be transmitted into multitude of sub-data blocks corresponding to different user levels. In addition, the first encryption module generates an encryption key for each level according to the received level propagation key of the level and the access identification key(AIk) generated based on a new seed. Encryption key will be generated by using the fallowing function.K (E) (m,l,t) =f (h) ( K L(m,l) , f (h) l?1 ( AI k (m,t) )),\par
Wherein f (h) is the hash function, and l represents the level and m represents the node id.\par
The first encryption module uses the encryption key K (E)(1,L,T) (wherein 1 is first node id and L=1..3) of each level for respectively encrypting the sub-data blocks.\par
If the first encryption module does not receive the new time seed but generates the access identification key(AI k ) by using the old time seed and encrypts the sub-data blocks by using the encryption key generated by using the old access identification key, the data storage determines the time seed after it receives the encrypted sub-data blocks and records the sub-data blocks which are encrypted by using the incorrect time seed as reference for subsequent data decryption. In addition, the data storage broadcasts the current time seed to the first encryption module again if the first encryption module does not use the correct time seed to encrypt the data.\par
After the encryption modules encrypt the subdata blocks and the encrypted data is sent to the data storage, the respective users can read the encrypted sub-data blocks stored in the data storage through the decryption module allotted to respective end user device. In the selected emblematic model, the end-user\par
The decryption module reads the encrypted sub-data blocks corresponding to the level of a user and other authorized levels of the user and corresponding to the encryption period from the data storage. To be specific, in the selected emblematic model, a user having higher right can read the data assigned to users having lower rights but a user having lower right cannot read the data assigned to users having higher rights. Thus, the data storage provides the corresponding authorized data to a user according to the level of the user after it authenticates the user according to a user key of the user.\par
In the selected emblematic model, the data storage generates a access identification key(AI k ) corresponding to the level of the user and sends AI k together with the encrypted sub-data blocks to the decryption module of the end-user device.\par
The decryption module generates the encryption cipher keys for the authorized levels (i.e., the second level and the third level) of the user according to the level propagation keys and the access identification keys of the authorized levels and decrypts the encrypted sub-data blocks by using the encryption keys. In particular, the decryption module generates the level propagation key and AI k of a lower level according to the level propagation key and the access identification key(AIk) of an upper level. 
\section[{VII. CONCLUSION AND FUTURE WORK}]{VII. CONCLUSION AND FUTURE WORK}\par
The proposed linear hierarchical ciphering model is robust and scalable where data is encrypted corresponding to multiple levels so that a user having higher right can access the data assigned to users having lower rights but a user having lower right cannot access data assigned to users having higher rights. In addition, in the present invention, an access identification key updated by using a access seeds generated based on access time is adopted to ensure the encrypted data to have forward and backward security and that no synchronous process is required. Thus, the encryption process relaxed from\begin{figure}[htbp]
\noindent\textbf{1}\includegraphics[]{image-2.png}
\caption{\label{fig_0}Figure 1 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-3.png}
\caption{\label{fig_1}K}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{1} \par 
\begin{longtable}{P{0.17835325365205842\textwidth}P{0.08240371845949535\textwidth}P{0.003386454183266932\textwidth}P{0.12304116865869855\textwidth}P{0.4628154050464807\textwidth}}
\tabcellsep \multicolumn{4}{l}{LH-Cipher: A Linear Hierarchical Cipher approach for Data}\\
\tabcellsep Method\tabcellsep \tabcellsep Proposed by\tabcellsep Special features\\
\multicolumn{2}{l}{Multi level encryption}\tabcellsep \tabcellsep Zhou Yuping et al [1]\tabcellsep Encrypt the data system, table level and field level of\\
\tabcellsep \tabcellsep \tabcellsep \tabcellsep objects\\
\multicolumn{2}{l}{Multi level secondary storage}\tabcellsep \tabcellsep Chaitanya et al[2]\tabcellsep Flexible performance against security trade-offs\\
\multicolumn{2}{l}{Multi level crpto disk(MLCD)}\tabcellsep \tabcellsep \tabcellsep For generic storage devices\\
\multicolumn{2}{l}{Multi level secure architecture}\tabcellsep \tabcellsep Sathiaseelan et al[3]\tabcellsep Integrated web services especially for academic\\
\tabcellsep \tabcellsep \tabcellsep \tabcellsep institutions\\
\multicolumn{2}{l}{Parallel AES algorithm}\tabcellsep \tabcellsep Deguang Le et al[4]\tabcellsep Fast Data Encryption on GPU to overcome the draw\\
\tabcellsep \tabcellsep \tabcellsep \tabcellsep backs of CPU resource consumption.\\
ElGamal\tabcellsep encryption\tabcellsep and\tabcellsep Fu Minfeng et al[5]\tabcellsep It is based on elliptical based cryptosystem that\\
\multicolumn{2}{l}{transmission scheme}\tabcellsep \tabcellsep \tabcellsep aimed to improve ElGamal algorithm, ECC ElGamal\\
\tabcellsep \tabcellsep \tabcellsep \tabcellsep encryption algorithm\end{longtable} \par
 
\caption{\label{tab_0}Table 1 :}\end{figure}
 			\footnote{© 2012 Global Journals Inc. (US)} 		 		\backmatter  			 
\subsection[{January 2012}]{January 2012}\par
device is connected to the control device with the choice of network model; here we consider a wired connectivity. computational complexity. Moreover, the level propagation key and the access identification key(AI k ) of a lower level are generated according to the level propagation key and the access identification key(AI k ) of one level up in hierarchy. Thereby, the number of keys to be managed by an end-user device is reduced and accordingly the calculation load of the end-user device is also reduced. In future this solution can be extended to achieve the key generations without considering the sequence in levels of hierarchy.			 			  				\begin{bibitemlist}{1}
\bibitem[Yuping]{b5}\label{b5} 	 		\textit{},  		 			Zhou Yuping 		.  		 	 
\bibitem[Le]{b10}\label{b10} 	 		\textit{},  		 			Deguang Le 		.  		 	 
\bibitem[Chang]{b11}\label{b11} 	 		\textit{},  		 			Jinyi Chang 		.  		 	 	 (Xingdou Gou) 
\bibitem[Beth and Gollmann ()]{b2}\label{b2} 	 		‘Algorithm Engineering for Public Key Algorithms’.  		 			T Beth 		,  		 			D Gollmann 		.  	 	 		\textit{IEEE Journal on Selected Areas in Communications}  		1989. 7  (4)  p. .  	 
\bibitem[Agnew et al. ()]{b1}\label{b1} 	 		‘An Implementation for a Fast Public-Key Cryptosystems’.  		 			G B Agnew 		,  		 			R C Mullin 		,  		 			I M Onyszchuk 		,  		 			VqanstoneS 		.  	 	 		\textit{Journal of Cryptology}  		1995. 3  (2)  p. .  	 
\bibitem[Freeman and Neely ()]{b0}\label{b0} 	 		‘Developing Secure Systems: Issues and Solutions’.  		 			J Freeman 		,  		 			R Neely 		,  		 			MegaloL 		.  	 	 		\textit{IEEE Journal of Computer and Communication}  		1998. 89 p. .  	 
\bibitem[Minfeng and Wei (2010)]{b13}\label{b13} 	 		‘Elliptic curve cryptosystem ElGamal encryption and transmission scheme’.  		 			Fu Minfeng 		,  		 			; Chen Wei 		.  	 	 		\textit{Computer Application and System Modeling (ICCASM), 2010 International Conference on},  				Oct. 2010. 6 p. .  	 
\bibitem[IEEE International Symposium on (2010)]{b8}\label{b8} 	 		\textit{IEEE International Symposium on},  				17-19 Aug. 2010. p. .  	 
\bibitem[Chaitanya et al. ()]{b7}\label{b7} 	 		‘Multi-level Crypto Disk: Secondary Storage with Flexible Performance Versus Security Trade-offs’.  		 			S Chaitanya 		,  		 			B Urgaonkar 		,  		 			A Sivasubramaniam 		.  	 	 		\textit{Modeling, Analysis \& Simulation of Computer and Telecommunication Systems (MASCOTS)},  				2010.  	 
\bibitem[Sathiaseelan et al. (2010)]{b9}\label{b9} 	 		‘Multi-Level Secure Architecture for distributed integrated Web services’.  		 			J G R Sathiaseelan 		,  		 			S A Rabara 		,  		 			J R Martin 		.  	 	 		\textit{3rd IEEE International Conference on},  				2010. July 2010. 8 p. .  	 
\bibitem[Zhang and Lu (2010)]{b12}\label{b12} 	 		‘Parallel AES algorithm for fast Data Encryption on GPU’.  		 			Ankang Zhang 		,  		 			; Conglan Lu 		.  	 	 		\textit{2nd International Conference on},  				2010. April 2010. 6 p. .  	 
\bibitem[Xinghui (2010)]{b6}\label{b6} 	 		‘Research and realization of multi-level encryption method for database’.  		 			Wu Xinghui 		.  	 	 		\textit{2nd International Conference on},  				2010. March 2010. 3 p. .  	 
\bibitem[The Data Encryption Standard (DES) and its strength against attacks IBM Journal of Research and Development ()]{b3}\label{b3} 	 		‘The Data Encryption Standard (DES) and its strength against attacks’.  	 	 		\textit{IBM Journal of Research and Development}  		1994. 38 p. .  	 
\bibitem[The Data Encryption Standard (DES) and its strength against attacks IBM Journal of Research and Development ()]{b4}\label{b4} 	 		‘The Data Encryption Standard (DES) and its strength against attacks’.  	 	 		\textit{IBM Journal of Research and Development}  		1994. 38 p. .  	 
\end{bibitemlist}
 			 		 	 
\end{document}
