%0 Conference Proceedings
%T Algorithm Diversity for Resilient Systems
%+ Computer Science Department [SUNY]
%A Stoller, Scott, D.
%A Liu, Yanhong, A.
%Z Part 6: Source Code Security
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 33th IFIP Annual Conference on Data and Applications Security and Privacy (DBSec)
%C Charleston, SC, United States
%Y Simon N. Foley
%I Springer International Publishing
%3 Data and Applications Security and Privacy XXXIII
%V LNCS-11559
%P 359-378
%8 2019-07-15
%D 2019
%R 10.1007/978-3-030-22479-0_19
%Z Computer Science [cs]Conference papers
%X Diversity can significantly increase the resilience of systems, by reducing the prevalence of shared vulnerabilities and making vulnerabilities harder to exploit. Work on software diversity for security typically creates variants of a program using low-level code transformations. This paper is the first to study algorithm diversity for resilience. We first describe how a method based on high-level invariants and systematic incrementalization can be used to create algorithm variants. Executing multiple variants in parallel and comparing their outputs provides greater resilience than executing one variant. To prevent different parallel schedules from causing variants’ behaviors to diverge, we present a synchronized execution algorithm for DistAlgo, an extension of Python for high-level, precise, executable specifications of distributed algorithms. We propose static and dynamic metrics for measuring diversity. An experimental evaluation of algorithm diversity combined with implementation-level diversity for several sequential algorithms and distributed algorithms shows the benefits of algorithm diversity.
%G English
%Z TC 11
%Z WG 11.3
%2 https://inria.hal.science/hal-02384586/document
%2 https://inria.hal.science/hal-02384586/file/480962_1_En_19_Chapter.pdf
%L hal-02384586
%U https://inria.hal.science/hal-02384586
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-WG
%~ IFIP-TC11
%~ IFIP-WG11-3
%~ IFIP-DBSEC
%~ IFIP-LNCS-11559