The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
Accountable internet protocol (aip)
Abstract
This paper presents AIP (Accountable Internet Protocol), a network architecture that provides accountability as a first-order property. AIP uses a hierarchy of self-certifying addresses, in which each component is derived from the public key of the corresponding entity. We discuss how AIP enables simple solutions to source spoofing, denial-of-service, route hijacking, and route forgery. We also discuss how AIP's design meets the challenges of scaling, key management, and traffic engineering.
Overview
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
Space/time trade-offs in hash coding with allowable errors
Bloom, B. H. (1970) · Communications of the ACM · doi:10.1145/362686.362692 · Cited by 7,492
Security Architecture for the Internet Protocol
Atkinson, R. (1995) · doi:10.17487/rfc1825 · Cited by 2,762
Graphs over time: densification laws, shrinking diameters and possible explanations
Leskovec, J., Kleinberg, J., & Faloutsos, C. (2005) · Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining · doi:10.1145/1081870.1081893 · Cited by 2,281
Ferguson, P., & Senie, D. (2000) · doi:10.17487/rfc2827 · Cited by 1,313
Security Architecture for the Internet Protocol
Kent, S., & Atkinson, R. (1998) · doi:10.17487/rfc2401 · Cited by 891
Secure Border Gateway Protocol (S-BGP)
Kent, S., Lynn, C., & Seo, K. (2000) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.839934 · Cited by 645
An end-to-end approach to host mobility
Snoeren, A. C., & Balakrishnan, H. (2000) · Proceedings of the 6th annual international conference on Mobile computing and networking · doi:10.1145/345910.345938 · Cited by 595
Self-citationThe Locator/ID Separation Protocol (LISP)
Farinacci, D., Fuller, V., Meyer, D., & Lewis, D. (2022) · doi:10.17487/rfc9300 · Cited by 586
Park, K., & Lee, H. (2001) · Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/383059.383061 · Cited by 572
Understanding the network-level behavior of spammers
Ramachandran, A., & Feamster, N. (2006) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1151659.1159947 · Cited by 510
Self-citationThe Internet Engineering Task Force
Needleman, M. (2000) · Serials Review · doi:10.1016/s0098-7913(99)00073-8 · Cited by 457
ITRS: The International Technology Roadmap for Semiconductors
Hoefflinger, B. (2011) · The Frontiers Collection · doi:10.1007/978-3-642-23096-7_7 · Cited by 406
Ferguson, P., & Senie, D. (1998) · doi:10.17487/rfc2267 · Cited by 381
Report from the IAB Workshop on Routing and Addressing
Zhang, L., Meyer, D., & Fall, K. (2007) · Cited by 336
Separating key management from file system security
Mazières, D., Kaminsky, M., Kaashoek, M. F., & Witchel, E. (1999) · Proceedings of the seventeenth ACM symposium on Operating systems principles · doi:10.1145/319151.319160 · Cited by 332
Report from the IAB Workshop on Routing and Addressing
(2007) · doi:10.17487/rfc4984 · Cited by 299
Understanding the network-level behavior of spammers
Ramachandran, A., & Feamster, N. (2006) · Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/1159913.1159947 · Cited by 241
Self-citationPHAS: a prefix hijack alert system
Lad, M., Massey, D., Pei, D., Wu, Y., Zhang, B., & Zhang, L. (2006) · Cited by 239
Goodell, G., Aiello, W. A., Griffin, T. G., Ioannidis, J. P. A., McDaniel, P. D., & Rubin, A. D. (2003) · UCL Discovery (University College London) · Cited by 197
Middleboxes No Longer Considered Harmful
Walfish, M., Stribling, J., Krohn, M., Balakrishnan, H., Morris, R., & Shenker, S. J. (2004) · Cited by 168
Self-citationPassport: Secure and Adoptable Source Authentication
Liu, X., Li, A., Yang, X., & Wetherall, D. J. (2008) · Cited by 157
On compact routing for the internet
Krioukov, D., claffy, K., Fall, K., & Brady, A. (2007) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1273445.1273450 · Cited by 155
Analyzing BGP policies: methodology and tool
Siganos, G., & Faloulsos, M. (2004) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.2004.1354576 · Cited by 105
Constructing Inter-Domain Packet Filters to Control IP Spoofing Based on BGP Updates
Duan, Z., Yuan, X., & Chandrashekar, J. (2006) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infocom.2006.128 · Cited by 88
Varghese, G. (2009) · Chapman & Hall/CRC applied algorithms and data structures series · doi:10.1201/9781584888215-c28 · Cited by 53
Verkaik, P., Broido, A., claffy, K., Gao, R., Hyun, Y., & van der Pol, R. (2004) · Cited by 17
Cited by
A Survey of Man in the Middle Attacks
Conti, M., Dragoni, N., & Lesyk, V. (2016) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2016.2548426 · Cited by 724
LIPSIN: line speed publish/subscribe inter-networking
Jokela, P., Zahemszky, A., Esteve Rothenberg, C., Arianfar, S., & Nikander, P. (2009) · Proceedings of the ACM SIGCOMM 2009 conference on Data communication · doi:10.1145/1592568.1592592 · Cited by 434
MobilityFirst: a robust and trustworthy mobility-centric architecture for the future internet
Raychaudhuri, D., Nagaraja, K., & Venkataramani, A. (2012) · ACM SIGMOBILE Mobile Computing and Communications Review · doi:10.1145/2412096.2412098 · Cited by 263
Metadata
- Authors
- Andersen, D. G., Balakrishnan, H., Feamster, N., Koponen, T., Moon, D., & Shenker, S.
- Venue
- ACM SIGCOMM Computer Communication Review
- Published
- 2008-08-17
- Volume
- 38
- Issue
- 4
- Pages
- 339-350
- ISSN
- 0146-4833 (ISSN-L)
- OpenAlex
- W2116236383
- Cited by
- 262
- References
- 26
- FWCI
- 27.49
- Type
- journal article
- Language
- en
- Open access
- closed
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.