IDEAS home Printed from https://ideas.repec.org/a/gam/jjrfmx/v15y2022i8p342-d879383.html
   My bibliography  Save this article

HF-SCA: Hands-Free Strong Customer Authentication Based on a Memory-Guided Attention Mechanisms

Author

Listed:
  • Cosimo Distante

    (Institute of Applied Sciences and Intelligent Systems (ISASI), National Research Council of Italy, 73100 Lecce, Italy
    These authors contributed equally to this work.)

  • Laura Fineo

    (Department of Marketing, Banca Sella S.p.A., 13900 Biella, Italy
    These authors contributed equally to this work.)

  • Luca Mainetti

    (Department of Innovation Engineering, University of Salento, 73100 Lecce, Italy
    These authors contributed equally to this work.)

  • Luigi Manco

    (Vidyasoft s.r.l., 73047 Monteroni di Lecce, Italy
    These authors contributed equally to this work.)

  • Benito Taccardi

    (Faculty of Engineering, University of Salento, 73100 Lecce, Italy
    These authors contributed equally to this work.)

  • Roberto Vergallo

    (Department of Innovation Engineering, University of Salento, 73100 Lecce, Italy
    These authors contributed equally to this work.)

Abstract

Strong customer authentication (SCA) is a requirement of the European Union Revised Directive on Payment Services (PSD2) which ensures that electronic payments are performed with multifactor authentication. While increasing the security of electronic payments, the SCA impacted seriously on the shopping carts abandonment: an Italian bank computed that 22% of online purchases in the first semester of 2021 did not complete because of problems with the SCA. Luckily, the PSD2 allows the use of transaction risk analysis tool to exempt the SCA process. In this paper, we propose an unsupervised novel combination of existing machine learning techniques able to determine if a purchase is typical or not for a specific customer, so that in the case of a typical purchase the SCA could be exempted. We modified a well-known architecture (U-net) by replacing convolutional blocks with squeeze-and-excitation blocks. After that, a memory network was added in a latent space and an attention mechanism was introduced in the decoding side of the network. The proposed solution was able to detect nontypical purchases by creating temporal correlations between transactions. The network achieved 97.7% of AUC score over a well-known dataset retrieved online. By using this approach, we found that 98% of purchases could be executed by securely exempting the SCA, while shortening the customer’s journey and providing an elevated user experience. As an additional validation, we developed an Alexa skill for Amazon smart glasses which allows a user to shop and pay online by merely using vocal interaction, leaving the hands free to perform other activities, for example driving a car.

Suggested Citation

  • Cosimo Distante & Laura Fineo & Luca Mainetti & Luigi Manco & Benito Taccardi & Roberto Vergallo, 2022. "HF-SCA: Hands-Free Strong Customer Authentication Based on a Memory-Guided Attention Mechanisms," JRFM, MDPI, vol. 15(8), pages 1-24, August.
  • Handle: RePEc:gam:jjrfmx:v:15:y:2022:i:8:p:342-:d:879383
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/1911-8074/15/8/342/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/1911-8074/15/8/342/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Tasadduq Imam & Angelique McInnes & Sisira Colombage & Robert Grose, 2022. "Opportunities and Barriers for FinTech in SAARC and ASEAN Countries," JRFM, MDPI, vol. 15(2), pages 1-37, February.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Massimiliano Cologgi, 2023. "The security of retail payment instruments: evidence from supervisory data," Temi di discussione (Economic working papers) 30, Bank of Italy, Economic Research and International Relations Area.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.

      Corrections

      All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jjrfmx:v:15:y:2022:i:8:p:342-:d:879383. See general information about how to correct material in RePEc.

      If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

      If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

      If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

      For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

      Please note that corrections may take a couple of weeks to filter through the various RePEc services.

      IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.