A S URVEY OF TRUST MANAGEMENT AND ITS APPLICATIONS S UPERVISED BY : D R. Y AN W ANG Ravendra Singh Student-id: 41446461 1.

Slides:



Advertisements
Similar presentations
Recommender Systems & Collaborative Filtering
Advertisements

Trust Management of Services in Cloud Environments:
For e-Business F. Dignum Utrecht University Trust Reputation and.
1 CS 6910: Advanced Computer and Information Security Lecture on 11/2/06 Trust in P2P Systems Ahmet Burak Can and Bharat Bhargava Center for Education.
A P2P REcommender system based on Gossip Overlays (PREGO) ‏ R.Baraglia, P.Dazzi M.Mordacchini, L.Ricci A P2P REcommender system based on Gossip Overlays.
Content Management & Hashtag Recommendation IN P2P OSN By Keerthi Nelaturu.
Different methods and Conclusions Liqin Zhang. Different methods Basic models Reputation models in peer-to-peer networks Reputation models in social networks.
Trust and Reputation in Social Networks Laura Zavala 03/2010.
On the Economics of P2P Systems Speaker Coby Fernandess.
University of Cincinnati1 Towards A Content-Based Aggregation Network By Shagun Kakkar May 29, 2002.
Intelligent and Adaptive Systems Group Seminar 28 th September 2006.
TrustMe: Anonymous Management of Trust Relationships in Decentralized P2P Systems Aameek Singh and Ling Liu Presented by: Korporn Panyim.
Trust Model for High Quality of Recommendations G. Lenzini, N. Sahli, and H. Eertink (Telematica Instituut, NL) G. Lenzini, N. Sahli, and H. Eertink (Telematica.
A Survey of Trust Evaluation Methods (Supervisor: Yan Wang) Name:Erden Sacan Student ID: Unit:ITEC810.
Kuang-Hao Liu et al Presented by Xin Che 11/18/09.
CSCE 715 Ankur Jain 11/16/2010. Introduction Design Goals Framework SDT Protocol Achievements of Goals Overhead of SDT Conclusion.
TrustWalker: A Random Walk Model for Combining Trust-based and Item-based Recommendation Mohsen Jamali & Martin Ester Simon Fraser University, Vancouver,
FRIENDS: File Retrieval In a dEcentralized Network Distribution System Steven Huang, Kevin Li Computer Science and Engineering University of California,
Dept. of Computer Science & Engineering, CUHK1 Trust- and Clustering-Based Authentication Services in Mobile Ad Hoc Networks Edith Ngai and Michael R.
An Architecture for Dynamic Trust Monitoring in Mobile Networks Onolaja Olufunmilola, Rami Bahsoon, Georgios Theodoropoulos School of Computer Science.
Keeping Peers Honest In EigenTrust Robert McGrew Joint work with Zoë Abrams and Serge Plotkin.
Computing Trust in Social Networks
Chapter 20: Social Service Selection Service-Oriented Computing: Semantics, Processes, Agents – Munindar P. Singh and Michael N. Huhns, Wiley, 2005.
Agent Technology for e-Commerce
An Authentication Service Against Dishonest Users in Mobile Ad Hoc Networks Edith Ngai, Michael R. Lyu, and Roland T. Chin IEEE Aerospace Conference, Big.
Kemal AkkayaWireless & Network Security 1 Department of Computer Science Southern Illinois University Carbondale CS 591 – Wireless & Network Security Lecture.
Recommender systems Ram Akella February 23, 2011 Lecture 6b, i290 & 280I University of California at Berkeley Silicon Valley Center/SC.
Coye Cheshire & Andrew Fiore June 26, 2015 // Computer-Mediated Communication CMC & Society.
Recommender systems Ram Akella November 26 th 2008.
Social Context Based Recommendation Systems and Trust Inference Student: Andrea Manrique ID: ITEC810, Macquarie University1 Advisor: A/Prof. Yan.
Biologically Inspired Robotics Group,EPFL Associative memory using coupled non-linear oscillators Semester project Final Presentation Vlad TRIFA.
1 APPLICATION OF DDDAS FOR TRUSTED COMMUNICATION IN MOBILE NETWORKS. Onolaja Olufunmilola Supervisors: Dr Rami Bahsoon, Dr Georgios Theodoropoulos.
SocialFilter: Introducing Social Trust to Collaborative Spam Mitigation Michael Sirivianos Telefonica Research Telefonica Research Joint work with Kyungbaek.
Recommender Systems. >1,000,000,000 Finding Trusted Information How many cows in Texas?
Chapter 20: Social Service Selection Service-Oriented Computing: Semantics, Processes, Agents – Munindar P. Singh and Michael N. Huhns, Wiley, 2005.
Link Recommendation In P2P Social Networks Yusuf Aytaş, Hakan Ferhatosmanoğlu, Özgür Ulusoy Bilkent University, Ankara, Turkey.
Deploying Trust Policies on the Semantic Web Brian Matthews and Theo Dimitrakos.
An affinity-driven clustering approach for service discovery and composition for pervasive computing J. Gaber and M.Bakhouya Laboratoire SeT Université.
Autonomous Replication for High Availability in Unstructured P2P Systems Francisco Matias Cuenca-Acuna, Richard P. Martin, Thu D. Nguyen
Chengjie Sun,Lei Lin, Yuan Chen, Bingquan Liu Harbin Institute of Technology School of Computer Science and Technology 1 19/11/ :09 PM.
Introduction Mobile commerce(M-Commerce) is developing trend due to successful experience of E-Commerce(EC) Most significant difference between M-Commerce.
Trust- and Clustering-Based Authentication Service in Mobile Ad Hoc Networks Presented by Edith Ngai 28 October 2003.
Developing Trust Networks based on User Tagging Information for Recommendation Making Touhid Bhuiyan et al. WISE May 2012 SNU IDB Lab. Hyunwoo Kim.
Adapted from the original presentation made by the authors Reputation-based Framework for High Integrity Sensor Networks.
Enabling Peer-to-Peer SDP in an Agent Environment University of Maryland Baltimore County USA.
Estimating Component Availability by Dempster-Shafer Belief Networks Estimating Component Availability by Dempster-Shafer Belief Networks Lan Guo Lane.
Reputation Network Analysis for Filtering Ravi Emani Ramesh Ravindran.
High-integrity Sensor Networks Mani Srivastava UCLA.
Agents that Reduce Work and Information Overload and Beyond Intelligent Interfaces Presented by Maulik Oza Department of Information and Computer Science.
Trust Management in P2P systems Presenter: Lintao Liu April 21th, 2003.
Chapter 20: Social Service Selection Service-Oriented Computing: Semantics, Processes, Agents – Munindar P. Singh and Michael N. Huhns, Wiley, 2005.
Time-Space Trust in Networks Shunan Ma, Jingsha He and Yuqiang Zhang 1 College of Computer Science and Technology 2 School of Software Engineering.
Recommendation Algorithms for E-Commerce. Introduction Millions of products are sold over the web. Choosing among so many options is proving challenging.
A Reputation-Based Approach for Choosing Reliable Resources in Peer-to-Peer Networks E. Damiani S. De Capitani di Vimercati S. Paraboschi P. Samarati F.
Community-Based Link Prediction/Recommendation in the Bipartite Network of BoardGameGeek.com Brett Boge CS 765 University of Nevada, Reno.
Computer Science and Engineering 1 Mobile Computing and Security.
Peer-to-Peer Systems: An Overview Hongyu Li. Outline  Introduction  Characteristics of P2P  Algorithms  P2P Applications  Conclusion.
The EigenTrust Algorithm for Reputation Management in P2P Networks Sepandar D.Kamvar Mario T.Schlosser Hector Garcia-Molina.
Paper Study – Propagation of Trust in E-commerce Communities, and others YuanDa Cao (曹元大), etc. Beijing Institute of Technology Presented by Vincent Dec/2004.
Social Networks and Peer to Peer As Presented by Jeremy Robinson 3/22/2007.
Collaborative Filtering - Pooja Hegde. The Problem : OVERLOAD Too much stuff!!!! Too many books! Too many journals! Too many movies! Too much content!
Presented by Edith Ngai MPhil Term 3 Presentation
Recommendation Based Trust Model with an Effective Defense Scheme for ManetS Adeela Huma 02/02/2017.
Trustworthiness Management in the Social Internet of Things
The Beta Reputation System
Service-Oriented Computing: Semantics, Processes, Agents
Ebrahim Bagheri and Ali A. Ghorbani and
ITEC 810 Workshop Paper: A Survey of Web-based Social Network Trust
Service-Oriented Computing: Semantics, Processes, Agents
A Trust Evaluation Framework in Distributed Networks: Vulnerability Analysis and Defense Against Attacks IEEE Infocom
Presentation transcript:

A S URVEY OF TRUST MANAGEMENT AND ITS APPLICATIONS S UPERVISED BY : D R. Y AN W ANG Ravendra Singh Student-id:

WHAT IS TRUST?  Trust can mean having belief or confidence in the honesty, goodness, skill or safety of a person, organisation or a thing.  In simple terms, Trust can mean to have confidence or faith in a person or a piece of information.  Trust is inferred differently in different contexts, for example on social networks, peer-to-peer networks or for e-commerce transactions. 2

P ROBLEM S PECIFICATION  Too much information is available over the internet in terms of selection of goods and services.  Very difficult to ascertain the trustworthiness or the reliability of the available information.  How is trust inferred and applied in terms of ratings or feedback on online social networks?  How do reputation-based and trust based filtering methodologies work in peer-to-peer networks?  Comparison of the methodologies to highlight their merits and drawbacks  Suggest future studies 3

A IMS AND SIGNIFICANCE  Advent of online social and peer-to-peer networks has led to the emergence of a trust based approach to recommendations.  Different recommender systems using trust inference algorithms have been formulated.  The methodologies used have to be studied and compared for their effective deployment in the real world applications. 4

A IMS AND SIGNIFICANCE (C ONTD.)  In peer-to-peer networks, there is a widespread prevalence of malicious peers.  The malicious peers provide fake resources with the same name as a real resource peer which the user may be looking for.  Similarity and trust based filtering algorithm mechanisms have been formulated to check the menace and provide authenticity to the trustworthy resources. 5

S COPE OF WORK AND SOURCES USED Study and compare different trust inferring methodologies and it’s applications in context of Social networks:  Inferring trust using TidalTrust as a trust inference algorithm (Golbeck and Hendler 2006)  Trust-based recommendation system on a social network using collaborative filtering method (Walter, Battiston et al. 2008)  Random Walk model for combining trust-based and item based recommendation (Mohsen and Martin 2009) 6

S COPE OF WORK AND SOURCES USED ( CONTD.) Study and compare different trust inferring methodologies and it’s applications in context of P2P networks:  A Similarity-based recommendation filtering algorithm for establishing reputation based trust (Li, Jing et al. 2005)  Trust based search for unstructured peer-to-peer networks (Mashayekhi, Habibi et al. 2008) 7

A PPROACH TAKEN TO SOLVE THE PROBLEM  Study and compared the algorithms and the methodologies used in different models.  Highlighted the merits and shortcomings found in the used methodologies.  Proposed issues for future research in certain areas. 8

O UTCOMES OF THE PROJECT The first methodology studied in context of social networks points out that TidalTrust has been used as the trust inference algorithm.  It uses collaborative filtering only for calculating the similarity between users in the network and recommendation items that are liked by users with similar tastes.  It works on the premise that recommendations to suggest user’s interest in an item shall be generated.  It measures how much the item relates to the user’s preference.  It uses the concept of making predictions on a compact and strong trust neighbourhood.  Trust ratings within the social network have been taken as the basis for similarity related calculations. 9

O UTCOMES OF THE PROJECT (C ONTD.) 10 The second methodology studied in context of social networks pertains to a trust-based recommendation system using collaborative filtering  It works on the premise that agents use their social network to reach information and trust relationships to filter the information.  It looks into how the dynamics of trust among different agents affect the system’s performance when comparing the methodology with a frequency based recommendation system.  It functions in an automated and distributed manner and has the ability to filter information for people based on their social network and trust relationships.  The model is found as robust and reliable against random, selfish and malicious agents on the social network.

O UTCOMES OF THE PROJECT (C ONTD.) 11 The third methodology based on Random walk model studied in context of social networks combines trust-based and item-based recommendations.  It considers the ratings of similar items along with the ratings of the target items.  Taking the similar items’ rating is done to avoid considering the ratings of far neighbours in the network.  The methodology works on the premise that the reliability of far neighbours in the chain of trust-based relationships becomes weak and cannot be relied upon.  The model computes confidence in its prediction of recommendations which is not done by other models.

O UTCOMES OF THE PROJECT (C ONTD.) 12 The first methodology is based on similarity based recommendation filtering algorithm.  It takes a community based reputations approach for estimating the trustworthiness of peers.  A simplified algorithm method is used to compute the similarity between peers.  The algorithm proves to be robust to thwart attempts from group of peers who co-operate deliberately amongst themselves to subvert the system.  The algorithm tags the community of malicious peers and biases the downloads preventing inauthentic downloads.

O UTCOMES OF THE PROJECT (C ONTD.) 13 The second t methodology on P2P networks is based on trust based search model  It combines the search and trust systems to reduce the costs of executing them separately.  In the evaluation scheme, it does not calculate and store the global reputation values.  It obtains an estimate of global reputation values.

14 CONCLUSION

15 Q UESTIONS ?