The DOI matches its OpenAlex record; 33 of the 33 references it cites were found in a registry or an index.
The TESLA Broadcast Authentication Protocol
Open accessOverview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Password authentication with insecure communication
Lamport, L. (1981) · Communications of the ACM · doi:10.1145/358790.358797 · Cited by 2,789
SPINS: security protocols for sensor networks
Perrig, A., Szewczyk, R., Wen, V., Culler, D., & Tygar, J. D. (2001) · Proceedings of the 7th annual international conference on Mobile computing and networking · doi:10.1145/381677.381696 · Cited by 2,532
Self-citationSPINS: Security Protocols for Sensor Networks
Perrig, A., Szewczyk, R., Tygar, J. D., Wen, V., & Culler, D. E. (2002) · Wireless Networks · doi:10.1023/a:1016598314198 · Cited by 2,264
Self-citationHow to time-stamp a digital document
Haber, S., & Stornetta, W. S. (1991) · Journal of Cryptology · doi:10.1007/bf00196791 · Cited by 1,483
Ariadne: a secure on-demand routing protocol for ad hoc networks
Hu, Y.-C., Perrig, A., & Johnson, D. B. (2002) · Proceedings of the 8th annual international conference on Mobile computing and networking · doi:10.1145/570645.570648 · Cited by 1,298
Self-citationWeaknesses in the Key Scheduling Algorithm of RC4
Fluhrer, S., Mantin, I., & Shamir, A. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45537-x_1 · Cited by 1,043
Efficient authentication and signing of multicast streams over lossy channels
Perrig, A., Canetti, R., Tygar, J. D., & Song, D. (2002) · Proceeding 2000 IEEE Symposium on Security and Privacy. S&P 2000 · doi:10.1109/secpri.2000.848446 · Cited by 946
Self-citationNetwork Time Protocol (Version 3) Specification, Implementation and Analysis
Mills, D. L. (1992) · doi:10.17487/rfc1305 · Cited by 851
Efficient and Secure Source Authentication for Multicast.
Perrig, A., Canetti, R., Song, D. X., & Tygar, J. D. (2001) · Cited by 622
Self-citationSynchronizing clocks in the presence of faults
Lamport, L., & Melliar-Smith, P. M. (1985) · Journal of the ACM · doi:10.1145/2455.2457 · Cited by 543
The S/KEY One-Time Password System
Haller, N. (1995) · doi:10.17487/rfc1760 · Cited by 537
Real Time Cryptanalysis of A5/1 on a PC
Biryukov, A., Shamir, A., & Wagner, D. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44706-7_1 · Cited by 452
Shared generation of authenticators and signatures
Desmedt, Y., & Frankel, Y. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-46766-1_37 · Cited by 394
Gennaro, R., & Rohatgi, P. (1997) · Lecture Notes in Computer Science · doi:10.1007/bfb0052235 · Cited by 338
Using the Fluhrer, Mantin, and Shamir Attack to Break {WEP}
Stubblefield, A., Ioannidis, J. P. A., & Rubin, A. D. (2002) · Network and Distributed System Security Symposium · Cited by 331
Statistical Analysis of the Alleged RC4 Keystream Generator
Fluhrer, S. R., & McGrew, D. A. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44706-7_2 · Cited by 206
A compact and fast hybrid signature scheme for multicast packet authentication
Rohatgi, P. (1999) · Proceedings of the 6th ACM conference on Computer and communications security · doi:10.1145/319709.319722 · Cited by 178
Almost Optimal Hash Sequence Traversal
Coppersmith, D., & Jakobsson, M. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-36504-4_8 · Cited by 158
Graph-based authentication of digital streams
Miner, S., & Staddon, J. (2002) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/secpri.2001.924301 · Cited by 155
A new family of authentication protocols
Anderson, R., Bergadano, F., Bruno Crispo, A., Lee, J.-H., Manifavas, C., & Needham, R. M. (1998) · ACM SIGOPS Operating Systems Review · doi:10.1145/302350.302353 · Cited by 145
Linear Statistical Weakness of Alleged RC4 Keystream Generator
Golić, J. D. (1997) · Lecture notes in computer science · doi:10.1007/3-540-69053-0_16 · Cited by 133
An efficient message authentication scheme for link state routing
Cheung, S. (2002) · Annual Computer Security Applications Conference · doi:10.1109/csac.1997.646178 · Cited by 127
Multi-receiver/multi-sender network security: efficient authenticated multicast/feedback
Desmedt, Y., Frankel, Y., & Yung, M. M. (1992) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.1992.263476 · Cited by 125
Time-stamping with binary linking schemes
Buldas, A., Laud, P., Lipmaa, H., & Villemson, J. (1998) · Lecture notes in computer science · doi:10.1007/bfb0055749 · Cited by 115
Fractal hash sequence representation and traversal
Jakobsson, M. (2003) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2002.1023709 · Cited by 114
Digital signatures for flows and multicasts
Wong, C. K., & Lam, S. S. (2002) · IEEE International Conference on Network Protocols (ICNP) · doi:10.1109/icnp.1998.723740 · Cited by 108
An overview of clock synchronization
Simons, B. B. (2006) · Springer eBooks · doi:10.1007/bfb0042327 · Cited by 104
Simmons, G. J. (1990) · Journal of Cryptology · doi:10.1007/bf00204449 · Cited by 72
A security architecture for fault-tolerant systems
Reiter, M. K., Birman, K., & van Renesse, R. (1994) · ACM Transactions on Computer Systems · doi:10.1145/195792.195823 · Cited by 69
Individual single source authentication on the MBONE
Bergadano, F., Cavagnino, D., & Crispo, B. (2002) · IEEE International Conference on Multimedia and Expo (ICME) · doi:10.1109/icme.2000.869659 · Cited by 37
Desmedt, Y., & Yung, M. M. (2007) · Springer eBooks · doi:10.1007/3-540-38424-3_13 · Cited by 37
SECURE AND EFFICIENT TIME-STAMPING SYSTEMS
Lipmaa, H., & Henno, J. (1999) · Cited by 27
Bergadano, F., Cavagnino, D., & Bruno Crispo, A. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44983-3_11 · Cited by 27
Cited by
Securing vehicular ad hoc networks
Raya, M., & Hubaux, J.-P. (2007) · Journal of Computer Security · doi:10.3233/jcs-2007-15103 · Cited by 1,709
A tutorial survey on vehicular ad hoc networks
Hartenstein, H., & Laberteaux, K. P. (2008) · IEEE Communications Magazine · doi:10.1109/mcom.2008.4539481 · Cited by 1,619
Vehicular ad hoc networks (VANETS): status, results, and challenges
Zeadally, S., Hunt, R., Chen, Y.-S., Irwin, A., & Hassan, A. (2012) · Telecommunication Systems · doi:10.1007/s11235-010-9400-5 · Cited by 1,208
GSIS: A Secure and Privacy-Preserving Protocol for Vehicular Communications
Lin, X., Sun, X., Ho, P.-H., & Shen, X. (2007) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2007.906878 · Cited by 917
Security in mobile ad hoc networks: challenges and solutions
Yang, H., Luo, H., Ye, F., Lu, S., & Zhang, L. (2004) · IEEE Wireless Communications · doi:10.1109/mwc.2004.1269716 · Cited by 879
Metadata
- Authors
- Perrig, A., Canetti, R., Tygar, J. D., & Song, D. X.
- Venue
- Figshare
- Publisher
- Figshare (United Kingdom)
- Published
- 2018-04-02
- Volume
- 5
- OpenAlex
- W2110081058
- Cited by
- 842
- References
- 33
- FWCI
- 18.52
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.