\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={High Security by using Triple Wrapping Feature and their Comparison}, 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{2015-01-15 (revised: 15 January 2015)} \def\TheID{\makeatother } \def\TheDate{2015-01-15} \title{High Security by using Triple Wrapping Feature and their Comparison} \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]{Pooja Lal Mundaniya} \author[2]{Naveen Choudhary} \affil[1]{ College of Technology And Engineering} \renewcommand\Authands{ and } \date{\small \em Received: 14 December 2014 Accepted: 31 December 2014 Published: 15 January 2015} \maketitle \begin{abstract} In the age of information, cryptography is a predominant obligation for the security of our documents. Cryptography inclusive of authentication, integrity, confidentiality and non-repudiation has lot to offer. To protect users? information and their data from being attacked, encryption and digital signature algorithms could be utilized with distinct approaches to administer secure network and security solutions. In the current scenario, encryption alone cannot withstand the novel attacks; for notable security, we require encryption with digital signature. In this paper symmetric, asymmetric algorithm and digital signature techniques are proposed to elevate security. ElGamal encryption algorithm, ElGamal digital signature algorithm and IDEA algorithms are employed in the proposed methodology. \end{abstract} \keywords{digital signature, elgamal algorithm, encrypt-sign, encrypt-sign-encrypt, idea algorithm, sign-encrypt, sign-encrypt-sign.} \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 ecurity for confidential data is required by innumerable organizations across the Globe, and cryptography fulfils this fundamental in different ways.\par It contributes confidentiality, integrity, authentication and non-repudiation of data. Cryptography is divided into two parts, namely symmetric and asymmetric cryptography. In symmetric (or secret key) cryptography, a single key is required for both encryption as well as for decryption. A problem of key sharing emanates from this single key, as the same key is required for decryption. Nonetheless, it has an advantage of speed. A serious concern is that there may be a chance that an enemy (attacker) can discover the secret key during transmission. While in asymmetric (public key) cryptography, two different keys are used, one for encryption i.e. public key and another key (private key) for decryption. It solves the problem of key sharing, but engenders the problem of low speed.\par For encryption, the optimal solution is to fuse public-key and secret-key systems in order to get both, the security and speed. This solution is called hybrid security. In our proposed paper, Encrypt-Sign-Encrypt (ESE) and Sign-Encrypt-Sign (SES) triple wrapping techniques are employed, and it is established that they are better and more secure than encrypt-then-sign and sign-then-encrypt techniques. In the sign-then-encrypt (SE) technique, a recipient can decrypt the message, followed by re-encrypting it with the signature intact and send it to a third party. As a consequence, that third party will believe the original author sent the message directly to him, while it was actually forwarded by the original recipient. In Encrypt-then-sign (ES) technique, an attacker can remove the signature, replace it with his own, and claim authorship of the message without knowing its contents. To overcome both the above problems, a novel technique is proposed, namely Encrypt-Sign-Encrypt (ESE) technique. In this ESE technique, double encryption is performed and the results demonstrate it to be more secure when compared to ES and SE. However, it has disadvantage of high computational time and computational cost. This computational time and cost is reduced by another proposed technique called Sign-Encrypt-Sign (SES). SES is also secure with an advantage that it requires less time and computational cost. The remainder of this paper is organized as follows: In section 2, brief description of hybrid cryptography is given. In the next section related work is presented. Section 4 presents the proposed scheme and is analyzed in detail. Section 5, comparison of proposed methodology with ES and SE is given, section 6 gives results and discussion and finally conclusions and future work are presented in the last section based on the implementation. \section[{II.}]{II.} \section[{Hybrid Cryptogrpahy}]{Hybrid Cryptogrpahy}\par Hybrid encryption is a mode of encryption that merges two or more encryption systems. It incorporates a combination of asymmetric and symmetric encryption to benefit from the strengths of each form of encryption. These strengths are respectively defined as speed and security. Hybrid encryption is considered a highly secure type of encryption as long as the public and private keys are fully secure. Digital signature is used to validate that the message was created by authorized sender, such that the sender cannot deny having sent the message and that the message was not altered in transit. The notion of a digital signature is useful and is a legal replacement for handwritten signature. Encryption and digital signature techniques are fundamental in any cryptographic tool for privacy of the data and authenticity respectively. Hybrid-key cryptosystem and digital signature, which is more secure and the security relies on the problem of solving discrete logarithms and on factorization \hyperref[b0]{[1]}. The hybrid scheme may use encrypt-then-sign or sign-then-encrypt technique. In this proposed work, triple wrapping feature is put to use by implementing Encrypt-Sign-Encrypt and Sign-Encrypt-Sign techniques. These proposed techniques are expected to be more secure in comparison to the existing techniques but at the cost of extra overhead. \section[{III.}]{III.} \section[{Related Work}]{Related Work}\par In \hyperref[b0]{[1]} encrypt-then-sign scheme is proposed. In this IDEA-RSA algorithm is used for hybrid encryption and RSA digital signature algorithm is used to obtain digital signature. The end result shows that hybrid cryptographic scheme can be used for fast encryption and digital signature jointly and achieved speed of 2.8 Mbps which is faster than the existing implementations. This scheme is applicable in secure internet computing, e-payment in distance education system as well as in a mobile environment, because the overall computational cost is low. This scheme is also advantageous for mobile devices like smart card based applications and many other applications.\par In \hyperref[b4]{[5]} a new deniable authentication protocol based on the generalized ElGamal signature scheme is proposed, and has two characteristics: 1. It enables an intended receiver to identify the source of a given message. 2. The intended receiver cannot prove the source of a given message to any third party. This new protocol needs less computation and communication time.\par Moreover the new protocol is on-interactive. Therefore, the new protocol is more efficient.\par In \hyperref[b2]{[3]}, author solves the problem of key management and database encryption in the implementation process of the database encryption system. Some difficult technology of encrypt / decrypt engine in the implementation process is discussed, the hybrid cryptography encryption program is presented based on IDEA combined with RSA, and the encryption system is designed and realized. The key management module is responsible for encryption key generation, distribution, updating and storage, and is the core of the database encryption system. This shows that, new program can solve problems and make the whole encrypted database system work effectively.\par In \hyperref[b9]{[10]} an improved version of ElGamal signature algorithm for better security is proposed and this makes the ElGamal digital signature algorithm more adaptable and extensive use of digital signatures to provide security guarantees. It reduces the overall operation, and also saves storage space. Moreover the proposed method can be applied with the specific role of a particular digital signature system, to upgrade its attack against the resilience of random numbers.\par In \hyperref[b7]{[8]} hybrid cryptography algorithm is designed for better security by combining two symmetric cryptography techniques Data Encryption Standard (DES) and International Data Encryption Standard (IDEA). This hybrid algorithm has high security of data transmission over the network. This work results into more secure transmission of data comparatively DES, IDEA and AES data encryption algorithms. As both symmetric algorithms are used for hybrid cryptography security, the computational process used for encryption and decryption of the plaintext and ciphertext is essentially same.\par The existing techniques videlicet Sign-then-Encrypt and Encrypt-then-Sign fails some security parameters as shown in Table \hyperref[tab_0]{1}. In SE, the recipient can decrypt the message, then re-encrypt it with the signature intact and send it to a third party. In ES, any attacker can remove the signature, replace it with his own, and claim authorship of the message without knowing its contents. To overcome both problems new (triple wrapping) ESE and SES methods are proposed which uses hybrid security, mixture of symmetric and asymmetric cryptography which solves the problem of key transmission and speed respectively. These proposed methods prove to be more secure as compared to existing techniques. \section[{IV.}]{IV.} \section[{Proposed Methodology}]{Proposed Methodology}\par In this proposed methodology, various issues in hybrid cryptography are analyzed and are improve for better security. Hybrid cryptography combines two or more encryption systems to achieve effective security, but as new techniques appear; the attacker generates new attack. In this paper, two techniques are proposed ESE and SES, and they take advantage of the triple wrapping feature. In ESE -double encryption is implemented. In the first stage of encryption, plaintext is encrypted followed by the second stage where the sender's signature is also attached. In SES -sender's private key is used firstly to sign the message (plaintext) and then the encrypted message (ciphertext). These proposed techniques turn out to be secure and are improved alternative to sign-then-encrypt and encryptthen-sign techniques. These novel techniques use IDEA algorithm for message encryption, ElGamal encryption algorithm for encrypting IDEA key and ElGamal digital signature algorithm for generating digital signature. \section[{Comparison of Proposed Methodology with es and se Methods}]{Comparison of Proposed Methodology with es and se Methods}\par Comparison is done on the basis of security parameters, computational time and cost. Two types of attacks are considered in proposed work videlicet third person attack and receiver attack. Both attacks are applied on existing methods as well as proposed methods and on this basis, security parameters are evaluated as shown in table 1, and the results establish that the proposed methodologies are more secure. \section[{Third Person Attack}]{Third Person Attack}\par In this attack, any third person (or man-inmiddle) can undertake the attacker work, and vandalize our information. In Encrypt-then-Sign and Sign-Encrypt-Sign techniques, the attacker can discard outer signature and attach his own digital signature. Now, the receiver will believe that message was sent by the third person and not the original sender. In this scenario, authentication fails. Nevertheless, this outer signature has an advantage of public verifiability, which means that any person can verify the signature owing to the fact that signature's public key is open to all, and this digital signature is signed by sender's private key only.\par In Sign-Encrypt-Sign technique if outer signature is changed by third person then original receiver will find out that the message has been attacked and it is not the original message, this is because the outer signature will not match the inner signature. So, SES technique is safe from this attack. \section[{Receiver attack}]{Receiver attack}\par In some cases if receiver becomes attacker; he can forward our signature to others. In Sign-then-Encrypt and Encrypt-Sign-Encrypt techniques, after the receiver receives the message, he decrypts it with his private key and again encrypts it (re-encrypt) and send it to the third person with our digital signature intact. That third person (new receiver) will observe that the message is sent by the original sender, but actually it has been sent by the original receiver.\par SES and ESE technique are safe from both attacks, and proves secure as compare to ES and SE techniques. \section[{Global Journal of C omp uter S cience and T echnology}]{Global Journal of C omp uter S cience and T echnology}\par Volume XV Issue II Version I Year ( ) H \section[{a) Sign-then-Encrypt (SE)}]{a) Sign-then-Encrypt (SE)}\par In this technique, the document is first digitally signed with private key of sender, and then that signed document is encrypted with hybrid encryption. Document is encrypted by employing IDEA key algorithm, and then IDEA key is encrypted with ElGamal Encryption Algorithm. This document is transmitted to the receiver. At the receiver end, SE document is decrypted with receiver's private key and with IDEA key, the encrypted message is deciphered. In this case receiver can verify that the document is transmitted by the original sender with sender's digital signature. Problem: In above technique, if the receiver becomes intruder, the recipient can decrypt the message, then reencrypt it with the signature intact and send it to a third party. That third party will believe that the original author sent the message directly to him, while it was actually forwarded by the original recipient. In this case, authentication fails, no public-verification and repudiation problem occurs. \section[{b) Encrypt-then-Sign (ES)}]{b) Encrypt-then-Sign (ES)}\par In this technique, the document is first encrypted with Hybrid encryption technique, and then the encrypted document is digitally signed by the sender.\par i. Problem Any attacker can remove the signature, replace it with his own, and claim authorship of the message without knowing its contents. In this case, authentication fails, as original sender's signature is removed by third person. \section[{c) Encrypt-Sign-Encrypt (ESE)}]{c) Encrypt-Sign-Encrypt (ESE)}\par In this proposed technique, the document is first encrypted with hybrid technique and then digitally signed with sender's private key. Then again encryption is done on that document. This last encryption is done for better security; as a consequence outer signature cannot be replaced by third person.\par i. Problem In ESE the inner encryption ensures only the intended recipient can read the message. In this case, the recipient won't know the message is signed until after it's decrypted. Encrypting a message twice is more time consuming. Furthermore, encrypt-then-sign is known to be vulnerable to attack. Double encryption requires more time and no public-verification. \section[{d) Sign-Encrypt-Sign (SES)}]{d) Sign-Encrypt-Sign (SES)}\par In this proposed technique, double signature is performed on document-one on plaintext and another on ciphertext. Here, the inner signature means the author is aware of the content. The encryption ensures only the recipient can decrypt it. And the outer signature means that the author intended the message for the recipient. If an attacker tries to claim ownership by removing the outer signature and replacing it with his own, then the (replaced) outer signature won't match the inner signature.\par i. Problem Computational time and cost is more as compared to ES, SE techniques but less than ESE technique.\par The architecture of sign-then-encrypt approach deteriorates from forwarding attack. On the other hand, the architecture of encrypt-then-sign approach deteriorates from cipher text stealing attacks. The twoblock approach has many security flaws and to alleviate those, we present the three-block approach (triple wrapping feature) i.e., Encrypt-Sign-Encrypt and Sign-Encrypt-Sign. One major drawback of three-block approach is that the cost involved in securing a message using Encrypt-Sign-Encrypt or Sign-Encrypt-Sign is the total costs of three blocks of digital signature and encryption. In addition to this, computation time for signature verification and decryption process is involved at the receiving end. All of these constitute the cost of performing cryptographic operation on a message. \section[{Results and Discussion}]{Results and Discussion}\par The computational cost is evaluated by summing the number of operations (i.e. modulo, hash, multiplication, addition, exponentiation, and division (inversion)) for all schemes ES, SE, SES and ESE. The results for the same are depicted in the graph as shown in figure5 and 6. All schemes are implemented using MATLAB and executed on a machine with a 1.73GHz Intel Dual Core processor, with 1GB installed memory.\par Security parameters of our proposed methodology such as confidentiality, authentication, integrity and non-repudiation are proves to be secure as compare to existing methods as shown in table \hyperref[tab_0]{1}. Figure \hyperref[fig_6]{5} shows the comparison between existing techniques and our proposed ESE and SES techniques. The results show that the proposed methodology ESE requires four times more computational time for encryption and decryption as compared to existing methods. And second proposed method SES utilizes approximately the same computational time when compared to ES and SE techniques. Figure \hyperref[fig_7]{6} shows the graph between computational cost and number of operations. \section[{a) Where}]{a) Where}\par Texp: the time for a modular exponential computation, Tm: the time for a modular multiplication computation, Th: the time for a one way hash function f(\textunderscore ) computation and Ta: the time for a modular addition / subtraction computation.\par ES and SE require almost same number of operations except in case of Hash operation during encryption where ES takes 1 operation more than SE technique. Furthermore, SES methodology is not far behind and utilizes only few more operations than the existing technology i.e., for SES encryption 1 Th, 3 Texp and 4 Tm operations more and for SES decryption 2 Th, 1 Texp and 1 Tm additional operations. However, ESE encryption put to use 27 Texp operations which is nearly twice the number of operations when compared to 15 Texp operations of the existing technology and 1.5 times greater than 18 Texp operations of the second proposed methodology SES. Although the computational time and cost of the proposed methodology increases, it still proves to be better in terms of security parameters such as confidentiality, authentication, integrity and nonrepudiation. \section[{VII.}]{VII.} \section[{Conclusion and Future Work}]{Conclusion and Future Work}\par Encryption together with digital signature technique is employed to safeguard users' vital information from being compromised as encryption independently can be vulnerable to pristine attacks. Here, security is boosted by the amalgamation of symmetric-key, asymmetric-key and digital signature algorithms. To be precise, the proposed methodology exerts the merits of IDEA, ElGamal encryption algorithm and ElGamal digital signature algorithm.\begin{figure}[htbp] \noindent\textbf{1}\includegraphics[]{image-2.png} \caption{\label{fig_0}Figure 1}\end{figure} \begin{figure}[htbp] \noindent\textbf{1}\includegraphics[]{image-3.png} \caption{\label{fig_1}Figure 1 :}\end{figure} \begin{figure}[htbp] \noindent\textbf{2}\includegraphics[]{image-4.png} \caption{\label{fig_2}Figure 2 :}\end{figure} \begin{figure}[htbp] \noindent\textbf{3}\includegraphics[]{image-5.png} \caption{\label{fig_3}Figure 3 :}\end{figure} \begin{figure}[htbp] \noindent\textbf{4}\includegraphics[]{image-6.png} \caption{\label{fig_4}Figure 4 :}\end{figure} \begin{figure}[htbp] \noindent\textbf{}\includegraphics[]{image-7.png} \caption{\label{fig_5}}\end{figure} \begin{figure}[htbp] \noindent\textbf{5}\includegraphics[]{image-8.png} \caption{\label{fig_6}Figure 5 :}\end{figure} \begin{figure}[htbp] \noindent\textbf{6}\includegraphics[]{image-9.png} \caption{\label{fig_7}Figure 6 :}\end{figure} \begin{figure}[htbp] \noindent\textbf{1} \par \begin{longtable}{P{0.5012820512820513\textwidth}P{0.08717948717948718\textwidth}P{0.07083333333333333\textwidth}P{0.09262820512820513\textwidth}P{0.09807692307692308\textwidth}} Techniques\tabcellsep \tabcellsep \tabcellsep \tabcellsep \\ \tabcellsep ES\tabcellsep SE\tabcellsep ESE\tabcellsep SES\\ Parameters\tabcellsep \tabcellsep \tabcellsep \tabcellsep \\ Authentication\tabcellsep NO\tabcellsep NO\tabcellsep YES\tabcellsep YES\\ Confidentiality\tabcellsep YES\tabcellsep NO\tabcellsep YES\tabcellsep YES\\ Integrity\tabcellsep YES\tabcellsep YES\tabcellsep YES\tabcellsep YES\\ Non-Repudiation\tabcellsep YES\tabcellsep NO\tabcellsep YES\tabcellsep YES\\ Public Verification\tabcellsep YES\tabcellsep NO\tabcellsep NO\tabcellsep YES\end{longtable} \par \caption{\label{tab_0}Table 1 :}\end{figure} \footnote{© 2015 Global Journals Inc. (US)} \footnote{© 2015 Global Journals Inc. (US) 1} \backmatter \par In this paper, we have proposed triple wrapping feature namely Encrypt-Sign-Encrypt and Sign-Encrypt-Sign techniques and presented a comparison between the Sign-then-Encrypt, Encrypt-then-Sign, Encrypt-Sign-Encrypt and Sign-Encrypt-Sign. The proposed scheme is more secure for hybrid encryption and digital signature as compared to existing techniques ES and SE. ESE and SES demonstrates confidentiality, integrity, authentication and non-repudiation, and also SES is publically verifiable. Computational time and cost required for proposed SES technique is almost same as existing techniques ES and SE, where as proposed ESE technique requires four times more computational time when compared to ES, SE and SES. Future work can be done on SES technique to reduce computational time and cost. \begin{bibitemlist}{1} \bibitem[Stallings and Security ()]{b14}\label{b14} \textit{}, William Stallings , Cryptography And Network Security . 2011. Prentice-Hall. (Fifth Edition) \bibitem[Rivest et al. ()]{b3}\label{b3} ‘A Method for Obtaining Digital Signatures and Public-Key Cryptosystems’. R L Rivest , A Shamir , L Adleman . \textit{Communications of the ACM} 1978. 21 (2) p. . \bibitem[Reddy and Raju ()]{b5}\label{b5} ‘A New Design of Algorithm for Enhancing Security in Bluetooth Communication with Triple DES’. K R Reddy , G S Raju . \textit{International Journal of Science and Research} 2013. 2 (2) p. . (IJ SR)) \bibitem[Gonzalez and Kinsner ()]{b11}\label{b11} ‘Comparison Of Cryptosystems Using A Single-Scale Statistical Measure’. D T Gonzalez , W Kinsner . \textit{26th IEEE Canadian Conference Of Electrical And Computer Engineering (CCECE)}, 2013. \bibitem[Subasree and Sakthivel ()]{b13}\label{b13} ‘Design Of A New Security Protocol Using Hybrid Cryptography Algorithms’. S Subasree , N K Sakthivel . \textit{IJRRAS} 2010. 2 (2) p. . \bibitem[Mohit and Biswas]{b12}\label{b12} \textit{Design of ElGamal PKC for Encryption of Large Messages}, P Mohit , G P Biswas . 38-3.42. IEEE. \bibitem[Shao ()]{b4}\label{b4} ‘Efficient deniable authentication protocol based on generalized ElGamal signature scheme’. Z Shao . \textit{Computer Standards \& Interfaces} 2004. 26 p. . \bibitem[Jun et al. ()]{b9}\label{b9} \textit{ElGamal Digital Signature Scheme With a Private Key Pairs}, Z Jun , Z H Ying , J W Don . 2010. IEEE. \bibitem[Jain ()]{b7}\label{b7} ‘Implementation Of Hybrid Cryptography Algorithm’. M Jain , A . \textit{International Journal Of Core Engineering \& Management(IJCEM)} 2014. 1 (3) p. . \bibitem[Jain et al. ()]{b8}\label{b8} ‘Improved Security with Signcryption’. S A Jain , A B Abhale , A S Jadhav . \textit{International Journal of Engineering Research and Applications (IJERA)} 2012. 2 (2) p. . \bibitem[Diffie and Hellman ()]{b1}\label{b1} ‘New Directions in Cryptography’. W Diffie , M E Hellman . \textit{IEEE TRANSACTIONS ON INFORMATION THEORY} 1976. 22 (6) p. . \bibitem[Khan and Singh ()]{b0}\label{b0} ‘On the security of Joint Signature and Hybrid Encryption’. M Y Khan , Y P Singh . \textit{IEEE} 2005. p. . \bibitem[Xing-Hui and Xiu-Jun ()]{b2}\label{b2} ‘Research of the Database Encryption Technique Based on Hybrid Cryptography’. W Xing-Hui , M Xiu-Jun . \textit{International Symposium on Computational Intelligence and Design IEEE} 2010. p. . \bibitem[Malhotra and Singh ()]{b6}\label{b6} ‘Study of Various Cryptographic Algorithms’. M Malhotra , A Singh . \textit{International Journal of Scientific Engineering and Research (IJSER)} 2013. 1 (3) p. . \bibitem[Zheng ()]{b10}\label{b10} Y Zheng . \textit{Digital Signcryption or How to Achieve Cost (Signature \&: Encryption) << Cost (Signature) + Cost (Encryption)}, 1996. Springer. p. . \end{bibitemlist} \end{document}