Efficient and Secure Source Authentication for Multicast
By Adrian Perrig, Ran Canetti, Dawn Song, J. Doug Tygar, Uc Berkeley, I. T. Watson. Network and Distributed System Security Symposium, 2001
775 citations recorded by the source corpus.
View Paper: https://www.semanticscholar.org/paper/6d1f292dcb0aa92d96b955229d7d3f500dde908b
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
- Jean-Pierre Hubaux
- Yih-Chun Hu
- Adrian Perrig
- Chris Karlof
- Srdjan Čapkun
- David B. Johnson
- Donggang Liu
- Peng Ning
Citations in the corpus
- SPINS: Security Protocols for Sensor Networks (2001, background): “The recently proposed TESLA protocol provides ef£cient authenticated broadcast [31, 30].”
- SEAD: secure efficient distance vector routing for mobile wireless ad hoc networks (2002, methodology): “Any efficient broadcast authentication mechanism, such as TESLA [34], HORS [39], or TIK [35], can be used to authenticate the neighbor.”
- Secure routing for mobile ad hoc networks (2005, background): “There are several well-known hash functions that possess these properties, such as SHA-1 [27] and MD5 [28].”
- Multilevel μTESLA: Broadcast authentication for distributed sensor networks (2004, methodology): “The solution can be considered a variation of the immediate authentication extension to TESLA [Perrig et al. 2001a].”
- Advanced and authenticated marking schemes for IP traceback (2001, background): “Please refer to [15], [12] for more details on time synchronization.”
- The BiBa one-time signature and broadcast authentication protocol (2001, methodology): “Researchers proposed a number of schemes for broadcast authentication [4, 6, 16, 17, 23, 25].”
- Secure routing in wireless sensor networks: attacks and countermeasures (2003, background): “In the following sections we outline our assumptions about the underlying network, propose models for different classes of adversaries, and consider security goals in this setting.”
- Establishing pairwise keys in distributed sensor networks (2005, methodology): “developed a security architecture for sensor n etworks, which includes SNEP, a security primitive building block, andμTESLA [Perrig et al. 2001], an adaption of TESLA [Perrig et al.”
- Establishing pairwise keys in distributed sensor networks (2003, unknown): “Perrig et al. developed a security architecture for sensor networks, which includes SNEP, a security primitive building block, and µTESLA [12], an adaption of TESLA [10, 11].”
- On-the-fly verification of rateless erasure codes for efficient content distribution (2004, methodology): “Several protocols used the delayed disclosure of symmetric keys to provide source authentication, including Chueng [30], the Guy Fawkes protocol [31], and more recently TESLA [32], [33], by relying on loose time synchronization between senders and recipients.”
- Cyber security in the Smart Grid: Survey and challenges (2013, background): “Time-asymmetry methods (e.g., TESLA [112,113]) have excellent computational efficiency and low communication overhead.”
- Authenticated routing for ad hoc networks (2005, methodology): “A third option for Ariadne is the TESLA authentication scheme, which is also based on asymmetric encryption, thus requiring a certification authority or pre-deployed keys.”