| A. Perrig, R. Canetti, D. Song, D. Tygar, "Efficient and Secure Source Authentication for Multicast," in Network and Distributed System Security Symposium, NDSS '01, Feb. 2001. |
....relying on digital signatures. Other significant works include SEAD [26] and Ariadne [28] that provide efficient secure solutions for the DSDV [43] and DSR [30] routing proto cols, respectively. While SEAD uses one way hash chains to provide authentication, Ariadne uses a variant of the Tesla [46] source authentication tech nique to achieve similar security goals. 14 Marti et al. 37] address a problem similar to the one we consider, survivability of the routing service when nodes selectively drop packets. They take advantage of the wireless cards promiscuous mode and have trusted nodes ....
Adrian Perrig, Ran Canetti, Dawn Song, and Doug Tygar. Efficient and secure source authentication for multicast. In Network and Distributed System Security Symposium, February 2001.
....for the SRP protocol, ARIADNE needs some mechanism to bootstrap authentic keys required by the protocol. In particular, each node needs a shared secret key (K S,D , is the shared key between a source S and a destination D) with each node it communicates with at a higher layer, an authentic TESLA [3, 4] key for each node in the network and an authentic Route Discovery chain element for each node for which this node will forward RREQ messages. ARIADNE provides point to point authentication of a routing message using a message authentication code (MAC) and a shared key between the two parties. ....
A. Perrig, R. Canetti, D. Song, J.D. Tygar, Efficient and secure source authentication for multicast, in proceedings of NDSS 2001.
....for the SRP protocol, ARIADNE needs some mechanism to bootstrap authentic keys required by the protocol. In particular, each node needs a shared secret key (K S,D , is the shared key between a source S and a destination D) with each node it communicates with at a higher layer, an authentic TESLA [3, 4] key for each node in the network and an authentic Route Discovery chain element for each node for which this node will forward RREQ messages. ARIADNE provides point to point authentication of a routing message using a message authentication code (MAC) and a shared key between the two parties. ....
A. Perrig, R. Canetti, D. Song, J.D. Tygar, Efficient and secure source authentication for multicast, in proceedings of NDSS 2001.
....to be explored in the analysis. We conclude that WKA BKR has low computational overhead. 4. RELATED WORK There has been a great deal of work on secure group communications over the last few years on topics ranging from algorithms for group key establishment to authentication for large groups [8, 2, 10, 14, 29, 28, 24]. The use of logical key trees for scalable group rekeying was independently proposed by Wallner et al. [33] and Wong et al. [34] Mittra [22] proposed Iolus, a distributed framework for addressing the same problem. Periodic (batched) group rekeying was proposed and evaluated in [6, 27, 19, 37] ....
A. Perrig, R. Canetti, D. Song, and D. Tygar. Efficient and Secure Source Authentication for Multicast. Proc. of NDSS 2001.
....efforts have been made to devise a systematic analysis on a bounded trace of neighbor s transmissions. Related future work includes mobile network tracing [69, 68] and node classification based on data mining technologies [21] 6. 4 More work on securing MANET multicast protocols Perrig et al. [76, 77] have devised data integrity support for Internet multicast applications. In [40, 41] similar integrity support has been integrated into unicast ad hoc routing schemes to foil routing misbehavior. However, so far little efforts have been exerted on securing multicast protocols in ad hoc networks. ....
A. Perrig, R. Canetti, D. Song, and J. Tygar. Efficient and Secure Source Authentication for Multicast. In Network and Distributed System Security Symposium (NDSS), 2001.
No context found.
Adrian Perrig, Ran Canetti, Dawn Song, and J. D. Tygar. Efficient and Secure Source Authentication for Multicast. In Proceedings of the 2001.
No context found.
Adrian Perrig, Ran Canetti, Dawn Song, and J. D. Tygar. Efficient and Secure Source Authentication for Multicast. In Network and Distributed System Security Symposium (NDSS'01), February 2001.
No context found.
Adrian Perrig, Ran Canetti, Dawn Song, and J. D. Tygar. Efficient and Secure Source Authentication for Multicast. In Proceedings of the 2001.
No context found.
A. Perrig, R. Canetti, D. Song, and J. D. Tygar. Efficient and secure source authentication for multicast. In Proceedings of the Symposium on Network and Distributed Systems Security (NDSS 2001.
No context found.
A. Perrig, R. Canetti, D. Song, and J. D. Tygar. Efficient and secure source authentication for multicast. In Proceedings of the Symposium on Network and Distributed Systems Security (NDSS 2001.
No context found.
A. Perrig, R. Canetti, D. Song, and J. D. Tygar. Efficient and secure source authentication for multicast. In Proceedings of the Symposium on Network and Distributed Systems Security (NDSS 2001.
No context found.
Adrian Perrig, Ran Canetti, Dawn Song, and J. D. Tygar. Efficient and Secure Source Authentication for Multicast. In Proceedings of the 2001.
No context found.
Adrian Perrig, Ran Canetti, Dawn Song, and J. D. Tygar. Efficient and Secure Source Authentication for Multicast. In Network and Distributed System Security Symposium (NDSS'01), February 2001.
No context found.
Adrian Perrig, Ran Canetti, Dawn Song, and J. D. Tygar. Efficient and Secure Source Authentication for Multicast. In Proceedings of the 2001.
....powerful processors) Ariadne can authenticate routing messages using one of three schemes: shared secrets between each pair of nodes, shared secrets between communicating nodes combined with broadcast authentication, or digital signatures. We primarily discuss here the use of Ariadne with TESLA [43, 44], an efficient broadcast authentication scheme that requires loose time synchronization. Using pairwise shared keys avoids the need for synchronization, but at the cost of higher key setup overhead; broadcast authentication such as TESLA also allows some additional protocol optimizations. In ....
....only attempts to authenticate nodes. In this paper, we secure only a basic version of DSR, with a limited path cache) without these optimizations, and the use of these optimizations is beyond the scope of this paper. 3. OVERVIEW OF TESLA In this paper, we describe Ariadne using the TESLA [43, 44] broadcast authentication protocol for authenticating routing messages, since TESLA is efficient and adds only a single message authentication code (MAC) to a message for broadcast authentication. Adding a MAC (computed with a shared key) to a message can provide secure authentication in ....
Adrian Perrig, Ran Canetti, Dawn Song, and J. D. Tygar. Efficient and Secure Source Authentication for Multicast. In Network and Distributed System Security Symposium, NDSS '01, pages 35--46, February 2001.
....authenticated broadcast are impractical for sensor networks. First, most proposals rely on asymmetric digital signatures for authentication, which are impractical for multiple reasons, which we describe in section 1. The recently proposed TESLA protocol provides efficient authenticated broadcast [42,43]. However, TESLA is not designed for the limited computing environments we encounter in sensor networks for the following three reasons: 526 PERRIG et al. TESLA authenticates the initial packet with a digital signature. Clearly, digital signatures are too expensive to compute on our sensor nodes, ....
A. Perrig, R. Canetti, D. Song and J.D. Tygar, Efficient and secure source authentication for multicast, in: Network and Distributed System Security Symposium, NDSS'01 (2001).
....This technique was independently discovered by Cheung [8] in the context of authenticating link state routing updates. A related approach was used in the Guy Fawkes protocol for interactive unicast communication [1] In the context of multicast streamed data it was proposed by several authors [2, 3, 5, 27, 28]. The main idea of TESLA is that the sender attaches to each packet a MAC computed with a key k known only to itself. The receiver buffers the received packet without being able to authenticate it. A short while later, the sender discloses k and the receiver is able to authenticate the packet. ....
....suffices to provide broadcast authentication, provided that the receiver has synchronized its clock with the sender ahead of time. This article is an overview of the TESLA broadcast authentication protocol. A more detailed description is in a forthcoming book [30] and in our earlier publications [27, 28]. A standardization effort for TESLA is under way in the Multicast Security (MSEC) working group of the IETF [26] TESLA is used in a wide variety of applications, ranging from broadcast authentication in sensor networks [29] to authentication of messages in ad hoc network routing protocols [18] ....
[Article contains additional citation context not shown here]
A. Perrig, R. Canetti, D. Song, and J. D. Tygar. Efficient and secure source authentication for multicast. In Proceedings of the Symposium on Network and Distributed Systems Security (NDSS 2001.
....powerful processors) Ariadne can authenticate routing messages using one of three schemes: shared secrets between each pair of nodes, shared secrets between communicating nodes combined with broadcast authentication, or digital signatures. We primarily discuss here the use of Ariadne with TESLA [42, 43], an efficient broadcast authentication scheme that requires loose time synchronization. Using pairwise shared keys avoids the need for synchronization, but at the cost of higher key setup overhead; broadcast authentication such as TESLA also allows some additional protocol optimizations. In ....
....only attempts to authenticate nodes. In this paper, we secure only a basic version of DSR, with a limited path cache) without these optimizations, and the use of these optimizations is beyond the scope of this paper. 3. OVERVIEW OF TESLA In this paper, we describe Ariadne using the TESLA [42, 43] broadcast authentication protocol for authenticating routing messages, since TESLA is efficient and adds only a single message authentication code (MAC) to a message for broadcast authentication. Adding a MAC (computed with a shared key) to a message can provide secure authentication in ....
Adrian Perrig, Ran Canetti, Dawn Song, and J. D. Tygar. Efficient and Secure Source Authentication for Multicast. In Network and Distributed System Security Symposium, NDSS '01, pages 35--46, February 2001.
....powerful processors) Ariadne can authenticate routing messages using one of three schemes: shared secrets between each pair of nodes, shared secrets between communicating nodes combined with broadcast authentication, or digital signatures. We primarily discuss here the use of Ariadne with TESLA [43, 44], an efficient broadcast authentication scheme that requires loose time synchronization. Using pairwise shared keys avoids the need for synchronization, but at the cost of higher key setup overhead; broadcast authentication such as TESLA also allows some additional protocol optimizations. In ....
....only attempts to authenticate nodes. In this paper, we secure only a basic version of DSR, with a limited path cache) without these optimizations, and the use of these optimizations is beyond the scope of this paper. 3. OVERVIEW OF TESLA In this paper, we describe Ariadne using the TESLA [43, 44] broadcast authentication protocol for authenticating routing messages, since TESLA is efficient and adds only a single message authentication code (MAC) to a message for broadcast authentication. Adding a MAC (computed with a shared key) to a message can provide secure authentication in ....
Adrian Perrig, Ran Canetti, Dawn Song, and J. D. Tygar. Efficient and Secure Source Authentication for Multicast. In Network and Distributed System Securi _ty Symposium, NDSS '01, pages 3546, February 2001.
....Cache; for subsequent packets to this destination, the sender may use any other route to that destination in its Cache, or it may attempt a new Route Discovery for that target if necessary. 3. Overview of TESLA We base the authentication in Ariadne on the TESLA broadcast authentication protocol [67, 68], since TESLA is efficient and adds only a single message authentication code (MAC) to a message for authentication . Adding a MAC (computed with a shared key) to a message provides secure authentication in point to point communication; in broadcast however, multiple receivers need to know the MAC ....
....code (MAC) e.g. HMAC [6] and a shared key between the two parties. However, for authentication of a broadcast packet such as a ROUTE REQUEST, we cannot use a simple MAC, since any one receiver that knows the MAC key can alter the content and re compute the MAC. We instead use the TESLA [67, 68] broadcast authentication protocol, which we review in Section 3. In general, ad hoc network routing protocols do not need secrecy or confidentiality. These properties are required to achieve privacy or anonymity for the sender of messages. Even in the Internet, it is challenging to achieve ....
Adrian Perrig, Ran Canetti, Dawn Song, and J. D. Tygar. Efficient and secure source authentication for multicast. In Network and Distributed System Security Symposium, NDSS '01, February 2001.
No context found.
A. Perrig, R. Canetti, D. Song, D. Tygar, "Efficient and Secure Source Authentication for Multicast," in Network and Distributed System Security Symposium, NDSS '01, Feb. 2001.
No context found.
A. Perrig, R. Canetti, D. Song, and D. Tygar, Efficient and Secure Source Authentication for Multicast, Proc. Network and Distributed System Security Symp., Feb. 2001.
No context found.
A. Perrig, R. Canetti, D. Song and J.D. Tygar. Efficient and Secure Source Authentication for Multicast. - ISOC Network and Distributed System Security Symposium 2001.
No context found.
Adrian Perrig, Ran Canetti, Dawn Song, and J. D. Tygar. Efficient and Secure Source Authentication for Multicast. In Network and Distributed System Security Symposium, NDSS '01, 2001.
No context found.
A. Perrig, R. Canetti, D. Song, and D. Tygar. Efficient and Secure Source Authentication for Multicast. In Network and Distributed System Security Symposium, NDSS '01, February 2001.
No context found.
A. Perrig, R. Canetti, D. Song, and D. Tygar. Efficient and secure source authentication for multicast. In Proc. of Network and Distributed System Security Symposium, February 2001.
No context found.
A. Perrig, R. Canetti, D. Song, and D. Tygar. Efficient and secure source authentication for multicast. In Proceedings of Network and Distributed System Security Symposium, February 2001.
No context found.
A. Perrig, R. Canetti, D. Song, D. Tygar, "Efficient and Secure Source Authentication for Multicast," in Network and Distributed System Security Symposium, NDSS '01, Feb. 2001.
No context found.
A. Perrig et al., "Efficient and Secure Source Authentication for Multicast," 8th Annual Internet Society Symp. Network and Distributed System Security, 2001.
No context found.
A. Perrig, R. Canetti, D. Song, and J. Tygar, "Efficient and secure source authentication for multicast," Proceedings of the Symposium on Network and Distributed System Security (NDSS 2001.
No context found.
A. Perrig, R. Canetti, D. Song, and J. Tygar. Efficient and secure source authentication for multicast. In: Network and Distributed System Security Symposium, NDSS'01, 2001.
No context found.
A. Perrig, R. Canetti, D. Song, and J. D. Tygar. Efficient and secure source authentication for multicast. In Proc. NDSS'01, San Diego, CA, Feb. 2001.
No context found.
A. Perrig, R. Canetti, D. Song, and J. D. Tygar. Efficient and secure source authentication for multicast. In Proc. NDSS'01, San Diego, CA, Feb. 2001.
No context found.
A. Perrig, R. Canetti, D. Song, and D. Tygar, "Efficient and secure source authentication for multicast," in Proc. Network and Distributed System Security Symposium, NDSS '01, San Diego, CA, 2001.
No context found.
A. Perrig, R. Canetti, D. Song, and D. Tygar. Efficient and Secure Source Authentication for Multicast. In Network and Distributed System Security Symposium, NDSS '01, February 2001.
No context found.
A. Perrig, R. Canetti, D. Song, and D. Tygar, "Efficient and secure source authentication for multicast," in Network and Distributed System Security Symposium, February 2001.
No context found.
A. Perrig, R. Canetti, D. Song, and J. D. Tygar. Efficient and secure source authentication for multicast. In Proc. NDSS'01, San Diego, CA, Feb. 2001.
No context found.
A. Perrig, R. Canetti, D. Song, and D. Tygar, "Efficient and secure source authentication for multicast," in Network and Distributed System Security Symposium, February 2001.
No context found.
Adrian Perrig, Ran Canetti, Dawn Song, and J. D. Tygar. Efficient and Secure Source Authentication for Multicast. In Network and Distributed System Security Symposium, NDSS '01, pages 35--46, February 2001.
No context found.
A. Perrig, R. Canetti, D. Song, and D. Tygar. Efficient and secure source authentication for multicast. In proc. Network and Distributed System Security Symposium, (NDSS '01), San Diego, CA, Feb. 2001.
No context found.
A. Perrig, R. Canetti, D. Song, and D. Tygar, "Efficient and secure source authentication for multicast," in Proc. Network and Distributed System Security Symposium, NDSS '01, San Diego, CA, 2001.
No context found.
Perrig, A., Canetti, R., Song, D. and J.D. Tygar, "Efficient and Secure Source Authentication for Multicast", Network and Distributed System Security Symposium, NDSS 2001.
No context found.
Perrig, A., Canetti, R., Song, D. and J.D. Tygar, "Efficient and Secure Source Authentication for Multicast", Network and Distributed System Security Symposium, NDSS 2001.
No context found.
A. Perrig, R. Canetti, D. Song, and D. Tygar, "Efficient and secure source authentication for multicast," in Proc. Network and Distributed System Security Symposium, NDSS '01, San Diego, CA, 2001.
No context found.
Perrig, A., Canetti, R., Song, D. and J. Tygar, "Efficient and Secure Source Authentication for Multicast", Network and Distributed System Security Symposium, NDSS 2001.
No context found.
Perrig, A., Canetti, R., Song, D. and J.D. Tygar, "Efficient and Secure Source Authentication for Multicast", Network and Distributed System Security Symposium, NDSS 2001.
No context found.
Perrig, A., Canetti, R., Tygar, D. and D. Song, "Efficient and Secure Source Authentication for Multicast", in Proc. of Network and Distributed System Security Symposium NDSS 2001, pp. 35-46, 2001.
No context found.
Perrig, A., Canetti, R., Song, D. and J. Tygar, "Efficient and Secure Source Authentication for Multicast", Network and Distributed System Security Symposium, NDSS 2001.
No context found.
Perrig A, Canetti R, Song D and Tygar JD (2001) Efficient and Secure Source Authentication for Multicast. Proceedings of Network and Distributed System Security Symposium, San Diego, CA, February 8-9, 2001.
First 50 documents Next 50
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