Linkability of e-passports

This lecture covers the breaking of unlinkability of the ICAO 9303 Standard for e-Passports using Bisimilarity. It starts with an introduction to 7-calculus and reduction rules, followed by modeling BAC with #-calculus and the implications of MAC verification. The lecture then explores the unlinkability of BAC using T-calculus programs equivalence, trace equivalence, and examples illustrating trace equivalence. It delves into the unlinkability of BAC in terms of trace equivalence and discusses an attack on the UK implementation. The conclusion highlights the use of T-calculus in modeling cryptographic protocols and formalizing security properties, emphasizing the vulnerabilities of e-Passports to various attacks and the need for new protocols.