Lousy Phish— Relay Attacks on Visual Code Authentication Schemes

Total Page:16

File Type:pdf, Size:1020Kb

Lousy Phish— Relay Attacks on Visual Code Authentication Schemes I bought a new security token and all I got was this lousy phish| Relay attacks on visual code authentication schemes Graeme Jenkinson, Max Spencer, Chris Warrington, Frank Stajano fgraeme.jenkinson, max.spencer, chris.warrington, [email protected] University of Cambridge Computer Laboratory, Cambridge, UK Abstract. One recent thread of academic and commercial research into web authentication has focused on schemes where users scan a visual code with their smartphone, which is a convenient alternative to password- based login. We find that many schemes in the literature (including, previously, our own) are, unfortunately, vulnerable to relay attacks. We explain the inherent reasons for this vulnerability and offer an architec- tural fix, evaluating its trade-offs and discussing why it has never been proposed by other authors. 1 Introduction We consider a relatively new class of web authentication schemes, currently at- tracting significant academic and commercial interest, which we refer to as visual code authentication schemes. A user may log into a website which supports such an authentication scheme by scanning a visual code, such as a Quick Response (QR) code [1], using their hand-held authenticator device, henceforth scanner. The scanner is generally a smartphone, but might be a dedicated hardware gad- get. The user carries their scanner at all times, or at least whenever they might want to authenticate to a website; the scanner may have a mechanism to prevent its misuse if lost or stolen. Our own Pico system [2] is of course in this class too. Such schemes are interesting because they have some important usability benefits which passwords do not; specifically, there is nothing for users to remem- ber or type1. Furthermore these schemes are resilient to conventional phishing2 because the long-term secrets never leave the scanner and so an attacker can- not trick the victim into revealing them. However, visual code authentication schemes present a new risk. Because the information in a visual code is not human-readable, and visual codes are easily relayed, a user may be tricked into scanning a visual code displayed outside its intended context. 1 Cfr. definitions of Memoryless, Scalable-for-Users and Nothing-to-Type in the Us- ability, Deployability and Security (UDS) framework of Bonneau et al. [3]. 2 As defined in the UDS framework [3] Authors' preprint. In B. Christianson et al. (eds), Proceedings of Security Protocols Workshop 2014, Springer LNCS. We have surveyed a range of schemes currently in the literature, some com- mercial [4,5] and some academic [2,6,7]. We find there are significant structural similarities between the schemes and that they all are3 susceptible to attacks in which the victim inadvertently authenticates a session for the attacker. This paper makes the following contributions: { We show that the architecture of many visual authentication schemes cur- rently in the literature leaves them inherently vulnerable to attacks that relay the visual code, allowing an attacker to gain control of sessions authenticated by other users. { We present our proposed solution, session delegation, now adopted by Pico, which uses an additional communication channel to prevent the aforemen- tioned relay attacks, and discuss why no other scheme has adopted anything similar. { We discuss extensions to our session delegation protocol and some alternative means of mitigating these attacks, while considering their impact on the usability, deployability and security of the system. 2 Visual code authentication schemes All of the schemes surveyed offer a similar user experience and share some crucial architectural features. In this section we describe these commonalities and then review the individual schemes in more detail. 2.1 User experience when authenticating When a user visits a website in their web browser, the login page includes a visual code, possibly alongside a traditional username and password login form. In order to login, the user scans the code with their scanner, which authenticates to the website identified by the visual code. After the scanner has authenticated on the user's behalf, the web browser receives a session cookie which grants access to the user's account through their browser. The scanner is responsible for the generation and retention of all keys and secrets. As a result, using the scanner with arbitrarily many accounts and services does not require additional cognitive (and in particular memory) effort on the part of the user. 2.2 Protocol Crucially, these authentication schemes must also be able to authorise a web browser running on a different host than the scanner. We call this process browser authorisation. Without this ability users would be restricted to logging into, and using, websites only on their scanner. But it is this crucial feature, and the 3 Or were, in the case of Pico. common approach taken by the surveyed schemes to provide it, that leads to the security vulnerabilities we describe in section3 below. The schemes surveyed use differing protocols for the actual authentication between the scanner and the website. However, we found extensive similarities between the mechanisms used to perform the browser authorisation and, be- low, we show a generalised version of the overall protocol, to which the concrete implementations can all broadly be mapped4. Fig.1 shows the sequence of mes- sages sent between the user's web browser, B, their scanner, S, and the website, W . Website website identifier, 1 browser nonce 4 browser nonce browser nonce 3 5 session cookie auth protocol via visual code Web Browser 2 Scanner website identifier, browser nonce Fig. 1. Generalisation of the flawed browser authorisation protocol used by the re- viewed visual code authentication schemes. The figure shows how a session cookie, cU , for user U is installed into their browser B. 1. The user navigates to the login page of a website W in their web browser B. The login page returned by the website includes a visual code containing the website's address (or identifier) W and a fresh browser nonce, nB. Note that the request and response are performed over HTTPS and therefore encrypted under a TLS session key, KBW . W ! B : fW; nBgKBW 4 At least as far as we can infer|some schemes have not openly published a complete specification. 2. The website address W and browser nonce nB are transfered to the scanner, S, when the user scans the visual code on the website's login page. B ! S : W; nB (visual channel) 3. The scanner authenticates to the website using a scheme-specific authenti- cation protocol. The website looks up the user account, U, associated with the identity authenticated by the scanner. Subsequently, or as part of the authentication protocol itself, the scanner securely sends the browser nonce to the website. S ! W : fnBgKSW The website is then able to associate the nonce nB with the account U. 4. The browser makes another request to the website, again over HTTPS, which includes the browser nonce nB, with the intention of \trading in" this nonce for a session cookie. B ! W : fnBgKBW 5. After looking up the user account U associated with nB, the website W returns a session cookie cU . This cookie grants access to user U's account, as if the user had authenticated using a typical username-and-password-based scheme. W ! B : fcU gKBW If the browser had sent its second request (4) before the scanner had validated the nonce in (3) with the authentication protocol, the website would not have granted a session cookie in this step. 2.3 Schemes in the class Method and System for Authenticating a User by Means of a Mobile Device (2009) This patent [4], held by GMV Soluciones Globales Internet S.A., describes a visual code authentication scheme in which users authenticate to remote services with a trusted application running on a mobile phone. In this scheme the user selects the service to authenticate to by acquiring a visual code displayed by an untrusted device. The visual code contains both a random challenge and an identifier of the service to authenticate to. On scanning the visual code the mobile device creates a response to the challenge by signing it with a private key. The scheme uses Identity Based Encryption (IBE) allowing the response to be verified using the user's public identity such as an email address. In common with the other schemes described here, the scheme links the login session on the untrusted device with the scanner's response using the random challenge contained in the visual code. Thus, this random challenge is directly equivalent to the browser nonce shown in Fig.1. Snap2Pass Snap2Pass [8] is a visual code authentication system for web appli- cations in which users authenticate using a smartphone application. In this scheme the user selects the service to authenticate to by acquiring a visual code displayed by an untrusted device. The visual code contains both a random challenge and an identifier of the service (the relying party) to authenti- cate to. On scanning the visual code, the mobile device creates a response to the challenge comprising of the HMAC-SHA1 hash of the entire challenge message using a pre-shared secret as a key. The provider verifies this responds and, if successful, the browser session is authenticated with the appropriate account. The challenge nonce (sometimes referred to as a session key) in the visual code is directly equivalent to the browser nonce. Snap2Pass explicitly acknowledges that it does not mitigate active man in the middle attacks such as those discussed in this paper. Pico (2011) Stajano's Pico [2] is a visual code authentication scheme intended for a dedicated hardware device, although it could also be implemented, trading off security for convenience, as an application running on a smartphone5.
Recommended publications
  • CPAS04 Authenticator Options Version 1.0 11 November 2015
    GSM Association Non-confidential Official Document PDATA.03 - CPAS04 Authenticator Options CPAS04 Authenticator Options Version 1.0 11 November 2015 This is a Non-binding Permanent Reference Document of the GSMA Security Classification: Non-confidential Access to and distribution of this document is restricted to the persons permitted by the security classification. This document is confidential to the Association and is subject to copyright protection. This document is to be used only for the purposes for which it has been supplied and information contained in it must not be disclosed or in any other way made available, in whole or in part, to persons other than those permitted under the security classification without the prior written approval of the Association. Copyright Notice Copyright © 2016 GSM Association Disclaimer The GSM Association (“Association”) makes no representation, warranty or undertaking (express or implied) with respect to and does not accept any responsibility for, and hereby disclaims liability for the accuracy or completeness or timeliness of the information contained in this document. The information contained in this document may be subject to change without prior notice. Antitrust Notice The information contain herein is in full compliance with the GSM Association’s antitrust compliance policy. V1.0 Page 1 of 38 GSM Association Non-confidential Official Document PDATA.03 - CPAS04 Authenticator Options Table of Contents 1 Introduction 3 1.1 Overview 3 1.2 Scope 3 1.3 Abbreviations 3 1.4 References 5 2 Level
    [Show full text]
  • Modern Password Security for System Designers What to Consider When Building a Password-Based Authentication System
    Modern password security for system designers What to consider when building a password-based authentication system By Ian Maddox and Kyle Moschetto, Google Cloud Solutions Architects This whitepaper describes and models modern password guidance and recommendations for the designers and engineers who create secure online applications. A related whitepaper, Password security ​ for users, offers guidance for end users. This whitepaper covers the wide range of options to consider ​ when building a password-based authentication system. It also establishes a set of user-focused recommendations for password policies and storage, including the balance of password strength and usability. The technology world has been trying to improve on the password since the early days of computing. Shared-knowledge authentication is problematic because information can fall into the wrong hands or be forgotten. The problem is magnified by systems that don't support real-world secure use cases and by the frequent decision of users to take shortcuts. According to a 2019 Yubico/Ponemon study, 69 percent of respondents admit to sharing passwords with ​ ​ their colleagues to access accounts. More than half of respondents (51 percent) reuse an average of five passwords across their business and personal accounts. Furthermore, two-factor authentication is not widely used, even though it adds protection beyond a username and password. Of the respondents, 67 percent don’t use any form of two-factor authentication in their personal life, and 55 percent don’t use it at work. Password systems often allow, or even encourage, users to use insecure passwords. Systems that allow only single-factor credentials and that implement ineffective security policies add to the problem.
    [Show full text]
  • Trusted Execution Environments
    Trusted Execution Environments Assaf Rosenbaum Technion - Computer Science Department - M.Sc. Thesis MSC-2019-03 - 2019 Technion - Computer Science Department - M.Sc. Thesis MSC-2019-03 - 2019 Trusted Execution Environments Research Thesis Submitted in partial fulfillment of the requirements for the degree of Master of Science in Computer Science Assaf Rosenbaum Submitted to the Senate of the Technion | Israel Institute of Technology Kislev 5779 Haifa November 2018 Technion - Computer Science Department - M.Sc. Thesis MSC-2019-03 - 2019 Technion - Computer Science Department - M.Sc. Thesis MSC-2019-03 - 2019 This research was carried out under the supervision of Prof. Eli Biham and Dr. Sara Bitan, in the Faculty of Computer Science. Acknowledgements First and foremost, I wish to thank my advisors, Prof. Eli Biham and Dr. Sara Bitan, for their incredible support during the work on thesis. Thank you for providing me the freedom to find my own path while constantly guiding and directing me. I learned a lot from both of you. I would also like to thank my parents, siblings and my parents-in-law for their help and support during this stressful time. Thank you for being there whenever I needed. A special thanks is due to my three lovely children, you sparkle my life with moment of pure joy. Most importantly, I would like to thank my beautiful wife, Lior. Thank you for your endless support, the long hours in which you worked hard to give me the time I needed to work and for always pushing me forward. You ar the light of my life and I love you very much.
    [Show full text]
  • A Closer Look at SQRL Research Findings
    A closer look at SQRL Agenda • SQRL introduction • Related work • SQRL design details • Research questions • Research method • Research findings • Conclusion UvA-SNE-RP1 presentation 1 A closer look at SQRL SQRL introduction: trigger Secure Quick Reliable Login UvA-SNE-RP1 presentation 2 A closer look at SQRL SQRL introduction: how it works QR-scanning QR-tapping QR-clicking UvA-SNE-RP1 presentation 3 A closer look at SQRL SQRL introduction: design goals SSO 2FA out-of-band (OOB) authentication no secret(s) exchange anonymity no (additional) TTP low friction deployment UvA-SNE-RP1 presentation 4 A closer look at SQRL Related work: SSO • Open standards • OpenID • TiQR UvA-SNE-RP1 presentation 5 A closer look at SQRL SQRL design details: crypto ID site (fixed) specific secret 1-F secret 2-F Brute Elliptic Force Curve UvA-SNE-RP1 presentation 6 A closer look at SQRL SQRL design details: more crypto Compromised ID ? • ID revocation support • proves ID ownership • uses additional keys • Lock (disable) • Unlock (enable/change) UvA-SNE-RP1 presentation 7 A closer look at SQRL SQRL design details: messages UvA-SNE-RP1 presentation 8 A closer look at SQRL Research questions • How does SQRL improve authentication security compared to related solutions? • What does SQRL offer to both parties? • What constraints must be met to guaranty this behaviour? • What additional features are relevant to extend deployability? • What attacks remain feasible and what countermeasures are to be considered? UvA-SNE-RP1 presentation 9 A closer look at SQRL
    [Show full text]
  • Zero-Knowledge User Authentication: an Old Idea Whose Time Has Come
    Zero-Knowledge User Authentication: An Old Idea Whose Time Has Come Laurent Chuat, Sarah Plocher, and Adrian Perrig ETH Zurich Abstract User authentication can rely on various factors (e.g., a pass- word, a cryptographic key, and/or biometric data) but should not re- veal any secret information held by the user. This seemingly paradoxical feat can be achieved through zero-knowledge proofs. Unfortunately, naive password-based approaches still prevail on the web. Multi-factor authen- tication schemes address some of the weaknesses of the traditional login process, but generally have deployability issues or degrade usability even further as they assume users do not possess adequate hardware. This as- sumption no longer holds: smartphones with biometric sensors, cameras, short-range communication capabilities, and unlimited data plans have become ubiquitous. In this paper, we show that, assuming the user has such a device, both security and usability can be drastically improved using an augmented password-authenticated key agreement (PAKE) pro- tocol and message authentication codes. 1 Introduction User authentication still typically involves transmitting a plaintext password to the web server, which is problematic for many reasons. First, an attacker could obtain the user’s password using malware, a keystroke logger, phishing, or a man-in-the-middle attack. Second, the user might be using the same password on different websites, allowing a malicious server operator to impersonate the user. Third, if the website’s database is breached, although passwords may be protected by a hash function, a brute-force attack could reveal low-entropy pass- words. Fourth, as password-reuse and low-entropy passwords are problematic, users are constantly advised to pick new, long, complicated passwords.
    [Show full text]
  • SQRL: Anti-Phishing & Revocation
    Security Now! Transcript of Episode #426 Page 1 of 30 Transcript of Episode #426 SQRL: Anti-Phishing & Revocation Description: After following-up on a week chockful of interesting security news, Steve and Leo continue with their discussion of SQRL, the Secure QR code Login system, to discuss two recent innovations in the system that bring additional valuable features. High quality (64 kbps) mp3 audio file URL: http://media.GRC.com/sn/SN-426.mp3 Quarter size (16 kbps) mp3 audio file URL: http://media.GRC.com/sn/sn-426-lq.mp3 SHOW TEASE: It's time for Security Now!. Steve Gibson has the latest - yes, another Java patch - and more information about Lavabit. More information about the NSA, too. What is a Ferret's Cannon? It's coming up next on Security Now!. Leo Laporte: This is Security Now! with Steve Gibson, Episode 426, recorded October 16th, 2013: SQRL, Anti-Phishing, and Revocation. It's time for Security Now!, the show that covers your privacy and security online. Somebody in the chatroom before we began the show today, Steve Gibson, Explainer in Chief, said we should call it "Insecurity Now!" since it really talks mostly about insecure. But not today. Today we're going to talk about better security. Steve Gibson: Well, yeah. Actually, this is one of those episodes where so much happened in the last week in security news that, I mean, we just - there's a whole bunch of really interesting stuff to talk about. And in the past when we've done that we've just said, okay, we're not going to have any major topic because too much happened.
    [Show full text]
  • Management Digitaler Identitäten : Aktueller Status Und Zukünftige Trends
    Management Digitaler Identitäten: Aktueller Status und zukünftige Trends Christian Tietz, Chris Pelchen, Christoph Meinel, Maxim Schnjakin Technische Berichte Nr. 114 des Hasso-Plattner-Instituts für Softwaresystemtechnik an der Universität Potsdam ISBN 978-3-86956-395-4 ISSN 1613-5652 Technische Berichte des Hasso-Plattner-Instituts für Softwaresystemtechnik an der Universität Potsdam Technische Berichte des Hasso-Plattner-Instituts für Softwaresystemtechnik an der Universität Potsdam | 114 Christian Tietz | Chris Pelchen | Christoph Meinel | Maxim Schnjakin Management Digitaler Identitäten Aktueller Status und zukünftige Trends Universitätsverlag Potsdam Bibliografische Information der Deutschen Nationalbibliothek Die Deutsche Nationalbibliothek verzeichnet diese Publikation in der Deutschen Nationalbibliografie; detaillierte bibliografische Daten sind im Internet über http://dnb.dnb.de/ abrufbar. Universitätsverlag Potsdam 2017 http://verlag.ub.uni-potsdam.de/ Am Neuen Palais 10, 14469 Potsdam Tel.: +49 (0)331 977 2533 / Fax: 2292 E-Mail: [email protected] Die Schriftenreihe Technische Berichte des Hasso-Plattner-Instituts für Softwaresystemtechnik an der Universität Potsdam wird herausgegeben von den Professoren des Hasso-Plattner-Instituts für Softwaresystemtechnik an der Universität Potsdam. ISSN (print) 1613-5652 ISSN (online) 2191-1665 Das Manuskript ist urheberrechtlich geschützt. Online veröffentlicht auf dem Publikationsserver der Universität Potsdam URN urn:nbn:de:kobv:517-opus4-103164 http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-103164
    [Show full text]
  • World Speed Skating Championships 2021
    On behalf of the KNSB, the Organizing Committee has the honor and pleasure to invite you to participate in the WORLD SPEED SKATING CHAMPIONSHIPS 2021 which will be held in Heerenveen, Netherlands on February 11-14, 2021 PROGRAM Wednesday, February 10, 2021 17:30 Online Team Leaders Meeting via MS Teams in combination with the online draw Invitation will be sent in due time Thursday, February 11, 2021 14:50 3000m Ladies 5000m Men Friday, February 12, 2021 15:10 Team Pursuit Ladies Team Pursuit Men 500m Men 500m Ladies Saturday, February 13, 2021 13:45 Semi-Finals Mass Start Ladies Semi-Finals Mass Start Men 1000m Ladies 1000m Men Final Mass Start Ladies Final Mass Start Men Sunday, February 14, 2021 12:35 1500m Ladies 1500m Men 5000m Ladies 10 000m Men REGULATIONS The ISU World Speed Skating Championships 2021 (Single Distances & Team Pursuit) will be held in accordance with the 2018 Regulations of the International Skating Union (ISU), relevant ISU Communications, in particular ISU Communication No. 2361, Guidelines for ISU Events During the COVID-19 Pandemic and all Health Regulations guidelines edited and released by House of Sports. Participation in the Championships is open to Skaters who belong to an ISU Member (Rule 130, paragraph 1) that has been allocated quota place(s) for the Championships, and who have met the qualification criteria according to Rule 208 and ISU Communication No. 2361. TRACK Thialf is an indoor artificially frozen ice rink with a standard track of 400 meters and inner and outer curves with radii of 26 and 30 meters respectively.
    [Show full text]
  • Justin Love FVCP 2018-03-14 Outline
    Next Get Authentication SQRL and other trends in authentication systems Justin Love FVCP 2018-03-14 Outline • Theft of Server DB • Weak Passwords • Loss of User Information • Theft of User Information Next Get Authentication SQRL and other trends in authentication systems Justin Love FVCP 2018-03-14 Secure Quick Reliable Login Justin Love [email protected] http://wondible.com @wondible THREAT Theft of Server Database https://duckduckgo.com/?q=database+compromise “Three may keep a secret if two are dead. –Benjamin Franklin Some Secrets Should not be shared Nothing to Lose Public/Private Key Cryptography One Way Functions SSH Elliptic Curve https://en.wikipedia.org/wiki/File:EllipticCurveCatalog.svg Elliptic Curve https://en.wikipedia.org/wiki/File:EllipticCurveCatalog.svg ED25519 http://arstechnica.com/security/2013/10/a-relatively-easy- to-understand-primer-on-elliptic-curve-cryptography/ Bitcoin AES Bittorrent Sync FIDO UAF “256 bits is the new black.” –Steve Gibson https://github.com/jedisct1/libsodium THREAT Weak Passwords Weak https://xato.net/passwords/more-top-worst-passwords/ Password Schemes http://xkcd.com/936/ Forgotten http://xkcd.com/936/ Reused http://xkcd.com/792/ Password Manager Something you Know Something you Have Something you Are Agents Apps Mobile Push Authentication Public/Private Key Cryptography SSH Crypto Currency Wallet SQRL Secure the Private Key Encryption Levels of Protection Multi-level Encryption THREAT Loss of User Information User Responsibility Out-of-band may be possible Offline Storage MetaMask Words
    [Show full text]
  • SQRL Revisited
    Security Now! Transcript of Episode #516 Page 1 of 27 Transcript of Episode #516 SQRL Revisited Description: Security and privacy-related news keeps coming! So this week Father Robert and I will cover the past week's many interesting events. Then we revisit the much evolved and nearly finalized SQRL protocol to see how it has grown and matured during the 92 weeks since I first disclosed its concept during Podcast 424 with Tom. High quality (64 kbps) mp3 audio file URL: http://media.GRC.com/sn/SN-516.mp3 Quarter size (16 kbps) mp3 audio file URL: http://media.GRC.com/sn/sn-516-lq.mp3 SHOW TEASE: Today with Steve Gibson: Hacking Team follies, UEFI nightmare. Can exceptional access exist beside strong encryption? And everything you ever wanted to know about SQRL but were afraid to ask. Security Now! is next. FATHER ROBERT BALLECER: This is Security Now! with Steve Gibson, Episode 516, recorded July 14th, 2015: Hacking Team vs. SQRL. It's time for Security Now!, the show that covers your privacy and security online with the one, the only, the incomparable Steve Gibson from GRC.com. That's right, the creator of ShieldsUP!, SpinRite, and soon SQRL. Steve, so good to see you again, my friend. Steve Gibson: Well, Father, this is our third and final podcast together. And, boy, based on the feedback from the last couple, you're definitely a hit as my co-host. So anytime Leo feels that he needs to take a break from this, I know that you'll be welcome back.
    [Show full text]
  • Sqrl and U2f As 2Fa for Cern Sso
    EVALUATION AND IMPLEMENTATION OF SQRL AND U2F AS 2FA FOR CERN SSO SUPERVISORS BY VINCENT BRILLAULT (IT-DI-CSO) AZQA NADEEM (IT-DI-CSO) STEFAN LUEDERS (IT-DI-CSO) PROJECT GOALS 2 AZQA NADEEM (IT-DI-CSO) PROJECT GOALS Evaluation of SQRL and U2F 2 AZQA NADEEM (IT-DI-CSO) PROJECT GOALS Evaluation of SQRL and U2F Implementation of feasible 2FA algorithm 2 AZQA NADEEM (IT-DI-CSO) PROJECT GOALS Evaluation of SQRL and U2F Implementation of feasible 2FA algorithm Integration with CERN Single Sign-on (SSO) 2 AZQA NADEEM (IT-DI-CSO) 2ND FACTOR AUTHENTICATION 3 AZQA NADEEM (IT-DI-CSO) 2ND FACTOR AUTHENTICATION 3 AZQA NADEEM (IT-DI-CSO) 2ND FACTOR AUTHENTICATION 4 AZQA NADEEM (IT-DI-CSO) 2ND FACTOR AUTHENTICATION • Username • Password 5 AZQA NADEEM (IT-DI-CSO) 2ND FACTOR AUTHENTICATION • Cell phone • Physical token • Biometrics 6 AZQA NADEEM (IT-DI-CSO) CERN SINGLE SIGN-ON 7 AZQA NADEEM (IT-DI-CSO) CERN SINGLE SIGN-ON SMS 7 AZQA NADEEM (IT-DI-CSO) CERN SINGLE SIGN-ON SMS Google Authenticator 7 AZQA NADEEM (IT-DI-CSO) CERN SINGLE SIGN-ON SMS Google Authenticator Yubikey 7 AZQA NADEEM (IT-DI-CSO) CERN SINGLE SIGN-ON SMS Google Authenticator Yubikey Smartcard 7 AZQA NADEEM (IT-DI-CSO) CERN SINGLE SIGN-ON Can we do better? 8 AZQA NADEEM (IT-DI-CSO) SQRL VS. U2F Secure Quick Reliable Login (SQRL) Universal 2nd Factor (U2F) 9 AZQA NADEEM (IT-DI-CSO) SECURE QUICK RELIABLE LOGIN (SQRL) 10 AZQA NADEEM (IT-DI-CSO) SECURE QUICK RELIABLE LOGIN (SQRL) • Software based authentication mechanism 10 AZQA NADEEM (IT-DI-CSO) SECURE QUICK RELIABLE LOGIN (SQRL)
    [Show full text]
  • User Authentication
    CHAPTER User Authentication 3.1 Digital User Authentication Principles A Model for Digital User Authentication Means of Authentication Risk Assessment for User Authentication 3.2 Password-Based Authentication The Vulnerability of Passwords The Use of Hashed Passwords Password Cracking of User-Chosen Passwords Password File Access Control Password Selection Strategies 3.3 Token-Based Authentication Memory Cards Smart Cards Electronic Identify Cards 3.4 Biometric Authentication Physical Characteristics Used in Biometric Applications Operation of a Biometric Authentication System Biometric Accuracy 3.5 Remote User Authentication Password Protocol Token Protocol Static Biometric Protocol Dynamic Biometric Protocol 3.6 Security Issues for User Authentication 3.7 Practical Application: An Iris Biometric System 3.8 Case Study: Security Problems for ATM Systems 3.9 Key Terms, Review Questions, and Problems 85 M03_STAL0611_04_GE_C03.indd 85 10/11/17 2:44 PM 86 CHAPTER 3 / USer AutheNtIcatION LEARNING OBJECTIVES After studying this chapter, you should be able to: ◆◆ Discuss the four general means of authenticating a user’s identity. ◆◆ Explain the mechanism by which hashed passwords are used for user authentication. ◆◆ Understand the use of the Bloom filter in password management. ◆◆ Present an overview of token-based user authentication. ◆◆ Discuss the issues involved and the approaches for remote user authentication. ◆◆ Summarize some of the key security issues for user authentication. In most computer security contexts, user authentication is the fundamental building block and the primary line of defense. User authentication is the basis for most types of access control and for user accountability. User authentication encompasses two functions. First, the user identifies herself to the system by presenting a credential, such as user ID.
    [Show full text]