• DocumentCode
    3279607
  • Title

    An Approach to Optimize Local Trust Algorithm in SureMsg Service

  • Author

    Zhang, Wenmao ; Bi, Jun ; Wu, Jianping ; Qin, Zheng

  • Author_Institution
    Tsinghua Univ., Beijing
  • fYear
    2007
  • fDate
    9-10 Aug. 2007
  • Firstpage
    51
  • Lastpage
    54
  • Abstract
    SureMsg is a trustworthy email service that is based on the instant messaging (IM) platform and which scores the reputation level of email sender by both: global reputation value and local trust value. As compared to the global reputation, the local trust value is more reasonable and precisely represents a sender\´s behaviour in the social network. This paper proposes an approach that is underpinned by the "six- degree-of-separation" to optimize the local trust algorithm in SureMsg so as to decrease the complexity of computation to the local trust value and to obtain a precise score. Experiments are presented that demonstrate that the six-degree-of-separation theory is practicable in SureMsg. Moreover, we show that decreasing the degree from six to two or to three can also obtain a precise score and also decrease the complexity of computation.
  • Keywords
    Web services; electronic mail; electronic messaging; telecommunication security; SureMsg service; computational complexity; global reputation value; instant messaging; local trust algorithm; local trust value; six-degree-of-separation theory; social network; trustworthy email service; Computer architecture; Electronic mail; File servers; Intelligent networks; Intelligent systems; Postal services; Protocols; Relays; Social network services; Software algorithms;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Bio-inspired, Learning, and Intelligent Systems for Security, 2007. BLISS 2007. ECSIS Symposium on
  • Conference_Location
    Edinburgh
  • Print_ISBN
    0-7695-2919-4
  • Type

    conf

  • DOI
    10.1109/BLISS.2007.36
  • Filename
    4290938