Seung Yi, Prasad Naldurg, and Robin Kravets. Security-Aware Ad-Hoc Routing for Wireless Networks. Technical Report UIUCDCS-R-2001-2241, Department of Computer Science, University of Illinois at Urbana-Champaign, August 2001.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....situations [1, 2] Because of their natural characteristics, MANETS utilize message relay to deliver messages. For e#ciency, many have proposed routing algorithms to uniquely support this purpose [3, 4] Recently, a flurry of research has been directed at protecting routing in this environment [5, 6, 7]. In this work, we illustrate the complexities involved with evaluating MANET security protocols by analyzing the proposed Secure Routing Protocol (SRP) 8] 1.1 Cryptography and Security Because MANETs are put into practice, it behooves us to find ways to protect these networks with the common ....

S. Yi, P. Naldurg, and R. Kravets. Security-aware ad-hoc routing for wireless networks. Technical Report UIUCDCS-R-2001-2241, University of Illinois at Urbana-Champaign, August 2001.

....by its assumptions, the high computational overhead (hop by hop public key cryptography, for each transmitted packet) and the implementation of physically tamper resistant modules. The protection of the route discovery process has been regarded as an additional Quality ofService (QoS) issue [Yi01], by choosing routes that satisfy certain quantifiable security criteria. In particular, nodes in a MANET subnet are classified into different trust and privilege levels. A node initiating a route discovery sets the sought security level for the route; i.e. the required minimal trust level for ....

S. Yi, P. Naldurg, R. Kravets, "Security-Aware Ad-Hoc Routing for Wireless Networks," UIUCDCS-R-2001-2241 Technical Report, Aug. 2001

....by its assumptions, the high computational overhead (hop byhop public key cryptography, for each transmitted packet) and the implementation of physically tamper resistant modules. The protection of the route discovery process has been regarded as an additional Quality of Service (QoS) issue [17], by choosing routes that satisfy certain quantifiable security criteria. In particular, nodes in a MANET subnet are classified into different trust and privilege levels. A node initiating a route discovery sets the sought security level for the route; i.e. the required minimal trust level for ....

S. Yi, P. Naldurg, R. Kravets, "Security-Aware Ad-Hoc Routing for Wireless Networks," UIUCDCS-R-2001-2241 Technical Report, Aug. 2001.

....[10] have proposed a secure ad hoc routing protocol based on secret sharing; unfortunately, this protocol is based on erroneous assumptions, e.g. that each node cannot impersonate the MAC address of multiple other nodes. Yi, et al. also have proposed a general framework for secure ad hoc routing [21]. Attack AODV DSR ARAN Remote redirection modif. of seq. numbers Yes No No modif. of hop counts Yes No No modif. of source routes No Yes No tunneling Yes Yes Yes, but only to lengthen path Spoofing Yes Yes No Fabrication fabr. of error messages Yes Yes Yes, but non repudiable fabr. of ....

S. Yi, P. Naldurg, and R. Kravets. Security-aware ad hoc routing for wireless networks. In Proc. ACM Mobihoc, 2001.

....it and also assumes that the packets it receives from its neighbors are authentic. This naive trust model allows a malicious node to inject erroneous routing requests or routing updates into a network, which can paralyze the entire network. To deal with such attacks, recently several researchers [5, 9, 10, 32] have proposed security extensions to existing routing protocols that include mechanisms for authenticating the routing control packets in the network. To the best of our knowledge, however, none of the proposed secure routing protocols include any provisions for authenticating data packets. One ....

....and proposed to use asymmetric cryptography for securing ad hoc routing protocols. Although their approach could provide strong security, performing a digital signature on every routing control packet could lead to performance bottleneck on both bandwidth and computation. Yi, Naldurg, and Kravets [32] present a security aware routing protocol which uses security (e.g. trust level in a trust hierarchy) as the metric for route discovery between pairs. Perrig et al. 28] use symmetric primitives for securing routes between nodes and a trusted base station in a resource extremely constrained ....

S. Yi, P. Naldurg, R. Kravets. Security-Aware Ad-Hoc Routing for Wireless Networks. Technical Report, UIUCDCS-R-20012241, UILU-ENG-2001-1748

....use of secure hardware to limit the damage that can be done by a compromised node. Papadimitratos and Haas [40] present work that secures against non colluding adversaries, and they do not authenticate intermediate nodes that forward ROUTE REQUESTs, and thus do not handle authorization. Yi et al. [55] discuss authorization issues. Our previous work, SEAD [20] uses hash chains to authenticate routing updates sent by a distance vector protocol; however, that approach builds on a periodic protocol, and such protocols tend to have higher overhead than on demand protocols and may not be suitable ....

Seung Yi, Prasad Naldurg, and Robin Kravets. Security-Aware Ad hoc Routing for Wireless Networks. Technical Report UIUCDCS-R-2001-2241, Department of Computer Science, University of Illinois at Urbana-Champaign, August 2001.

....DSR or AODV to enable scalable routing schemes. In Zone Routing Protocol (ZRP) 45, 71, 33] proactive schemes are used in local zones while remote routing requests are served by reactive schemes. Recently many researchers have proposed secure routing protocols for ad hoc networks. Yi et al. [106] treat security as part of QoS and realize a scheme with AODV to discover routes with security protections. Zhou et al. 110] and Dahill et al. 17] propose to use public key cryptosystem and digital signature to secure on demand ad hoc routing protocols. Basagni et al. 5] uses a network wide ....

S. Yi, P. Naldurg, and R. Kravets. Security-aware Ad Hoc Routing for Wireless Networks. Technical Report UIUCDCS-R-2001-2241, Department of Computer Science, Unverisity of Illinois at UrbanaChampaign, August 2001.

....IDs, nuglet counter and cryptographic materials (but not the code) is compulsory. The cross certification architecture calls for public key cryptography, which exerts a high demand on computing resources. The amount of overhead is also a concern. Another line of thought can be traced to Yi [59], who proposes levels of protection as a negotiable metric in route discovery. In this way, a pair of nodes establishes a certain application specific level of protection before any securitysensitive tra#c begins. As mentioned, the simple availability of cryptographic protection does not solve the ....

S. Yi, P. Naldurg, and R. Kravets. Security-aware ad hoc routing for wireless networks. In Proceedings of the 2001.

....use of secure hardware to limit the damage that can be done by a compromised node. Papadimitratos and Haas [39] present work that secures against non colluding adversaries, and they do not authenticate intermediate nodes that forward ROUTE REQUESTs, and thus do not handle authorization. Yi et al. [54] discuss authorization issues. Our previous work, SEAD [19] uses hash chains to authenticate routing updates sent by a distance vector protocol; however, that approach builds on a periodic protocol, and such protocols tend to have higher overhead than on demand protocols and may not be suitable ....

Seung Yi, Prasad Naldurg, and Robin Kravets. Security-Aware Ad hoc Routing for Wireless Networks. Technical Report UIUCDCS-R-2001-2241, Department of Computer Science, University of Illinois at Urbana-Champaign, August 2001.

No context found.

S. Yi, P. Naldurg, and R. Kravets. Security-Aware Ad Hoc Routing for Wireless Networks. Poster presentation, ACM Symposium on Mobile Ad Hoc Networking & Computing (Mobihoc), 2001.

No context found.

Seung Yi, Prasad Naldurg, and Robin Kravets. Security-Aware Ad-Hoc Routing for Wireless Networks. Technical Report UIUCDCS-R-2001-2241, Department of Computer Science, University of Illinois at Urbana-Champaign, August 2001.

No context found.

Seung Yi, Prasad Naldurg, and Robin Kravets. Security-Aware Ad-Hoc Routing for Wireless Networks. Technical Report UIUCDCS-R-2001-2241, Department of Computer Science, University of Illinois at Urbana-Champaign, August 2001.

No context found.

S. Yi, P. Naldurg, and R. Kravets. Security-aware ad hoc routing for wireless networks. Proc. of 2nd ACM Mobile Ad Hoc Networking and Computing (MobiHoc'01), pp. 299--302, 2001.

No context found.

P. N. S. Yi and R. Kravets, "Security-Aware Ad-Hoc Routing for Wireless Networks," in Report No. UIUCDCS-R-2001.

No context found.

Seung Yi, Prasad Naldurg, and Robin Kravets. Security-aware ad hoc routing for wireless networks. Technical Report UIUCDCS-R-2001-2241, UILUENG -2001-1748, University of Illinois at UrbanaChampaign, August 2001.

No context found.

S. Yi, P. Naldurg, and R. Kravets. Security-aware ad hoc routing for wireless networks. In Proc. ACM Mobihoc, 2001.

No context found.

Seung Yi, Prasad Naldurg, and Robin Kravets. Security-Aware Ad-Hoc Routing for Wireless Networks. Technical Report UIUCDCS-R-2001-2241, Department of Computer Science, University of Illinois at Urbana-Champaign, August 2001.

No context found.

S. Yi, P. Naldurg, and R. Keavets. Security-aware ad-hoc routing for wireless networks. Technical Report UIUCDCS-R-2001-2241, UIUC/CS, 2001.

No context found.

Seung Yi, Prasad Naldurg, Robin Kravets, "Security-aware ad-hoc routing for wireless networks", Technical Report UIUCDCS-R-2001-2241, UIUC, 1304 West Springfield Avenue, Urbana, IL 61801-2987, USA, Aug. 2001.

No context found.

S.Yi, P. Naldurg, R. Kravets, "Security-aware ad hoc routing for wireless networks." In Proceedings MobiHoc'01

No context found.

S. Yi, P. Naldurg, R. Kravets, Security-aware ad hoc routing for wireless networks, in: Proceedings of the 2001.

No context found.

Seung Yi, Prasad Naldurg, and Robin Kravets. Security-Aware Ad-Hoc Routing for Wireless Networks. Technical Report UIUCDCS-R-2001-2241, Department of Computer Science, University of Illinois at Urbana-Champaign, August 2001.

No context found.

S. Yi, P. Naldurg, R. Kravets. "Security-Aware AdHoc Routing for Wireless Networks." UIUCDCS-R2001 -2241 Technical Report, Aug. 2001.

No context found.

S. Yi, P. Naldurg, and R. Kravets , Security-Aware Ad Hoc Routing for Wireless Networks, , Poster presentation, ACM Symposium on Mobile Ad Hoc Networking & Computing (Mobihoc), Long Beach, California, October, 2001.

No context found.

S. Yi, P. Naldurg and R. Kravets, "Security-Aware Ad-Hoc Routing for Wireless Networks," UIUCDCS-R-2001-2241 Technical Report, August 2001.

First 50 documents

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC