An Exhaustive Investigation of Security Issues Tended to by Different Cryptographic Algorithms

Themed Section: Science and Technology

An Exhaustive Investigation of Security Issues Tended to by Different

Cryptographic Algorithms

B. Sugumar*1_{, Dr. M. Ramakrishnan}2

1_{Research Scholar, Department of Computer Applications, Madurai Kamaraj University, Madurai, Tamil Nadu,}

India

2_{Professor and Head, Department of Computer Applications, Madurai Kamaraj University, Madurai, , Tamil}

Nadu, India

ABSTRACT

Internet applications and disseminated portable systems are better and expanding at extremely quick. Because of the modern advancement, secured method for information communicate over the Internet is turning into a testing errand. Interlopers hack the information and utilize it for their great reason. To defeat these undesirable demonstrations, cryptography is utilized to guarantee security of the secretive and secure message. While encoded information is difficult to translate, it is similarly simple to identify. Physically capable encryption calculations and appropriate key administration methods for the frameworks will help in accomplishing classification, validation and trustworthiness of information. In the present examination, different encryption calculations which can be utilized for dispersed portable systems are researched. The work depicts the different security issues tended to by the cryptography calculations by consolidating key administration plans. The proposed Key Escrow based Elliptic Curve Cryptographic calculation ensures for a hearty and more secure conveyed Certificate less specialist in dispersed portable systems. The security in view of the elliptic bend division key offering issue to key escrow idea can be a best selected security device for productive information transmission in disseminated versatile systems.

Keywords - Cryptography, Distributed Networks, Elliptic Curve Cryptography, Key Escrow, Mobile Networks, Security Issues

I.

Cryptography is the technique for accomplishing security by encoding messages utilizing key to make them reasonable. The fast improvement in the systems administration innovation drives a normal culture for exchanging of the information in a huge way. Henceforth the introduction of copying of information and re-dispersion by programmers additionally happen. In such circumstances, data must be secured while transmitting it. Touchy data like Mastercards, managing an account exchanges and standardized savings numbers should be secured. The encryption of information assumes a noteworthy part

Standard (DES) calculation [2]. These have continued as the concentration for think about in cryptography. The DES is overall acknowledged square figure for the past quarter century. The cryptographic calculations grew so far were not examined for the potential shortcomings against conceivable assaults on the framework [3]. National Institute of Standards (NIST), made an exhaustive investigation of existing cryptographic calculations and built up a typical standard by name Advanced Encryption Standard (AES) [4]. A Belgian accommodation, Rijndael, turned into the main AES [5] because of its cautious and rich outline alongside its adaptable execution characteristics. Specialists around there foreseen DES would be supplanted by AES of institutionalizing encryption, which is valid in a portion of the items today. AES was supplanted by DES in piece figure class. The secured frameworks required a standard casing work, and the Public key foundation (PKI) is the first of such structure.

Intrusion location for remote framework is mind boggling and filled of unpredictability fundamentally because of the dynamic character of conveyed portable systems, their exceedingly constrained hubs, and the absence of focal observing focuses. Old IDSs are not connected effectively to remote system. Scientists needed to grow new methodologies or else adjust existing philosophies/approaches for dispersed versatile systems [6]. In the present work, we propose and completely execute another procedure for Intrusion identification framework named Key escrow with Elliptic Curve Algorithm uniquely intended for disseminated versatile systems. Contrasted with different methodologies, Key escrow based Elliptic Curve Cryptography exhibits higher malignant conduct recognition rates in disseminated condition while does not enormously influence the system QoS exhibitions to accomplish arrange standard. Encryption is an exceptionally regular method for advancing the data security. There is probability of hacking the information while sharing from balanced.

To keep the information being hacked there are such a large number of methods, for example, Digital Signature, Key escrow Cryptography can be actualized. The present work centers around the Key escrow based procedures in elliptic bend cryptography which is utilized to ensure the information in dispersed condition.

Motivation behind Cryptography

Cryptography fills following needs as appeared in Figure 1.

Classification: The decide of privacy indicates that lone the sender and the proposed beneficiary ought to have the capacity to get to the substance of a message. Validation: Authentication components help to make evidence of personalities. This technique guarantees that the wellspring of the message is effectively recognized.

Respectability: This honesty technique checks that the substance of the message remain a similar when it achieves the right beneficiary as sent by the sender. Non-Repudiation: Non-denial does not enable the sender of a message to discredit the claim of not sending the message.

Access Control: Access Control determines and joystick who can get to what.

Figure 1: Motivation behind Cryptography

II.

Open Key Cryptography

It includes two sets of keys: one for encryption and another for decoding. Key utilized for encryption is an open key and appropriated. On the opposite side key utilized for decoding is private key.

Key Escrow Cryptography

This is well constructed application for encryption and decoding keys are created by key escrow specialists (outsider endowed key escrow). The decoding keys are part into two sections and given to isolate escrow experts. Access to one a player in the key does not help unscramble the information; both keys ought to be acquired.

Translucent Cryptography

In this framework the administration can unscramble a portion of the messages, however not all. Just portion of message can be unscrambled and remaining part can't be decoded.

Symmetric Key Cryptography

System utilizes same key for encoding and deciphering data. The sender and beneficiary of information must share same key and keep data mystery keeping information access from outside. The Kinds of cryptography are charted in Figure 2.

Figure 2: Kinds of Cryptography

TABLE 1

APPLICATIONS OF CRYPTOGRAPHIC SCHEMES

S.N o

Cryptography Application area Description Examples

1 Public Key Cryptography Secure message

transmission using

proxy

Encryption and

decryption keys (two pairs) are used

Low power computers in the networks

2 Public key cryptography(SSL) Certificates and

authentication

Public and

private keys used

Password authentication

3 Public Key Cryptography Digital Signature and

Authentication

Public and

private keys used

Electronic Mail

4 Key Escrow Cryptography Monitoring

communications in the mobile networks

Third party

escrow key is used

Used by government

mobile network agencies to monitor the messages

5 Translucent Cryptography Fractional Observing of

Data in the network

Partial key

viewing of data

based on the

parameter

Monitored by agencies

where absolute

monitoring is not required

Dispersed Key Generation Algorithms

As of late, organize security has outside basic consideration from both sight and sound and versatile correspondence. As the information organize turns out to be all the more concealing and its degree winds up bigger, arrange intrusion and assault have turned out to be serious dangers to portable system clients [7-10]. This is feasible for the rising remote portable

customer conventions are talked about in the work [14], their utilization is limited. This is on the grounds that:

1. These conventions are not considered for huge quantities of versatile clients.

2. They encounter inadequately from inconvenience like absence of versatility of the Key Distribution Centre (KDC), which maintains outsider that disperses cryptographic keys safely and keeps up all the included login and logout records.

In both the ordinary wired parcel systems and framework upheld Remote systems, security in organize is acquired utilizing joint validation and encryption of the data. General society key transportation and the outsider are regularly used to meet the security wants. Remote systems have asset limitation subsequently PKI based conventions are hard to work in the appropriated condition [15]. These conventions are troublesome and vitality expending subsequently not valuable for expansive scale remote conveyed systems. The remote systems have little radio range for correspondence, precarious system topology and irregularity activities which make the outsider confirmation convention implausible to work. Serious source imperatives and expansive system adaptability of remote systems require a security convention which is productive and secured. Latest examinations show, preloading of symmetric keys [16] in gadgets can take care of the issue of key appropriation and administration in remote systems after the hub game plan [17]. A safe connection between the neighboring hubs in the system can be position up because of the shared keys. Pre-execution of key escrow keys into remote gadgets have two basic procedures, in particular, ace key approach and outsider key approach.

Key Escrow Plan for Remote Systems

In the key escrow based technique, symmetric key is over-burden in the memory of the gadgets if there

should arise an occurrence of Ace key approach and this key is utilized for secured information exchange. The approach is clear and proficient because of low overhead of key foundation and utilization of just a single key, however it doesn't create enough security for remote systems. These strategy ineffectively experience the ill effects of even a solitary hub catch assault bargains the total system in the event of ace key approach as all the keys utilized by the system are presented to the assailant. Combine insightful key based approach utilizes [18], an arrangement of symmetric keys rather than one key are stacked in the gadget in the system. The preloading is done to such an extent that any two hubs have a select match for the correspondence between them. The strategy guarantees enough security since restricting of a key of any combine of hubs can change coordinate correspondence between those two hubs as it were. This technique asks for a substantial key stockpiling memory. The technique is likewise not adaptable with respect to a system involving 'n' hubs, it ends up obligatory for each gadget to store (n-1) keys. The streamlining system can be utilized to decrease this number in the system. Be that as it may, even with above advanced numbers, the adaptability remains an issue.

be checked enigmatically and the defenselessness to particular assaults must be tried for every single conceivable case in the system. The current proposed philosophies were grave dissected. Based on examination, one can order assaults in various classes. Thinking about the general security of any framework, Assaults are ordered into four kinds in particular, honesty, classification, verification and accessibility [19]. Honesty assault tries to adjust or changes the present condition of data of the framework. Accessibility assaults happen when a legitimate client is precluded access from claiming information or assets, because of simultaneous unapproved access of these assets. Secrecy assaults happens if a restricted segment get to is finished by noxious client deliberately. Verification assault happens if a legitimate client isn't recognized and approval comes up short. In spite of the fact that analysts have made an endeavor to discover ways to deal with protect from all the above assaults, sadly, none are effective. A total and viable measure of security isn't found yet. The current techniques change in their measure of security against these conceivable assaults. There are strategies accessible that recognize such assaults [20]. Some of the time, the assault is identified simply after the assault or the incomplete assault. It is additionally conceivable that these assaults may go unrevealed. However such approachs assume a key part, regardless of whether the assurance is fragmented, as it decreases the general demolition in the system. The genuine worries about the framework in the later stage are diminished [21]. Utilization of cryptographic capacity has been proposed by a few mathematicians that disallow decoding of the code under these states of the assault. It is exceptionally uncommon to recognize cryptographic capacity related to every issue. To look at wired partner, remote systems are level to security assaults extending from aloof listening stealthily to fiery meddling. As it is considerably harder to guard arrange elements against the gatecrashers in

appropriated versatile condition, occasional break-ins in a substantial scale portable system are almost unsurprising over a vast day and age. Since two customary accreditation Innovations, to be specific the single confirmation expert (CA) and the various leveled CA innovation don't function admirably in expansive versatile impromptu systems, so we have to propose novel way to deal with keep up security in this condition. Among them, Computerized signature confirmation benefit innovation in light of limit mystery sharing instrument is the most troublesome strategy [11-13]. The essential thought of the plan is that a trusted merchant is set up at the framework improvement stage, and after that the framework mystery key is shared among the system elements by the edge division mystery sharing instrument. At last the applicable data about the trusted merchant is annihilated and the trusted merchant is repudiated. The present work displays a circulated key age calculation in light of Elliptic Bend Division Advanced Mark Calculation, which influences the key match and key offer to be produced totally by the collaboration of Shared hubs disseminated in the systems, and framework key itself isn't recouped in any hub, consequently understanding the confirmation benefit without trusted merchant at the framework improvement stage.

The accreditation benefit innovation in view of limit Division mystery sharing system in versatile specially appointed systems is profoundly dissected. The circulated key age calculation in view of Elliptic Bend Division Advanced Mark Calculation is proposed, which create the key and key offer without accepting any confided in merchant, and enhance the security of conveyed affirmation in portable Specially appointed systems. The preparatory investigations uncover that the appropriated key age calculation for conveyed confirmation is practical.

The wireless mobile expertise is the most promising field in this world; the unwired endeavour has long been an objective in most organizations, and the advent of 802.11 now makes achieving that goal a realistic dependability. A Distributive mobile network is nothing but collection of independent mobile nodes that can communicate to each other by the use of radio waves. The mobile node communicate with each other by using two ways one is the mobile nodes communicate directly if they are in radio range of each other, whereas others needs the help of intermediate nodes to route their packets in the distributed network. Due to its important characteristics, such as wireless distributed medium, dynamic distributed topology, distributed cooperation key management, Distributed mobile network is vulnerable to different kinds of security attacks like worm hole, black hole, rushing attack etc. Intrusion detection for wireless infrastructure is more difficult and filled of difficulty mainly due to the dynamic character of such networks, their highly forced nodes, and the lack of central monitoring points. Previous IDSs are not applied easily to wireless network. Researchers have to develop new approaches or else adapt existing approaches for the mobile network. We propose and fully implement a new methodology for intrusion-detection system named Enhanced Key escrow based with Elliptic Curve Algorithm (ECC) specially designed for distributed mobile networks. Compared to modern approaches, Key escrow based ECC demonstrates higher malicious- behaviour-detection rates in certain conditions while does not greatly affect the network QoS performances.

Dispersed versatile system is a developing, rousing and fundamental innovation nowadays because of the brisk extension, enlargement in remote applications. There are principally five wellbeing administrations as appeared in Figure 3.

1. Confirmation: Correct uniqueness is known to the correspondence connect.

2. Privacy: Correspondence data is held shielded from criminal gathering.

3.Integrity: Message is unaffected all through correspondence.

4. Non Denial: The wellspring of the message can't dismiss having sent the message.

5. Availability: The typical administration details in resistance of all sort of assaults.

Figure 3: Mobile Network Safety Services

III.

Security in Mobile Networks

Appropriated Open key Elliptic bend Cryptography validation conspire offers extensively more prominent information security for a given key size. On the off chance that the bit key size is littler it is additionally conceivable to execute for a given level of security so it devour less power and less cost generation. The littler key size makes speedier cryptographic tasks, running on littler hubs and conservative programming in dispersed versatile applications.

So for information security ECC is the immense decision for following reasons. The information security reasons are graphed in Figure 4.

1. ECC build up great security of given key size amid information transmission in the system.

2. By utilizing littler keys it make more minimal usage, quick cryptographic tasks.

3. Less power utilization and warmth generation. 4. In ECC, there is efficient and smaller equipment usage in cell phones.

5. It is for all intents and purposes difficult to discover private key so it isn't workable for outsider to get the mystery.

Figure 4: ECC Data Security

IV.

ECC based Digital Signature Schemes

ECC based Advanced mark plans can be utilized to offer the accompanying essential cryptographic administrations in the disseminated condition:

1. Information honesty (the guarantee that information has not been changed by prohibited or obscure way)

2. Information validation (the certification that the wellspring of information is as asserted)

Bundle disappointment assault has dependably been a most imperative danger to the security in circulated versatile systems and in addition arrange time postpone makes framework moderate and influences the system choice steering power. Our proposed plot is utilized to avoid assaults in the disseminated systems. We reach the conclusion that plan is more reasonable to be executed in appropriated arrange. A distributed frame work is required to keep such information up to date about the compromises and removal due to expiration of the time. This distributed framework is responsible to authenticate the user who is component of the system. For secure communication authentication is major key factor. In the absence of authentication it is easy to forge or spoof someone„s key in the network. The PKI cryptosystem has two dominating trust models, namely, centralized and web-of-trust trust models. To attain network scalability, the centralized key distributed model is a hierarchical key distributed structure instead of a single CA. Multiple CA roots are necessary for a large network, such as the Internet and this model is the so called distributed key distributed model . To obtain an efficient key management system for heterogeneous networks two more variations of the distributed key models are added to the initial types. These key distributed models are CA-view and hybrid models. The CA view is similar to the distributed key model. The Key escrow distributed model glues the centralized and the distributed ECC models together. To establish the secret key a series of protocols are required to be built. The protocols in the distributed mobile networks suffer from problems like weak security, lack of scalability, high energy overhead for key management, and increased end to end data latency.

Appropriated Convention trade keys between hubs inside a control aggregate through the focal of the control head give the basic mystery key. The mystery keys are invigorated intermittently and the control

hubs are changed occasionally to upgrade security. The convention improves the survivability of the system by dealing with trade off and disappointments of control hubs. It gives the certification that the correspondence stays secure notwithstanding the bargain of some other hub in the appropriated arrange. The issue of the correspondence cost, bit key size is as yet unsolved. The current key administration framework is moderate and not adaptable. By and large the present situation requests a superior and speedier key administration conspire in portable systems. Working towards this, an endeavor has been made propose a plan which utilizes transitively shut structure. People in general key cryptosystem like elliptic bend cryptography circulated demonstrate is utilized to trade the keys between the true blue clients. In this way, the entire key administration life cycle is accomplished. The encryption and unscrambling of the message is accomplished alongside the transmission of them to the substantial clients. The parameters utilized as a part of the procedure are dynamic and change is capricious to make the interloper's activity troublesome promotion lessened the cost. Consequently, the general framework will have the capacity to deal with the entire procedure of conveyed key administration.

V.

condition. This technique is called as Key escrow based ECC calculation. This safe correspondence likewise is fit for adjusting to the adjustment in the portable hubs and assaults in the appropriated natural conditions. It is conceivable to make the dynamic circulated mystery key administration condition reproduction. The reproduced execution can be noted. This reproduction is likewise equipped for improving the calculations and diminished the correspondence cost amid information transmission.

A Portable System is an arrangement of remote versatile hubs that can talk with each other without the utilization of predefined foundation or brought together administrator controller. In the versatile specially appointed system, client hubs can specifically speak with other client hubs utilizing their radio range; if the hubs are not in the immediate correspondence run they utilize the middle of the road hubs to speak with each other in the system. Among all the current security issues of specially appointed system, the nature of correspondence and absence of foundation bolster make the security especially all the more difficult. Various security components has been created and proposed, yet it is still hard to guarantee that entire system is free from any malevolent assault. This work centers around key escrow based Elliptic bend enter administration in completely disseminated versatile specially appointed systems.

Exhibit approaches for confirmation administrations rely upon unified administration approaches by either authentication experts (CA) or key appropriation focuses. A brought together approach might be worthy in situations where a particular hub can be secured and is available by different hubs of the system. Notwithstanding, for the remote specially appointed systems that we envision for our focused on applications, an incorporated approach will experience the ill effects of a solitary purpose of administration dissent and might be inaccessible by

organize hubs requiring CA administrations. Along these lines a more strong ECC based CA approach must be utilized. This requirement for remote specially appointed systems is directly an extremely dynamic research zone. To Give CA technique in a specially appointed system is to allocate a solitary hub to be the CA not to all. The accomplishment of this plan relies upon that solitary CA hub. Since disappointment of one hub breaks the framework, this approach isn't blame tolerant. Thus this approach is very helpless, since a foe needs just to bargain one hub to secure the mystery key. At last, given the unusualness and expected portability of specially appointed systems, it might be conceivable that hubs won't have the capacity to achieve the CA in due course, making accessibility significantly capricious. Accordingly, a solitary CA can't adequately benefit an entire specially appointed system.

In the present work, we propose a dynamic completely circulated Key escrow construct endorsement expert plan situated in light of a polynomial over elliptic bend for Portable Systems, which however has better cryptography in nature. The security depends on the elliptic bend discrete logarithm issue, yet the members' keys are disseminated by a Division focus, which takes a considerable measure of badly designed in handy applications. The work offers a Division sharing plan in view of a polynomial over elliptic bend, in these plan members will hold conceivable sub-mystery keys.

The Key escrow based conveyed testament less expert, comprises of n server hubs which, overall, have an open/private key combine K. People in general key K is known to all hubs in the system, while the private key k is separated into n shares (s1, s2 , s3, . . . , sn ), one for every server. The Key escrow based dispersed endorsement less specialist signs a testament by delivering a division limit bunch signature. Every hub creates a halfway division signature utilizing its division mystery key offer and presents the incomplete authentication less signature to a combiner C. The combiner can be any hub and requires at any rate t + 1 offers to effectively recreate the division advanced mark. The reference paper work [24] demonstrates that Completely Circulated Testament Specialist Methodologies utilizes a (k, n) edge plan to disseminate a RSA endorsement marking key to all hubs in the system. It likewise utilizes certain and proactive mystery sharing systems to trade off the authentication marking key and secure against dissent of administration assaults however not for all hubs. This arrangement infer that, long haul specially appointed systems with hubs fit for open key encryption. Be that as it may, since the administration is dispersed among every one of the hubs when they join the system, there is no compelling reason to pick or choose any specific server hubs. Their answer likewise utilizes a (n, k) limit signature plan to frame a circulated testament expert. They improve the accessibility highlight of Commonsense PKI (open key foundation) for Specially appointed Remote Systems [25] by picking n to be every one of the hubs in the system.

VI.

Security Analysis

The Key Escrow based Elliptic Bend Cryptography requires a conveyed organize framework to give the set up, mystery key sharing and confirmation period of the administrations. The principle advantages of this plan are its accessibility and that its polynomial

over the elliptic bend. The security of our plan relies upon the Unmanageability of Elliptic Bend Division mystery key sharing Issue. This procedure makes the Division Mystery key authentication less specialist more powerful against a few sorts of assaults. This is alluded to the elliptic bend logarithm issue, on the off chance that we make an examination between the RSA and ECC calculations by practically identical key sizes as far as computational exertion for cryptanalysis. Impressively littler key size can be utilized for ECC contrasted with RSA. Along these lines, there is a computational preferred standpoint to utilizing key escrow based ECC with a shorter key length than an equivalently secure RSA. Since all hubs are a piece of the Division mystery key sharing administration, it is sufficient that an asking for hub has t one-bounce neighbors for the Division mystery key sharing administration to be accessible. The measure of system wide activity is additionally restricted. The cost of accomplishing this accessibility is an arrangement of rather complex support conventions, e.g. the offer set up and the offer check conventions. A well-assembled number of mystery key offers are additionally shown to bargain since every hub has its own particular offer when contrasted with just the specific information hubs in the mostly dispersed arrangement. The parameter of key size in this way may should be picked bigger since an aggressor might have the capacity to trade off a bigger number of offers between each offer refresh. This thusly influences the accessibility of the administration.

Dispersed Division mystery key sharing specialists are one of the principle strategies that have been utilized for issuing, checking and dealing with the matched keys in portable impromptu systems. In our plan we proposed a Key escrow with conveyed testament less specialist in light of polynomial over elliptic bend and in view of division limit key cryptography. This plan gives a strong and more secure disseminated Declaration less expert over the appropriated versatile system, which however has better cryptography in nature. The security depends on the elliptic bend Division key sharing issue.

VII.

The field of cryptography used to pass on messages safely. The objective of cryptography is to affirm the message got by the expected beneficiaries safely. Cryptography tries to maintain a strategic distance from the gatecrasher from understanding the message. In the present work, essential ideas of cryptography regarding security and information exchange effectiveness measures are considered. In the work, we attempted to sort the issues of multi bounce message seek over encoded information in conveyed versatile system. We ought to build up a plan which gives greater security while keeping up the inquiry and information protection in the circulated arrange. We can achieve it by consolidating Key Escrow ideas with Elliptic bend based calculation. This plan will offer preferred standpoint of added substance includes together with a superior level of security. As a result of ECC and key blending utilized as a part of the plan, this is appropriate for the system applications with restricted computational cost. With investigation, we can demonstrate that proposed plan may give adaptability towards the information and inquiry security. This will diminish the correspondence cost over the information transmission in the conveyed arrange. This plan gives best extension to different

security issues and offer conceivable outcomes for incorporated key administration plans.

VIII.

1. W. DIFFIE AND M. E. HELLMAN, ―NEW DIRECTIONS IN CRYPTOGRAPHY,‖ IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. IT-22,NOV.1976, PP.644–54.

2. W. F. EHRSAM,S.M. MATYAS, C.H.MEYER, AND W. L. TUCHMAN, ―A CRYPTOGRAPHIC KEY MANAGEMENT SCHEME FOR IMPLEMENTING THE DATA ENCRYPTION STANDARD,‖ IBM SYST. JOURNAL, VOL.17, PP.106-125,FEB.1978

3. CATHERINE MEADOWS ―FORMAL METHODS FOR CRYPTOGRAPHIC PROTOCOL ANALYSIS: EMERGING ISSUES AND TRENDS‖ IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 21, NO. 1, JANUARY 2003PP44-53

4. W. STALLINGS, CRYPTOGRAPHY AND NETWORK SECURITY: PRINCIPLES AND PRACTICE, 2ND ED., PRENTICE HALL,1999.

5. K. SHIM, ―CRYPTANALYSIS OF MUTUAL AUTHENTICATION AND KEY EXCHANGE FOR LOW POWER WIRELESS COMMUNICATIONS,‖ IEEE COMMUN.LETT., VOL.7, PP.248–250,2003.

6. PRANJALI DEEPAK NIKAM , VANITA RAUT ,-IMPROOVED MANET SECURITY USING ELLIPTIC CURVE CRYPTOGRAPHY AND EAACK. 2015 INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND COMMUNICATION NETWORKS 7. ADRIAN P. LAUF, RICHARD A. PETERS AND

WILLIAM H.ROBINSON,"A DISTRIBUTED INTRUSION DETECTION SYSTEM FOR RESOURCE-CONSTRAINED DEVICES IN AD-HOC NETWORKS," AD HOC NETWORKS, VOL.8, NO.3, PP.253-266,MAY 2010. 8. WOLFGANG KIESS AND MARTIN MAUVE,"A SURVEY

ON REAL-WORLD IMPLEMENTATIONS OF MOBILE AD -HOC NETWORKS,"AD HOC NETWORKS, VOL.5, NO. 3, PP.324-339,APRIL 2007.

NETWORKS,"AD HOC NETWORKS, VOL.3, NO.5, PP. 656-667,SEPTEMBER 2005.

10. NIKOS KOMNINOS, DIMITRIS VERGADOS AND CHRISTOS DOULIGERIS, "DETECTING UNAUTHORIZED AND COMPROMISED NODES IN MOBILE AD HOC NETWORKS,"AD HOC NETWORKS, VOL.5, NO.3, PP.289-298,APRIL 2007

11. SHAMIR A, "HOW TO SHARE A SECRET," COMMUNICATIONS OF THE ACM, VOL. 22, NO. 11, PP.612-613,1979.

12. A.D.SANTIS, Y.DESMEDT, Y.FRANKLE, AND M. YUNG, "HOW TO SHARE A FUNCTION SECURELY (EXTEND SUMMARY)," PROCEEDINGS OF THE TWENTY-SIXTH ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING, PP.522-533,1987.

13. JIEJUN K AND ZERFOS P,"PROVIDING ROBUST AND UBIQUITOUS SECURITY SUPPORT FOR MOBILE AD -HOC NETWORKS," PROC. OF THE 9TH INTERNATIONAL CONFERENCE ON NETWORK PROTOCOLS,2001, PP.251-260.

14. RONALD L.RIVEST,ADI SHAMIR AND LEONARD M. ADLEMAN, A METHOD FOR OBTAINING DIGITAL SIGNATURES AND PUBLIC-KEY CRYPTOSYSTEMS, COMMUNICATIONS OF THE ACM 21(1978)(2), PP. 120–126

15. L. ESCHENAUER, V.D. GLIGOR, A KEY -MANAGEMENT SCHEME FOR DISTRIBUTED SENSOR NETWORKS, IN: PROCEEDINGS OF THE 9TH ACM

CONFERENCE ON COMPUTER AND

COMMUNICATIONS SECURITY,NOVEMBER 2002. 16. J. HEATHER AND S. SCHNEIDER. TOWARDS

AUTOMATIC VERIFICATION OF AUTHENTICATION PROTOCOLS ON AN UNBOUNDED NETWORK.IN 13TH COMPUTER SECURITY FOUNDATIONS WORKSHOP, PAGES 132–143.

17. ABDELHAMID OUARDANI,SAMUEL PIERRE,HANIFA BOUCHENEB SECURITY PROTOCOL FOR MOBILE AGENTS BASED UPON THE COOPERATION OF SEDENTARY AGENTS ELSEVIER JOURNAL OF NETWORK AND COMPUTER APPLICATIONS 30(2007) 1228–1243

18. L. ESCHENAUER AND V. D. GLIGOR, ―A KEY -MANAGEMENT SCHEME FOR DISTRIBUTED SENSOR NETWORKS,‖ IN PROC. CCS„02. NEW YORK, , USA ACMPRESS,2002, PP.41–47

19. K.LU,Y.QIAN,M.GUIZANI, AND H.-H.CHEN,―A DISTRIBUTED KEY MANAGEMENT SCHEME IN HETEROGENEOUS WIRELESS SENSOR NETWORKS,‖

IEEE TRANSACTION ON WIRELESS

COMMUNICATIONS,2007.

20. EL RHAZI A, PIERRE S, BOUCHENEB H. SECURE PROTOCOL IN MOBILE AGENT ENVIRONMENTS.IEEE CCECE 2003, MAY 4–7, VOL. 2, MONTREAL, PP.777–80.

21. WALTER FUMY AND PETER LANDROCK ―PRINCIPLES OF KEY MANAGEMENT‖ IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 11, NO. 5, JUNE 1993 PP 785 TO 793

22. M. ZAPATA AND N. ASOKAN, “SECURING AD HOC ROUTING PROTOCOLS,” IN PROC. ACMWORKSHOP WIRELESS SECURE.2002, PP.1–10.K.ELISSA,“TITLE OF PAPER IF KNOWN,” UNPUBLISHED.

23. L. ZHOU AND Z. J. HAAS, SECURING AD HOC NETWORKS.IEEENETWORKS,VOLUME 13,ISSUE 6 1999.