Trade-offs in probabilistic packet marking for IP traceback
DOI10.1145/1059513.1059517zbMATH Open1312.68021OpenAlexW2041651407MaRDI QIDQ3546283FDOQ3546283
Authors: Micah Adler
Publication date: 21 December 2008
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1059513.1059517
Recommendations
Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Authentication, digital signatures and secret sharing (94A62) Network protocols (68M12)
Cited In (9)
- On the nonexistence of \(k\)-reptile simplices in \(\mathbb R^3\) and \(\mathbb R^4\)
- Learning the valid incoming direction of IP packets
- Towards asymptotic optimality in probabilistic packet marking
- A scheme of reconstructing network attack path
- Protocols and Lower Bounds for Failure Localization in the Internet
- Coupon subset collection problem with quotas
- Prefix-preserving IP address anonymization: measurement-based security evaluation and a new cryptography-based scheme
- Title not available (Why is that?)
- Applied Cryptography and Network Security
This page was built for publication: Trade-offs in probabilistic packet marking for IP traceback
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3546283)