Abstract
Computing systems are evolving into large networks interconnecting organizations and even countries. The relationships among these organizations are characterized by the need for competition and cooperation without a common trusted agent. Trust arises primarily in establishing channels for secure communication. This paper presents an axiometric theory of trust in secure communication protocols. The paper introduces basic notions about developing a logic or a theory, and shows that logics of belief are appropriate for basing a theory of trust on. A theory of trust has many applications, such as design of authentication servers based on trust relationships, and design of protocols that are tolerant to security failures. We present methods for reasoning about the trust properties of secure protocols. The protocols can be implemented in an iterative or a recursive manner. Surprisingly, these two classes of protocols have different trust requirements, and exhibit interesting duality properties.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call