Assessing the Effect of Deceptive Data in the Web of Trust Yi Hu, Brajendra Panda, and Yanjun Zuo Computer Science and Computer Engineering Department.

Slides:



Advertisements
Similar presentations
Data Communications and Networking
Advertisements

Mobile Communication Networks Vahid Mirjalili Department of Mechanical Engineering Department of Biochemistry & Molecular Biology.
Doc.: IEEE /1387r0 Submission Nov Yan Zhang, et. Al.Slide 1 HEW channel modeling for system level simulation Date: Authors:
1 Intrusion Monitoring of Malicious Routing Behavior Poornima Balasubramanyam Karl Levitt Computer Security Laboratory Department of Computer Science UCDavis.
Page 1 / 14 The Mesh Comparison PLANET’s Layer 3 MAP products v.s. 3 rd ’s Layer 2 Mesh.
How Bad is Selfish Routing? By Tim Roughgarden Eva Tardos Presented by Alex Kogan.
Optimal redundancy allocation for information technology disaster recovery in the network economy Benjamin B.M. Shao IEEE Transaction on Dependable and.
Graph Partitioning Dr. Frank McCown Intro to Web Science Harding University This work is licensed under Creative Commons Attribution-NonCommercial 3.0Attribution-NonCommercial.
An Approach to Evaluate Data Trustworthiness Based on Data Provenance Department of Computer Science Purdue University.
Database Management System
Edith C. H. Ngai1, Jiangchuan Liu2, and Michael R. Lyu1
Intrusion Detection and Containment in Database Systems Abhijit Bhosale M.Tech (IT) School of Information Technology, IIT Kharagpur.
8.1 © 2007 by Prentice Hall 8 Chapter Securing Information Systems.
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.
© nCode 2000 Title of Presentation goes here - go to Master Slide to edit - Slide 1 Reliable Communication for Highly Mobile Agents ECE 7995: Term Paper.
Detecting Network Intrusions via Sampling : A Game Theoretic Approach Presented By: Matt Vidal Murali Kodialam T.V. Lakshman July 22, 2003 Bell Labs, Lucent.
A Trust Based Assess Control Framework for P2P File-Sharing System Speaker : Jia-Hui Huang Adviser : Kai-Wei Ke Date : 2004 / 3 / 15.
May 14, Organization Design and Dynamic Resources Huzaifa Zafar Computer Science Department University of Massachusetts, Amherst.
Improvements in the Spatial and Temporal representation of the Model Owen Woodberry Bachelor of Computer Science, Honours.
An Authentication Service Against Dishonest Users in Mobile Ad Hoc Networks Edith Ngai, Michael R. Lyu, and Roland T. Chin IEEE Aerospace Conference, Big.
Art and Science of Social Computing London, October 4, 2010 Natasa Milic-Frayling Microsoft Research Vodafone Lecture Series Royal Academy of Engineering.
The Very Small World of the Well-connected. (19 june 2008 ) Lada Adamic School of Information University of Michigan Ann Arbor, MI
Building a Strong Foundation for a Future Internet Jennifer Rexford ’91 Computer Science Department (and Electrical Engineering and the Center for IT Policy)
Wei Gao Joint work with Qinghua Li, Bo Zhao and Guohong Cao Department of Computer Science and Engineering The Pennsylvania State University Multicasting.
1 Algorithms for Bandwidth Efficient Multicast Routing in Multi-channel Multi-radio Wireless Mesh Networks Hoang Lan Nguyen and Uyen Trang Nguyen Presenter:
SocialFilter: Introducing Social Trust to Collaborative Spam Mitigation Michael Sirivianos Telefonica Research Telefonica Research Joint work with Kyungbaek.
Introduction to Network Defense
1 Pertemuan 20 Teknik Routing Matakuliah: H0174/Jaringan Komputer Tahun: 2006 Versi: 1/0.
Design of the multi-level security network switch system which restricts covert channel Conference: Communication Software and Networks (ICCSN), 2011 IEEE.
Information flow-based Risk Assessment in Access Control Systems
CPT 123 [299] Internet Skills Overview of the Internet Session One Class Notes DMWilliamson 1998.
1 ECE-517: Reinforcement Learning in Artificial Intelligence Lecture 6: Optimality Criterion in MDPs Dr. Itamar Arel College of Engineering Department.
Improving Capacity and Flexibility of Wireless Mesh Networks by Interface Switching Yunxia Feng, Minglu Li and Min-You Wu Presented by: Yunxia Feng Dept.
SOS: Security Overlay Service Angelos D. Keromytis, Vishal Misra, Daniel Rubenstein- Columbia University ACM SIGCOMM 2002 CONFERENCE, PITTSBURGH PA, AUG.
Trust- and Clustering-Based Authentication Service in Mobile Ad Hoc Networks Presented by Edith Ngai 28 October 2003.
Copyright: S.Krishnamurthy, UCR Power Controlled Medium Access Control in Wireless Networks – The story continues.
NETWORKS NEED HISTORY HARDWARE REQD. SOFTWARE REQD. TOPOLOGIES.
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.
TCP Trunking: Design, Implementation and Performance H.T. Kung and S. Y. Wang.
Evaluating Network Security with Two-Layer Attack Graphs Anming Xie Zhuhua Cai Cong Tang Jianbin Hu Zhong Chen ACSAC (Dec., 2009) 2010/6/151.
A Tale of Institutional Education: Students’ Perspective Muhammad Hussain Mahdi Department of Computer Science and.
Peer Centrality in Socially-Informed P2P Topologies Nicolas Kourtellis, Adriana Iamnitchi Department of Computer Science & Engineering University of South.
Interpersonal Relationships in Group Interaction in CSCW Environments Yang Cao, Golha Sharifi, Yamini Upadrashta, Julita Vassileva University of Saskatchewan,
Excursions in Modern Mathematics, 7e: Copyright © 2010 Pearson Education, Inc. 7 The Mathematics of Networks 7.1Trees 7.2Spanning Trees 7.3 Kruskal’s.
SECURING SELF-VIRTUALIZING ETHERNET DEVICES IGOR SMOLYAR, MULI BEN-YEHUDA, AND DAN TSAFRIR PRESENTED BY LUREN WANG.
Search Worms, ACM Workshop on Recurring Malcode (WORM) 2006 N Provos, J McClain, K Wang Dhruv Sharma
Collaboration diagrams. Purpose A collaboration diagram is an alternate way to show a scenario. A collaboration diagram shows the objects and relationships.
HTML5 based Notification System for Updating E-Training Contents Yu-Doo Kim 1 and Il-Young Moon 1 1 Department of Computer Science Engineering, KoreaTech,
Reading TCP/IP Protocol. Training target: Read the following reading materials and use the reading skills mentioned in the passages above. You may also.
Computer Networks22-1 Network Layer Delivery, Forwarding, and Routing.
Exploiting Sink Mobility for Maximizing Sensor Networks Lifetime Z. Maria Wang, Emanuel Melachrinoudis Department of Mechanical and Industrial Engineering.
UDP: User Datagram Protocol Chapter 12. Introduction Multiple application programs can execute simultaneously on a given computer and can send and receive.
An Algorithm for Measuring Optimal Connections in Large Valued Networks Song Yang Henry Hexmoor Sociology Computer Science University of Arkansas Preparation.
Assignment # 3 Networking Components By: Jeff Long.
Risk-Aware Mitigation for MANET Routing Attacks Submitted by Sk. Khajavali.
Constructing Inter-Domain Packet Filters to Control IP Spoofing Based on BGP Updates Zhenhai Duan, Xin Yuan Department of Computer Science Florida State.
COMESA MONETARY INSTITUTE TRAINING ON MACROPRUDENTIAL POLICY TOOLS RELEVANT FOR COMESA MEMBER COUNTRIES WORKSHOP III: NETWORK ANALYSIS USING BANK-LEVEL.
Malicious Modification Attacks by Insiders in Relational Databases: Prediction and Prevention Qussai Yaseen and Brajendra Panda 1PASSAT 2010.
Presented by Edith Ngai MPhil Term 3 Presentation
Analysis of University Researcher Collaboration Network Using Co-authorship Jiadi Yao School of Electronic and Computer Science,
Chap. 2 Network Models.
Introduction to Computers
Pandemic Flu & General Disaster Preparedness
Security in Networking
Dieudo Mulamba November 2017
CS223 Advanced Data Structures and Algorithms
E-learning system "Carat"
Department of Computer Science University of York
Modeling and Taming Parallel TCP on the Wide Area Network
Presentation transcript:

Assessing the Effect of Deceptive Data in the Web of Trust Yi Hu, Brajendra Panda, and Yanjun Zuo Computer Science and Computer Engineering Department University of Arkansas Fayetteville, AR

Outline Open Rating Systems Objective of this Research Model – Indirect Trust Computation – Trust on Objects – Social Circles and their Effects Conclusion

Open Rating Systems No central authority Available to virtually everyone Lack of full knowledge of subjects and objects Trust plays a vital role Information Flow Policy may exist – Lattice Vs. Non-Lattice based

Problems Lack of mechanisms to prevent deceptive data from spreading from one subject to another. Lack of capability to evaluate the impacts of any deceptive data in an effective way.

Objective of this Research Evaluation of the effects of deceptive data transmitted by a malicious user – Which subjects in the trusted network may be affected by the deceptive data?

Our Model Utilizes both the web of trust and the information flow policy. Information Flow where S is a set of subjects and  is defined on pairs of subjects. A  B indicates information from subject A is allowed to flow to subject B.

Our Model (continued) Web of Trust Set of Objects: O Set of Subjects: A Set of possible ratings of objects: D(0  D  1) Set of possible ratings of subjects: T (0  T  1) Partial function R: A  O = D Partial function W: A  A = T Web of trust is a directed graph represented by W

Our Model (continued) Information Flow Network and Web of Trust – Usually web of trust and information flow network are independent of each other. – However, trust management plays a critical role in discretionary based information flow policy.

Calculation of Indirect Trust Ratings

Trust Rating Based on Information Flow Path

The Basic Model Steps to calculate effects of deceptive data: 1. Find all possible nodes where the information may reach. 2. For each of possible destination nodes, find all possible paths from the originating node to it. 3. For each of possible paths, calculate the rating of the deceptive data to the destination node. If the rating is below a trust threshold, this deceptive data will be discarded and, thus, would not spread to other nodes continuing on that path.

An Example Figure 1. Information Flow Policy

An Example (Continued) Figure 2. Web of Trust

Discussion of the Example Suppose subject 3 spreads a deceptive data a Suppose the trust decay factor d = 5%, and the trust threshold equal to 30% Subject 9 will not trust this deceptive data (D 9a ’= 40% * 50% * 95% * 100% = 19%); thus (s)he will not send it to other subjects. So subjects 11 and 12 will not receive the data.

Augmenting the Basic Model with Social Circle Factor In the basic model no consideration was given to the property of social circle of web of trust. In general, information is selectively sent to individuals who the host thinks would be interested in it. Trust among subjects often developed based on the common interests, this is especially true with online communities.

A Social Circle In the web of trust in Figure 3, the circle indicates the social circle of subject A. In this figure, subjects inside the circle are considered to have common interest as that of subject A, whereas the people outside the circle have very little common interest as that of subject A. Figure 3. Social circle in a web of trust A

Deceptive Data in a Social Circle The size of the social circle is calculated based on interest decay factor. Taking a social circle into account, there are four cases of how a deceptive data originating from subject A can affect other users.

Deceptive Data in a Social Circle (continued) (Suppose D BO represents the trust rating of object o by subject B and R trust represents the trust threshold) Case 1: B is outside the social circle and D BO > R trust – No harm Case 2: B is outside the social circle and D BO < R trust – No harm Case 3: B is inside the social circle and D BO > R trust – B would be affected Case 4: B is inside the social circle and D BO < R trust – No harm

Conclusions Deceptive data transmitted by a malicious user in a web of trust affects other subjects in this network. The presented model utilizes both web of trust and information flow network to assess the effect of any such data. Future work would include a recovery mechanism to undo the damage.