Abhishek Shukla et al. / (IJAEST) INTERNATIONAL JOURNAL OF ADVANCED ENGINEERING SCIENCES AND TECHNOLOGIES Vol No. 1, Issue No. 1, 058 - 060
E-Correspondence system with error correction code ( ECSECC) Abhishek Shukla (Research Scholar Singhania University) College of Computer Application R.K.G.Institute of Technology Ghaziabad,U.P.,INDIA abhishekknit@gmail.com
Meenu Sahni (Research Scholar Mewar University)
Department of Mathematics Bhagwati Institute of Technology & Sciences Ghaziabad,U.P.,INDIA mnu.sahni@rediffmail.com
Abstract— In this paper, we presented an errorless model of
to variety of information systems. Some keyis used in these systems when it embeds/extracts secret data. One natural application is a secret mailing system [5] that uses a symmetric key. Another application pays attention to the nature of steganography whereby the external data (e.g., visible image data) and the internal data (any hidden information) cannot be separated by any means. We will term this nature as an ―i nseparability‖ of the two forms of data. In the present paper we will show our basic model of an anonymous cum idiosyncratic Machiavellian e-mailing system. The interested reader may consult [1, 3, 4, 6, 7, 8 & 12].The structure of the present paper is as follows. In Section 2 we will make a short discussion on the E-Correspondence system with error correction code. Section 3 describes the scheme of the error correction code in E-Correspondence system. Section 4 describes the customization of ECorrespondence system with error correction code and its works.
ES
e-correspondence system for Internet communication. It is the model of a real-life secure mailing system for any organization. In this model Alice can send a secret message even to any strange person in an anonymous way. The users of this model are assumed to be may or may not be the members of a closed organization. If any error occurred during the transmission due to teeming channel, it can also be determine & encountered by error correction function.
T
Deo Brat Ojha
Department of Mathematics R.K.G.Institute of Technology Ghaziabad,U.P.,INDIA ojhdb@yahoo.co.in
IJ A
Keywords: Message, Transmission Error, Stegnography, Covert Mailing System, Error Correction function.
I.
INTRODUCTION
Human beings have long hoped to have a technique to communicate with a distant partner anonymously but later on distinctive and must be secure. We may be able to realize this hope by using steganography. Modern steganography has a relatively short history because people did not pay much attention to this skill until Internet security became a social concern. Most people did not know what steganography was because they did not have any means to know the meaning. Even today ordinary dictionaries do not contain the word ―st eganography.‖ Books on steganography are still very few [11],[10]. The most important feature of this steganography is that it has a very large data hiding capacity [9], [2]. It normally embeds 50% or more of a container image files with information without increasing its size. Steganography can be applied
ISSN: 2230-7818
II.
ECSECC
ECSECC is a steganography application program. In the following description, M ECSECC I denotes a member ECSECC I , and
M ECSECC II denotes a member ECSECC II . An CESSC consists of the three following components. 1. Envelope Producer (EP). 2. Message Inserter (MI). 3. Envelope Opener (EO). We denote M ECSECC I ’s CESSC as ECSECC I (i.e., customized ECSECC by M ECSECC I ). So, it is described as
ECSECC I ( EPECSECC I , MI ECSECC I , EOECSECC I ) . EPECSECC I
@ 2010 http://www.ijaest.iserp.org. All rights Reserved.
Page 58
is
Abhishek Shukla et al. / (IJAEST) INTERNATIONAL JOURNAL OF ADVANCED ENGINEERING SCIENCES AND TECHNOLOGIES Vol No. 1, Issue No. 1, 058 - 060
EECSECC I .
is the envelope (actually, an image file)
which is used by all other members in the organization when they send a secret message to (M ECSECC I ) .
EOECSECC I is produced from an original image ( EO) .
(M ECSECC I ) can select it according to his preference. ( EECSECC I ) has both the name and e-mail address of (M ECSECC I ) on the envelope surface (actually, the name and address are ―prin ted‖ on image ( EECSECC I ) . It will be placed at an open site in the organization so that anyone can get it freely and use it any time. Or someone may ask (M ECSECC I ) to send it directly to him/her. (MI ECSECC I ) is the component to insert (i.e., embed according to the steganographic scheme) (M ECSECC I ) ’s message into another member’s (e.g.,
M ECSECC II
)’s envelope
( EECSECC I ) when (M ECSECC I ) is sending a secret message (Mess.ECSECC I ) to (M ECSECC II ) . One important function of that has
been hidden in the envelope ( EECSECC II ) , and uses it when inserting a message (Mess.ECSECC I )
( EECSECC I )
in ( EECSECC II ) .
is a component that opens (extracts)
( EOECSECC I )
’s
―m essage
inserted‖
( EECSECC I (Mess.ECSECC II ) which (M ECSECC I )
envelope
received from
someone as an e-mail attachment. The sender (M ECSECC II )
IJ A
of the secret message (Mess.ECSECC II ) is not known until
(M ECSECC I ) opens the envelope by using ( EOECSECC I ) . III.
ERROR CORRECTION CODE
A metric space is a set C with a distance function dist : C C R [0, ) , which obeys the usual properties(symmetric, triangle inequalities, zero distance between equal points)[19,20]. 3.1. Definition
C{0,1}n be a code set which consists of a set of code words c i of length n. The distance metric between any two code words c i and c j in C is defined by Let
ISSN: 2230-7818
i
j
c
ir
r 1
c
c , c C. This is known as
jr
i
j
Hamming distance [21]. 3.2. Definition
An error correction function f for a code C is defined as f (ci ) {c j / dist (ci , c j ) is the minimum, over C {ci }} . Here, c j f ci is called the nearest neighbour of
ci [19]. 3.3. Definition
The measurement of nearness between two code words c and c is defined by nearness (c, c) dist (c, c) / n , it is obvious that 0 nearness (c, c) 1 [21]. 3.4. Definition
The fuzzy membership function for a code word c to be equal to a given c is defined as [21].
FUZZ (c) 0
if nearness(c, c) z z 0 1
z
otherwise
ES
(M ECSECC I ) is that it detects a key ( KeyECSECC I )
n
dist (c , c )
T
a component that produces M ECSECC I ’s envelope
IV.
CUSTOMIZATION OF AN ECSECC
Customization of an ECSECC for a member (M ECSECC I ) takes place in the following way.
(M ECSECC I )
first
decides a key ( KeyECSECC I ) when he installs the CESSC onto his computer. Then he types in his name ( NameECSECC I ) and e-mail address ( Email adrECSECC I ) . is secretly hidden (according to a
( KeyECSECC I )
steganographic procedure in his envelope ( EECSECC I ) This ( KeyECSECC I ) is eventually transferred to a message sender’s (MI ECSECC II )
in an invisible way. ( NameECSECC I )
and ( Email adrECSECC I ) are printed out on the envelope surface when (M ECSECC I )
produces ( EECSECC I )
by using
( EPECSECC I ) . ( KeyECSECC I ) is also set to ( EOECSECC I ) at the time of installation. ( NameECSECC I ) and ( Email adrECSECC I ) are also inserted (actually, embedded) automatically by (MI ECSECC I ) any time (M ECSECC I ) inserts his message
(Mess.ECSECC I ) in another member’s envelope
( EECSECC II ) .
The embedded ( NameECSECC I ) and ( Email adrECSECC I )
are
extracted by a message receiver (M ECSECC II )
by
( EOECSECC II )
.
@ 2010 http://www.ijaest.iserp.org. All rights Reserved.
Page 59
Abhishek Shukla et al. / (IJAEST) INTERNATIONAL JOURNAL OF ADVANCED ENGINEERING SCIENCES AND TECHNOLOGIES Vol No. 1, Issue No. 1, 058 - 060
ECSECC is a very easy-to-use system because users are not bothered by any key handling, as the key is always operated automatically. As CESSC doesn’t need any authorization bureau, this system can be very low cost. All these features overcome the drawbacks of an encrypted mailing system. Our approach provides the method to remove the error due to stymieing channel through fuzzy approach. . REFERENCES
[17] E. Kawaguchi, et al, ―A concept of digital picture envelope for Internet communication‖ in Information modeling and knowledge bases X, IOS Press, pp.343-349, 1999. [18] Eiji Kawaguchi, Hideki Noda, Michiharu Niimi and Richard O. Eason, ― A Model of Anonymous Covert Mailing System Using Steganographic Scheme, Information modelling and knowledge bases X‖,IOS Press, pp.8185,2003. [19] J.P.Pandey, D.B.Ojha, Ajay Sharma, ―En hance Fuzzy Commitment Scheme: An Approach For Post Quantum Cryptosystem‖, in Journal of Applied and Theoretical Information Technology, (pp 16-19 ) Vol. 9, No. 1, Nov. 2009. [20]V.Pless, ― Introduction to theory of Error Correcting Codes‖, Wiley , New York 1982. [21].A.A.Al-saggaf,H.S.Acharya,―A Fuzzy Commitment Scheme‖IEEE International Conference on Advances in Computer Vision and Information Technology 2830November 2007 – India
IJ A
ES
[1] Stefan Katzenbeisser and Fabien A.P. Petitcolas (eds) :― Information hiding techniques for steganography and digital watermarking‖, Artech House, 2000. [2] Neil F. Johnson, Zoran Duric and Sushil Jajodia :― Information Hiding‖, Kluwer Academic Publishers, 2001. [3] M. Niimi, H. Noda and E. Kawaguchi :"An image embedding in image by a complexity based region segmentation method", Proceedings of International Conf.on Image Processing'97, Vol.3, pp.74-77, Santa Barbara, Oct., 1997. [4] E. Kawaguchi and R. O. Eason :"Principle and applications of BPCS- Steganography", Proceedings of SPIE: Multimeda Systems and Applications, Vol.3528, pp.464-463, 1998. [5] URL http://www.know.comp.kyutech.ac.jp/BPCSe/Dpenve/DPENVe- pro_ down. html. [6] E. Kawaguchi,et al: ―Aconcept of digital picture envelope for Internet communication‖ in Information modeling and knowledge bases X,IOS Press, pp.343-349, 1999. [7] K. H. Ko, D. H. Choi, M. S. Cho, and J. W. Lee, ― New signature scheme using conjugacy problem.‖ (http://eprint.iacr.org/2002/168) [8] K. H. KO, S. J. Lee, J. H. Cheon, J. W. Han, J. S. Kang, and C Park,― New public- key cryptosystem using braid groups,‖ in Advances in Cryptology (Crypto’00), LNCS 1880, pp. 166-183, Springer- Verlag, 2000. [9] A. Menezes, M. Qu, and S. Vanstone, ―Keyagree-ment and the need for authentication,‖ in Proceed-ings of PKS’95, pp. 34-42, 1995. [10] L. Law, A. Menezes, M. Qu, J. Solinas, and S. Vanstone, An Efficient Protocol for Authenticated Key Agreement, Technical Report CORR98-05, Department of CO, University of Waterloo, 1998.
[11] L. Law, A. Menezes, M. Qu, J. Solinas, and S. Van-stone, ―An efficient protocol for authenticated key-agreement,‖ Design, Codes and Cryptography, vol. 28, no. 2, pp. 119-134, 2003 [12] Eiji Kawaguchi, Hideki Noda, Michiharu Niimi and Richard O. Eason, A Model of Anonymous Covert Mailing System Using Steganographic Scheme, Information modelling and knowledge bases X,IOS Press, pp.81-85,2003. [13] Stefan Katzenbeisser and Fabien A.P. Petitcolas (eds), ―Inform ation hiding techniques for steganography and digital watermarking‖, Artech House, 2000. [14] Neil F. Johnson, Zoran Duric and Sushil Jajodia,― Information Hiding‖, Kluwer Academic Publishers, 2001. [15] M. Niimi, H. Noda and E. Kawaguchi,"An image embedding in image by a complexity based region segmentation method", Proceedings of International Conf. on Image Processing'97, Vol.3, pp.74-77, Santa Barbara, Oct., 1997. [16] E. Kawaguchi and R. O. Eason,"Principle and applications of BPCS-Steganography", Proceedings of SPIE: Multimeda Systems and Applications, Vol.3528, pp.464-463, 1998.
T
V.CONCLUSION
ISSN: 2230-7818
@ 2010 http://www.ijaest.iserp.org. All rights Reserved.
Page 60