Distributed processes and the logic of knowledge

Parikh, Rohit; Ramanujam, R.

doi:10.1007/3-540-15648-8_21

Cited by 110 publications

(56 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…[17]), in multi-agent system semantics using local history identity (cf. [16,27]), and in information flow theory using low-level observability (cf. [33]).…”

Section: Introductionmentioning

confidence: 99%

A Complete Axiomatization of Knowledge and Cryptography

Cohen

Dam

2007

22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007)

View full text Add to dashboard Cite

The combination of first-order epistemic logic and formal cryptography offers a potentially very powerful framework for security protocol verification. In this article, we address two main challenges towards such a combination; First, the expressive power, specifically the epistemic modality, needs to receive concrete computational justification. Second, the logic must be shown to be, in some sense, formally tractable. Addressing the first challenge, we provide a generalized Kripke semantics that uses permutations on the underlying domain of cryptographic messages to reflect agents' limited computational power. Using this approach, we obtain logical characterizations of important concepts of knowledge in the security protocol literature, namely Dolev-Yao style message deduction and static equivalence. Answering the second challenge, we exhibit an axiomatization which is sound and complete relative to the underlying theory of cryptographic terms, and to an omega rule for quantifiers. The axiomatization uses largely standard axioms and rules from first-order modal logic. In addition, it includes some novel axioms for the interaction between knowledge and cryptography. To illustrate the usefulness of the logic we consider protocol examples using mixes, a Crowds style protocol, and electronic payments. Furthermore, we provide embedding results for BAN and SVO.

show abstract

“…[17]), in multi-agent system semantics using local history identity (cf. [16,27]), and in information flow theory using low-level observability (cf. [33]).…”

Section: Introductionmentioning

confidence: 99%

A Complete Axiomatization of Knowledge and Cryptography

Cohen

Dam

2007

22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007)

View full text Add to dashboard Cite

show abstract

“…and conditions on the reasoning abilities of the agents (perfect recall, no surprise, synchronisation, bounded agents). Moreover, [21] marks the start of a research paradigm that compares and links existing approaches to epistemic logic (Kripke models, interpreted systems ( [46])), and 'Parikh style' logic ( [92]), time (history based structures ( [92]), runs ( [46])), and dynamics, including PDL-style logic ( [61]) and dynamic epistemic logic (see Chapter 7). Van Benthem further helped clarify the link between interpreted systems, epistemic temporal logic and dynamic epistemic logic in [19].…”

Section: Epistemic Temporal Framesmentioning

confidence: 99%

Structures for Epistemic Logic

Bezhanishvili

Hoek

2014

Outstanding Contributions to Logic

View full text Add to dashboard Cite

“…Any logic of protocols must include as part of it a logic of knowledge. A number of researchers have begun the development of logics of distributed protocols which include the notion of knowledge [7] [8] [10] [12] [13] [16].…”

Section: Motivation and Backgroundmentioning

confidence: 99%

“…The work done so far on the logic of protocols which includes knowledge also includes, to varying degrees, time and to varying degrees is capable of implicitly modeling games [7] [8] [10] [12] [13] [16]. We feel, however, that the logics developed so far do not adequately model phenomena in protocols like asynchrony.…”

Section: Motivation and Backgroundmentioning

confidence: 99%

“…We feel, however, that the logics developed so far do not adequately model phenomena in protocols like asynchrony. In addition, they seem (with the possible exception of Parikh and Ramanujam's work [16]) to be capable of modeling only restricted classes of games. We feel that the logics of distributed protocols that we present go further than those of previous researchers in two ways:…”

Section: Motivation and Backgroundmentioning

confidence: 99%

See 1 more Smart Citation