Logical Foundations for Reasoning about Trust in Secure Digital Communication

Liu, Chuchang

doi:10.1007/3-540-45656-2_29

Cited by 16 publications

(15 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The soundness of the logic TML + depends on the soundness theorems for TML and SLTL [27,28]. The completeness of TML + can be proved by the techniques used in [14].…”

Section: ϕ(X)mentioning

confidence: 99%

“…SLTL has been used for specifying events that may run on different clocks of varying rates of progress, such as those found in distributed and/or reactive systems [28], and also for representing and reasoning about such events stored in temporal knowledge bases [40]. TML is a multi-modal variant of the modal logic KD and it extends first-order logic with typed variables and belief operators for agents [27]. We in particular establish the soundness and completeness of the labelled tableau calculus for TML + .…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

An analytic tableau calculus for a temporalised belief logic

Orgun

Adi

2011

Journal of Applied Logic

View full text Add to dashboard Cite

A tableau is a refutation-based decision procedure for a related logic, and is among the most popular proof procedures for modal logics. In this paper, we present a labelled tableau calculus for a temporalised belief logic called TML + , which is obtained by adding a linear-time temporal logic onto a belief logic by the temporalisation method of Finger and Gabbay. We first establish the soundness and the completeness of the labelled tableau calculus based on the soundness and completeness results of its constituent logics. We then sketch a resolution-type proof procedure that complements the tableau calculus and also propose a model checking algorithm for TML + based on the recent results for model checking procedures for temporalised logics. TML + is suitable for formalising trust and agent beliefs and reasoning about their evolution for agent-based systems. Based on the logic TML + , the proposed labelled tableau calculus could be used for analysis, design and verification of agent-based systems operating in dynamic environments.

show abstract

“…The soundness of the logic TML + depends on the soundness theorems for TML and SLTL [27,28]. The completeness of TML + can be proved by the techniques used in [14].…”

Section: ϕ(X)mentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

An analytic tableau calculus for a temporalised belief logic

Orgun

Adi

2011

Journal of Applied Logic

View full text Add to dashboard Cite

show abstract

“…The modal logic approach is able to enhance propositional and first-order logic with modal operators to represent agent beliefs. Liu (2001) proposed a belief logic, called TML (typed modal logic), which extends firstorder logic with typed variables and belief operators. TML is very suitable to express static properties, for example, the assertion "John believes that Bob has the key k" can be formalised in TML as B john Has(bob, k) where B john is the modal belief operator for agent John.…”

Section: Motivation For Tml +mentioning

confidence: 99%

“…TML + is obtained by combining a belief logic called TML (typed modal logic; Liu 2001) with a temporal logic called SLTL (simple linear-time temporal logic). SLTL is a simple form of temporal logic with clocks proposed by Liu andOrgun (1996, 1999) for specifying reactive systems in which different events may occur over timelines with varying rates of progress. This logic allows us to express agent beliefs as temporal propositions that may vary through time.…”

Section: Aims and Contributionsmentioning

confidence: 99%

“…The initial trust or metabeliefs of agents in the system can be encapsulated in a notion of trust and represented as a set of rules (axioms) in a chosen logical framework. These rules together with those of the logic form a theory of trust for the system (Liu 2001). Such theories provide a foundation for reasoning about agent beliefs as well as security properties that systems may satisfy.…”

Section: Motivationmentioning

confidence: 99%

See 1 more Smart Citation

Formalising theories of trust for authentication protocols

Orgun

2007

Inf Syst Front

View full text Add to dashboard Cite

This paper discusses a formal approach for establishing theories of trust for authentication systems which can be used to reason about how agent beliefs evolve through time. The goal of an authentication system is to verify and authorise users in order to protect restricted data and information, so trust is a critical issue for authentication systems. After authentication, two principals (people, computers, services) should be entitled to believe that they are communicating with each other and not with intruders. So, it is important to express such beliefs precisely and to capture the reasoning that leads to them. In this paper, we focus on analysis of agent beliefs in dynamic environments using a temporalised belief logic, obtained by adding a temporal logic onto a belief logic. Working through a well-known authentication protocol, namely Kerberos, we discuss how to express principal beliefs involved in authentication protocols and the evolution of those beliefs based on a series of observations of agents as a consequence of communication. Our approach could be used for designing, verifying and implementing authentication protocols.

show abstract

Managing Theories of Trust in Agent Based Systems

Orgun

2005

Computer and Information Sciences - ISCIS 2005

View full text Add to dashboard Cite

Logical Foundations for Reasoning about Trust in Secure Digital Communication

Cited by 16 publications

References 5 publications

An analytic tableau calculus for a temporalised belief logic

An analytic tableau calculus for a temporalised belief logic

Formalising theories of trust for authentication protocols

Managing Theories of Trust in Agent Based Systems

Contact Info

Product

Resources

About