A framework for merging inconsistent beliefs in security protocol analysis

This paper proposes a framework for merging inconsistent beliefs in the analysis of security protocols. The merge application is a procedure of computing the inferred beliefs of message sources and resolving the conflicts among the sources. Some security properties of secure messages are used to ensure the correctness of authentication of messages. Several instances are presented, and demonstrate our method is useful in resolving inconsistent beliefs in secure messages.

[1]  N. S. Sridharan.  Proceedings of the Eleventh International Joint Conference on Artificial Intelligence : IJCAI-89, Detroit, Michigan, USA, August 20-25, 1989 , 1989 .

[2]  Martín Abadi,et al.  A logic of authentication , 1989, Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences.

[3]  Reihaneh Safavi-Naini,et al.  Partial belief and probabilistic reasoning in the analysis of secure protocols , 1992, [1992] Proceedings The Computer Security Foundations Workshop V.

[4]  Li Gong,et al.  Reasoning about belief in cryptographic protocols , 1990, Proceedings. 1990 IEEE Computer Society Symposium on Research in Security and Privacy.

[5]  Martín Abadi,et al.  A logic of authentication , 1990, TOCS.

[6]  Alberto O. Mendelzon,et al.  Knowledge Base Merging by Majority , 1999 .

[7]  Marco Schaerf,et al.  Arbitration (or How to Merge Knowledge Bases) , 1998, IEEE Trans. Knowl. Data Eng..

[8]  E DenningDorothy,et al.  Timestamps in key distribution protocols , 1981 .

[9]  Ronald Fagin,et al.  Uncertainty, belief, and probability 1 , 1991, IJCAI.

[10]  John M. Vickers,et al.  Belief and Probability , 1977 .