Dr James Heather

Biography

Security is increasingly important in a highly connected world. Cryptographic protocols, designed to achieve goals such as authentication, confidentiality and non-repudiation, have, however, proved difficult to verify in their full generality.

Much of my work has been in the application of rank functions to protocol verification, using CSP as the underlying process algebra. By harnessing the power of rank functions, I have been able to develop an algorithm that can verify a protocol running on a network of unbounded size.