Security through redundant data diversity
Authors:
- 1 January 2008
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 15300889,p. 187-196
Abstract
Unlike other diversity-based approaches, N-variant systems thwart attacks without requiring secrets. Instead, they use redundancy (to require an attacker to simultaneously compromise multiple variants with the same input) and tailored diversity (to make it impossible to compromise all the variants with the same input for given attack classes). In this work, we develop a method for using data diversity in N-variant systems to provide high-assurance arguments against a class of data corruption attacks. Data is transformed in the variants so identical concrete data values have different interpretations. In order to corrupt the data without detection, an attacker would need to alter the corresponding data in each variant in a different way while sending the same inputs to all variants. We demonstrate our approach with a case study using that thwarts attacks that corrupt UID values.Keywords
This publication has 16 references indexed in Scilit:
- Beyond Output Voting: Detecting Compromised Replicas Using HMM-Based Behavioral DistanceIEEE Transactions on Dependable and Secure Computing, 2008
- Understanding and Countering Insider Threats in Software Development2008
- Secure and practical defense against code-injection attacks using software dynamic translation2006
- Dynamic Taint Propagation for Java2006
- Hardware and Binary Modification Support for Code Pointer Protection From Buffer Overflow2005
- The design and implementation of an intrusion tolerant system2004
- Transparent runtime randomization for security2004
- Tabulating the heavens: Computing the Nautical Almanac in 18th-Century EnglandIEEE Annals of the History of Computing, 2003
- Building diverse computer systems2002
- Learning Unknown Attacks — A Start2002