Lecture

Linkability of e-passports

Description

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.

About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.