Modeling deceptive information dissemination using a holistic approach

ABSTRACT

This research studies deceptive information dissemination based on the Information Flow Network and the Web of Trust. We present an Information Dissemination Model that illustrates the prerequisite for information propagation based on the subject and object trusts. To evaluate the spread of deceptive data accurately, we offer two quantitative models that are utilized to calculate the degree to which the subjects in the information flow network are affected. The algorithms for evaluating information dissemination for these two models are provided and the time complexities of the algorithms are also analyzed. Our experiments illustrate the characteristics of the web of trust that affect the dissemination of the deceptive information.

REFERENCES

• 1: Paul Resnick , Ko Kuwabara , Richard Zeckhauser , Eric Friedman, Reputation systems, Communications of the ACM, v.43 n.12, p.45-48, Dec. 2000 [doi>10.1145/355112.355122]
• 2: S. Tadelis. The Market for Reputations as an Incentive Mechanism. Journal of Political Economy, Vol. 2, No. 2, Pages 854--882, August 2002.
• 3: G. Zacharia and P. Maes. Trust Management through Reputation Mechanisms. Applied Artificial Intelligence, Vol. 14, No. 8, Pages 881--908, 2000
• 4: P. Massa and P. Avesani. Controversial Users Demand Local Trust Metrics: an Experimental Study on Epinions.com Community. In Proceedings of the 25th AAAI (American Association for Artificial Intelligence) Conference, 2005.
• 5: R. Guha , Ravi Kumar , Prabhakar Raghavan , Andrew Tomkins, Propagation of trust and distrust, Proceedings of the 13th international conference on World Wide Web, May 17-20, 2004, New York, NY, USA [doi>10.1145/988672.988727]
• 6: Raph Levien , Alexander Aiken, Attack-resistant trust metrics for public key certification, Proceedings of the 7th conference on USENIX Security Symposium, 1998, p.18-18, January 26-29, 1998, San Antonio, Texas
• 7: R. Levien. Attack Resistant Trust Metrics. PhD Thesis, UC Berkeley, Berkeley, CA, USA, 2003.
• 8: Cai-Nicolas Ziegler , Georg Lausen, Spreading Activation Models for Trust Propagation, Proceedings of the 2004 IEEE International Conference on e-Technology, e-Commerce and e-Service (EEE'04), p.83-97, March 28-31, 2004
• 9: R. Quillian. Semantic Memory. Semantic Information Processing, Pages 227--270, MIT Press, 1968.
• 10: Dorothy E. Denning, A lattice model of secure information flow, Communications of the ACM, v.19 n.5, p.236-243, May 1976 [doi>10.1145/360051.360056]
• 11: M. Richardson, R. Agrawal, and P. Domingos. Trust Management for the Semantic Web. In Proceedings of 2nd International Semantic Web Conference, USA, October 20--23, 2003.
• 12: E. Dijkstra. A Note on Two Problems in Connexion with graphs. Numerische Mathematik, Vol. 1, Pages 269--271, 1959.
• 13: Thomas T. Cormen , Charles E. Leiserson , Ronald L. Rivest, Introduction to algorithms, MIT Press, Cambridge, MA, 1990
• 14: Robert W. Floyd, Algorithm 97: Shortest path, Communications of the ACM, v.5 n.6, p.345, June 1962 [doi>10.1145/367766.368168]
• 15: Y. Hu, B. Panda, and Y. Zuo, Assessing the Effect of Deceptive Data in the Web of Trust, In Proceedings of 1st NSF/NSA/AFRL workshop on Secure Knowledge Management (SKM'04), Buffalo, NY, Sep. 2004.

INDEX TERMS

Primary Classification:
  F. Theory of Computation
  F.2 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY
      F.2.2 Nonnumerical Algorithms and Problems
          Subjects: Computations on discrete structures

General Terms:
Algorithms, Security

Keywords:
information flow, trust management, web of trust