Lecture

Linkability of e-passports

In course
DEMO: aliqua in
Irure qui et excepteur magna Lorem. Pariatur sit cupidatat mollit incididunt. Officia id qui et consectetur occaecat elit dolor sint excepteur ex pariatur aliquip sunt do.
Login to see this section
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.

Instructor
consequat incididunt nostrud
Enim aliqua adipisicing elit ullamco in ex laboris ad ea irure. Do cillum anim officia amet Lorem quis dolore tempor do enim. Minim voluptate enim et adipisicing eiusmod irure labore dolor excepteur. Fugiat dolore ad nostrud ea non qui.
Login to see this section
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.
Related lectures (31)
Secure Communications: Biometric Passport Case Study
Explores the shift to secure communications through the biometric passport case study, covering RFID, identity examples, MRTD, EAC, and cryptographic protocols.
Biometric Technologies: Enhancing Security and Privacy
Explores the development of biometric technologies based on finger vein recognition to enhance security and privacy.
Elliptic Curve Cryptography in Practice
Explores the practical applications of elliptic curve cryptography in various real-world scenarios and cryptographic operations.
Secure Multiparty Computation: Danish Sugar Beets Auction
Explores the Danish Sugar Beets Auction, Secure Multiparty Computation, and the design of secure protocols for privacy and correctness.
Cryptographic Security Fundamentals
Covers cryptographic security fundamentals, including collision search algorithms, public-key cryptography, and risks of underestimating collision attacks.
Show more

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.