Formal methods for security protocols : three examples of the black-box approach

Abstract

Security protocols are hard to design, even under the assumption of perfect cryptography. With the `classical' Needham-Schroder protocol as leading example, three so-called black-box approaches to the formal verification of security protocols are sketched.