\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={Visual Pixel Expansion of Secret Image},
 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-11-30 (revised: 30 November 2011)}
\def\TheID{\makeatother }
\def\TheDate{2011-11-30}
\title{Visual Pixel Expansion of Secret Image}
\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]{  Vijayaraj.A}

             \author[2]{  Velmurugan.N}

             \affil[1]{  Saveetha Engineering College,Anna University,Chennai.}

\renewcommand\Authands{ and }

\date{\small \em Received: 20 October 2011 Accepted: 18 November 2011 Published: 30 November 2011}

\maketitle


\begin{abstract}
        


Two common drawbacks of the visual cryptography scheme (VCS) are the large pixel expansion of each share image and the small contrast of the recovered secret image. In this paper, we propose a step construction to construct VCSOR and VCSXOR for general access structure by applying (2,2)-VCS recursively, where a participant may receive multiple share images. The proposed step construction generates VCSOR and VCSXOR which have optimal pixel expansion and contrast for each qualified set in the general access structure in most cases. Our scheme applies a technique to simplify the access structure, which can reduce the average pixel expansion (APE) in most cases compared with many of the results in the literature. Finally, we give some experimental results and comparisons to show the effectiveness of the proposed scheme.

\end{abstract}


\keywords{Average pixel expansion (APE), VCSOR, VCSXOR, Visual Cryptography Scheme (VCS), Share image, Secret image.}

\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[{Visual Pixel Expansion of Secret Image}]{Visual Pixel Expansion of Secret Image}\par
Velmurugan.N ? , Vijayaraj.A ? Abstract -Two common drawbacks of the visual cryptography scheme (VCS) are the large pixel expansion of each share image and the small contrast of the recovered secret image. In this paper, we propose a step construction to construct VCSOR and VCSXOR for general access structure by applying (2,2)-VCS recursively, where a participant may receive multiple share images. The proposed step construction generates VCSOR and VCSXOR which have optimal pixel expansion and contrast for each qualified set in the general access structure in most cases. Our scheme applies a technique to simplify the access structure, which can reduce the average pixel expansion (APE) in most cases compared with many of the results in the literature. Finally, we give some experimental results and comparisons to show the effectiveness of the proposed scheme.\par
Keywords : Average pixel expansion (APE), VCSOR, VCSXOR, Visual Cryptography Scheme (VCS), Share image, Secret image. 
\section[{I.}]{I.}\par
OVERVIEW OF THE PAPER n this project, there is a secret image which is encrypted into some share images. The secret image is called the original secret image for clarity, and the share images are the encrypted images. When a qualified set of share images are stacked together properly, it gives a visual image which is almost the same as the original secret image or recovered secret image. In the case of black and white images, the original secret image is represented as a pattern of black and white pixels. Each of these pixels is divided into subpixels which themselves are encoded as black and white to produce the share images. The recovered secret image is also a pattern of black and white subpixels which should visually reveal the original secret image if a qualified set of share images is stacked. This paper will focus on the black and white images, where a white pixel is denoted by the number 0 and a black pixel is denoted by the number 1. Using these 0's and 1's the XOR and OR operation takes place to recover the original secret image.In a traditional VCS, each participant takes one share image and all the share images have the same pixel expansion. However, in proposed construction of this paper, each of the participants may take multiple share images with different pixel expansions. So, in the following part, list Author ? : Assistant Professor, Department of MCA, Saveetha Engineering College, Thandalam, Chennai-602 105. E-mail : velmurugann@yahoo.com Author ? : Associate Professor, Department of IT, Saveetha Engineering College, Thandalam,Chennai-602 105. E-mail : satturvijay@yahoo.com the pixel expansions of all the share images for each participant. We compute the average pixel expansion (APE) as well, where the APE is defined as the average value of the total pixel expansions of the share images that each participant holds. Quantum key distribution protocol which works on network security by the use of key agreement. Secret Key is used by each user in the network. Each user has unique Secret Key and will be shared by each user to Trusted Center. In Trusted Center we have to generate a Key for network Security with the Help of Algorithms and Quantum Mechanics. Through that we have to prove how secure the data has been transmitted over network to receiver. 
\section[{II.}]{II.} 
\section[{EXISTING SYSTEM}]{EXISTING SYSTEM}\par
In 2008 an algorithm for visual cryptography has been developed by Chetana Hegde, Manu S, P Deepa Shenoy, Venugopal K R, and L. M. Patnaik for Banking Applications. The aim of the algorithm was to design an efficient technique for checking authenticity of the customer in corebanking and internet banking applications. In 2008 Avishek Adhikari and Bimal Roy have proposed On some Constructions of Monochrome Visual Cryptographic Schemes, which is a (2, n) visual cryptographic scheme.Data hiding in halftone images using conjugate ordered dithering (DHCOD) algorithm is an existing algorithm which is used for visual cryptography scheme. In this algorithm let X is the cover image and H is the image to be hidden i.e. secret image.\par
1. Add some noise to the secret image i.e. H. Let us call it as H1.It introduces some stochastic factors between the original multi-tone images and final share. This step is very important to break the direct correlation between multi-tone and share images. Merits and Demerits of this Scheme Proposed scheme provides a high-level security. First phase i.e. visual cryptographic encryption adds the advantages and security of basic schemes. Then phase two adds the advantage and security DHCOD algorithm. Here we get the shares with some information as some image can be shown in the shares with respect to completely black and white pixels in basic scheme. Since it provides better security so it is most useful in transmission of financial documents. More applications can also be developed which require a high level security. As we know no scheme can be perfect in all aspects. This scheme also has drawbacks as the quality of the revealed image is not rich. Since it uses second phase takes the input as the result of first phase i.e. visual cryptographic encryption so definitely it will have the low contrast and high pixel expansion. 
\section[{III.}]{III.} 
\section[{PROPOSED SYSTEM}]{PROPOSED SYSTEM}\par
To overcome the drawbacks of visual cryptography schemes we propose a step construction to construct VCS OR and VCS XOR for general access structure by applying (2,2)-VCS recursively, where a participant may receive multiple share images. The proposed step construction generates VCS OR and VCS XOR which have optimal pixel expansion and contrast for each qualified set in the general access structure in most cases. Our scheme applies a technique to simplify the access structure, which can reduce the average pixel expansion (APE) in most cases compared with many of the results in the literature. Finally, we give some experimental results and comparisons to show the effectiveness of the proposed scheme.\par
In a traditional VCS, each participant takes one share image and all the share images have the same pixel expansion. However, in proposed construction of this paper, each of the participants may take multiple share images with different pixel expansions. So, in the following part, list the pixel expansions of all the share images for each participant. We compute the average pixel expansion (APE) as well, where the APE is defined as the average value of the total pixel expansions of the share images that each participant holds.Particularly, for a set of participants A, we define the pixel expansion of A as the largest pixel expansion of the share images of A. If A is a qualified set, then define the contrast of A as the contrast of the recovered secret image after adjusting stacking.The participants may have multiple share images, and different qualified sets of share images may result in different contrasts. So, in this paper will focus pixel expansion as well as contrast of the secret image. 
\section[{Data Flow Diagram}]{Data Flow Diagram}\par
A data flow diagram (DFD) is a graphical representation of the "flow" of data through an information system. A data flow diagram can also be used for the visualization of data processing (structured design). It is common practice for a designer to draw a context-level DFD first which shows the interaction between the system and outside entities. This contextlevel DFD is then "exploded" to show more detail of the system being modelled.  
\section[{MODULE DESCRIPTION}]{MODULE DESCRIPTION}\par
This includes three basic modules. They are? Sender ? Trusted Center ? Receiver 
\section[{SENDER}]{SENDER}\par
Getting Authorization is the first stage in sending phase. If a user wants to send a text to Destination user, he wants unique Identification. By using that Identification System knows that the person is 2011 December an authorized person. This phase or Sender Module has Sub Modules. They are as:? Registration ? Login ? Send Data\par
Registration is the Initial state for getting Authentication. By Providing username and Password user sets their Authentication. And System provides one more credentials that is Secret key which is generated by the system for each user. By using username, Password and Secret key system will identify the Authorized person. These credentials are provided to user for the login purpose. These values are stored in the Database. The Database access will be through the registration form in the project. A user wants to send a file means, he/she must log in by using his/her authentication credentials. In this module we have to give username, password and Secret key which was generated by the system.If the user does not provide proper information or the given information is mismatched with database then our system shows Exception message immediately.If the user's details are verified and matched with the existing database then our system allows the person to transmit the file. 
\section[{TRUSTED CENTER}]{TRUSTED CENTER}\par
This module provides the path for the data transfer from the sender to the receiver. This will also generates and verifies the generated key simultaneously.\par
Verify the secret key received from the user and authenticate the corresponding user for secure transmission. It is shared secret key which is used to for encryption and decryption. The size of session key is 8 bits. This session key is generated from pseudo random prime number and exponential value of random number. 
\section[{RECEIVER}]{RECEIVER}\par
Getting Authorization is the first stage in receive phase. If a user wants to receive a text from source user, he wants unique Identification. By using that Identification System knows that the person is an authorized person. Verifying the credentials provided, it will allow the user to receive the data. The data given are stored in the database. Similarly there will be secret key generation. In the receiver there will be decryption module. This phase or Receiver Module has Sub Modules. They are as: 
\section[{Registration 2. Login 3. Receive Data}]{Registration 2. Login 3. Receive Data}\par
Registration is the Initial state for getting Authentication. By Providing username and Password user sets their Authentication. System provides one more credentials that is Secret key which is generated by the system for each user. By using username, Password and Secret key system will identify the Authorized person. These values are stored in the Database. A user wants to send a file means, he/she must log in by using his/her authentication credentials.\par
In this module we have to give username, password and Secret key which was generated by the system.If the user does not provide proper information or the given information is mismatched with database then our system shows Exception message immediately.After login the TCP program calls i.e. our Trusted Center program starts listen the client or sender. Through Login we send the sender's secret key for Identification. If the given credentials provided matches the data in the database then it allows the transaction. If improper it declines the transaction and identifies that it is an unauthorized user. Here, the receiver waits for the sender request to send the data.\par
The main aim of this module is to decrypt a file. Decryption will happen only if the system gets a key from Trusted Center (TC). So after verification of user identification system will send the current user's name and his/her secret key to Trusted Center (TC).\par
V. 
\section[{IMPLEMENTATION}]{IMPLEMENTATION}\par
Implementation is the most crucial stage in achieving a successful system and giving the user's confidence that the new system is workable and effective. Implementation of a modified application to replace an existing one. This type of conversation is relatively easy to handle, provide there are no major changes in the system. Each program is tested individually at the time of development using the data and has verified that this program linked together in the way specified in the programs specification, the computer system and its environment is tested to the satisfaction of the user. The system that has been developed is accepted and proved to be satisfactory for the user. And so the system is going to be implemented very soon. A simple operating procedure is included so that the user can understand the different functions clearly and quickly. 
\section[{MAINTENANCE}]{MAINTENANCE}\par
The software will definitely undergo change once it is deliver to the customer. There can be many reasons for this change to occur. Change could happen because of some unexpected input values into the system. In addition, the changes in the system could directly affect the software operation. The software should be developed to accommodate changes that could happen during the post implementation period. expansion and contrast properties compared with many of the known results in the literature. According to the step construction proposed in this paper, the VCS with general access structure can be constructed by only applying (2, 2)-VCS recursively, regardless of whether the underlying operation is OR or XOR, where a participant may receive multiple share images. This result is most interesting, because construction of XOR for general access structure has never been claimed to be possible before. Using Cryptography scheme, image is transferred in a secure mode through the trusted center. Simultaneously, the quantum key is generated in the trusted center and it is distributed to the sender and the receiver. By, this authentication the third party cannot interfere in the middle during the data transfer. The proposed construction can generate optimal OR and XOR for each qualified set and our schemes can also reduce the APE in the most cases compared with the known results in the literature.\begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-2.png}
\caption{\label{fig_0}Fig}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-3.png}
\caption{\label{fig_1}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{} \par 
\begin{longtable}{}
\end{longtable} \par
  {\small\itshape [Note: a pixel which should be a black one can turn to a white pixel. While in ordered dithering we deals with individual pixels and it is takes less computation to generate the halftone image. Since this work is completely based on pixel by pixel manner so it is revealing operation of]} 
\caption{\label{tab_0}}\end{figure}
 			\footnote{© 2011 Global Journals Inc. (US) Global Journal of Computer Science and Technology Volume XI Issue XX Version I} 			\footnote{Decemberbetter to use ordered dithering with respect to error diffusion. We have also made a small change in the} 			\footnote{DecemberVisual Pixel Expansion of Secret Image} 		 		\backmatter  			  				\begin{bibitemlist}{1}
\bibitem[Droste ()]{b2}\label{b2} 	 		‘New results on visual cryptography’.  		 			S Droste 		.  	 	 		\textit{CRYPTO'96},  				1996. Springer-VerlagLNCS. 1109 p. .  	 
\bibitem[Yang ()]{b4}\label{b4} 	 		‘New visual secret sharing schemes using probabilistic method’.  		 			C N Yang 		.  	 	 		\textit{Pattern Recognit. Lett}  		2004. 25 p. .  	 
\bibitem[Blundo et al. ()]{b3}\label{b3} 	 		‘On the Contrast in visual cryptography schemes’.  		 			C Blundo 		,  		 			A De Santis 		,  		 			D R Stinson 		.  	 	 		\textit{J. Crypotology}  		1999. 12  (4)  p. .  	 
\bibitem[Chen ()]{b6}\label{b6} 	 		‘On the simplification of the acces: structure secret sharing schemes’.  		 			X M Chen 		.  	 	 		\textit{China Sci. Bulletin}  		1999. 15 p. .  	 	 (in Chinese) 
\bibitem[Cimato et al. ()]{b5}\label{b5} 	 		‘Probablistic visual cryptography schemes’.  		 			S Cimato 		,  		 			R De Prisco 		,  		 			A De Santis 		.  	 	 		\textit{Computer J}  		2006. 49  (1)  p. .  	 
\bibitem[Yang and Chen ()]{b7}\label{b7} 	 		‘Size -adjustable visual secret sharing schemes’.  		 			C N Yang 		,  		 			T S Chen 		.  	 	 		\textit{ASIA}  		2002. 2002. Springer-VerlagLNCS. 2501 p. .  	 
\bibitem[Naor and Shamir ()]{b0}\label{b0} 	 		‘Visual Cryptography’.  		 			M Naor 		,  		 			A Shamir 		.  	 	 		\textit{EUROCRYPT'94},  				 (Berlin)  		1995. Springer-Verlag. 950 p. .  	 
\bibitem[Bihman and Itzkovitz ()]{b1}\label{b1} 	 		‘Visual Cryptography with polarization’.  		 			E Bihman 		,  		 			A Itzkovitz 		.  	 	 		\textit{RUMP Session of CRYPTO'98},  				1997.  	 
\end{bibitemlist}
 			 		 	 
\end{document}
