The following documents outline the notes for the course ICS 280 Design and Analysis of Algorithms. These notes are not for general distribution; they are for use only by students in ICS 280.

Copyright © 2002, Michael T. Goodrich. All rights reserved.

Note: Some of the files indexed here are in PDF format, which requires requires the use of a PDF Reader. Others are in PostScript, which requires requires the use of a Postscript viewer. In addition, some files are compressed, which requires the use of decompression software.

Notes

• Dealing With Denial of Service Attacks

References

• Dealing with Denial of Service Attacks:
1. D. Song and A. Perrig, Advanced and Authenticated Marking Schemes for IP Traceback, In IEEE Infocomm 2001. [ PDF].
2. D. Dean, M. Franklin, and A. Stubblefield, An algebraic approach to IP traceback. ACM Trans. Information and System Security, May 2002.
3. M. Adler, Tradeoffs in Probabilistic Packet Marking for IP Traceback, to appear in Proceedings of 34th ACM Symposium on Theory of Computing (STOC) 2002.
4. Stefan Savage, David Wetherall, Anna Karlin, Tom Anderson, Practical Network Support for IP Traceback, SIGCOMM, 2000.
5. Kihong Park, Heejo Lee On the Effectiveness of Probabilistic Packet Marking for IP Traceback under Denial of Service Attack, 2000.
• Secure Routing Algorithms
1. Yih-Chun Hu, David B. Johnson, and Adrian Perrig. SEAD: Secure Efficient Distance Vector Routing for Mobile Wireless Ad Hoc Networks. Proceedings of the 4th IEEE Workshop on Mobile Computing Systems & Applications (WMCSA 2002), IEEE, Calicoon, NY, June 2002, to appear.
2. Steven Cheung, An Efficient Message Authentication Scheme for Link State Routing. 13th Annual Computer Security Applications Conference, 1997.
3. Ralf C. Hauser, Tony Przygienda, and Gene Tsudik, "Lowering security overhead in link state routing," "Computer Networks", 31, 8, 885-894, 1999.
4. Suresh Chari, Tal Rabin, and Ronald Rivest, An Efficient Signature Scheme for Route Aggregation.
5. Kan Zhang, Efficient Protocols for Signing Routing Messages.
• Authenticated Data Structures
1. M.T. Goodrich, R. Tamassia, and A. Schwerin, Implementation of an Authenticated Dictionary with Skip Lists and Commutative Hashing, DARPA Information Survivability Conference & Exposition II (DISCEX II), IEEE Press, 2001, 68--82.
2. A. Anagnostopoulos, M. T. Goodrich, and R.. Tamassia, Persistent Authenticated Dictionaries and Their Applications, Proc. Information Security Conference (ISC 2001), Lecture Notes in Computer Science, vol. 2200, pp. 379-393, 2001.
3. C. Martel, G. Nuckollis, M. Gertz, P. Devanbu, A. Kwong, S. Stubblebine, A General Model for Authenitc Data Publication, 2001.