Formal Verification of Challenge Flow in EMV 3-D Secure and Its Improvement

EMV 3-D Secure is an authentication service mainly to identify and verify cardholders for card-not-present (CNP) transactions over the Internet. EMV 3-D Secure services are provided by international credit card brands such as Visa, Mastercard and American Express, and its protocol is specified by EMVCo. There are known existing works on evaluating security of several versions of 3-D Secure, such as a formal verification using Casper/FDR2 for the old specification (3-D Secure 1.0) and a spoofing attack using reverse engineering on risk assessment indicators for the current specification, EMV 3-D Secure (3-D Secure 2.0). However, there is no security verification of EMV 3-D Secure based on its protocol specification. Formal methods are known as methods that can verify security with high fidelity to the protocol specification and have been actively researched in recent years. In this paper, we verify the security of EMV 3-D Secure using ProVerif, an automated security verification tool for cryptographic protocols. First, one of the difficulties we faced is to correctly extract the detailed protocol structure from the entire specification that is written by natural language over 400 pages. Based on the extracted protocol structure, we formalize Challenge Flow for authentication by secret information under three environments (App-based (default-sdk), App-based (split-sdk), and Browser-based) in the latest version 2.3.1.1, which are specified for the purpose of identity verification in CNP transactions. We then verify the confidentiality and resistance to off-line dictionary attacks of secret information, the authenticity and the resistance to replay attacks against both man-in-the-middle attacks and colluding attacks with relay servers. As verification results, we show that Challenge Flow satisfies all of the above security requirements. Furthermore, we discuss the necessity of the unilateral authenticated channel between the cardholder and the card issuer assumed in the EMV 3-D Secure specification, and show that if we use a public channel instead of a unilateral authenticated channel, Challenge Flow still satisfies security requirements. It indicates that the protocol can be more efficient than the specification without reducing security.

Authors

Institutions

Publication Details

Journal
IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences
Published
2025-02-18
DOI
https://doi.org/10.1587/transfun.2024eap1132
Citations
1
Primary Topic
Digital Rights Management and Security
Type
article
Field-Weighted Citation Impact
3.25

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Formal Verification of Challenge Flow in EMV 3-D Secure and Its Improvement

Kazuki Yoneyama, Kakeru Watanabe
1 citations
IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences
Digital Rights Management and Security
3.25
article

Formal Verification of Challenge Flow in EMV 3-D Secure and Its Improvement

Kazuki Yoneyama, Kakeru Watanabe
article en
1 citations

Abstract

EMV 3-D Secure is an authentication service mainly to identify and verify cardholders for card-not-present (CNP) transactions over the Internet. EMV 3-D Secure services are provided by international credit card brands such as Visa, Mastercard and American Express, and its protocol is specified by EMVCo. There are known existing works on evaluating security of several versions of 3-D Secure, such as a formal verification using Casper/FDR2 for the old specification (3-D Secure 1.0) and a spoofing attack using reverse engineering on risk assessment indicators for the current specification, EMV 3-D Secure (3-D Secure 2.0). However, there is no security verification of EMV 3-D Secure based on its protocol specification. Formal methods are known as methods that can verify security with high fidelity to the protocol specification and have been actively researched in recent years. In this paper, we verify the security of EMV 3-D Secure using ProVerif, an automated security verification tool for cryptographic protocols. First, one of the difficulties we faced is to correctly extract the detailed protocol structure from the entire specification that is written by natural language over 400 pages. Based on the extracted protocol structure, we formalize Challenge Flow for authentication by secret information under three environments (App-based (default-sdk), App-based (split-sdk), and Browser-based) in the latest version 2.3.1.1, which are specified for the purpose of identity verification in CNP transactions. We then verify the confidentiality and resistance to off-line dictionary attacks of secret information, the authenticity and the resistance to replay attacks against both man-in-the-middle attacks and colluding attacks with relay servers. As verification results, we show that Challenge Flow satisfies all of the above security requirements. Furthermore, we discuss the necessity of the unilateral authenticated channel between the cardholder and the card issuer assumed in the EMV 3-D Secure specification, and show that if we use a public channel instead of a unilateral authenticated channel, Challenge Flow still satisfies security requirements. It indicates that the protocol can be more efficient than the specification without reducing security.

IEICE Transactions on Fundamentals of Electronics Communications and Computer SciencesVol. E108.A(8)
Ibaraki University (JP)
Core Research for Evolutional Science and Technology
Openalex Percentile: Top 11%
Digital Rights Management and Security
3.25
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.