Kan Zhang. Efficient Protocols for Signing Routing Messages. In Proceedings of the Symposium on Network and Distributed Systems Security (NDSS '98), March 1998. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
An Efficient Algorithm for Malicious Update Detection.. - Chakrabarti, Manimaran (Correct)
....2 6 2 2 8 1 1 3 3 2 Original Network (A) B) Fig. 1. Example showing the working of CC Algorithm A. Related Work The solutions proposed for detecting distance vector attacks can be broadly classified into three categories: Routing Information Techniques: In this type of techniques [6] [7] digital signatures are used to detect malicious distance vector updates in case of link attacks. However, these schemes are unable to detect router attacks. Intrusion Detection Techniques: These techniques [8] are used to detect the anomalous behavior in the routers, assuming that intrusion ....
K. Zhang, "Efficient Protocols for Signing Routing Messages," in Proc. NDSS, 1998.
Ariadne: A Secure On-Demand Routing Protocol for Ad Hoc.. - Hu, Perrig, Johnson (2002) (86 citations) (Correct)
....secure on demand ad hoc network routing protocols. However, as above, when the nodes in an ad hoc network are generally unable to verify asymmetric signatures quickly enough, or when network bandwidth is insufficient, these protocols may not be suitable. Cheung [9] Hauser et al. [16] and Zhang [57] describe symmetric key approaches to the authentication of link state updates, but they do not discuss mechanisms for detecting the status of these links. In wired networks, a common technique for authenticating HELLO packets is to verify that the the incoming network interface is the expected ....
Kan Zhang. Efficient Protocols for Signing Routing Messages. In Proceedings of the Symposium on Network and Distributed Systems Security (NDSS '98), March 1998.
Ariadne: A Secure On-Demand Routing Protocol for Ad Hoc.. - Hu, Perrig, Johnson (2002) (86 citations) (Correct)
....secure on demand ad hoc network routing protocols. However, as above, when the nodes in an ad hoc network are generally unable to verify asymmetric signatures quickly enough, or when network bandwidth is insufficient, these protocols may not be suitable. Cheung [9] Hauser et al. [15] and Zhang [56] describe symmetric key approaches to the authentication of link state updates, but they do not discuss mechanisms for detecting the status of these links. In wired networks, a common technique for authenticating HELLO packets is to verify that the the incoming network interface is the expected ....
Kan Zhang. Efficient Protocols for Signing Routing Messages. In Proceedings of the Symposium on Network and Distributed Systems Security (NDSS '98), March 1998.
Ariadne: A Secure On-Demand Routing Protocol for Ad Hoc.. - Hu, Perrig, Johnson (2002) (86 citations) (Correct)
.... in efficient one time signature algorithms [22, 55, 56, 81] micro )payment mechanisms [2, 27, 63, 79] server supported non repudiation [3] and for conditional anonymity [28] Hash chains were also used for efficient certificate revocation [57] and to authenticate link state routing updates [ 16, 26, 91]. Coppersmith and Jakobsson propose a storage efficient mechanism for one way chains [19] a one way chain with N elements only requires O(log(N) storage and O(log(N) computation to access an element. Each sender using TESLA for authentication generates a one way key chain, by repeatedly ....
Kan Zhang. Efficient protocols for signing routing messages. In Proceedings of the Symposium on Network and Distributed Systems Security (NDSS '98), San Diego, California, March 1998. Intemet Society.
Multi-Party Electronic Payments for Mobile Communications - Peirce (2000) (1 citation) (Correct)
....of fraud in the former as emphasised by Reiter. Non payment applications using hash chains have also been designed. S KEY [Hal94, Hal95, HMN 98] used hash chain values as passwords for user authentication. Hash chains have also been used for efficient 42 authentication of routing messages [HPT97, HPT99, Zha98], and multicast packets [Roh99] In contrast to authentication, Hauser and Tsudik [HT96] employed hash functions to provide conditional anonymity for consumers during the pre purchase browsing and service delivery phases of an e commerce transaction. Micali s certificate revocation scheme [Mic96, ....
K. Zhang. Efficient protocols for signing routing messages. In Proceedings of the
Efficient Security Mechanisms for Routing Protocols - Yih-Chun Hu Yihchun (2003) (8 citations) (Correct)
No context found.
Kan Zhang. Efficient Protocols for Signing Routing Messages. In Proceedings of the Symposium on Network and Distributed Systems Security (NDSS '98), March 1998.
Efficient Security Mechanisms for Routing Protocols - Yih-Chun Hu Yihchun (2003) (8 citations) (Correct)
No context found.
Kan Zhang. Efficient Protocols for Signing Routing Messages. In Proceedings of the Symposium on Network and Distributed Systems Security (NDSS '98), March 1998.
S-RIP: A Secure Distance Vector Routing Protocol - Wan, Kranakis, Van Oorschot (Correct)
No context found.
Kan Zhang. Efficient Protocols for Signing Routing Messages. In Proceedings of 1998.
Efficient Constructions for One-way Hash Chains - Hu, Jakobsson, Perrig (2003) (Correct)
No context found.
Kan Zhang. Efficient protocols for signing routing messages. In Proceedings of the Symposium on Network and Distributed Systems Security (NDSS '98), San Diego, California, March 1998. Internet Society. 23
ODSBR: An On-Demand Secure Byzantine Routing Protocol - Awerbuch, Curtmola.. (2003) (Correct)
No context found.
K. Zhang, "Efficient protocols for signing routing messages," in Symposium on Networks and Distributed Systems Security, 1998.
INSENS: Intrusion-Tolerant Routing in Wireless Sensor Networks - Deng, Han, Mishra (2002) (2 citations) (Correct)
No context found.
K. Zhang. "Efficient protocols for signing routing messages." In Proceedings of the Symposium on Network and Distributed Systems Security (NDSS '98), San Diego, California, March 1998.
Efficient Security Mechanisms for Routing Protocols - Yih-Chun Hu Yihchun (2003) (8 citations) (Correct)
No context found.
Kan Zhang. Efficient Protocols for Signing Routing Messages. In Proceedings of the Symposium on Network and Distributed Systems Security (NDSS '98), March 1998.
Enhancing Base Station Security in Wireless Sensor Networks - Deng, Han, Mishra (2003) (2 citations) (Correct)
No context found.
K. Zhang, "Efficient protocols for signing routing messages", In Proceedings of the Symposium on Network and Distributed Systems Security (NDSS '98), San Diego, Cali-fornia, March 1998.
Resisting Malicious Packet Dropping in Wireless Ad Hoc Networks - Just, Kranakis, Wan (2003) (Correct)
No context found.
Kan Zhang. Efficient Protocols for Signing Routing Messages. In Proceedings of 1997.
Efficient Security Mechanisms for Routing Protocols - Hu, Perrig, Johnson (2003) (8 citations) (Correct)
No context found.
Kan Zhang. Efficient Protocols for Signing Routing Messages. In Proceedings of the Symposium on Network and Distributed Systems Security (NDSS '98), March 1998.
Efficient Security for BGP Route Announcements - Nicol, Smith, Zhao (2003) (Correct)
No context found.
K. Zhang. Efficient Protocols for Signing Routing Messages. In Symposium on Network and Distributed Systems Security (NDSS '98), San Diego, California, 1998.
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