• DocumentCode
    1886190
  • Title

    Disconnection punishment in trust bootstrapping: Benefits of activity stereotypes

  • Author

    Sánchez-Artigas, Marc

  • Author_Institution
    Dept. of Comput. Eng. & Math., Univ. Rovira i Virgili, Tarragona, Spain
  • fYear
    2012
  • fDate
    3-5 Sept. 2012
  • Firstpage
    149
  • Lastpage
    154
  • Abstract
    Trust-based systems have been proposed as means to fight against malicious agents in peer-to-peer networks. However, there still exist some issues that have been generally overlooked in the literature. One of them is the question of whether punishing disconnecting agents is effective. In this paper, we investigate this question for these initial cases where prior direct and reputational evidence is unavailable, what is referred in the literature as trust bootstrapping. First, we demonstrate that there is not a universally optimal penalty for disconnection and that the effectiveness of this punishment is markedly dependent on the uptime and downtime session lengths. Second, to minimize the effects of an inadequate selection of the disconnection penalty, we propose to incorporate predictions into the trust bootstrapping process. These predictions based on the current activity of the agents enhance the selection of potentially long-lived trustees, shortening the trust bootstrapping time when direct and reputational information is lacking.
  • Keywords
    computer bootstrapping; computer network security; peer-to-peer computing; software agents; trusted computing; activity stereotype; disconnection punishment; malicious agent; peer-to-peer network; reputational information; trust bootstrapping; trust-based system; Analytical models; Availability; Monitoring; Peer to peer computing; Positron emission tomography; Quality of service; Uncertainty;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Peer-to-Peer Computing (P2P), 2012 IEEE 12th International Conference on
  • Conference_Location
    Tarragona
  • Print_ISBN
    978-1-4673-2860-9
  • Electronic_ISBN
    978-1-4673-2861-6
  • Type

    conf

  • DOI
    10.1109/P2P.2012.6335795
  • Filename
    6335795