Trust and Grid Computing Systems Presented By: Woodas Lai.

Slides:



Advertisements
Similar presentations
Security by Design A Prequel for COMPSCI 702. Perspective “Any fool can know. The point is to understand.” - Albert Einstein “Sometimes it's not enough.
Advertisements

Conceptual Framework for Dynamic Trust Monitoring and Prediction Olufunmilola Onolaja Rami Bahsoon Georgios Theodoropoulos School of Computer Science The.
For e-Business F. Dignum Utrecht University Trust Reputation and.
Multi Card Problem Which card do I use when I am at a point of sale to maximize rewards? Choose Randomly ? Build & Solve a complex equation to choose the.
High Performance Computing Course Notes Grid Computing.
TrustMe: Anonymous Management of Trust Relationships in Decentralized P2P Systems Aameek Singh and Ling Liu Presented by: Korporn Panyim.
Fundamentals of Computer Security Geetika Sharma Fall 2008.
Digital Identities for Networks and Convergence Joao Girao, Amardeo Sarma.
Information Security Policies and Standards
Trust Establishment in Pervasive Grid Environments Syed Naqvi, Michel Riguidel TÉLÉCOM PARIS ÉNST É cole N ationale S upérieur des T élécommunications.
FIT3105 Smart card based authentication and identity management Lecture 4.
An Authentication Service Based on Trust and Clustering in Wireless Ad Hoc Networks: Description and Security Evaluation Edith C.H. Ngai and Michael R.
Introduction and Overview “the grid” – a proposed distributed computing infrastructure for advanced science and engineering. Purpose: grid concept is motivated.
Dept. of Computer Science & Engineering, CUHK1 Trust- and Clustering-Based Authentication Services in Mobile Ad Hoc Networks Edith Ngai and Michael R.
First Year Talk: Self-Enforcing Automatic Rational Contracts between Computers Brian Shand Supervisor: Dr Jean Bacon.
Distributed Intrusion Detection Systems (dIDS) 2/10 CIS 610.
Consider the following one-year investment. An amount X is invested in a fund at the beginning of the year. In six months, the fund is worth X/2 at which.
An Authentication Service Against Dishonest Users in Mobile Ad Hoc Networks Edith Ngai, Michael R. Lyu, and Roland T. Chin IEEE Aerospace Conference, Big.
Security Models for Trusting Network Appliances From : IEEE ( 2002 ) Author : Colin English, Paddy Nixon Sotirios Terzis, Andrew McGettrick Helen Lowe.
Virtual Organizations as Normative Multiagent Systems Guido Boella Università di Torino, Joris Hulstijn Vrije Universiteit, Amsterdam,
Preventing Spam For SIP-based Sessions and Instant Messages Kumar Srivastava Henning Schulzrinne June 10, 2004.
1-1 Incentive Mechanisms for Large Collaborative Resource Sharing Objectives:  Why Resource harnessing  Examples of resource harnessing  Grid computing.
1 APPLICATION OF DDDAS FOR TRUSTED COMMUNICATION IN MOBILE NETWORKS. Onolaja Olufunmilola Supervisors: Dr Rami Bahsoon, Dr Georgios Theodoropoulos.
1-1 Incentive Mechanisms for Large Collaborative Resource Sharing Objectives:  Why Resource harnessing  Resource sharing  Assumptions  Considerations.
New Challenges in Cloud Datacenter Monitoring and Management
1 Requirements Analysis and Design Engineering Southern Methodist University CSE 7313.
GrIDS -- A Graph Based Intrusion Detection System For Large Networks Paper by S. Staniford-Chen et. al.
MASY: Management of Secret keYs in Mobile Federated Wireless Sensor Networks Jef Maerien IBBT DistriNet Research Group Department of Computer Science Katholieke.
Trusted Systems Laboratory Hewlett-Packard Laboratories Bristol, UK InfraSec 2002 InfraSec 2002 Bristol, October 2002 Marco Casassa Mont Richard.
Deploying Trust Policies on the Semantic Web Brian Matthews and Theo Dimitrakos.
SecureMR: A Service Integrity Assurance Framework for MapReduce Author: Wei Wei, Juan Du, Ting Yu, Xiaohui Gu Source: Annual Computer Security Applications.
Trustworthiness Management in the Social Internet of Things
ITEC 810 – Project Unit Trustworthy Sensor Networks Daniel Aegerter, Supervisor: Rajan Shankaran.
Frascati, October 9th, Accounting in DataGrid Initial Architecture Albert Werbrouck Frascati, October 9, 2001.
A Unifying Approach to the Design of a Secure Database Operating System Written By: David L. Spooner Ehud Gudes.
Public Works and Supervision Ethics Nick Arena. LEARNING OBJECTIVES Ethics defined? Your Employer’s Code of Ethics APWA’s Code of Conduct Doing the right.
Trust- and Clustering-Based Authentication Service in Mobile Ad Hoc Networks Presented by Edith Ngai 28 October 2003.
Coordinated Sensor Deployment for Improving Secure Communications and Sensing Coverage Yinian Mao, Min Wu Security of ad hoc and Sensor Networks, Proceedings.
1 Objective and Secure Reputation-Based Incentive Scheme for Ad-Hoc Networks Dapeng Oliver Wu Electrical and Computer Engineering University of Florida.
1 4/23/2007 Introduction to Grid computing Sunil Avutu Graduate Student Dept.of Computer Science.
Examining Dynamic Trust Relationships in Autonomy-Oriented Partner Finding Department of Computer Science, HKBU, HK International WIC Institute, BJUT,
Consumer Authentication for Networked Personal Health Information Redwood Health Information Collaborative March 18, 2008 Josh Lemieux Director, Personal.
Operating System Organization Chapter 3 Michelle Grieco.
Secure In-Network Aggregation for Wireless Sensor Networks
UML’s StateChart FSM, EFSM in UML Concurrent states Tool support.
Dynamic Trust Models for Ubiquitous Computing Environments Colin English, Paddy Nixon, Sotirios Terzis, Andrew McGettrick, Helen Lowe Department of Computer.
Security Vulnerabilities in A Virtual Environment
Time-Space Trust in Networks Shunan Ma, Jingsha He and Yuqiang Zhang 1 College of Computer Science and Technology 2 School of Software Engineering.
Globus and PlanetLab Resource Management Solutions Compared M. Ripeanu, M. Bowman, J. Chase, I. Foster, M. Milenkovic Presented by Dionysis Logothetis.
A Security Framework with Trust Management for Sensor Networks Zhiying Yao, Daeyoung Kim, Insun Lee Information and Communication University (ICU) Kiyoung.
Computer Science and Engineering 1 Mobile Computing and Security.
GRID ANATOMY Advanced Computing Concepts – Dr. Emmanuel Pilli.
Cloud Multi-domain Access Control Model Based on Role and Trust-degree Lixia Xie Chong Wang School of Computer Science and Technology Civil Aviation University.
Dept. of Computer Science & Engineering, CUHK1 Trust- and Clustering-Based Authentication Service in Mobile Ad Hoc Networks Presented by Edith Ngai Supervised.
Presented by Edith Ngai MPhil Term 3 Presentation
Talal H. Noor, Quan Z. Sheng, Lina Yao,
Emerging Payments Market Developments: Trends and Risks James Van Dyke, President and Founder Presented at the Federal Reserve Bank of Atlanta, November.
Lan Zhou, Vijay Varadharajan, and Michael Hitchens
Chapter 14: System Protection
Walter Binder Giovanna Di Marzo Serugendo Jarle Hulaas
The Beta Reputation System
Organization and Knowledge Management
Giannis F. Marias, Vassileios Tsetsos,
UML’s StateChart FSM, EFSM in UML Concurrent states Tool support.
E-Commerce and Economic Forces
   Storage Space Allocation at Marine Container Terminals Using Ant-based Control by Omor Sharif and Nathan Huynh Session 677: Innovations in intermodal.
Operating Systems : Overview
Operating Systems : Overview
A Trust Evaluation Framework in Distributed Networks: Vulnerability Analysis and Defense Against Attacks IEEE Infocom
Jeremy Grant Coordinator Better Identity Coalition
Presentation transcript:

Trust and Grid Computing Systems Presented By: Woodas Lai

Agenda What is Grid? What is Trust? Our Trust Model Future Work

What is Grid? Two facts: Advanced Technologies lead to the large, complex and resource-intensive applications Moore ’ s Law: power of network, storage, and computing resources is projected to double every 9, 12, and 18 months, respectively  Network performance outperforms CPU performance

What is Grid? Conclusion: Difficult to gather enough computational resources for running applications at a single location How to overcome?

What is Grid? Grid is a technology which brings together a set of resources distributed over wide-area networks that can support large-scale distributed applications Grid coordinates resource sharing and problem solving in dynamic, multi-institutional, virtual organizations

Gird Example

Grid Computing Each company could be regarded as a domain Each domain will have its own security policy The primary goal of Grid environment is to encourage domain-to-domain interactions to share the resources

How to share the resources? To encourage the controlled sharing of resources: The security overhead should be minimized so that the sharing is appealing The security mechanism applied should be scalable Domains should not lose control over their own resources  This is where our trust model comes and is applied

What is Trust Trust is to model the human social behavior When I use a credit card to pay the bill, the bank trust me that I will pay back the money later When I use the e-banking service to perform a transaction, I trust the bank that it will perform the transaction for me

Definition of Trust Trust is the firm belief in the competence of an entity to behave as expected such that this firm belief is a dynamic value associated with the entity and is subject to the entity ’ s behavior and applies only within a specific context at a given time

Trust Trust value is a continuous and dynamic value in the range of [0,1] 1 means very trustworthy 0 means very untrustworthy It is built on past experience It is context based (under different context may have different trust value)

Reputation When making trust-based decisions, entities can rely on others for information regarding to a specific entity. The information regarding to a specific entity x is defined as the reputation of entity x.

Definition of Reputation The reputation of an entity is an expectation of its behavior based on other entities ’ observations or information about the entity ’ s past behavior within a specific context at a given time.

Evaluating Trust and Reputation Trusts decays with time Entities may form alliances and they may trust their allies and business partners more than others Trust value is based on the combination of direct trust and reputation

Let D i and D j be two domains of entities The trust relationship based on a specific context c at a given time t is T(D i,D j,t,c) Let the direct trust relationship for the context c at time t be dT(D i,D j,t,c) Let the reputation of D j for the context c at time t be R(D j,t,c) Evaluating Trust and Reputation

T(D i,D j,t,c) =  x dT(D i,D j,t,c) +  x R(D j,t,c) where  and  are the weights given to direct and reputation relationships respectively Evaluating Trust and Reputation

Direct trust relationship is computed as a product of the trust level in the direct trust table (DTT) and the decay function  (t-t ij,c) where c is the specific context t is the current time t ij is the time of the last update or the last transaction between D i and D j Evaluating Trust and Reputation

dT(D i,D j,t,c) = DTT(D i,D j,c) x  (t-t ij,c) Evaluating Trust and Reputation

The reputation of D j is computed as the average of the product of the trust level in the reputation trust table (RTT), the decay function (  (t-t kj,c)), and the recommender trust factor (r(D k,D j )) for all domains k. Evaluating Trust and Reputation

Recommender trust factor It is used to prevent cheating via collusions among a group of domains It is a value between 0 and 1 Higher value if D k and D j are unknown or have no prior relationship Lower value if D k and D j are allies or business partner

R(D j,t,c) =  RTT(D k,D j,c) x r(D k,D j ) x  (t-t kj,c)  D k Evaluating Trust and Reputation

Each Domain will maintain its own Direct Trust Table (DTT) and Reputation Trust Table (RTT). Trust Model

ContextDomains D1D1 D2D2 ……DjDj C1C1 Trust Value ……Trust Value …… CiCi Trust Value ……Trust Value Direct Trust Table maintained By D k

Trust Model Time duration for this service invocation = t4-t1 In Grid Computing, there is always a chain of service calls

Trust Model We define another time decay function: (t expected -t duration,c) Where t expected is the expected time duration for this service call t duration is the actual time duration for this service call C is the context

Trust Model Our Direct Trust Relationship will be modified as follows: dT(D i,D j,t,c) = DTT(D i,D j,c) x  (t-t ij,c) x (t expected -t duration,c)

Updating Direct Trust Table Our formula is: DTT(D i,D j,c) = (1-  )x DTT(D i,D j,c) +  x Tv(t ij,c) where Tv(t ij,c) is the trust value for context c resulted from the direct trust relationship between D i and D j  is between 0 and 1. If  > 0.5, more preference will be given to current direct trust value

Required Trust Value The required trust value is defined as a value between 0 and 1, such that if T(D i,D j,t,c) >= RTv, the interaction is trusted and the request is granted if T(D i,D j,t,c) < RTv, the interaction is not trusted and enhance security mechanism is enforced (authentication using X.509 certificate)

Initial Trust Value Itv is define as the initial trust value. At the very beginning, D i and D j may not know each other. D j will then send the X.509 certificate to D i so as to verify the identity, if the verification is successful, Dj will be assigned the trust value of Itv and then the transaction starts. After the transaction, some trust metrics like last transaction time and duration time will be updated. After that, our trust model will continue to evolve as described before.

Future Work Simulation or Experiments should be done in order to test our trust model. In this model, the behavior of the entity is not monitored. (Like the entity consumes more resources than requested or reading some memory out of the allocated boundary). Intrusion Detection Systems (IDSs) may be studied so as to address this behavioral issue.

Thanks for your attention Q&A