Fault Tolerance and Security Geraint Price Information Security Group Royal Holloway.

Slides:



Advertisements
Similar presentations
Cryptography and Network Security 2 nd Edition by William Stallings Note: Lecture slides by Lawrie Brown and Henric Johnson, Modified by Andrew Yang.
Advertisements

1 Programa de Engenharia Elétrica - PEE/COPPE/UFRJ Universidade Federal do Rio de Janeiro A Review of Anomalies Detection Schemes for Smart Grids Andrés.
Mobile Code Security Aviel D. Rubin, Daniel E. Geer, Jr. MOBILE CODE SECURITY, IEEE Internet Computing, 1998 Minkyu Lee
DARPA ITS PI Meeting – Honolulu – July 17-21, 2000Slide 1 Aegis Research Corporation Intrusion Tolerance Using Masking, Redundancy and Dispersion DARPA.
Trustworthy Services from Untrustworthy Components: Overview Fred B. Schneider Department of Computer Science Cornell University Ithaca, New York
Reliability on Web Services Presented by Pat Chan 17/10/2005.
Chapter 1 – Introduction
19.1 Silberschatz, Galvin and Gagne ©2003 Operating System Concepts with Java Chapter 19: Security The Security Problem Authentication Program Threats.
1 Cryptography and Network Security Third Edition by William Stallings Lecturer: Dr. Saleem Al_Zoubi.
CS 582 / CMPE 481 Distributed Systems Fault Tolerance.
Chapter 1 – Introduction The art of war teaches us to rely not on the likelihood of the enemy's not coming, but on our own readiness to receive him; not.
Presented By: Vinay Kumar.  At the time of invention, Internet was just accessible to a small group of pioneers who wanted to make the network work.
Applied Cryptography for Network Security
Cryptography and Network Security Chapter 1. Chapter 1 – Introduction The art of war teaches us to rely not on the likelihood of the enemy's not coming,
Cryptography and Network Security Third Edition by William Stallings Lecture slides by Lawrie Brown.
A Progressive Fault Tolerant Mechanism in Mobile Agent Systems Michael R. Lyu and Tsz Yeung Wong July 27, 2003 SCI Conference Computer Science Department.
Trustworthy Services from Untrustworthy Components: Overview Fred B. Schneider Department of Computer Science Cornell University Ithaca, New York
Cryptography and Network Security Chapter 1 Fourth Edition by William Stallings Lecture slides by Lawrie Brown.
Software Dependability CIS 376 Bruce R. Maxim UM-Dearborn.
Mitigating DoS Attacks against Broadcast Authentication in Wireless Sensor Networks Peng Ning, An Liu North Carolina State University and Wenliang Du Syracuse.
1 Cryptography and Network Security Fourth Edition by William Stallings Lecture slides by Lawrie Brown Changed by: Somesh Jha [Lecture 1]
Dr. Lo’ai Tawalbeh 2007 INCS 741: Cryptography Chapter 1:Introduction Dr. Lo’ai Tawalbeh New York Institute of Technology (NYIT) Jordan’s Campus
Cryptography and Network Security
Eng. Wafaa Kanakri Second Semester 1435 CRYPTOGRAPHY & NETWORK SECURITY Chapter 1:Introduction Eng. Wafaa Kanakri UMM AL-QURA UNIVERSITY
1 System Models. 2 Outline Introduction Architectural models Fundamental models Guideline.
Computer Science Open Research Questions Adversary models –Define/Formalize adversary models Need to incorporate characteristics of new technologies and.
Distributed Systems: Concepts and Design Chapter 1 Pages
BFTCloud: A Byzantine Fault Tolerance Framework for Voluntary-Resource Cloud Computing Yilei Zhang, Zibin Zheng, and Michael R. Lyu
© Oxford University Press 2011 DISTRIBUTED COMPUTING Sunita Mahajan Sunita Mahajan, Principal, Institute of Computer Science, MET League of Colleges, Mumbai.
Reliable Communication in the Presence of Failures Based on the paper by: Kenneth Birman and Thomas A. Joseph Cesar Talledo COEN 317 Fall 05.
Advanced Computer Networks Topic 2: Characterization of Distributed Systems.
Practical Byzantine Fault Tolerance
Survival by Defense- Enabling Partha Pal, Franklin Webber, Richard Schantz BBN Technologies LLC Proceedings of the Foundations of Intrusion Tolerant Systems(2003)
Cryptography and Network Security (CS435) Part One (Introduction)
Rushing Attacks and Defense in Wireless Ad Hoc Network Routing Protocols ► Acts as denial of service by disrupting the flow of data between a source and.
1 University of Palestine Information Security Principles ITGD 2202 Ms. Eman Alajrami 2 nd Semester
. 1. Computer Security Concepts 2. The OSI Security Architecture 3. Security Attacks 4. Security Services 5. Security Mechanisms 6. A Model for Network.
Agile Survivable Store PIs: Mustaque Ahamad, Douglas M. Blough, Wenke Lee and H.Venkateswaran PhD Students: Prahlad Fogla, Lei Kong, Subbu Lakshmanan,
1 ACTIVE FAULT TOLERANT SYSTEM for OPEN DISTRIBUTED COMPUTING (Autonomic and Trusted Computing 2006) Giray Kömürcü.
MAFTIA Expression of Interest for DEFINE and DESIRE presented by Robert Stroud, University of Newcastle upon Tyne.
GLOBE DISTRIBUTED SHARED OBJECT. INTRODUCTION  Globe stands for GLobal Object Based Environment.  Globe is different from CORBA and DCOM that it supports.
1 Chapter 1 – Background Computer Security T/ Tyseer Alsamany - Computer Security.
Topic 1 – Introduction Huiqun Yu Information Security Principles & Applications.
Security in Mobile Ad Hoc Networks: Challenges and Solutions (IEEE Wireless Communications 2004) Hao Yang, et al. October 10 th, 2006 Jinkyu Lee.
Byzantine Fault Tolerance CS 425: Distributed Systems Fall 2012 Lecture 26 November 29, 2012 Presented By: Imranul Hoque 1.
Re-Configurable Byzantine Quorum System Lei Kong S. Arun Mustaque Ahamad Doug Blough.
P ROTOCOL FOR COLLABORATING MOBILE AGENTS IN THE NETWORK INTRUSION DETECTION SYSTEMS. By Olumide Simeon Ogunnusi Shukor Abd Razak.
Mixed Criticality Systems: Beyond Transient Faults Abhilash Thekkilakattil, Alan Burns, Radu Dobrin and Sasikumar Punnekkat.
POND: THE OCEANSTORE PROTOTYPE S. Rea, P. Eaton, D. Geels, H. Weatherspoon, J. Kubiatowicz U. C. Berkeley.
Systems Research Barbara Liskov October Replication Goal: provide reliability and availability by storing information at several nodes.
©Ian Sommerville 2000Dependability Slide 1 Chapter 16 Dependability.
Cryptography and Network Security Chapter 1. Background  Information Security requirements have changed in recent times  traditionally provided by physical.
A Survey of Fault Tolerance in Distributed Systems By Szeying Tan Fall 2002 CS 633.
9.2 SECURE CHANNELS JEJI RAMCHAND VEDULLAPALLI. Content Introduction Authentication Message Integrity and Confidentiality Secure Group Communications.
By Marwan Al-Namari & Hafezah Ben Othman Author: William Stallings College of Computer Science at Al-Qunfudah Umm Al-Qura University, KSA, Makkah 1.
SECURITY. Security Threats, Policies, and Mechanisms There are four types of security threats to consider 1. Interception 2 Interruption 3. Modification.
1 Network Security Maaz bin ahmad.. 2 Outline Attacks, services and mechanisms Security attacks Security services Security Mechanisms A model for Internetwork.
Lecturer: Eng. Mohamed Adam Isak PH.D Researcher in CS M.Sc. and B.Sc. of Information Technology Engineering, Lecturer in University of Somalia and Mogadishu.
Lecture 1 Introduction Dr. nermin hamza 1. Aim of Course Overview Cryptography Symmetric and Asymmetric Key management Researches topics 2.
BChain: High-Throughput BFT Protocols
Intrusion Tolerant Architectures
Intrusion Tolerance for NEST
Athith Amarnath, graduate Student Database and Security Research Group
Principles of Computer Security
Jacob Gardner & Chuan Guo
Web Information Systems Engineering (WISE)
Luca Simoncini PDCC, Pisa and University of Pisa, Pisa, Italy
Presentation transcript:

Fault Tolerance and Security Geraint Price Information Security Group Royal Holloway

3-5th April 2005 Security and Protection of Information Outline Introduction Background  Security  Fault Tolerance Major Contributions A Personal Perspective Future Challenges Conclusions

3-5th April 2005 Security and Protection of Information Introduction Computer Security and Fault Tolerance share a subset of goals  The ability to tolerate or mitigate failure in a computer system The assumptions that underpin traditional solutions make their merger non-trivial  Security: Remove any replication and tighten control  Fault Tolerance: Replicate and compare results

3-5th April 2005 Security and Protection of Information Introduction – II Recent cross-over research began with Reiter’s work on Rampart (mid 90s) Spawned a new interest in the application of fault tolerant mechanisms in security:  Tacoma: Provision of replication for mobile agents  MAFTIA: A large-scale project to study survivability in Internet applications We concentrate on two avenues of research:  Development of the fault model  Progression of the replication mechanisms

3-5th April 2005 Security and Protection of Information Background – Security Why the relatively late interaction? In our opinion, it has much to do with the history of computer security:  Trusted Computing Base  Research was weighted towards confidentiality and integrity – not availability Others had noted this gap in the computer security literature [Needham,’94]

3-5th April 2005 Security and Protection of Information Background – Security – II Very little in the open literature that dealt with Denial of Service (the absence of availability) A notable exception [Gligor, ‘86]:  An increase in Maximum Waiting Time (MWT)  Legitimate and other forms of denial of service – system returns before MWT Interesting exception [Turn and Habibi, ‘86]:  A security function is fault tolerant, if given the presence of a fault, the system’s security policy remains intact

3-5th April 2005 Security and Protection of Information Background – Fault Tolerance Fault Modelling:  Fault → Error → Failure  Fault: Adjudged or hypothesized cause of error  Error: The part of the system that may lead to failure  Failure: Service deviates from specification  Four techniques within the dependability paradigm: Fault prevention, fault tolerance, fault removal, fault forecasting

3-5th April 2005 Security and Protection of Information Background – Fault Tolerance – II Replication Mechanisms:  Underlying group communication mechanisms  Early work conducted at Cornell University: Isis toolkit: CBCAST (Causal broadcast), ABCAST (Atomic broadcast)  Group Structures: State Machine Approach: Active replication, which masks the failure of a proportion of the servers Primary Backup Approach: Passive replication, if the primary fails, then a backup takes over

3-5th April 2005 Security and Protection of Information Major Contributions Rampart Castro and Liskov Quorum Systems MAFTIA Tacoma Other Projects

3-5th April 2005 Security and Protection of Information Rampart Group communication implemented by Reiter [Reiter, ’94 & ‘96] First system to implement replicated service based on Byzantine agreement protocols Main communication structure derived from the earlier work on Isis at Cornell Extension over the Isis work through its ability to tolerate the malicious failure of a proportion of the servers within the group

3-5th April 2005 Security and Protection of Information Rampart – II Choices over communication primitives within Rampart:  State machine approach to replication  Digital signatures to provide message authentication in group communication primitive Lack of efficiency and scalability Although it has its drawbacks, it inspired the majority of the remaining work The main research agenda as a result was the search for more efficient protocols

3-5th April 2005 Security and Protection of Information Castro & Liskov A new replication mechanism to overcome efficiency concerns [Castro & Liskov, ‘99] Two main differences to Rampart:  Primary backup model  Pair-wise symmetric key Message Authentication Codes A test implementation over NFS was only 3% slower than Digital Unix NFS Efficiency gains are due to optimistic protocols under normal operation

3-5th April 2005 Security and Protection of Information Quorum Systems Data replication in a group of servers [Malkhi & Reiter, ‘97] Move away from the state machine approach Increase scalability by removing the server- to-server communication for a read operation However, their work does require server-to- server communication for state update, and hence a write operation

3-5th April 2005 Security and Protection of Information MAFTIA Malicious and Accidental Fault Tolerance for Internet Applications Large EU funded project:  6 partners  Expertise in fault tolerance, distributed computing, cryptography, formal verification and intrusion detection  3 main areas of work: conceptual framework and architecture; mechanisms and protocols; formal verification and assessment

3-5th April 2005 Security and Protection of Information MAFTIA – Conceptual Model Extension of the Fault → Error → Failure model Re-defining a Fault as an Intrusion:  Intrusion: A malicious, externally-induced fault resulting from an attack that has been successful in exploiting a vulnerability  Attack: A malicious interaction fault, through which an attacker aims to deliberately violate one or more security properties  Vulnerability: A fault created during development of the system, or during operation, that could be exploited to create an intrusion

3-5th April 2005 Security and Protection of Information MAFTIA – Conceptual Model – II In breaking down an Intrusion, they highlight the possibility of targeting the removing or preventing of both Attacks and Vulnerabilities Although MAFTIA’s main focus was Intrusion Tolerance, they classify a whole range of security mechanisms according to the fault prevention, tolerance, removal and forecasting paradigms mentioned earlier

3-5th April 2005 Security and Protection of Information MAFTIA – Hybrid Failure Model Composite fault model with a hybrid failure assumption The presence and severity of vulnerabilities, attacks and intrusions varies from component to component Assumptions present in their architectural design:  Built on top of trustworthy components: Java Card Trusted Timely Computing Base (TTCB) Trusted Middleware component

3-5th April 2005 Security and Protection of Information MAFTIA – Hybrid Failure Model – II The key element of the MAFTIA architecture is the TTCB:  Provision of time based services through the use of a Control Channel  Dedicated and heavily protected security kernel – fail silent rather than arbitrary failure Implementation of a reliable broadcast protocol that can tolerate up to f of f+2 failures [Correia et al., ‘02 ]

3-5th April 2005 Security and Protection of Information Tacoma Tromso And COrnell Moving Agents project Provision of security and fault tolerance were two key elements Resilience for the agent on a potentially malicious host:  Replicated agents, with voting mechanisms Fault tolerance for mobile agents:  Extension of the primary backup approach “… preserving the necessary consistency between replicas can be done efficiently only within a local- area network”

3-5th April 2005 Security and Protection of Information Other Projects COCA:  Replication of a CA to provide availability  Byzantine quorum systems  Proactive recovery OASIS (Organically Assured and Survivable Information Systems)  Umbrella project which sponsors separate work items in the field of resilient security

3-5th April 2005 Security and Protection of Information A Personal Perspective Control of Execution:  Adapting fault tolerant principles for a secure environment can come down to a principle of control  In the Fault → Error → Failure model, breaking the chain requires retaining control Whose security policy are we protecting? Proposed mechanisms for allowing a client to share that control [Price, ‘99]

3-5th April 2005 Security and Protection of Information A Personal Perspective – II Use of Other Mechanisms:  Some of our previous work identified the possibility of using timing checks [Price, ’01]  Remove the attacker’s ability to delay or replay messages with impunity  Some variants of replay attacks rely on this With hindsight, there is an interesting comparison with MAFTIA’s use of a Control Channel

3-5th April 2005 Security and Protection of Information Future Challenges Relaxation of assumptions:  Fully Byzantine failure models are difficult to protect against – and hence solutions are inefficient  Most of the work since Rampart have concentrated on feasible means of relaxing these failure assumptions: can we do better? Further use of hardware:  MAFTIA’s use of trusted hardware allows for more efficient protocols – can the principle be generalised?  Mixed failure environments [Siu et al., ‘98]  Trusted Computing Group

3-5th April 2005 Security and Protection of Information Future Challenges – II Other dependability models:  Fault tolerance is only part of a very mature dependability literature  Disjoint v Inclusive error recovery?  MAFTIA defined a whole classification within their model Security service classification:  Quorum based systems use the parallelism of a read operation to increase efficiency  Can we class different services according to their communication requirements?

3-5th April 2005 Security and Protection of Information Conclusions Until 10 years ago, the work in this field was sparse and sporadic Now there is a large body of work in this area Practical efficiency is still a key research topic Broaden our search for other applicable mechanisms Availability and survivability on the Internet is only going to become more important