• DocumentCode
    3288273
  • Title

    The theory of creating trust with a set of mistrust-parties

  • Author

    Viehmann, Johannes

  • Author_Institution
    Fraunhofer Inst. FOKUS (MOTION), Berlin, Germany
  • fYear
    2012
  • fDate
    16-18 July 2012
  • Firstpage
    185
  • Lastpage
    194
  • Abstract
    This paper presents the idea for achieving trustworthiness by splitting responsibilities between different parties mutually mistrusting one another. These parties are called mistrust-parties because some kind of mistrust between these parties is actively created to prevent potentially manipulative cooperation. The birth of the S-Network, a universally applicable trustworthy repository, should enable users to make and access reliable publications and secure deposits. The S-Network combines secure long term data storage and preservation in a computer network with non-repudiation and legal validity. This paper describes how one can apply the concept of creating trust with the help of mistrust-parties for the S-Network so that the S-Network itself would be highly trustworthy. Besides being a potential application, the S-Network could also be used as a tool for vital parts in the measures for creating trust with a set of mistrust-parties described in this paper.
  • Keywords
    computer network security; game theory; trusted computing; S-Network; computer network; game theory; legal validity; long term data preservation; long term data storage security; manipulative cooperation prevention; mistrust-parties; nonrepudiation; reliable publication access; secure deposits; trust creation theory; trustworthiness; universally applicable trustworthy repository; Games; Law; Proposals; Protocols; Reliability; Testing; S-Network; Trust; game theory; mistrust; non-repudiation; trustworthy repository;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Privacy, Security and Trust (PST), 2012 Tenth Annual International Conference on
  • Conference_Location
    Paris
  • Print_ISBN
    978-1-4673-2323-9
  • Electronic_ISBN
    978-1-4673-2325-3
  • Type

    conf

  • DOI
    10.1109/PST.2012.6297939
  • Filename
    6297939