Upload
vikashkumar
View
214
Download
2
Embed Size (px)
DESCRIPTION
digital
Citation preview
Digitalsignatureisamechanismbywhichamessageisauthenticatedi.e.proving thatamessageiseffectivelycomingfromagivensender,muchlikeasignatureonapaperdocument.Digitalsignaturesarecomputedbasedonthe documents(message/information)thatneedtobesignedandonsomeprivate informationheldonlybythesender.Inpractice,insteadofusingthewhole message, a hash function is applied to the message to obtain the message digest. A hashfunction,inthiscontext,takesanarbitrary-sizedmessageasinputand producesafixed-sizemessagedigestasoutput.Amongthecommonlyusedhash functionsinpracticeareMessageDigest5(MD-5)andSecureHashAlgorithm (SHA).Thesealgorithmsarefairlysophisticatedandensurethatitishighly improbablefor twodifferentmessagestobemappedto the samehashvalue. UsingDigitalSignatureAuthentication,IntegrityandNonRepudiationcanbe enforced. So digital signature can be used to verify if a node is legitimate to respond inthenetworkandthisdigitalsignaturetechniqueisusedtoauthenticateall legitimatenodesofthenetwork,ifanymaliciousnodeiswillingtobepartofthe network then the access to that malicious node is restricted.Asshowninfigure4.1,duringroutecreationandmaintenancephase,nodes appendstheirdigitalsignaturetotheRREQandRREPpackets.Whenthesender broadcasts RREQ in the network, it appends its signature in the signature column of RREQpacket.Allfurtherrecipientsofthepacketsverifythedigitalsignatureof previousnodesbylistofallnodesandtheirrespectivedigitalsignature.Ifthe Figure Error! No text of specified style in document..1 Digital Signature signature is matched then the recipient node can be sure that it is a trusted node in the network. If the signature is found to be duplicated or the signature is found to be absent in the signature column then it is considered to be malicious node. Thus, only legitimatenodescantakepartintheprocessofroutecreationandmaintenance.It willalsobeabletohandlepacketmodificationandsinglemaliciousnodeproblem. The proposed algorithm is as follows (Sharma & Trivedi, 2011):