Capturing Parallel Attacks within the Data Independence Framework

We carry forward the work described in our previous papers [3, 14, 12] on the application of data independence to the model checking of cryptographic protocols using CSP [13] and FDR [5]. In particular, we showed how techniques based on data independence [7, 13] could be used to justify, by means of a finite FDR check, systems where agents can perform an unbounded number of protocol runs. Whilst this allows for a more complete analysis, there was one significant incompleteness in the results we obtained: While each individual identity could perform an unlimited number of protocol runs sequentially, the degree of parallelism remained bounded (and small to avoid state space explosion). In this paper, we report significant progress towards the solution of this problem, by means anticipated in [3], namely by “internalising” all or part of each agent identity within the “intruder” process. The internalisation of agents (initially only server roles) was introduced in [14] as a st...

• Type: Conference
• Year: 2002
• Where: CSFW
• Authors: Philippa J. Broadfoot, A. W. Roscoe
• Keywords: CSFW 2002, Data Independence, Protocol Runs, Security Privacy, finite Fdr Check