A calculus for distrust and mistrust

Properties of trust are becoming widely studied in several applications within the computational domain. On the contrary, negative trust attribution is less well-defined and related issues are yet to be approached and resolved. We present a natural deduction calculus for trust protocols and its negative forms, distrust and mistrust. The calculus deals efficiently with forms of trust transitivity and negative trust multiplication and we briefly illustrate some possible applications

A calculus for distrust and mistrust

Properties of trust are becoming widely studied in several applications within the computational domain. On the contrary, negative trust attribution is less well-defined and related issues are yet to be approached and resolved. We present a natural deduction calculus for trust protocols and its negative forms, distrust and mistrust. The calculus deals efficiently with forms of trust transitivity and negative trust multiplication and we briefly illustrate some possible applications

Managing software uninstall with negative trust

A problematic aspect of software management systems in view of integrity preservation is the handling, approval, tracking and eventual execution of change requests. In the context of the relation between clients and repositories, trust can help identifying all packages required by the intended installation. Negative trust, in turn, can be used to approach the complementary problem induced by removing packages. In this paper we offer a logic for negative trust which allows to identify admissible and no-longer admissible software packages in the current installation profile in view of uninstall processes. We provide a simple working example and the system is formally verified using the Coq theorem prover

Managing software uninstall with negative trust

A problematic aspect of software management systems in view of integrity preservation is the handling, approval, tracking and eventual execution of change requests. In the context of the relation between clients and repositories, trust can help identifying all packages required by the intended installation. Negative trust, in turn, can be used to approach the complementary problem induced by removing packages. In this paper we offer a logic for negative trust which allows to identify admissible and no-longer admissible software packages in the current installation profile in view of uninstall processes. We provide a simple working example and the system is formally verified using the Coq theorem prover

A Conceptual Examination of Distrusting Beliefs in Older Adults about the Internet

Older adults are adopting the Internet in increasing numbers today. At the same time they are also experiencing uncertainties about their safety and information privacy on this medium. Several media reports have shown a rising number of incidents involving older Internet user, that indicate lack of awareness of Internet-related security and privacy issues. This conceptual paper provides a framework to help understand the reasons why older adults might distrust the commercial websites in general. Based on established theoretical frameworks about trust, distrust and aging-based technology adoption challenges, we develop several postulates to explain distrusting beliefs that can result in precautious Internet behavior. Implications of this framework will be found in building educational programs and interventions for the population over the age of 55

A logic of negative trust

We present a logic to model the behaviour of an agent trusting or not trusting messages sent by another agent. The logic formalises trust as a consistency checking function with respect to currently available information. Negative trust is modelled in two forms: distrust, as the rejection of incoming inconsistent information; mistrust, as revision of previously held information becoming undesirable in view of new incoming inconsistent information, which the agent wishes to accept. We provide a natural deduction calculus, a relational semantics and prove soundness and completeness results. We overview a number of applications which have been investigated for the proof-theoretical formulation of the logic

Security, Privacy'); DROP TABLE users; -- and Forced Trust in the Information Age?

In this study, we discuss forced trust in the context of information systems, information society and surveillance. Trust definitions and concepts pertinent to the discussion are examined and portrayed with case examples of forced trust in different situations that make up the information society. As the forced trust appears mostly in the governmental information systems, we reflected the concept from the security and privacy point-of-view that are important for the users of such systems in the current age of information. We portray the trust landscape of critical governmental information systems and discuss forced trust in the context of Internet infrastructure and mass surveillance. We provide a glimpse of an information society that combines security, trust, and privacy, while also providing discussion on what kind of trust dynamics such a utopia would require.</p

Contradictory information flow in networks with trust and distrust

We offer a proof system and a NetLogo simulation for trust and distrust in networks where contradictory information is shared by ranked lazy and sceptic agents. Trust and its negative are defined as properties of edges: the former is required when a message is passed bottom-up in the hierarchy or received by a sceptic agent; the latter is attributed to channels that require contradiction resolution, or whose terminal is a lazy agent. These procedures are associated with epistemic costs, respectively for confirmation and refutation. We describe the logic, illustrate the algorithms implemented in the model and then focus on experimental results concerning the analysis of epistemic costs, the role of the agents’ epistemic attitude on distrust distribution and the influence of (dis)trust in reaching consensus

Contradictory information flow in networks with trust and distrust

We offer a proof system and a NetLogo simulation for trust and distrust in networks where contradictory information is shared by ranked lazy and sceptic agents. Trust and its negative are defined as properties of edges: the former is required when a message is passed bottom-up in the hierarchy or received by a sceptic agent; the latter is attributed to channels that require contradiction resolution, or whose terminal is a lazy agent. These procedures are associated with epistemic costs, respectively for confirmation and refutation. We describe the logic, illustrate the algorithms implemented in the model and then focus on experimental results concerning the analysis of epistemic costs, the role of the agents’ epistemic attitude on distrust distribution and the influence of (dis)trust in reaching consensus