Attacking a Protocol for Group Key Agreement by Refuting Incorrect Inductive Conjectures

Abstract. Automated tools for finding attacks on flawed security protocols often struggle to deal with protocols for group key agreement. Systems designed for fixed 2 or 3 party protocols may not be able to model a group protocol, or its intended security properties. Frequently, ls require an abstraction to a group of fixed size to be made before the automated analysis takes place. This can prejudice chances of finding attacks on the protocol. In this paper, we describe Coral, our system for finding security protocol attacks by refuting incorrect inductive conjectures. We have used Coral to model a group key protocol in a general way. By posing inductive conjectures about the trace of messages exchanged, we can investigate novel properties of the protocol, such as tolerance to disruption, and whether it results in agreement on a single key. This has allowed us to find three distinct novel attacks on groups of size two and three.

• Type: Conference
• Year: 2004
• Where: CADE
• Authors: Graham Steel, Alan Bundy, Monika Maidl
• Keywords: Analysis Takes Place, Automated Reasoning, CADE 2004, Incorrect Inductive Conjectures, Inductive Conjectures