%0 Conference Proceedings
%T Experimental Investigation in the Impact on Security of the Release Order of Defensive Algorithms
%+ Centre for Cybercrime and Computer Security [Newcastle]
%A Alsuhibany, Suliman, A.
%A Alonaizi, Ahmad
%A Morisset, Charles
%A Smith, Chris
%A Moorsel, Aad, Van
%Z Part 2: Security Engineering
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 1st Cross-Domain Conference and Workshop on Availability, Reliability, and Security in Information Systems (CD-ARES)
%C Regensburg, Germany
%Y Alfredo Cuzzocrea
%Y Christian Kittl
%Y Dimitris E. Simos
%Y Edgar Weippl
%Y Lida Xu
%I Springer
%3 Security Engineering and Intelligence Informatics
%V LNCS-8128
%P 321-336
%8 2013-09-02
%D 2013
%K Release Order of Defensive Algorithms
%K learning
%K Experimentation
%K Security and Protection
%Z Computer Science [cs]
%Z Humanities and Social Sciences/Library and information sciencesConference papers
%X 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.
%G English
%2 https://inria.hal.science/hal-01506554/document
%2 https://inria.hal.science/hal-01506554/file/978-3-642-40588-4_22_Chapter.pdf
%L hal-01506554
%U https://inria.hal.science/hal-01506554
%~ SHS
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC5
%~ IFIP-WG
%~ IFIP-TC8
%~ IFIP-CD-ARES
%~ IFIP-WG8-4
%~ IFIP-WG8-9
%~ IFIP-LNCS-8128