City Research Online

Abstract

Intruders that log in through a series of machines when conducting an attack are hard to trace because of the complex architecture of the Internet. The thumbprinting method provides an efficient way of tracing such intruders by determining whether two connections are part of the same connection chain. Because many connections are transient and therefore short in length, choosing the best time interval to thumbprint over can be an issue. In this paper, we provide a way to shorten the time interval used for thumbprinting. We then study some special properties of the thumbprinting function. We also study another mechanism for tracing intruders in the Internet based on a timestamping approach, which passively monitors flows between source and destination pairs. Given a potentially suspicious source, we identify its true destination. We compute the error probability of our algorithm and show that its value decreases exponentially as the observation time increases. Our simulation results show that our approach performs well.

Publication Type:	Article
Additional Information:	This is the peer reviewed version of the following article: Olteanu Raimond, A. M., Xiao, Y., Liu, J., Chen, T. & Chen, C. L. P. (2013). Nonintrusive tracing in the Internet. Security and Communication Networks, 6(7), pp. 833-843., which has been published in final form at http://dx.doi.org/10.1002/sec.616. This article may be used for non-commercial purposes in accordance with Wiley Terms and Conditions for Self-Archiving.
Publisher Keywords:	nonintrusive; tracing; Internet
Subjects:	Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Departments:	School of Science & Technology > Engineering
SWORD Depositor:	Symplectic Administrator

Export

Downloads