Systems and methods for enhanced mobile device authentication

Information

  • Patent Grant
  • 12261957
  • Patent Number
    12,261,957
  • Date Filed
    Monday, October 30, 2023
    a year ago
  • Date Issued
    Tuesday, March 25, 2025
    a month ago
Abstract
Systems and methods for enhanced mobile device authentication are disclosed. Systems and methods for enhanced mobile authentication are disclosed. In one embodiment, method for electronic device authentication may include (1) a server comprising at least one computer processor communicating a one-time passcode to an electronic device over a first communication channel; (2) the server receiving, from the electronic device over a second communication channel the one-time passcode encrypted with a private key associated with the electronic device; (3) the server decrypting the one-time passcode using a public key; (4) the server validating the one-time passcode; (5) the server generating a device identifier for the electronic device; and (6) the server persisting an association between the device identifier and the electronic device.
Description
BACKGROUND OF THE INVENTION

Banks seek to authenticate customers more effectively and with the best customer possible experience. The mobile device offers huge potential in that it is personal, near ubiquitous, usually with the owner, and increasingly used for banking activity.


SUMMARY OF THE INVENTION

Systems and methods for enhanced mobile authentication are disclosed. In one embodiment, method for electronic device authentication may include (1) a server comprising at least one computer processor communicating a one-time passcode to an electronic device over a first communication channel; (2) the server receiving, from the electronic device over a second communication channel the one-time passcode encrypted with a private key associated with the electronic device; (3) the server decrypting the one-time passcode using a public key; (4) the server validating the one-time passcode; (5) the server generating a device identifier for the electronic device; and (6) the server persisting an association between the device identifier and the electronic device.


In one embodiment, the method may further include the server receiving, from the electronic device over the second communication channel, a password; and the server persisting the password.


In one embodiment, the device identifier may include a universally unique identifier.


In one embodiment, the method may further include the server receiving from the electronic device over the second communication channel, a public key paired with the private key.


In one embodiment, the method may further include the server receiving, from the electronic device over the second communication channel, an application specific verification key; and the server decrypting the application specific verification key. The step of persisting the association between the device identifier and the electronic device further comprises storing an indication that the application specific verification key was valid.


In one embodiment, the application specific verification key may be calculated according to the following equation:

ASVK=HASH(salt+Env+OTP);


where:

    • “salt” comprises a cryptographic salt;
    • “Env” comprises at least one environmental parameter;
    • OTP is the one-time password; and
    • HASH comprises a hashing algorithm.


In one embodiment, the method may further include the server receiving, from the electronic device over the second communication channel, device fingerprint data for the electronic device.


In one embodiment, the method may further include the server communicating, over the second communication channel, the device identifier to the electronic device.


According to another embodiment, a method for electronic device authentication may include (1) an application executed by an electronic device comprising at least one computer processor receiving, over a first communication channel, a one-time passcode from a server; (2) the application encrypting the one-time passcode with a private key; (3) the application communicating, over a second communication channel, the one-time passcode encrypted with the private key to the server; (4) the application receiving, from the server, a device identifier for the electronic device; and (5) the application persisting the device identifier.


In one embodiment, the method may further include the application generating an application specific verification key; and the application communicating, over the second communication channel, the application specific verification key to the server; wherein the application specific verification key may be calculated according to the following equation:

ASVK=HASH(salt+Env+OTP);


where:

    • “salt” comprises a cryptographic salt;
    • “Env” comprises at least one environmental parameter;
    • OTP is the one-time password; and
    • HASH comprises a hashing algorithm.


In one embodiment, the device identifier may include a universally unique identifier.


In one embodiment, the method may further include the application generating a public key and private key pair; and the application persisting the private key in one of a secure element of the electronic device or in a secure storage element of one of the application and an operating system executed by the electronic device.


In one embodiment, the method may further include the application communicating, over the second communication channel, device fingerprint data for the electronic device to the server.


A system for electronic device authentication may include an electronic device comprising at least one electronic device computer processor, a memory, and an interface; an authentication server comprising at least one server computer processor; a first communication channel between the electronic device and the server; and a second communication channel between the electronic device and the server. The authentication server may generate a one-time passcode and communicates the one-time passcode to the over the first communication channel. The application may encrypt the one-time passcode with a private key and communicates, over the second communication channel, the one-time passcode encrypted with the private key to the authentication server. The authentication server may decrypt the one-time passcode using a public key, and may validate the one-time passcode. It may also generate a device identifier for the electronic device and persist an association between the device identifier and the electronic device. It may then communicate, over the second communication channel, the device identifier for the electronic device to the application. The application may then persist the device identifier.


In one embodiment, the application may generate an application specific verification key, and communicates the application specific verification key to the authentication server over the second communication channel; wherein the application specific verification key may be calculated according to the following equation:

ASVK=HASH(salt+Env+OTP);


where:

    • “salt” comprises a cryptographic salt;
    • “Env” comprises at least one environmental parameter;
    • OTP is the one-time password; and
    • HASH comprises a hashing algorithm.


In one embodiment, the authentication server may decrypt the application specific verification key and stores an indication that the application specific verification key was valid.


In one embodiment, the authentication server may receive, from the electronic device over the second communication channel, a password, and may persist the password.


In one embodiment, the device identifier may be a universally unique identifier.


In one embodiment, the authentication server may receive, from the application, an identification of the first communication channel for receiving the one-time passcode.


In one embodiment, the authentication server may receive from the electronic device over the second communication channel, device fingerprint data for the electronic device.





BRIEF DESCRIPTION OF THE DRAWINGS

For a more complete understanding of the present invention, the objects and advantages thereof, reference is now made to the following descriptions taken in connection with the accompanying drawings in which:



FIG. 1 depicts a system for enhanced mobile device authentication according to one embodiment;



FIG. 2 depicts a method for strong registration according to one embodiment;



FIG. 3 depicts an enrollment process using enhanced mobile device authentication according to one embodiment;



FIG. 4 depicts a method for strong registration using enhanced mobile device authentication according to embodiments; and



FIG. 5 depicts a method for strong registration using enhanced mobile device authentication according to another embodiment.





DETAILED DESCRIPTION OF PREFERRED EMBODIMENTS

Several embodiments of the present invention and their advantages may be understood by referring to FIGS. 1-5.


Embodiments of the present disclosure relate to enhancing the security of electronic devices, and, in particular, mobile electronic devices. Embodiments disclosed herein may provide for three levels of “trust”: (1) trust that the device is secure; (2) trust that the communication channel between the device and an application executed by the device is secure; and (3) trust that the user operating the device is the individual that is associated with the device. To achieve these levels of trust, (1) the inherent security of the device may be tested, (2) the ownership of the device may be established through enrollment controls, (3) cryptographic keys and/or tokens that are a unique function of the application, the device, and the user identity may be deployed. The unique binding among the application, the device, and the user identity may be exploited to strengthen and simplify the authentication from the device. Moreover, a token encrypted with a unique cryptographic key may be used to pass to other channels and may act as a strong identifier.


In one embodiment, the token may be encrypted using a cryptographic key to act as a proxy for the customer's identity. For example, the encrypted token may support a number of different customer experiences or use cases, such as being able to use the mobile device to authenticate the customer to, for example, an ATM.


As another example, a token may be provided to the customer when the customer uses an application on the mobile device to authenticate a customer to a customer service representative. In one embodiment, customer data (e.g., account information, potential reasons for contacting the customer service representative, etc.) may be associated with the token and may be provided to the customer service representative.


The disclosure of U.S. patent application Ser. No. 13/644,326 is hereby incorporated by reference in its entirety.


In addition, a one-time Application Source Validation Key, or ASVK, may be used to verify that the application, program, or other software, is from a trusted source. For example, because mobile applications may leverage standard HTTPs internet connectivity to communicate secure requests to the server, even with mutual authentication, it cannot be definitively determined whether the application or software is authentic or otherwise sanctioned. Thus, it may be difficult to distinguish the application or software from impostor apps or scripts running on a server.


In one embodiment, a cryptographic key and/or a token may be deployed to an electronic device (e.g., a mobile electronic device, an Internet of Things appliance, a desktop computer, a workstation, etc.) during a registration process for the application, program, or software. In one embodiment, signed, sanctioned applications or software may be distributed with a protected cryptographic functionality to support application source verification. The cryptographic function, which may be protected by application-level white box cryptography, may be called to encrypt a one-time passcode (OTP) known environmental parameters and generate a one-time challenge/response. For example, in one embodiment, an ASVK encrypted cipher may be calculated as follows:

ASVK=HASH(salt+Env+OTP)


Where: (1) “Salt” may be a sequence of bits, known as a cryptographic salt and may have a static x-bit long value; “Env” may be a set of known environmental parameters or attributes, such as device fingerprint data, etc., and OTP may be a one-time ephemeral passcode delivered by the server as part of the registration process. In one embodiment, Salt, Env and OTP may be run through an ADD function, and a hashing algorithm (e.g. SHA256, SHA512, etc.) may be run over that to generate ASVK.


Other calculations for determining ASVK may be used as is necessary and/or desired.


In one embodiment, the static data may include an algorithm that may be shared by both the server and the electronic device. In one embodiment, only a sanctioned application, program, or software, properly provisioned with the protected cryptographic functionality, may create a valid ASVK. The ASVK may be used to verify that the source of mobile web service APIs is genuinely a sanctioned native application.


In another embodiment, a mobile electronic device may be used to continuously authenticate the user. At the manufacturer's device level, a variety of user data can be collected to create an association between the electronic device and its regular authorized user. As reliance on electronic devices to identify users grows, a set of controls may be used mitigate fraudulent usage.


In one embodiment, servers and virtual machines deployed within the enterprise, private and public cloud infrastructure may be used for continuous authentication.


In one embodiment, devices may leverage sensors, monitors, etc. to establish probabilistic behavior patterns. This may include, for example, biometric data, user movement data, user geolocation data, etc. In combination with machine learning, these patterns may be associated with the notion of a “regular,” or registered, authorized device user.


Applications that may be deployed to the devices may associate an application level identity token with the device's “regular” authorized user. Subsequent application authentication requests will leverage this relationship to assert the application identity is the device's “regular” authorized user.


In one embodiment, the exchange of Personally Identifiable Information (“PII”) may not be required. Instead, an anonymous token that correlates back to the identity may be shared between the electronic device and the authentication server.


In one embodiment, if an irregular behavior, or pattern of behaviors, are sensed, the authentication may be terminated.


Referring to FIG. 1, a system for enhanced mobile device authentication according to one embodiment is disclosed. System 100 may include user 110, electronic device 120, remote server/device 150, and authentication server 160. In one embodiment, electronic device 120 may be any suitable electronic device, including workstations, desktop computers, notebook computers, tablet computers, smart phones, Internet of Things (IOT) appliances, etc. In one embodiment, electronic device 120 may provide a secure storage area, such as in a secure element.


Electronic device 120 may execute application 140, which may be any application, computer program, or software. In one embodiment, application 130 may authenticate a user.


In one embodiment, application 140 may provide user 110 with access to sensitive, confidential, or otherwise restricted information and/or resources. In another embodiment, application 140 may provide user 110 with the ability to conduct transactions with sensitive, confidential, or otherwise restricted information and/or resources.


In one embodiment, application 140 may be provided by a financial services provider, such as a financial institution, a payment processor, an investment manager, etc.


In one embodiment, application 140 may be a mobile wallet.


In one embodiment, application 140 and/or the operating system executed by electronic device 120 may include secure storage.


In one embodiment, electronic device 120 may be provided with cryptographic key 125 and token 130. Cryptographic key 125 and/or token 130 may serve to “bind” user 110, application 130, and device 120 to each other. In one embodiment, token 130 that may be encrypted with cryptographic key 125 may be used to authenticate user 110, device 120 and/or application 140 to remote server or device 140.


Any suitable type, format, size, etc. of cryptographic key may be used as is necessary and/or desired.


In one embodiment, cryptographic key 125 may comprise an ASVK.


In one embodiment, remote server/device 150 may be an ATM.


Authentication server 160 may authenticate user 110 and/or electronic device 120. In one embodiment, authentication server 160 may be separate from remote server/device 150. In another embodiment, the functionality of authentication sever 160 may be partially or wholly incorporated into remote server/device 150.


Referring to FIG. 2, a method for strong registration is disclosed according to one embodiment.


In step 205, a one-time passcode, or password, may be received by, for example, an application executed by an electronic device. In one embodiment, the one-time passcode may be provided by the server, and may be considered to be a “challenge” in a challenge/response authentication protocol.


In one embodiment, the one-time passcode may be received on an out-of-band network (e.g., SMS, email, etc.).


In step 210, a crypto key exchange may be performed. In one embodiment, the application may generate public and private keys, and may exchange public keys with the authentication server.


In one embodiment, the private key may be persisted in the secure element of the electronic device or in a secure storage element of the application or operating system. In one embodiment, the manner of storage may depend on whether the user may be authenticated to the electronic device using, for example, biometrics. For example, if the electronic device can receive biometrics, and the user is authenticated, the private key may be stored in the electronic device's secure element. If the electronic device is not biometric-enabled, the private key may be stored in the secure storage element of the application or operating system.


In step 215, the one-time passcode may be digitally signed or encrypted using, for example, the private key. The encrypted one-time passcode may be considered to be a “response” in the challenge/response authentication protocol.


In step 220, the encrypted one-time passcode may be communicated to the authentication server. In one embodiment, additional data, such as device fingerprint data, malware data, username, and password, etc. may also be communicated as is necessary and/or desired.


In one embodiment, device fingerprint data may include, for example, operating system data (e.g., operating system version number, etc.), browser data (e.g., browser, version, etc.), locale data (e.g., country, language, etc.), hardware/system data (e.g., operating system, screen resolution, screen aspect ratio, manufacturer, serial number, SIM card, jailbreak information, etc.), settings data, cookie data, mobile application data, etc. It may further collect data from a mobile wallet application, such as user id and password. Other device data may be used as is necessary and/or desired.


In step 225, an authentication server may decrypt the one-time passcode, and, in step 230, the authentication server may determine whether or not the one-time passcode is valid. If it is not, the process may be stopped in step 235. In one embodiment, error messages, warnings, etc. may be provided as is necessary and/or desired.


In step 240, a device identifier may be generated by the authentication server. In one embodiment, the device identifier may be a variant of universally unique identifier (UUID) that may be created based on, for example, the RFC 4122 UUID namespace specification. In one embodiment, the device identifier may be persisted at the authentication server.


In step 245, the device identifier and the electronic device may be may be persisted at, for example, the authentication server. Other information may be persisted as is necessary and/or desired.


In one embodiment, the device identifier may be communicated to the electronic device and persisted at the electronic device.


In step 250, the user may enter a password, and the password may be received and persisted at the authentication server. The user may also provide contact information which may also be persisted in storage at the authentication authority.


Referring to FIG. 3, an enrollment process is disclosed according to one embodiment.


In step 305, a user may download a software application or program onto his or her electronic device. In one embodiment, the software application may be downloaded from an app store or similar location.


In step 310, the application may perform an integrity check on the electronic device. In one embodiment, the application may check to see if there is malware on the electronic device, if the electronic device has been “rooted,” whether the application is an authorized application, etc. In one embodiment, this may include updating malware detection software.


In one embodiment, any checks that may verify the integrity of the electronic device and/or the operating system executed thereby may be performed as is necessary and/or desired.


In step 315, device profiling data may be collected. In one embodiment, this data may be used to determine whether the electronic device has previously been involved with, or associated with, fraud. In one embodiment, the application may provide electronic device data (e.g., serial number, MAC address, etc.) to an authenticating entity, which may compare the electronic device data to that in a blacklist, a white list, etc.


In step 320, the user may be prompted for user information, such as a user name, account number, date of birth, etc., and may enter such information.


In step 325, the entered data and device profiling data may be provided to the authenticating entity, which may perform a device profiling check for fraud.


In step 330, the authenticating entity may identify the user in its database(s). If the user is not found, a message may be displayed in step 335. In one embodiment, the process may be stopped.


If the user is found, in step 340, an optional carrier check may be performed. For example, if the electronic device is operating on a carrier network, a carrier check may be performed in conjunction with a third party mobile network operator (i.e., a carrier) to corroborate that the user data on record both within, for example, a financial institution as well as the carrier, matches. An unsuccessful carrier check may indicate fraud, and in step 345, a message indicating such may be displayed. In one embodiment, the process may be stopped.


If the carrier check is verified, in step 350, a user may be created, and, in step 355, the user may select one or more one-time passcode contacts (e.g., email, SMS, etc.).


Referring to FIG. 4, a method for strong registration is disclosed according to one embodiment. In one embodiment, cryptographic key exchange using crypto-authentication protocols may be used among the electronic device, the application executed by the device, and the authentication server.


In step 405, an electronic device may receive a one-time passcode. In one embodiment, the one-time passcode may be received, for example, via an out-of-band communication channel (e.g., SMS, email, etc.). In one embodiment, the out-of-band communication channel may be the one that the user selected during registration.


In step 410, a crypto key exchange may be performed. This may be similar to step 210, above.


In step 415, the one-time passcode may be encrypted using, for example, the private key. This may be similar to step 215, above.


In step 420, the application specific verification key may be derived. In one embodiment, the AVSK may be derived using the algorithm, above. Other suitable algorithms may be used as is necessary and/or desired.


In step 425, the ASVK and the encrypted one-time passcode may be communicated to the authentication server. In one embodiment, additional data, such as device fingerprint data, malware data, username, and password, etc. may also be communicated as is necessary and/or desired. In one embodiment, some or all of the additional data may be encrypted.


In step 430, the authentication server may decrypt the one-time passcode and, in step 435, may determine if the one-time passcode is valid. If it is not, in step 440, the process may end.


If the one-time passcode is valid, in step 445, the AVSK may be decrypted, and in step 450, a device identifier may be generated. This may be similar to step 240, above.


In step 455, the device identifier may be persisted in storage, for example, at the authentication authority. In addition, a Boolean value (e.g., true or false) indicating whether the application source verification process succeeded or failed may also be persisted at the authentication server. Other information may be persisted as is necessary and/or desired.


In one embodiment, the device identifier may be communicated to the electronic device and persisted at the electronic device.


In step 460, the user may then create a password, and may provide contact information. This may be similar to step 250, above.


Referring to FIG. 5, a method for strong authentication is disclosed according to another embodiment.


In step 505, a user may select a login method, such as userid/password, biometric, etc. If, in step 510, the user does not select a biometric login, the application may receive the user's credentials. If the user selects biometric login, in step 520, the application may receive biometrics from the user.


In step 525, the deviceID may be retrieved from, for example, the device's secure element and, in step 530, the deviceID may be encrypted with, for example, a private key from the device's secure element, or from a secure storage element of the application or operating system.


In one embodiment, as part of this process, a one-time passcode may be received, and an ASVK may be generated and communicated to the authentication server.


In step 535, the electronic device's profile may be verified. If it cannot be verified, in step 555, the process may stop. In one embodiment, this may include checking to see if the electronic device is a familiar electronic device (e.g., a returning electronic device) based on fingerprint data, cookies, etc. In one embodiment a check may be made to determine if the electronic device acting suspiciously (e.g., associated with many accounts, resetting passwords on multiple accounts), known to have been associate with fraud, etc.


In step 540, the user's credentials (e.g., username/password, authentication token, biometrics, etc.) may be checked for validity. If the user's credentials cannot be verified, in step 545, the process may stop.


In step 545, the authentication server may decrypt the deviceID, and, in step 550, access may be granted and logged.


The following disclosures are hereby incorporated, by reference, in their entities: U.S. patent application Ser. Nos. 61/820,917; 61/823,669; 13/908,618; 61/844,097; 13/940,799; 61/860,475; and 13/972,556.


Hereinafter, general aspects of implementation of the systems and methods of the invention will be described.


The system of the invention or portions of the system of the invention may be in the form of a “processing machine,” such as a general purpose computer, for example. As used herein, the term “processing machine” is to be understood to include at least one processor that uses at least one memory. The at least one memory stores a set of instructions. The instructions may be either permanently or temporarily stored in the memory or memories of the processing machine. The processor executes the instructions that are stored in the memory or memories in order to process data. The set of instructions may include various instructions that perform a particular task or tasks, such as those tasks described above. Such a set of instructions for performing a particular task may be characterized as a program, software program, or simply software.


As noted above, the processing machine executes the instructions that are stored in the memory or memories to process data. This processing of data may be in response to commands by a user or users of the processing machine, in response to previous processing, in response to a request by another processing machine and/or any other input, for example.


As noted above, the processing machine used to implement the invention may be a general purpose computer. However, the processing machine described above may also utilize any of a wide variety of other technologies including a special purpose computer, a computer system including, for example, a microcomputer, mini-computer or mainframe, a programmed microprocessor, a micro-controller, a peripheral integrated circuit element, a CSIC (Customer Specific Integrated Circuit) or ASIC (Application Specific Integrated Circuit) or other integrated circuit, a logic circuit, a digital signal processor, a programmable logic device such as a FPGA, PLD, PLA or PAL, or any other device or arrangement of devices that is capable of implementing the steps of the processes of the invention.


The processing machine used to implement the invention may utilize a suitable operating system. Thus, embodiments of the invention may include a processing machine running the iOS operating system, the OS X operating system, the Android operating system, the Microsoft Windows™ operating systems, the Unix operating system, the Linux operating system, the Xenix operating system, the IBM AIX™ operating system, the Hewlett-Packard UX™ operating system, the Novell Netware™ operating system, the Sun Microsystems Solaris™ operating system, the OS/2™ operating system, the BeOS™ operating system, the Macintosh operating system, the Apache operating system, an OpenStep™ operating system or another operating system or platform.


It is appreciated that in order to practice the method of the invention as described above, it is not necessary that the processors and/or the memories of the processing machine be physically located in the same geographical place. That is, each of the processors and the memories used by the processing machine may be located in geographically distinct locations and connected so as to communicate in any suitable manner. Additionally, it is appreciated that each of the processor and/or the memory may be composed of different physical pieces of equipment. Accordingly, it is not necessary that the processor be one single piece of equipment in one location and that the memory be another single piece of equipment in another location. That is, it is contemplated that the processor may be two pieces of equipment in two different physical locations. The two distinct pieces of equipment may be connected in any suitable manner. Additionally, the memory may include two or more portions of memory in two or more physical locations.


To explain further, processing, as described above, is performed by various components and various memories. However, it is appreciated that the processing performed by two distinct components as described above may, in accordance with a further embodiment of the invention, be performed by a single component. Further, the processing performed by one distinct component as described above may be performed by two distinct components. In a similar manner, the memory storage performed by two distinct memory portions as described above may, in accordance with a further embodiment of the invention, be performed by a single memory portion. Further, the memory storage performed by one distinct memory portion as described above may be performed by two memory portions.


Further, various technologies may be used to provide communication between the various processors and/or memories, as well as to allow the processors and/or the memories of the invention to communicate with any other entity; i.e., so as to obtain further instructions or to access and use remote memory stores, for example. Such technologies used to provide such communication might include a network, the Internet, Intranet, Extranet, LAN, an Ethernet, wireless communication via cell tower or satellite, or any client server system that provides communication, for example. Such communications technologies may use any suitable OSI protocols such as TCP/IP, UDP, IP, for example.


As described above, a set of instructions may be used in the processing of the invention. The set of instructions may be in the form of a program or software. The software may be in the form of system software or application software, for example. The software might also be in the form of a collection of separate programs, a program module within a larger program, or a portion of a program module, for example. The software used might also include modular programming in the form of object oriented programming. The software tells the processing machine what to do with the data being processed.


Further, it is appreciated that the instructions or set of instructions used in the implementation and operation of the invention may be in a suitable form such that the processing machine may read the instructions. For example, the instructions that form a program may be in the form of a suitable programming language, which is converted to machine language or object code to allow the processor or processors to read the instructions. That is, written lines of programming code or source code, in a particular programming language, are converted to machine language using a compiler, assembler or interpreter. The machine language is binary coded machine instructions that are specific to a particular type of processing machine, i.e., to a particular type of computer, for example. The computer understands the machine language.


Any suitable programming language may be used in accordance with the various embodiments of the invention. Illustratively, the programming language used may include assembly language, Ada, APL, Basic, C, C++, COBOL, dBase, Forth, Fortran, Java, Modula-2, Pascal, Prolog, REXX, Visual Basic, and/or JavaScript, for example. Further, it is not necessary that a single type of instruction or single programming language be utilized in conjunction with the operation of the system and method of the invention. Rather, any number of different programming languages may be utilized as is necessary and/or desirable.


Also, the instructions and/or data used in the practice of the invention may utilize any compression or encryption technique or algorithm, as may be desired. An encryption module might be used to encrypt data. Further, files or other data may be decrypted using a suitable decryption module, for example.


As described above, the invention may illustratively be embodied in the form of a processing machine, including a computer or computer system, for example, that includes at least one memory. It is to be appreciated that the set of instructions, i.e., the software for example, that enables the computer operating system to perform the operations described above may be contained on any of a wide variety of media or medium, as desired. Further, the data that is processed by the set of instructions might also be contained on any of a wide variety of media or medium. That is, the particular medium, i.e., the memory in the processing machine, utilized to hold the set of instructions and/or the data used in the invention may take on any of a variety of physical forms or transmissions, for example. Illustratively, the medium may be in the form of paper, paper transparencies, a compact disk, a DVD, an integrated circuit, a hard disk, a floppy disk, an optical disk, a magnetic tape, a RAM, a ROM, a PROM, an EPROM, a wire, a cable, a fiber, a communications channel, a satellite transmission, a memory card, a SIM card, or other remote transmission, as well as any other medium or source of data that may be read by the processors of the invention.


Further, the memory or memories used in the processing machine that implements the invention may be in any of a wide variety of forms to allow the memory to hold instructions, data, or other information, as is desired. Thus, the memory might be in the form of a database to hold data. The database might use any desired arrangement of files such as a flat file arrangement or a relational database arrangement, for example.


In the system and method of the invention, a variety of “user interfaces” may be utilized to allow a user to interface with the processing machine or machines that are used to implement the invention. As used herein, a user interface includes any hardware, software, or combination of hardware and software used by the processing machine that allows a user to interact with the processing machine. A user interface may be in the form of a dialogue screen for example. A user interface may also include any of a mouse, touch screen, keyboard, keypad, voice reader, voice recognizer, dialogue screen, menu box, list, checkbox, toggle switch, a pushbutton or any other device that allows a user to receive information regarding the operation of the processing machine as it processes a set of instructions and/or provides the processing machine with information. Accordingly, the user interface is any device that provides communication between a user and a processing machine. The information provided by the user to the processing machine through the user interface may be in the form of a command, a selection of data, or some other input, for example.


As discussed above, a user interface is utilized by the processing machine that performs a set of instructions such that the processing machine processes data for a user. The user interface is typically used by the processing machine for interacting with a user either to convey information or receive information from the user. However, it should be appreciated that in accordance with some embodiments of the system and method of the invention, it is not necessary that a human user actually interact with a user interface used by the processing machine of the invention. Rather, it is also contemplated that the user interface of the invention might interact, i.e., convey and receive information, with another processing machine, rather than a human user. Accordingly, the other processing machine might be characterized as a user. Further, it is contemplated that a user interface utilized in the system and method of the invention may interact partially with another processing machine or processing machines, while also interacting partially with a human user.


It will be readily understood by those persons skilled in the art that the present invention is susceptible to broad utility and application. Many embodiments and adaptations of the present invention other than those herein described, as well as many variations, modifications and equivalent arrangements, will be apparent from or reasonably suggested by the present invention and foregoing description thereof, without departing from the substance or scope of the invention.


Accordingly, while the present invention has been described here in detail in relation to its exemplary embodiments, it is to be understood that this disclosure is only illustrative and exemplary of the present invention and is made to provide an enabling disclosure of the invention. Accordingly, the foregoing disclosure is not intended to be construed or to limit the present invention or otherwise to exclude any other such embodiments, adaptations, variations, modifications or equivalent arrangements.

Claims
  • 1. A method for electronic device authentication, comprising: receiving, at an authentication server and from a computer application executed by an electronic device, a public key, wherein the public key corresponds to a private key as a cryptographic keyset, wherein the cryptographic keyset is generated by the computer application, wherein the cryptographic keyset is generated from input that comprises a unique combination of the computer application, the electronic device, and a user of the electronic device, and wherein the public key is stored by the authentication server for decryption and verification of data encrypted by the computer application using the private key from the cryptographic keyset;generating, by the authentication server comprising at least one computer processor, a one-time passcode;communicating, by the authentication server over an out-of-band communication channel, the one-time passcode to the computer application, wherein the out-of-band communication channel is an SMS channel;receiving, by the authentication server, from the computer application and over an in-band communication channel the one-time passcode encrypted with the private key;receiving, by the authentication server, from the computer application over the in-band communication channel, an application specific verification key;receiving, by the authentication server from the computer application over the in-band communication channel, device fingerprint data for the electronic device;decrypting, by the authentication server, the application specific verification key to verify a source of the computer application;decrypting, by the authentication server, the encrypted one-time passcode using the public key;validating, by the authentication server, the one-time passcode;generating, by the authentication server, a device identifier for the electronic device;binding, by the authentication server, the device identifier and the electronic device to each other, including storing an indication that the application specific verification key was valid; andcommunicating, by the authentication server and over the in-band communication channel, the device identifier for the electronic device to the computer application, wherein the computer application stores the device identifier.
  • 2. The method of claim 1, wherein the device identifier comprises a universally unique identifier.
  • 3. The method of claim 1, wherein the one-time passcode is received in a SMS message.
  • 4. The method of claim 1, wherein the application specific verification key is calculated according to the following equation: ASVK=HASH(salt+Env+OTP);where:“salt” comprises a cryptographic salt;“Env” comprises at least one environmental parameter;OTP is the one-time passcode; andHASH comprises a hashing algorithm.
  • 5. A system including at least one computer comprising a processor and a memory, wherein the at least one computer is configured to: receive at an authentication server and from a computer application executed by an electronic device, a public key, wherein the public key corresponds to a private key as a cryptographic keyset, wherein the cryptographic keyset is generated by the computer application, wherein the cryptographic keyset is generated from input that comprises a unique combination of the computer application, the electronic device, and a user of the electronic device, and wherein the public key is stored by the authentication server for decryption and verification of data encrypted by the computer application using the private key from the cryptographic keyset;generate by the authentication server comprising at least one processor a one-time passcode;communicate by the authentication server over an out-of-band communication channel, the one-time passcode to the computer application, wherein the out-of-band communication channel is an SMS channel;receive by the authentication server from the computer application and over an in-band communication channel the one-time passcode encrypted with the private key;receive, by the authentication server from the computer application over the in-band communication channel, an application specific verification key;receive, by the authentication server from the computer application over the in-band communication channel, device fingerprint data for the electronic device;decrypt, by the authentication server, the application specific verification key to verify a source of the computer application;decrypt, by the authentication server the encrypted one-time passcode using the public key;validate, by the authentication server, the one-time passcode;generate, by the authentication server, a device identifier for the electronic device;bind, by the authentication server, the device identifier and the electronic device to each other including storing an indication that the application specific verification key was valid; andcommunicate, by the authentication server, over the in-band communication channel, the device identifier for the electronic device to the computer application, wherein the computer application stores the device identifier.
  • 6. The system of claim 5, wherein the device identifier comprises a universally unique identifier.
  • 7. The system of claim 5, wherein the one-time passcode is received in a SMS message.
  • 8. The system of claim 5, wherein the application specific verification key is calculated according to the following equation: ASVK=HASH(salt+Env+OTP);where:“salt” comprises a cryptographic salt;“Env” comprises at least one environmental parameter;OTP is the one-time passcode; andHASH comprises a hashing algorithm.
  • 9. The system of claim 5, wherein the at least one computer is configured to: receive, from the computer application, an identification of the out-of-band communication channel for receiving the one-time passcode.
  • 10. A non-transitory computer readable storage medium, including instructions stored thereon, which instructions, when read and executed by one or more computer processors, cause the one or more computer processors to perform steps comprising: receive at an authentication server and from a computer application executed by an electronic device, a public key, wherein the public key corresponds to a private key as a cryptographic keyset, wherein the cryptographic keyset is generated by the computer application, wherein the cryptographic keyset is generated from input that comprises a unique combination of the computer application, the electronic device, and a user of the electronic device, and wherein the public key is stored by an authentication server for decryption and verification of data encrypted by the computer application using the private key from the cryptographic keyset;generate, by the authentication server, a one-time passcode;communicate, by the authentication server, over an out-of-band communication channel, the one-time passcode to the computer application, wherein the out-of-band communication channel is an SMS channel;receive, by the authentication server, from the computer application and over an in-band communication channel the one-time passcode encrypted with the private key;receive, by the authentication server and from the computer application over the in-band communication channel, an application specific verification key;receive, by the authentication server from the computer application over the in-band communication channel, device fingerprint data for the electronic device;decrypt, by the authentication server, the application specific verification key to verify a source of the computer application;decrypt, by the authentication server, the encrypted one-time passcode using the public key;validate, by the authentication server, the one-time passcode;generate, by the authentication server, a device identifier for the electronic device;bind, by the authentication server, the device identifier and the electronic device to each other, including storing an indication that the application specific verification key was valid; andcommunicate, by the authentication server and over the in-band communication channel, the device identifier for the electronic device to the computer application, wherein the computer application stores the device identifier.
  • 11. The non-transitory computer readable storage medium of claim 10, wherein the device identifier comprises a universally unique identifier.
  • 12. The non-transitory computer readable storage medium of claim 10, wherein the one-time passcode is received in a SMS message.
  • 13. The non-transitory computer readable storage medium of claim 10, wherein the application specific verification key is calculated according to the following equation: ASVK=HASH(salt+Env+OTP);where:“salt” comprises a cryptographic salt;“Env” comprises at least one environmental parameter;OTP is the one-time passcode; andHASH comprises a hashing algorithm.
  • 14. The non-transitory computer readable storage medium of claim 10, comprising: receiving, from the computer application, an identification of the out-of-band communication channel for receiving the one-time passcode.
RELATED APPLICATIONS

The present application is a continuation application of U.S. patent application Ser. No. 16/994,205, filed Aug. 14, 2020, now U.S. Pat. No. 11,838,421, which is a continuation of U.S. patent application Ser. No. 15/393,836, filed Dec. 29, 2016, now U.S. Pat. No. 10,778,435, which claims the benefit of U.S. Provisional Patent Application Ser. No. 62/273,003, filed Dec. 30, 2015, and U.S. Provisional Patent Application Ser. No. 62/321,060, filed Apr. 11, 2016, the disclosures of each of which is hereby incorporated by reference in its entirety.

US Referenced Citations (413)
Number Name Date Kind
5764772 Kaufman Jun 1998 A
6085320 Kaliski, Jr. Jul 2000 A
6212585 Chrabaszcz Apr 2001 B1
6434238 Chaum Aug 2002 B1
6880079 Kefford et al. Apr 2005 B2
7133846 Ginter et al. Nov 2006 B1
7165174 Ginter et al. Jan 2007 B1
7418596 Carroll et al. Aug 2008 B1
7500616 Beenau Mar 2009 B2
7870599 Pemmaraju Jan 2011 B2
8180051 O'Toole, Jr. May 2012 B1
8297520 Wakerly Oct 2012 B1
8452965 Griffin et al. May 2013 B1
8458483 Bailey et al. Jun 2013 B1
8515389 Smetters et al. Aug 2013 B2
8533460 Hird Sep 2013 B2
8661254 Sama Feb 2014 B1
8683564 Khan Mar 2014 B2
8719952 Damm-Goossens May 2014 B1
8751793 Ginter et al. Jun 2014 B2
8752146 van Dijk Jun 2014 B1
8769289 Kronrod Jul 2014 B1
8799655 Dotan Aug 2014 B1
8832788 Gibson Sep 2014 B1
8868923 Hamlet Oct 2014 B1
8904482 Dotan et al. Dec 2014 B1
9032171 Niles May 2015 B2
9032212 Juels May 2015 B1
9143492 Redberg Sep 2015 B2
9154304 Dotan Oct 2015 B1
9178880 Dotan Nov 2015 B1
9191386 Yaron et al. Nov 2015 B1
9197414 Martin et al. Nov 2015 B1
9202035 Manusov Dec 2015 B1
9203620 Nyström Dec 2015 B1
9215075 Poltorak Dec 2015 B1
9231925 Lundström Jan 2016 B1
9292668 Spangler Mar 2016 B1
9397989 Ramalingam et al. Jul 2016 B1
9432339 Bowness Aug 2016 B1
9461759 Anniballi Oct 2016 B2
9537654 Botero Montano Jan 2017 B2
9569605 Schneider Feb 2017 B1
9614838 Duchin Apr 2017 B1
9805182 Kayyidavazhiyil Oct 2017 B1
9847875 Berzin Dec 2017 B1
9860059 Duane et al. Jan 2018 B1
9985786 Bhabbur May 2018 B1
10270748 Briceno et al. Apr 2019 B2
10516527 Briceno et al. Apr 2019 B1
10299118 Karachiwala May 2019 B1
10356087 Vetter Jul 2019 B1
10373158 James Aug 2019 B1
10440014 Hoyer Oct 2019 B1
10540654 James Jan 2020 B1
10778435 Wimberley et al. Sep 2020 B1
10915891 Winklevoss Feb 2021 B1
10929842 Arvanaghi Feb 2021 B1
10938567 Martino Mar 2021 B2
11139955 So Oct 2021 B1
11184356 Tandon Nov 2021 B1
11238453 Kim et al. Feb 2022 B2
11381783 Ratnakaram Jul 2022 B1
11501370 Paya Nov 2022 B1
11522700 Auerbach Dec 2022 B1
11651357 Kumar May 2023 B2
11838421 Wimberley Dec 2023 B2
11909860 So Feb 2024 B1
20020095507 Jerdonek Jul 2002 A1
20030074326 Byers Apr 2003 A1
20030204726 Kefford Oct 2003 A1
20040093499 Arditi et al. May 2004 A1
20040098581 Balfanz et al. May 2004 A1
20040128519 Klinger Jul 2004 A1
20040238621 Beenau Dec 2004 A1
20050010786 Michener Jan 2005 A1
20050123135 Hunt Jun 2005 A1
20060075506 Sanda Apr 2006 A1
20060083228 Ong et al. Apr 2006 A1
20060085844 Buer Apr 2006 A1
20060136739 Brock Jun 2006 A1
20060156028 Aoyama Jul 2006 A1
20060167784 Hoffberg Jul 2006 A1
20060242423 Kussmaul Oct 2006 A1
20060248082 Raikar Nov 2006 A1
20070014407 Narendra Jan 2007 A1
20070016798 Narendra Jan 2007 A1
20070033642 Ganesan et al. Feb 2007 A1
20070087756 Hoffberg Apr 2007 A1
20070112676 Kontio et al. May 2007 A1
20070186105 Bailey et al. Aug 2007 A1
20070239991 Cheng Oct 2007 A1
20070258585 Sandhu et al. Nov 2007 A1
20070294746 Sasakura Dec 2007 A1
20080010449 Holtzman et al. Jan 2008 A1
20080010450 Holtzman et al. Jan 2008 A1
20080010451 Holtzman et al. Jan 2008 A1
20080010452 Holtzman et al. Jan 2008 A1
20080010455 Holtzman et al. Jan 2008 A1
20080010458 Holtzman et al. Jan 2008 A1
20080028230 Shatford Jan 2008 A1
20080034440 Holtzman et al. Jan 2008 A1
20080040276 Hammad Feb 2008 A1
20080077791 Lund et al. Mar 2008 A1
20080077796 Lund et al. Mar 2008 A1
20080098464 Mizrah Apr 2008 A1
20080244272 Hsieh Oct 2008 A1
20080256616 Guarraci Oct 2008 A1
20080301461 Coulier et al. Dec 2008 A1
20090019505 Gopalakrishnan et al. Jan 2009 A1
20090025080 Lund et al. Jan 2009 A1
20090028337 Balabine Jan 2009 A1
20090031133 Bar-El Jan 2009 A1
20090055910 Lee Feb 2009 A1
20090077371 Powell Mar 2009 A1
20090106556 Hamid Apr 2009 A1
20090164797 Kramer Jun 2009 A1
20090183008 Jobmann Jul 2009 A1
20090204778 Marking Aug 2009 A1
20090210696 Moreau Aug 2009 A1
20090228703 Grajek et al. Sep 2009 A1
20090235339 Mennes et al. Sep 2009 A1
20090240936 Lambiase et al. Sep 2009 A1
20090282467 Schenk Nov 2009 A1
20090307139 Mardikar Dec 2009 A1
20090307486 Grajek et al. Dec 2009 A1
20090316907 Cachin Dec 2009 A1
20090327744 Hatano Dec 2009 A1
20100083371 Bennetts Apr 2010 A1
20100100724 Kaliski, Jr. Apr 2010 A1
20100106973 Guenther Apr 2010 A1
20100138652 Sela et al. Jun 2010 A1
20100138914 Davis Jun 2010 A1
20100185860 Mishra et al. Jul 2010 A1
20100185864 Gerdes, Jr. Jul 2010 A1
20100217982 Brown Aug 2010 A1
20100306533 Phatak Dec 2010 A1
20100317420 Hoffberg Dec 2010 A1
20110035584 Meyerstein et al. Feb 2011 A1
20110072274 Leoutsarakos et al. Mar 2011 A1
20110090541 Harper Apr 2011 A1
20110095863 Laaroussi Apr 2011 A1
20110113245 Varadarajan May 2011 A1
20110119155 Hammad May 2011 A1
20110126000 Pang et al. May 2011 A1
20110131661 Valls Fontanals Jun 2011 A1
20110159848 Pei Jun 2011 A1
20110161672 Martinez et al. Jun 2011 A1
20110163845 Wong Jul 2011 A1
20110209208 Quach Aug 2011 A1
20110258452 Coulier et al. Oct 2011 A1
20110276495 Varadarajan et al. Nov 2011 A1
20110289576 Cheng Nov 2011 A1
20110302646 Ronda et al. Dec 2011 A1
20120018506 Hammad Jan 2012 A1
20120030475 Ma Feb 2012 A1
20120054842 Urios Rodriguez Mar 2012 A1
20120066501 Xiong Mar 2012 A1
20120066504 Hird Mar 2012 A1
20120066749 Taugbol Mar 2012 A1
20120079569 Mendelovich Mar 2012 A1
20120110342 Agrawal May 2012 A1
20120124370 Choi May 2012 A1
20120131350 Atherton May 2012 A1
20120144461 Rathbun Jun 2012 A1
20120155636 Muthaiah Jun 2012 A1
20120159153 Shim et al. Jun 2012 A1
20120159163 von Behren Jun 2012 A1
20120159195 von Behren Jun 2012 A1
20120170743 Senese et al. Jul 2012 A1
20120203663 Sinclair et al. Aug 2012 A1
20120204033 Etchegoyen Aug 2012 A1
20120208557 Carter Aug 2012 A1
20120268248 Hiraide Oct 2012 A1
20120297206 Nord et al. Nov 2012 A1
20120311322 Koyun Dec 2012 A1
20120324242 Kirsch Dec 2012 A1
20130046972 Campagna et al. Feb 2013 A1
20130054433 Giard Feb 2013 A1
20130066772 Xiong Mar 2013 A1
20130067545 Hanes Mar 2013 A1
20130091564 Fitzgerald et al. Apr 2013 A1
20130124855 Varadarajan May 2013 A1
20130139222 Kirillin May 2013 A1
20130159195 Kirillin et al. Jun 2013 A1
20130179692 Tolba Jul 2013 A1
20130215275 Berini Aug 2013 A1
20130242706 Newsome, Jr. Sep 2013 A1
20130254036 Trinh Sep 2013 A1
20130254117 von Mueller Sep 2013 A1
20130263211 Neuman Oct 2013 A1
20130263212 Faltyn et al. Oct 2013 A1
20130290707 Sinclair et al. Oct 2013 A1
20130311784 Bleahen Nov 2013 A1
20130318625 Fan Nov 2013 A1
20130333006 Tapling et al. Dec 2013 A1
20130333008 Tapling et al. Dec 2013 A1
20130340054 Subramanya Dec 2013 A1
20140040611 Tenenboym et al. Feb 2014 A1
20140064480 Hartley et al. Mar 2014 A1
20140082715 Grajek et al. Mar 2014 A1
20140087790 Babbage Mar 2014 A1
20140101742 Wu Apr 2014 A1
20140115696 Fadell Apr 2014 A1
20140157388 Tsumura Jun 2014 A1
20140157391 Choi Jun 2014 A1
20140164776 Hook et al. Jun 2014 A1
20140189359 Marien et al. Jul 2014 A1
20140219448 Froels et al. Aug 2014 A1
20140223175 Bhatnagar Aug 2014 A1
20140230039 Prakash Aug 2014 A1
20140245377 Faltyn et al. Aug 2014 A1
20140245378 Faltyn et al. Aug 2014 A1
20140250512 Goldstone Sep 2014 A1
20140281477 Nayshtut et al. Sep 2014 A1
20140281506 Redberg Sep 2014 A1
20140281539 Faltyn et al. Sep 2014 A1
20140281560 Ignatchenko Sep 2014 A1
20140282543 Ignatchenko Sep 2014 A1
20140282925 Walsh Sep 2014 A1
20140283010 Rutkowski et al. Sep 2014 A1
20140289118 Kassemi Sep 2014 A1
20140289834 Lindemann Sep 2014 A1
20140331049 Duby et al. Nov 2014 A1
20140359308 Tsai Dec 2014 A1
20140365780 Movassaghi Dec 2014 A1
20140372752 Salllis Dec 2014 A1
20150006895 Irvine Jan 2015 A1
20150012339 Onischuk Jan 2015 A1
20150013000 Linnakangas Jan 2015 A1
20150039891 Ignatchenko Feb 2015 A1
20150046339 Wong Feb 2015 A1
20150073992 Weiner Mar 2015 A1
20150074615 Han Mar 2015 A1
20150082399 Wu et al. Mar 2015 A1
20150095648 Nix Apr 2015 A1
20150113277 Harkins Apr 2015 A1
20150117639 Feekes Apr 2015 A1
20150121511 Jin Apr 2015 A1
20150127965 Hong May 2015 A1
20150143118 Sheller et al. May 2015 A1
20150180865 Wong Jun 2015 A1
20150199684 Maus Jul 2015 A1
20150213433 Khan Jul 2015 A1
20150237049 Grajek et al. Aug 2015 A1
20150244706 Grajek et al. Aug 2015 A1
20150270961 Barnett Sep 2015 A1
20150317625 Hammad Nov 2015 A1
20150318990 Berger Nov 2015 A1
20150318998 Erlikhman et al. Nov 2015 A1
20150319142 Herberg et al. Nov 2015 A1
20150319151 Chastain Nov 2015 A1
20150324563 Deutschmann Nov 2015 A1
20150326567 Hamburg Nov 2015 A1
20150333910 Kirdahy Nov 2015 A1
20150349959 Marciniak Dec 2015 A1
20150350894 Brand Dec 2015 A1
20150358316 Cronin Dec 2015 A1
20150358317 Deutschmann Dec 2015 A1
20150373011 Subramanya Dec 2015 A1
20160005042 Tervo Jan 2016 A1
20160006729 Yang Jan 2016 A1
20160007195 Goldstone Jan 2016 A1
20160013947 Jaber et al. Jan 2016 A1
20160065370 Le Saint et al. Mar 2016 A1
20160065550 Kanov Mar 2016 A1
20160086184 Carpenter Mar 2016 A1
20160094540 Camenisch et al. Mar 2016 A1
20160105540 Kwon Apr 2016 A1
20160119780 Jung Apr 2016 A1
20160134599 Ross et al. May 2016 A1
20160142205 Mohan May 2016 A1
20160156598 Alonso Cebrian Jun 2016 A1
20160156607 Kim Jun 2016 A1
20160157085 Yeoum Jun 2016 A1
20160171186 Marking Jun 2016 A1
20160205538 Kweon Jul 2016 A1
20160212129 Johnston Jul 2016 A1
20160241389 Le Saint et al. Aug 2016 A1
20160241537 Cha Aug 2016 A1
20160260098 Landrock Sep 2016 A1
20160262073 Muley et al. Sep 2016 A1
20160285871 Chathoth Sep 2016 A1
20160323267 Sun Nov 2016 A1
20160330199 Weiner Nov 2016 A1
20160337131 de Andrada Nov 2016 A1
20160337329 Sood et al. Nov 2016 A1
20160366105 Smith et al. Dec 2016 A1
20160371683 Maus Dec 2016 A1
20170012945 Poffenbarger Jan 2017 A1
20170018207 Rodriguez Jan 2017 A1
20170019254 Bone Jan 2017 A1
20170026180 Salllis Jan 2017 A1
20170026385 Zarkesh Jan 2017 A1
20170033931 Fries et al. Feb 2017 A1
20170034133 Korondi et al. Feb 2017 A1
20170041309 Ekambaram Feb 2017 A1
20170060259 Yang Mar 2017 A1
20170061147 Dash Mar 2017 A1
20170070353 Suwirya et al. Mar 2017 A1
20170078278 Hong Mar 2017 A1
20170099140 Hoy et al. Apr 2017 A1
20170099603 Vicente Ruggiero Apr 2017 A1
20170104739 Lansler Apr 2017 A1
20170109751 Dunkelberger et al. Apr 2017 A1
20170111170 Baghdasaryan Apr 2017 A1
20170148009 Perez Lafuente May 2017 A1
20170170955 Wood Jun 2017 A1
20170230363 Deutschmann Aug 2017 A1
20170244692 Bhupathiraju Aug 2017 A1
20170244730 Sancheti Aug 2017 A1
20170264596 Maydanik Sep 2017 A1
20170270517 Vasu Sep 2017 A1
20170324729 Hon Nov 2017 A1
20170364875 Efroni Dec 2017 A1
20170364911 Landrok Dec 2017 A1
20180075536 Jayaram Mar 2018 A1
20180091552 Hsiung et al. Mar 2018 A1
20180121921 Woo May 2018 A1
20180152296 Parez May 2018 A1
20180205743 Mciver et al. Jul 2018 A1
20180206117 Stahl Jul 2018 A1
20180254909 Hancock Sep 2018 A1
20180270067 Woo Sep 2018 A1
20180337907 Bhansali Nov 2018 A1
20180350180 Onischuk Dec 2018 A1
20180357638 Wang Dec 2018 A1
20180359096 Ford Dec 2018 A1
20190007400 Navarro Luft Jan 2019 A1
20190036940 Balakrishnan Jan 2019 A1
20190050855 Martino Feb 2019 A1
20190065406 Steiner et al. Feb 2019 A1
20190188707 Arora Jun 2019 A1
20190200218 Redberg Jun 2019 A1
20190213585 Patni Jul 2019 A1
20190222576 Borkar Jul 2019 A1
20190289017 Agarwal Sep 2019 A1
20190296913 Verma Sep 2019 A1
20190305953 Le Saint et al. Oct 2019 A1
20190305955 Verma Oct 2019 A1
20190306153 Girdhar Oct 2019 A1
20190312861 Kairi Oct 2019 A1
20190327223 Kumar Oct 2019 A1
20190347888 Agbeyo Nov 2019 A1
20190384931 Lahav Dec 2019 A1
20190394053 Yu Dec 2019 A1
20200045038 Mumma Feb 2020 A1
20200059468 Wolosewicz Feb 2020 A1
20200092113 Hutchison et al. Mar 2020 A1
20200092330 Hayton Mar 2020 A1
20200106771 Guibert Apr 2020 A1
20200137052 Sunkavally Apr 2020 A1
20200154272 Uy May 2020 A1
20200162454 Jain May 2020 A1
20200226601 Gurunathan Jul 2020 A1
20200242227 Bowness Jul 2020 A1
20200252392 Mullins Aug 2020 A1
20200387887 Rathod Dec 2020 A1
20210004786 Mossler Jan 2021 A1
20210012073 Suko et al. Jan 2021 A1
20210026544 Tav Jan 2021 A1
20210065165 Wadhwa Mar 2021 A1
20210073367 Kim Mar 2021 A1
20210078571 Zhu Mar 2021 A1
20210158360 Somani May 2021 A1
20210176059 Hertrich Jun 2021 A1
20210176063 Liu et al. Jun 2021 A1
20210182847 Lian Jun 2021 A1
20210184858 Perry Jun 2021 A1
20210185575 Marcelli Jun 2021 A1
20210211876 Bakshi Jul 2021 A1
20210248600 Garg Aug 2021 A1
20210320794 Auh Oct 2021 A1
20210342816 Benkreira Nov 2021 A1
20220078184 Traynor Mar 2022 A1
20220114245 Krishan Apr 2022 A1
20220116385 Hertrich Apr 2022 A1
20220116392 Shah Apr 2022 A1
20220139511 Osborn May 2022 A1
20220217135 Jarvis Jul 2022 A1
20220237608 Rule Jul 2022 A1
20220255945 Guan Aug 2022 A1
20220327525 Tsitrin Oct 2022 A1
20220335432 Rule Oct 2022 A1
20220345309 Rule Oct 2022 A1
20220353081 Duvdevani Nov 2022 A1
20220385654 Kim et al. Dec 2022 A1
20220386118 Kim et al. Dec 2022 A1
20220386123 Sangai Dec 2022 A1
20230017314 Da Rocha Jan 2023 A1
20230020843 Bowers Jan 2023 A1
20230032549 Ciarniello Feb 2023 A1
20230033192 Sutherland Feb 2023 A1
20230065163 Vargas Mar 2023 A1
20230083633 Desai Mar 2023 A1
20230096239 Cole Mar 2023 A1
20230096899 Smith-Rose Mar 2023 A1
20230115793 Jangam Apr 2023 A1
20230128193 Williams Apr 2023 A1
20230179592 Colesanto Jun 2023 A1
20230370448 Jhou Nov 2023 A1
20230418923 Ogbennah Dec 2023 A1
20230421368 Patil Dec 2023 A1
20240031360 Wu Jan 2024 A1
20240040348 Hua Feb 2024 A1
20240048992 Way Feb 2024 A1
20240080315 Ravuna Mar 2024 A1
20240119132 Wieker Apr 2024 A1
20240127237 Alkarboly Apr 2024 A1
20240127942 Keller Apr 2024 A1
20240171570 Rule May 2024 A1
20240187236 Rule Jun 2024 A1
20240195631 Yee Jun 2024 A1
Non-Patent Literature Citations (14)
Entry
Liang et al “User Authentication Interfaces in Mobile Devices: Some Design Considerations,” 2014 IEEE 17th International Conference on Computational Science and Engineering, IEEE Computer Society, pp. 754-757 (Year: 2014).
Sen et al “Putting Pressure on Mobile Authentication,” 2014 Seventh International Conference on Mobile Computing and Ubiquitous Networking (ICMU), pp. 56-61 (Year: 2014).
Lu et al “The Design and Implementation of XMPP-based SMS Gateway,” 2012 Fourth International Conference on Computational Intelligence, Communication Systems and Networks, IEEE Computer Society, pp. 145-148, (Year: 2012).
Eldefrawy et al “OTP-Based Two Factor Authentication Using Mobile Phones,” 2011 Eighth International Conference on Information Technology: New Generation, IEEE Computer Society, pp. 327-331 (Year: 2011).
Kogan et al “A Practical Revocation Scheme for Broadcast Encryption Using Smart Cards,” IEEE Computer Society, pp. 1-11 ( Year: 2003).
Neumann et al “A Usable Android Application Implementing Distributed Cryptography for Election Authorities,” IEEE, pp. 207-216 (Year: 2014).
Wang, et al “Secure Authentication and Authorization Scheme for Mobile Devices,” Proceedings of ICCTA2009, pp. 207-211, ( Year: 2009).
Mandal, et al “Multi-Party Key-Exchange with Perfect Forward Secrecy,” 2014 International Conference on Information Technology, IEEE Computer Society, pp. 362-367 (Year: 2014).
Yang, et al “An Efficient Mutual Authentication with Key Agreement Protocol for Mobile Devices,” 2011 Seventh International Conference on Intelligent Information Hiding and Multimedia Signal Processing, IEEE Computer Society, pp. 145-148 (Year: 2011).
Sax, et al “Sax,” “Wireless Technology Infrastructures for Authentication of Patients: PKI that Rings,” Journal of the American Medical Informatics Association, vol. 12, No. 3, May-Jun. 2005, pp. 263-268 (Year: 2005).
Gurav, et al “Remote Client Authentication Using Mobile Phone Generated OTP,” International Journal of Scientific and Research Publications, vol. 2, Issue 5, May 2012, pp. 1-4 (Year: 2012).
Huang, et al “A new One-Time Password Method,” 2013 International Conference on Electronic Engineering and Computer Science, pp. 32-37, Science Direct, (Year: 2013).
Eldefrawy-OTP Based Two Factor Authentication Using Mobile Phones, 2011 Eighth International Conference on Information Technology: New Generations, pp. 327-331 (Year: 2011).
Vaze (“Vaze,” “Digital Signature On-Line, One Time Private Key [OTPK],” Online Certification Process with Strong (2-Factor Authentication), International Journal of Scientific & Engineering Research vol. 3, Issue 3, Mar. 2012, pp. 1-5).
Related Publications (1)
Number Date Country
20240080201 A1 Mar 2024 US
Provisional Applications (2)
Number Date Country
62321060 Apr 2016 US
62273003 Dec 2015 US
Continuations (2)
Number Date Country
Parent 16994205 Aug 2020 US
Child 18497549 US
Parent 15393836 Dec 2016 US
Child 16994205 US