TAPS: The Last Few Slides

Abstract

In the last few years, a variety of methods have been used to verify cryptographic protocols in unbounded Dolev-Yao models. However, these methods typically rely on rather drastic assumptions (e.g., the injectivity of tupling and encryption), and it is unclear how to extend these methods to more realistic protocol models. We show how the first-order verification method of [1] (implemented in the verifier TAPS) can be extended to more faithfully capture some features of real protocols, including weak secrets, bitwise concatenation and projection, reversible encryption, and bitwise exclusive-or. (These extensions are usually relegated to the last few slides in presentations of TAPS, hence the title.)