https://www.mdu.se/

mdu.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Automated Passport Control: Mining and Checking Models of Machine Readable Travel Documents
Mälardalen University, School of Innovation, Design and Engineering, Embedded Systems. Avl List Gmbh, Graz, Austria.ORCID iD: 0000-0001-8556-1541
Mälardalen University, School of Innovation, Design and Engineering, Embedded Systems.
Mälardalen University, School of Innovation, Design and Engineering, Embedded Systems.ORCID iD: 0000-0001-7586-0409
2024 (English)In: ACM International Conference Proceeding Series, Association for Computing Machinery , 2024, article id 171Conference paper, Published paper (Refereed)
Abstract [en]

Passports are part of critical infrastructure for a very long time. They also have been pieces of automatically processable information devices, more recently through the ISO/IEC 14443 (Near-Field Communication - NFC) protocol. For obvious reasons, it is crucial that the information stored on devices are sufficiently protected. The International Civil Aviation Organization (ICAO) specifies exactly what information should be stored on electronic passports (also Machine Readable Travel Documents - MRTDs) and how and under which conditions they can be accessed. We propose a model-based approach for checking the conformance with this specification in an automated and very comprehensive manner: we use automata learning to learn a full model of passport documents and use trace equivalence and primitive model checking techniques to check the conformance with an automaton modeled after the ICAO standard. Since the full behavior is underspecified in the standard, we compare a part of the learned model and apply a primitive checking ruleset to assure proper authentication. The result is an automated (non-interactive), yet very thorough test for compliance, despite the underspecification. This approach can also be used with other applications for which a specification automaton can be modeled and is therefore broadly applicable.

Place, publisher, year, edition, pages
Association for Computing Machinery , 2024. article id 171
Keywords [en]
Automata Learning, Bisimulation, Formal Methods, NFC, Passports, Protocol Compliance, Automata theory, Automation, Compliance control, Model checking, Automaton learning, Bisimulations, Information devices, International Civil Aviation Organization, ISO/IEC-14443, Machine readable travel documents, Passport, Processable
National Category
Computer and Information Sciences
Identifiers
URN: urn:nbn:se:mdh:diva-68173DOI: 10.1145/3664476.3670454ISI: 001283894700098Scopus ID: 2-s2.0-85200364225ISBN: 9798400717185 (print)OAI: oai:DiVA.org:mdh-68173DiVA, id: diva2:1888956
Conference
19th International Conference on Availability, Reliability and Security, ARES, Vienna, 30 July-2 August, 2024
Available from: 2024-08-14 Created: 2024-08-14 Last updated: 2025-10-10Bibliographically approved
In thesis
1. Formal Methods-based Security Testing Utilizing Threat Modeling, Automata Learning, and Model Checking
Open this publication in new window or tab >>Formal Methods-based Security Testing Utilizing Threat Modeling, Automata Learning, and Model Checking
2025 (English)Doctoral thesis, comprehensive summary (Other academic)
Abstract [en]

This thesis strives towards finding more efficient methods of automating security test case generation, which are currently in a state of infancy for automotive systems, in both white and, especially, black box settings. The thesis focuses on communication protocols used in vehicular systems and we base our research on formal methods. The rationale is their rigor, as they are based on sound logical principles, and their potential for efficiency gains, since formally defined systems can be more easily analyzed algorithmically and, therefore, tested automatically. Our contributions include:

• Methods for deriving automata: 

  • We provide a method to automatically obtain behavioral models in the form of state machines of communication protocol implementations in real-world settings using automata learning.   
  • We demonstrate a method to derive compound protocol state machines, i.e., state machines representing systems that communicate via more than one protocol at the same time

• Methods for checking automata:   

  • We provide a means to automatically check these state machines for their compliance with a specification (e.g., from a standard, like ISO/IEC 14443-3). 
  • We provide a scheme, Context-based Proposition Maps (CPMs), to aug    ment the state machines with propositions (i.e., attributes that can be checked).   
  • We define generic Linear Temporal Logic (LTL)-based properties to recognize cybersecurity-related specification violations.   
  • We provide a method to model-check inferred state machines utilizing the Rebeca modeling language providing a formally defined template.

• Methods to facilitate test case generation: 

  • We present a technique to automatically derive test cases to demonstrate deviations identified in a state machine on the actual system.   
  • We also present a method to create abstract cybersecurity test-case specifications from semi-formal threat models using attack trees.   
  • We provide a method for utilizing Large Language Models (LLMs) to derive test cases from threat models and inferred state machines.   
  • We present a method utilizing LLMs to derive security properties from threat models to model-check implemented state machines, determining the consistency of designs’ threat models and implementations’ state machines.
Place, publisher, year, edition, pages
Västerås: Mälardalens universitet, 2025
Series
Mälardalen University Press Dissertations, ISSN 1651-4238 ; 445
Keywords
Cybersecurity, Formal Methods, Model Checking, Threat Modeling, Testing, Verification
National Category
Security, Privacy and Cryptography
Research subject
Computer Science
Identifiers
urn:nbn:se:mdh:diva-73534 (URN)978-91-7485-726-9 (ISBN)
Public defence
2025-11-28, Kappa, Mälardalens universitet, Västerås, 10:00 (English)
Opponent
Supervisors
Available from: 2025-10-03 Created: 2025-10-03 Last updated: 2025-11-07Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records

Marksteiner, StefanSirjani, MarjanSjödin, Mikael

Search in DiVA

By author/editor
Marksteiner, StefanSirjani, MarjanSjödin, Mikael
By organisation
Embedded Systems
Computer and Information Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 262 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf