Lookup NU author(s): Suliman Alsuhibany,
Dr Charles Morisset,
Dr Christopher Smith,
Professor Aad van Moorsel
Full text for this publication is not currently held within this repository. Alternative links are provided below where available.
In the practical use of security mechanisms such as CAPTCHAs and spam filters, attackers and defenders exchange 'victories,' each celebrating (temporary) success in breaking and defending. While most of security mechanisms rely on a single algorithm as a defense mechanism, we propose an approach based on a set of algorithms as a defense mechanism. When studying sets of algorithms various issues arise about how to construct the algorithms and in which order or in which combination to release them. In this paper, we consider the question of whether the order in which a set of defensive algorithms is released has a significant impact on the time taken by attackers to break the combined set of algorithms. The rationale behind our approach is that attackers learn from their attempts, and that the release schedule of defensive mechanisms can be adjusted so as to impair that learning process. This paper introduces this problem. We show that our hypothesis holds for an experiment using several simplified but representative spam filter algorithms-that is, the order in which spam filters are released has a statistically significant impact on the time attackers take to break all algorithms. © IFIP International Federation for Information Processing 2013.
Author(s): Alsuhibany SA, Alonaizi A, Morisset C, Smith C, van Moorsel A
Publication type: Conference Proceedings (inc. Abstract)
Publication status: Published
Conference Name: CD-ARES: International Conference on Availability, Reliability, and Security - 2013 Workshops
Year of Conference: 2013
Library holdings: Search Newcastle University Library for this item
Series Title: Lecture Notes in Computer Science