Systems and methods for secure and efficient enrollment into a federation which utilizes a biometric repository

Information

  • Patent Grant
  • 9237152
  • Patent Number
    9,237,152
  • Date Filed
    Saturday, June 14, 2014
    11 years ago
  • Date Issued
    Tuesday, January 12, 2016
    9 years ago
  • CPC
  • Field of Search
    • US
    • 713 186000
    • CPC
    • G06F21/00
    • G06F21/32
    • H04L9/32
    • H04L9/3231
    • H04L63/0861
  • International Classifications
    • G06F21/00
    • H04L29/06
    • Disclaimer
      This patent is subject to a terminal disclaimer.
      Term Extension
      32
Abstract
A method includes receiving data related to an individual, the data comprising a plurality of elements of personally-identifying information (PII). The method further includes building, via the plurality of elements of the PII, a compositional key for the individual. In addition, the method includes storing the compositional key and a biometric print for the individual as a biometric record in a biometric repository. The method also includes, via the compositional key, providing a plurality of federated entity (FE) computer systems with access to the biometric repository.
Description
BACKGROUND

1. Technical Field


The invention relates generally to information security and more particularly, but not by way of limitation, to systems and methods for using a biometric repository.


2. History of Related Art


Identity theft is one of the fastest-growing crimes in the United States and worldwide. Identity theft generally involves a use of personally-identifying information (PII) that is not authorized by an owner of the PII. PII, as used herein, refers to information that can be used to uniquely identify, contact, or locate a person or can be used with other sources to uniquely identify, contact, or locate a person. PII may include, but is not limited to, social security numbers (SSN), bank or credit card account numbers, passwords, birth dates, and addresses. Identity theft may include, for example, an unauthorized change to PII or an unauthorized use of PII to access resources or to obtain credit or other benefits.


Businesses and consumers alike are victims of identity-theft crimes. For example, in 2008, approximately ten million U.S. adults were victims of identity theft and businesses suffered approximately $56 billion as a direct result thereof. The Identity Fraud Survey Report created by Javelin Strategy & Research found that victims averaged a personal cost of $373 and 21 hours of time to resolve their identity fraud issues in 2009. The annual cost of identity theft currently exceeds $200 billion worldwide. Given that identity theft is a high-reward/low-risk crime as described by the Federal Bureau of Investigation (FBI), it appears that identity theft will continue to increase.


Therefore, it is advantageous for businesses to implement security practices that reduce the occurrence of identity theft. Biometric security is an example of an effective form of security. Biometric security generally involves an ability to identify and/or verify an identity of an individual person based upon one or more intrinsic physical or behavioral traits such as, for example, voice, fingerprints, DNA, and the like. However, biometric security is often too expensive and complex to be a viable option for businesses.


SUMMARY OF THE INVENTION

In one embodiment, a method includes receiving data related to an individual, the data comprising a plurality of elements of personally-identifying information (PII). The method further includes building, via the plurality of elements of the PII, a compositional key for the individual. In addition, the method includes storing the compositional key and a biometric print for the individual as a biometric record in a biometric repository. The method also includes, via the compositional key, providing a plurality of federated entity (FE) computer systems with access to the biometric repository.


In one embodiment, a computer-program product includes a computer-usable medium having computer-readable program code embodied therein, the computer-readable program code adapted to be executed to implement a method. The method includes receiving data related to an individual, the data comprising a plurality of elements of personally-identifying information (PII). The method further includes building, via the plurality of elements of the PII, a compositional key for the individual. In addition, the method includes storing the compositional key and a biometric print for the individual as a biometric record in a biometric repository. The method also includes, via the compositional key, providing a plurality of federated entity (FE) computer systems with access to the biometric repository.


The above summary of the invention is not intended to represent each embodiment or every aspect of the present invention.





BRIEF DESCRIPTION OF THE DRAWINGS

A more complete understanding of the method and apparatus of the present invention may be obtained by reference to the following Detailed Description when taken in conjunction with the accompanying Drawings wherein:



FIG. 1A shows an illustrative system for creating and maintaining a biometric repository;



FIG. 1B describes an illustrative flow for initiating an enrollment process;



FIG. 2 describes an illustrative flow for concluding an enrollment process;



FIG. 3 describes an illustrative exception-handling process;



FIG. 4 describes an illustrative biometric enrollment process;



FIG. 5 describes an illustrative process for creating and assigning an almost globally unique identifier (AGUID);



FIG. 6 describes an illustrative enrollment process that utilizes a biometric repository;



FIG. 7 describes an illustrative enrollment process that utilizes a biometric repository; and



FIG. 8 describes an illustrative enrollment process that utilizes a biometric repository.





DETAILED DESCRIPTION OF ILLUSTRATIVE EMBODIMENTS OF THE INVENTION

In various embodiments, entities such as, for example, financial institutions, insurance companies, governmental entities, and goods or services providers, regularly carry out activities that involve personally-identifying information (PII) of members. For example, the entities may manage loans or bank accounts or maintain official records. PII, as used herein, refers to information that can be used to uniquely identify, contact, or locate a person or can be used with other sources to uniquely identify, contact, or locate a person. PII may include, but is not limited to, social security numbers (SSNs), bank or credit card account numbers, passwords, birth dates, and addresses. A member, as used herein, is an owner of PII and a person on behalf of whom entities such as, for example, the entities described above, may provide a good, service, or resource.


Activities that are performed with respect to members without proper authorization of the members may, in a typical embodiment, constitute identity theft. Identity theft generally involves, for example, an unauthorized change to PII or an unauthorized use of PII to access resources or to obtain credit or other benefits. In a typical embodiment, entities such as those described above may establish various security measures such as, for example, biometric security, in efforts to prevent identity theft. Biometric security generally includes an ability to identify and/or verify an identity of an individual person based upon one or more intrinsic physical or behavioral traits.


In a typical embodiment, biometric security involves obtaining a biometric sample from an individual and comparing the biometric sample to a stored biometric print for a member. For purposes of this patent application, a biometric print is a set of measurable biometric characteristics that uniquely identifies an individual. A biometric print may be, for example, a voiceprint, a fingerprint, a retinal print, a facial print, a DNA print, or the like. A biometric sample is generally a biometric specimen of a same type and form as a biometric print. A biometric sample is generally obtained from an individual, for example, for purposes of identifying the individual or authenticating the individual as a person to whom a particular biometric print corresponds.


In various embodiments, a particular person may be a member of multiple entities including, but not limited to, financial institutions, insurance companies, utility companies, governmental entities, and the like. In various embodiments, it is advantageous for entities such as those described above to share a common security resource such as, for example, a biometric repository of biometric prints. In various embodiments, the biometric repository facilitates identity-theft prevention that is more efficient and more effective than prior-art methods. Entities that share the biometric repository may be referenced herein as federated entities.


For purposes of illustration and to more fully explain various inventive principles to one of ordinary skill in the art, various examples of a biometric repository will be described below relative to voice-biometric security. Voice-biometric security typically involves comparing a person's voice to a voiceprint. A voiceprint, as used herein, is a set of measurable characteristics of a human voice that uniquely identifies an individual. Although several examples are provided with respect to voice-biometric security, one of ordinary skill in the art will appreciate that the principles described herein are not limited to voice-biometrics and may also be applied to other biometrics such as, for example, finger, retinal, facial, DNA, or the like.



FIG. 1A illustrates a system 1000 for creating and maintaining a biometric repository such as, for example, a voice-biometric repository. The system 1000 includes a plurality of federated-entity (FE) computer systems 106, a biometric repository 110, a communication device 116, and a computer 118. In a typical embodiment, each FE computer system in the plurality of FE computer systems 106 is operable to communicate with the communication device 116 via a network 114 that, for example, may be capable of carrying voice communication such as, for example, a public switch telephone network (PSTN), a cellular network, or the Internet. In a typical embodiment, each FE computer system in the plurality of FE computer systems 106 is operable to communicate with the biometric repository 110 via a network 108. In a typical embodiment, each FE computer system in the plurality of FE computer systems 106 is additionally operable to communicate with the computer 118 via a network 112.


For purposes of illustration, various networks are illustrated in FIG. 1A. However, one of ordinary skill in the art will appreciate that the depicted networks are illustrative in nature and should not be interpreted to mean that each network is necessarily separate or mutually exclusive from another network. For example, the network 114, the network 108, and the network 112 are illustrated separately in FIG. 1. However, in various embodiments, the network 114, the network 108, and the network 112 may each comprise a portion of the Internet. In various other embodiments, the network 114, the network 108, and the network 112 may indeed be separate networks.


In a typical embodiment, each FE computer system in the plurality of FE computer systems 106 corresponds to a distinct federated entity that provides a good, service, or resource for members. The communication device 116 is typically controlled by a member. The communication device 116 may be, for example, a wireline telephone, a wireless telephone, a smartphone telephone, a voice-over-internet-protocol (VOIP) telephone, a satellite telephone, a personal computer (PC), or any other device capable of receiving and transmitting voice communication. In a typical embodiment, the plurality of FE computer systems 106 are operable to perform text-to-speech (TTS) conversion and automated speech recognition (ASR) in order to communicate with the communication device 116.


In various embodiments, the system 1000 may be utilized for biometric security. For example, the plurality of FE computer systems 106 may be operable to utilize voice-biometric technology to verify members via voiceprints. During enrollment, for example, of a member who does not already have a voiceprint in the biometric repository 110, an FE computer system in the plurality of FE computer systems 106 may capture a voiceprint and transmit the voiceprint to the biometric repository 110 for storage. During verification of a member who has a voiceprint stored in the biometric repository 110, an FE computer system in the plurality of FE computer systems 106 may obtain the voiceprint and verify the member via the voiceprint. For example, in various embodiments, the member may be prompted to speak certain utterances (e.g., a random sequence of digits) and the speech may be analyzed against the voiceprint.


In a typical embodiment, the plurality of FE computer systems 106 may further operate as web servers and serve web pages to the computer 118 over the network 112. The network 112 may be, for example, the Internet. The computer 118 may be, for example, a desktop computer, a laptop computer, a smartphone, or the like. In various embodiments, the computer 118 may be operated by, for example, a member. The computer 118 may be equipped with, for example, a microphone or other recording device. Additionally, in various embodiments, the computer 118 may be operated at a kiosk by, for example, an agent for a business that utilizes the system 1000. The agent may, for example, correspond with members and relay information to the system 1000.



FIG. 1B illustrates a flow 1050 for initiating enrollment of a member into an FE computer system such as, for example, an FE computer system in the plurality of FE computer systems 106 of FIG. 1A. At step 103, the member requests to enroll in the FE computer system. In a typical embodiment, the member makes the request and accesses the FE computer system via various methods. The various methods may include, for example, person-to-person contact 100, voice communication 101, and computer communication 102.


In a typical embodiment, the person-to-person contact 100 involves the member personally appearing at a federated entity's physical location. In various embodiments, the person-to-person contact 100 may be required as a security measure if, for example, the member does not already have PII stored at the FE computer system. The person-to-person contact 100 optionally may be utilized in various other scenarios in order to provide, for example, increased security. During the person-to-person contact 100, an agent from the federated entity may directly speak to the member and operate a kiosk computer such as, for example, the computer 118, on behalf of the member.


In a typical embodiment, the voice communication 101 may be facilitated via a communication device such as, for example, the communication device 116 of FIG. 1A. For example, the FE computer system may receive a call from the communication device. In a typical embodiment, the voice communication 101 may be utilized if, for example, the member already has PII stored in the FE computer system. In a typical embodiment, ASR and TTS functionality may be utilized by the FE computer system to communicate with the communication device.


In a typical embodiment, the computer communication 102 may be facilitated via a member computer such as, for example, the computer 118 of FIG. 1A. The member computer is typically operated by the member. In a typical embodiment, the FE computer system communicates with the member over the Internet and is operable to serve one or more web pages.


From step 103, the flow 1050 proceeds to step 104. At step 104, the enrollment begins via the person-to-person contact 100, the voice communication 101, or the computer communication 102, as appropriate. The enrollment may include, for example, acquisition of PII, verification of an identity of the member, and capture of a biometric print (e.g., a voiceprint) of the member for storage in the biometric repository. The enrollment may, in a typical embodiment, further include various other procedures that may be required by the FE. After step 104, the flow 1050 ends.



FIG. 2 illustrates a flow 2000 for concluding an enrollment process into an FE computer system. The enrollment process may be, for example, the enrollment at step 104 of FIG. 1B. At step 200, the enrollment process concludes. From step 200, the flow 2000 proceeds to step 201. At step 201, a notification is communicated from an FE computer system such as, for example, an FE computer system in the plurality of FE computer systems 106 of FIG. 1A. In a typical embodiment, the notification indicates whether the enrollment process was successful or unsuccessful. In a typical embodiment, the enrollment process may be deemed successful if, for example, no unresolved exceptions remain. An exception may be, for example, a failure to verify an identity of the member, a failure to obtain a biometric print, and the like. In a typical embodiment, if an unresolved exception remains, the enrollment process may be deemed unsuccessful.


The notification may be communicated to the member via various methods according to how the enrollment process was initiated. The various methods may include, for example, person-to-person communication 202, voice communication 203, and computer communication 204. If the member initiated the enrollment process via, for example, the person-to-person communication 100 of FIG. 1B, the agent may receive the notification via the kiosk computer and personally relay the message to the member via the person-to-person communication 202. If the member initiated the enrollment process via, for example, the voice communication 101 of FIG. 1B, the FE computer system may cause the notification to be delivered to the communication device of the member via the voice communication 203. If the member initiated the enrollment process via, for example, the computer communication 102 of FIG. 1B, the FE computer system may cause the notification to be delivered to the member computer via the computer communication 204. From step 204, the flow 2000 proceeds to step 205. At step 205, the flow 2000 ends.



FIG. 3 describes an illustrative exception-handling process 3000. At step 300, the exception-handling process 3000 is initiated. In a typical embodiment, the exception-handling process 3000 may be initiated by an exception in an enrollment process for a member such as, for example, the enrollment processes described with respect to FIGS. 1B and 2. The exception-handling process 3000 typically handles exceptions that occur via voice communication or computer communication. The exception may be caused by a failure such as, for example, a failure in verifying an identity of the member, a failure in obtaining a biometric print from the member, or another type of failure. From step 300, the exception-handling process 3000 proceeds to step 301.


At step 301, it is determined whether the member will be given an opportunity to resolve the exception via a retry. In a typical embodiment, the member is given a predefined number of attempts to resolve the exception. For example, during an identity-verification process, the member may be given another opportunity to correctly answer an incorrectly-answered question. By way of further example, during a voiceprint-capture process, the member may be given another opportunity to provide a voiceprint that meets, for example, pre-established quality standards. If the member has not exceeded the predefined number of attempts, the exception-handling process 3000 proceeds to step 301A.


At step 301A, the member is given an opportunity to resolve the exception via a retry. From step 301A, the process 3000 proceeds to step 302. At step 302, it is determined whether the exception has been resolved by the retry. If the member has failed to resolve the exception at step 301A, the failed attempt is logged and the exception-handling process 3000 returns to step 301 for a determination of whether the member will be provided another retry. If the member resolves the exception at step 301A, the exception-handling process 3000 proceeds to step 303. From step 303, the exception-handling process 3000 returns to step 300 so that the member can exit the exception-handling process 3000 as a passing exception.


Returning to step 301, if it is determined that the member will not be provided any additional attempts to resolve the exception, the exception-handling process 3000 proceeds to step 302A. At step 302A, the member is directed to an agent such as, for example, an agent of a federated entity or an agent for a biometric repository. In this way, the member may be given an opportunity to manually resolve the exception via consultation with the agent. The member may also be assigned a “potential fraud” tag. In a typical embodiment, the “potential fraud” tag locks an account of the member from being accessed except via communication with the agent. In that way, records for the member cannot be accessed or modified in an automated fashion via, for example, voice communication or computer communication.


From step 302A, the exception-handling process 3000 proceeds to step 303B. If the member has resolved the exception after consultation with the agent, the exception-handling process 3000 proceeds from step 303B to step 303D. At step 303D, the exception-handling process 3000 returns to step 300 so that the member can exit the exception-handling process 3000 as a passing exception. Returning to step 303B, if the member has failed to resolve the exception after consulting with the agent, the exception-handling process 3000 proceeds to step 303C. At step 303C, the member may be flagged for possible fraud and requested, for example, to personally appear at a physical location for a federated entity. After step 303C, the exception-handling process 3000 ends in failure.


In various embodiments, records from the exception and from all attempts to resolve the exception may be recorded in a database for the federated entity and/or the biometric repository. In some embodiments, the records may serve as a basis for future fraud detection. For example, if the exception resulted in a biometric sample being stored, the biometric sample may be stored as a fraudulent biometric print. In a typical embodiment, such fraudulent biometric prints may be automatically compared with all biometric samples received during, for example, an enrollment process or a biometric-verification process. If a match to a fraudulent biometric print is determined, fraud may be more quickly and efficiently flagged.



FIG. 4 describes an illustrative biometric enrollment process 4000 that may be facilitated via, for example, an FE computer system in the plurality of FE computer systems 106 of FIG. 1A. In a typical embodiment, the process 4000 may be performed as part of step 104 of FIG. 1B. At step 400, the process 4000 begins for a member. If the biometric-enrollment process is occurring via person-to-person communication as described with respect to FIG. 1B, the process 4000 proceeds from step 400 to step 401. At step 401, an agent conducting the process 4000 may require, for example, a photo identification and/or other documentary evidence. In various embodiments in which additional security is desired, the process 4000 proceeds from step 401 to step 402. In various other embodiments, the process 4000 proceeds from step 401 to step 403. At step 400, if the biometric-enrollment process is occurring via a method other than person-to-person communication as described with respect to FIG. 1B, the process 4000 proceeds to step 402.


At step 402, in a typical embodiment, the FE computer system verifies an identity of the member via knowledge-based authentication (KBA) questions. KBA questions are generally considered to be questions or combinations of questions that only a person having a particular identity should be able to answer. In various embodiments, the FE computer system may generate the KBA questions using data records accessed via, for example, PII provided by the member. The KBA questions may be generated in real time and based on information in one or more of public records, compiled marketing data, and credit reports for the identity being asserted. Therefore, the KBA questions may relate to, for example, loan information, insurance information, previous addresses and phone numbers, and other information that generally only the owner of a particular identity should know.


In a typical embodiment, step 402 includes creation of the KBA questions, solicitation of answers to the KBA questions from the member, and verification whether the answers to the KBA questions are correct. The KBA questions may be presented, for example, via person-to-person communication, voice communication, or computer communication as described with respect to FIG. 1B. The KBA questions help ensure that the member is who they are claiming to be. From step 402, the process 4000 proceeds to step 403.


At step 403, if the identity of the member at step 401 and/or step 402 is determined to have been verified, the process 4000 proceeds to step 404 for capture of a biometric print. Otherwise, if the identity of the member at step 401 and/or step 402 is determined to have not been verified, an exception is generated and the process 4000 proceeds to step 403A. At step 403A, an exception-handling process similar to the exception-handling process 3000 of FIG. 3 may be conducted. It should be appreciated that steps 401-403A are presented above in order to provide examples of identity verification to one of one of ordinary skill in the art. After studying these examples, one of ordinary skill in the art will appreciate that many alternative methods and instrumentalities for identity verification may be substituted for all or part of steps 401-403A without deviating from the inventive principles described herein.


At step 404, biometric enrollment occurs. Biometric enrollment typically involves capturing a biometric print. For example, if the biometric print is a voiceprint, the FE computer system may prompt the member to utter a series of phrases. If the process 4000 is occurring via person-to-person communication, the agent may direct the member to use, for example, a microphone communicably coupled to a computer at a kiosk. In various embodiments, particular phrases, a number of phrases, and phrase length are each configurable. After the FE computer system has captured the biometric print of the member, at step 405, the biometric print is stored in an FE database. After step 405, steps 406 and 407 may occur in parallel, although this need not necessarily be the case. At step 406, the biometric print is delivered from the FE database to a biometric repository shared by multiple FEs. At step 407, the member is provided confirmation via, for example, person-to-person communication, voice communication, or computer communication, that the biometric print has been saved. After steps 406 and 407, the process 4000 concludes.



FIG. 5 describes an illustrative process 5000 for creating and assigning a compositional key, referred to herein as an almost globally unique identifier (AGUID). As one of ordinary skill in the art will appreciate, a globally unique identifier (GUID) is a unique reference number that, ideally, will never be generated twice by any computer in existence. Thus, a GUID may be considered a collision-free identifier. A GUID may be represented, for example, as a 32-character hexadecimal string (e.g., F87C34A4-5B7D-3947-D56E-45237B45D231) and stored as a 128-bit integer. By design, a GUID is not reproducible. Therefore, one of ordinary skill in the art will understand that a problem may arise if a particular GUID is lost. In contrast, an AGUID, as used herein, is a reference number that, in all practicality, is a unique reference number. However, an AGUID is reproducible. Creation of an AGUID will be described in more detail below.


The process 5000 begins at step 500. At step 500, an enrollment process such as, for example, the biometric-enrollment process 4000 of FIG. 4, occurs with respect to a member. In a typical embodiment, the enrollment process of step 500 results in PII and a biometric print of the member being stored in a database for an FE computer system such as, for example, an FE computer system in the plurality of FE computer systems 106 of FIG. 1A. From step 500, the process 5000 proceeds to step 501.


At step 501, the FE computer system stores the PII and the biometric print from the enrollment process of step 500. From step 501, the process 5000 proceeds to step 502. At step 502, the FE computer system transmits the PII of the member and the biometric print to a biometric repository that may be shared by multiple FEs. From step 502, the process 5000 proceeds to step 503. At step 503, the biometric repository receives the PII and the biometric print. From step 503, the process 5000 proceeds to step 504.


At step 504, an AGUID for the member is created. In a typical embodiment, the AGUID is created via a one-way hashing function that is almost collision-free. Although no hashing function is absolutely collision free, one of ordinary skill in the art will appreciate that collisions can be made extremely unlikely. The one-way hashing function may use, for example, elements of the PII of the member as input. Various hashing functions may be utilized such as, for example, SHA-1, SHA-2, and MD5. In a typical embodiment, the AGUID is a compositional key created using a set of n elements of the PII, where n is greater than one. The n elements may include, for example, a name, a social-security number, and the like.


The AGUID may be reproduced in whole or in part by again providing all or part of the PII as input to the one-way hashing function. The one-way hashing function may not be inverted without extreme computational complexity. For purposes of simplicity, it may be said that the one-way hashing function cannot be inverted to produce the input. From step 504, the process 5000 proceeds to step 505.


At step 505, the biometric repository stores the AGUID and the biometric print of the member as a record. From step 505, the process 5000 proceeds to step 506. At step 506, the biometric repository returns a record that includes the AGUID to the FE computer system for storage. From step 506, the process 5000 proceeds to step 507. At step 507, the FE computer system discloses the AGUID to the member. In some embodiments, from step 507, the process 5000 proceeds to step 508. At step 508, the process 5000 ends.


As described above, in a typical embodiment, an AGUID is created as a secure representation of PII that cannot, as a practical matter, be inverted to reproduce the PII. In a typical embodiment, AGUIDs eliminate the need for a biometric repository to store and maintain PII for purposes of identifying biometric prints, indexing biometric prints, or serving requests for biometric verification. Rather, in a typical embodiment, AGUIDs serve to securely identify biometric prints and the biometric repository is indexed by AGUID. Further, as described in greater detail with respect to FIGS. 7 and 8, the biometric repository may provide AGUID-based access to biometric-verification services. In that way, a point of access to PII (and a potential source for compromise) may be eliminated and the frequency at which PII must be transmitted or shared may be reduced. Although, in various embodiments, there may be various benefits of not storing PII in a biometric repository, one of ordinary skill in the art will appreciate that biometric repositories as described herein are not prevented from storing PII in embodiments in which it is advantageous or necessary to do so.



FIG. 6 illustrates an enrollment process 6000 that utilizes a biometric repository operable to return an AGUID. The enrollment process 6000 begins at step 600. In a typical embodiment, at step 600, a member makes a request for enrollment in an FE computer system via, for example, person-to-person communication, voice communication, or computer communication as described with respect to FIG. 1B. From step 600, the enrollment process 6000 proceeds to step 601. At step 601, the FE computer system obtains and stores PII and a biometric print of the member. For example, if the biometric print is a voiceprint, the FE computer system may capture the voiceprint by prompting the member to utter a series of phrases. In various embodiments, the phrases, a number of phrases, and phrase length are configurable.


From step 601, the process 6000 proceeds to step 602. At step 602, the FE computer system determines whether the biometric print is sufficient according to predetermined quality standards (e.g., audio-quality standards). If the biometric print fails to meet the predetermined quality standards, the enrollment process 6000 proceeds to step 602A. At step 602A, an exception-handling process similar to the exception-handling process 3000 of FIG. 3 is conducted. If the biometric print obtained at step 602 meets the predetermined quality standards, the enrollment process 6000 proceeds to step 603.


At step 603, the FE computer system verifies the member's identity in similar fashion to that described with respect to steps 401-403 of FIG. 4. If the verification at step 603 fails, the enrollment process 6000 proceeds to step 603A. At step 603A, an exception-handling process similar to the exception-handling process 3000 of FIG. 3 is conducted. If the member's identity is verified at step 603, the enrollment process 6000 proceeds to step 604. At step 604, the FE computer system saves the biometric print, for example, within an encrypted database or file system. From step 604, the enrollment process 6000 proceeds to step 605. At step 605, the FE computer system transmits PII of the member and the biometric print to a biometric repository that is shared by multiple FEs. From step 605, the enrollment process 6000 proceeds to step 606.


At step 606, the biometric repository receives and stores the PII and the biometric print. From step 606, the process 6000 proceeds to step 607. At step 607, an AGUID for the member is created, for example, in a manner similar to that described with respect to step 504 of FIG. 5. In a typical embodiment, the biometric repository stores the AGUID and the biometric print of the member as a record. The biometric repository returns a record that includes the AGUID to the FE computer system for storage. In a typical embodiment, the FE computer system discloses the AGUID to the member. After step 607, the enrollment process 6000 ends.



FIG. 7 illustrates a process 7000 for utilizing a biometric repository in connection with an enrollment into an FE computer system. The process 7000 illustrates enrollment when, for example, an AGUID has been previously assigned by a biometric repository. The process 7000 begins at step 700. In a typical embodiment, at step 700, a member makes a request for enrollment in the FE computer system via, for example, person-to-person communication, voice communication, or computer communication as described with respect to FIG. 1B. From step 700, the process 7000 proceeds to step 701. At step 701, the FE computer system prompts the member for an asserted AGUID. From step 701, the process 7000 proceeds to step 702.


At step 702, the FE computer system receives the asserted AGUID from the member and transmits the asserted AGUID to the biometric repository in connection with a biometric-verification request. From step 702, the process 7000 proceeds to step 703. At step 703, the biometric repository receives the asserted AGUID from the FE computer system. From step 703, the process 7000 proceeds to step 704. At step 704, the biometric repository verifies whether the asserted AGUID matches an existing AGUID stored therein. If the asserted AGUID does not match an existing AGUID stored in the biometric repository, the process 7000 proceeds to 704A. At step 704A, an exception-handling process such as the exception-handling process 3000 of FIG. 3 is conducted. At step 704, if the asserted AGUID matches an existing AGUID stored in the biometric repository, the process 7000 proceeds to step 705.


At step 705, the biometric repository requests and receives a biometric sample of the member from the FE computer system. For example, in a typical embodiment, the FE computer system obtains the biometric sample in a manner similar to that described with respect to step 601 of FIG. 6. From step 705, the process 7000 proceeds to step 706. At step 706, the biometric repository verifies the biometric sample against a biometric print associated with the existing AGUID in the biometric repository. In various embodiments, the biometric repository also verifies whether the biometric sample is of sufficient quality (e.g., audio quality for voice samples).


If the biometric sample fails the verification at step 706, the enrollment process 7000 proceeds to step 706A. At step 706A, an exception-handling process, such as the exception-handling process 3000 of FIG. 3, is conducted. If the biometric sample passes the verification at step 706, the process 7000 proceeds to step 707. At step 707, the biometric sample is paired with the AGUID and stored as a completed transaction in the biometric repository. From step 707, the process 7000 proceeds to step 708. At step 708, a notification confirming completion of the process 7000 may be communicated to the member by the FE computer system as described, for example, with respect to step 201 of FIG. 2. After step 708, the process 7000 ends.



FIG. 7 as described above depicts biometric verification in connection with a request for enrollment into an FE computer system. One of ordinary skill in the art will appreciate that the principles described with respect to FIG. 7 are not limited to requests for enrollment. In particular, a biometric repository such as, for example, the biometric repository described with respect to FIG. 7, may be utilized in a similar fashion to serve any type of biometric-verification request made by an FE computer system. In various embodiments, biometric-verification requests may be served on demand.



FIG. 8 illustrates a process 8000 for utilizing a biometric repository when, for example, it is believed that an AGUID for a member exists but the AGUID is not known. A variety of circumstances may cause the AGUID not to be known. For example, oftentimes the member may not remember the AGUID. By way of further example, the member may be uncertain as to whether enrollment into a biometric repository (and assignment of the AGUID) has previously occurred. The process 8000 may be used to address such scenarios. The process 8000 begins at step 800.


At step 800, a member makes a request for enrollment in an FE computer system via, for example, person-to-person communication, voice communication, or computer communication as described with respect to FIG. 1B. In a typical embodiment, the request includes a representation that enrollment has previously occurred but that the AGUID is not known. From step 800, the process 8000 proceeds to step 801. At step 801, the FE computer system receives the request and accesses PII of the member. From step 801, the process 8000 proceeds to step 802. At step 802, the FE computer system transmits the PII to the biometric repository. From step 802, the process 8000 proceeds to step 803.


At step 803, the biometric repository receives the PII. From step 803, the process 8000 proceeds to step 804. At step 804, the biometric repository builds a candidate AGUID for the member via the PII, for example, in a manner similar to that described with respect to step 504 of FIG. 5. From step 804, the process 8000 proceeds to step 805. At step 805, the biometric repository searches for records having an AGUID that at least partially matches the candidate AGUID. In various embodiments, the PII used to create the candidate AGUID may constitute all or part of a total set of PII that the biometric repository uses to create AGUIDs. If the PII represents only part of the total set of PII, one of ordinary skill will appreciate that partial matching may occur based that part.


From step 805, the process 8000 proceeds to step 806. At step 806, if no partial or complete matches are identified by the biometric repository at step 805, the process 8000 proceeds to step 806A. At step 806A, an exception-handling process such as the exception-handling process 3000 of FIG. 3 is conducted. In various embodiments, the exception-handling process may involve the member being required to begin a new enrollment session. If matches (partial or complete) are identified by the biometric repository at step 805, the process 8000 proceeds from step 806 to step 807.


At step 807, it is determined whether the FE computer system has already sent a biometric sample of the member. If not, the process 8000 proceeds from step 807 to step 807 A. At step 807A, the biometric repository solicits the biometric sample from the FE computer system. If the biometric repository fails to receive the solicited biometric sample at step 807A, the process 8000 proceeds to step 807B. At step 807B, an exception-handling process such as the exception-handling process 3000 of FIG. 3 is conducted. If it is determined at step 807 that the FE computer system has already sent a biometric sample or if at step 807A the biometric sample is acquired, the process 8000 proceeds to step 808.


At step 808, the biometric repository verifies the biometric sample against biometric prints associated with the potential matches identified at step 806. In a typical embodiment, the verification involves comparing the biometric sample with the biometric prints and determining if the biometric sample matches any of the biometric prints. From step 808, the process 8000 proceeds to step 809. At step 809, if the biometric sample is determined at step 808 to match a single one of the biometric prints, the process 8000 proceeds to step 810. Otherwise, the process 8000 proceeds to step 807B. At step 807B, an exception-handling process such as the exception-handling process 3000 of FIG. 3 is conducted.


At step 810, the biometric repository accesses the record for the matched biometric print. From step 810, the process 8000 proceeds to step 811. At step 811, the biometric repository returns the record (which includes the AGUID) to the FE computer system for storage on the FE computer system. From step 811, the process 8000 proceeds to step 812. At step 812, a notification confirming receipt of the record may be communicated to the member by the FE computer system as described with respect to step 201 of FIG. 2. After step 812, the process 8000 ends.



FIG. 8 as described above depicts biometric verification in connection with a request for enrollment into an FE computer system. One of ordinary skill in the art will appreciate that the principles described with respect to FIG. 8 are not limited to requests for enrollment. In particular, a biometric repository such as, for example, the biometric repository described with respect to FIG. 8, may be utilized in a similar fashion to serve any type of biometric-verification request made by an FE computer system. In various embodiments, biometric-verification requests may be served on demand.


Although various embodiments of the method and apparatus of the present invention have been illustrated in the accompanying Drawings and described in the foregoing Detailed Description, it will be understood that the invention is not limited to the embodiments disclosed, but is capable of numerous rearrangements, modifications and substitutions without departing from the spirit of the invention as set forth herein.

Claims
  • 1. A method comprising: receiving data related to an individual, the data comprising a plurality of elements of personally-identifying information (PII);building a compositional key for the individual as a function of at least some elements of the plurality of elements of PII;storing the compositional key and a biometric print for the individual as a biometric record in a biometric repository;via the compositional key, providing a plurality of federated entity (FE) computer systems with access to the biometric repository;receiving a request for biometric verification of an unverified individual from an FE computer system, the request comprising a representation that the unverified individual has an assigned compositional key that is not known, the request comprising PII;building a candidate compositional key as a function of at least some elements of the PII from the request;identifying one or more compositional keys in the biometric repository that at least partially match the candidate compositional key; andverifying a biometric sample for the individual against a biometric print associated with each of the one or more compositional keys.
  • 2. The method of claim 1, wherein the receiving comprises receiving the PII and the biometric print from an FE computer system of the plurality of FE computer systems.
  • 3. The method of claim 2, comprising returning the compositional key to the FE computer system.
  • 4. The method of claim 2, wherein the biometric record does not include the PII.
  • 5. The method of claim 1, wherein the biometric print is selected from the group consisting of: a voiceprint; a fingerprint; a retinal print; a facial print; and a DNA print.
  • 6. The method of claim 1, wherein the biometric print comprises a voiceprint.
  • 7. The method of claim 1, wherein building the compositional key comprises utilizing a one-way hashing function.
  • 8. The method of claim 1, comprising: receiving an asserted compositional key from an FE computer system in connection with a biometric-verification request;verifying whether the asserted compositional key matches an existing compositional key in the biometric repository; andverifying a biometric sample against a biometric print associated with the existing compositional key.
  • 9. The method of claim 8, wherein the biometric-verification request is made in connection with a request for enrollment into the FE computer system.
  • 10. The method of claim 1, comprising: responsive to the biometric sample for the individual matching exactly one biometric print in the verifying step: considering the unverified individual to be verified; andreturning a record to the FE computer system, the record comprising a matching one of the one or more compositional keys.
  • 11. The method of claim 1, wherein the request for biometric verification is in connection with a request for enrollment into the FE computer system.
  • 12. A computer-program product comprising a non-transitory computer-usable medium having computer-readable program code embodied therein, the computer-readable program code adapted to be executed to implement a method comprising: receiving data related to an individual, the data comprising a plurality of elements of personally-identifying information (PII);building a compositional key for the individual as a function of at least some elements of the plurality of elements of PII;storing the compositional key and a biometric print for the individual as a biometric record in a biometric repository;via the compositional key, providing a plurality of federated entity (FE) computer systems with access to the biometric repository;receiving a request for biometric verification of an unverified individual from an FE computer system, the request comprising a representation that the unverified individual has an assigned compositional key that is not known, the request comprising PII;building a candidate compositional key as a function of at least some elements of the PII from the request;identifying one or more compositional keys in the biometric repository that at least partially match the candidate compositional key; andverifying a biometric sample for the individual against a biometric print associated with each of the one or more compositional keys.
  • 13. The computer-program product of claim 12, wherein the receiving comprises receiving the PII and the biometric print from an FE computer system of the plurality of FE computer systems.
  • 14. The computer-program product of claim 13, wherein the method comprises returning the compositional key to the FE computer system.
  • 15. The computer-program product of claim 13, wherein the biometric record does not include the PII.
  • 16. The computer-program product of claim 12, wherein the biometric print is selected from the group consisting of: a voiceprint; a fingerprint; a retinal print; a facial print; and a DNA print.
  • 17. The computer-program product of claim 12, wherein the biometric print comprises a voiceprint.
  • 18. The computer-program product of claim 12, wherein building the compositional key comprises utilizing a one-way hashing function.
CROSS-REFERENCE TO RELATED APPLICATIONS

This patent application is a continuation of, and incorporates by reference the entire disclosure of, U.S. patent application Ser. No. 13/236,687, filed on Sep. 20, 2011.

US Referenced Citations (453)
Number Name Date Kind
3752904 Waterbury Aug 1973 A
5913196 Talmor et al. Jun 1999 A
5987440 O'Neil et al. Nov 1999 A
5999940 Ranger Dec 1999 A
6125985 Amdahl et al. Oct 2000 A
6142283 Amdahl et al. Nov 2000 A
6144988 Kappel Nov 2000 A
6249228 Shirk et al. Jun 2001 B1
6263447 French et al. Jul 2001 B1
6269349 Aieta et al. Jul 2001 B1
6282658 French et al. Aug 2001 B2
6292795 Peters Sep 2001 B1
6321339 French et al. Nov 2001 B1
6448889 Hudson Sep 2002 B1
6456984 Demoff et al. Sep 2002 B1
6496936 French et al. Dec 2002 B1
6505193 Musgrave et al. Jan 2003 B1
6510415 Talmor et al. Jan 2003 B1
6532459 Berson Mar 2003 B1
6553495 Johansson et al. Apr 2003 B1
6612488 Suzuki Sep 2003 B2
6700220 Bayeur et al. Mar 2004 B2
6740875 Ishikawa et al. May 2004 B1
6751626 Brown et al. Jun 2004 B2
6811082 Wong Nov 2004 B2
6829711 Kwok et al. Dec 2004 B1
6857073 French et al. Feb 2005 B2
6866586 Oberberger et al. Mar 2005 B2
6871287 Ellingson Mar 2005 B1
6913194 Suzuki Jul 2005 B2
6920435 Hoffman et al. Jul 2005 B2
6928546 Nanavati et al. Aug 2005 B1
6930707 Bates et al. Aug 2005 B2
6934849 Kramer et al. Aug 2005 B2
6965997 Dutta Nov 2005 B2
6973575 Arnold Dec 2005 B2
6983882 Cassone Jan 2006 B2
6991174 Zuili Jan 2006 B2
6993659 Milgramm et al. Jan 2006 B2
7028052 Chapman et al. Apr 2006 B2
7035855 Kilger et al. Apr 2006 B1
7083090 Zuili Aug 2006 B2
7092891 Maus et al. Aug 2006 B2
7104444 Suzuki Sep 2006 B2
7174335 Kameda Feb 2007 B2
7203653 McIntosh Apr 2007 B1
7212995 Schulkins May 2007 B2
7222779 Pineda-Sanchez et al. May 2007 B1
7225977 Davis Jun 2007 B2
7234156 French et al. Jun 2007 B2
7240363 Ellingson Jul 2007 B1
7254560 Singhal Aug 2007 B2
7272857 Everhart Sep 2007 B1
7289607 Bhargava et al. Oct 2007 B2
7298873 Miller, Jr. et al. Nov 2007 B2
7310743 Gagne et al. Dec 2007 B1
7314162 Carr et al. Jan 2008 B2
7340042 Cluff et al. Mar 2008 B2
7370044 Mulhern et al. May 2008 B2
7386448 Poss et al. Jun 2008 B1
7392534 Lu et al. Jun 2008 B2
7398915 Pineda-Sanchez et al. Jul 2008 B1
7438226 Helsper et al. Oct 2008 B2
7458508 Shao et al. Dec 2008 B1
7466235 Kolb et al. Dec 2008 B1
7480631 Merced et al. Jan 2009 B1
7481363 Zuili Jan 2009 B2
7490052 Kilger et al. Feb 2009 B2
7497374 Helsper et al. Mar 2009 B2
7519558 Ballard et al. Apr 2009 B2
7522060 Tumperi et al. Apr 2009 B1
7533808 Song et al. May 2009 B2
7536346 Aliffi et al. May 2009 B2
7540021 Page May 2009 B2
7542993 Satterfield et al. Jun 2009 B2
7543740 Greene et al. Jun 2009 B2
7548886 Kirkland et al. Jun 2009 B2
7552467 Lindsay Jun 2009 B2
7562814 Shao et al. Jul 2009 B1
7568616 Zuili Aug 2009 B2
7591425 Zuili et al. Sep 2009 B1
7593891 Kornegay et al. Sep 2009 B2
7606401 Hoffman et al. Oct 2009 B2
7606790 Levy Oct 2009 B2
7610229 Kornegay et al. Oct 2009 B1
7630932 Danaher et al. Dec 2009 B2
7636853 Cluts et al. Dec 2009 B2
7644868 Hare Jan 2010 B2
7647344 Skurtovich, Jr. et al. Jan 2010 B2
7647645 Edeki et al. Jan 2010 B2
7653593 Zarikian et al. Jan 2010 B2
7657431 Hayakawa Feb 2010 B2
7668921 Proux et al. Feb 2010 B2
7673793 Greene et al. Mar 2010 B2
7676418 Chung et al. Mar 2010 B1
7676433 Ross et al. Mar 2010 B1
7685096 Margolus et al. Mar 2010 B2
7686214 Shao et al. Mar 2010 B1
7689007 Bous et al. Mar 2010 B2
7701364 Zilberman Apr 2010 B1
7707163 Anzalone et al. Apr 2010 B2
7708200 Helsper et al. May 2010 B2
7711636 Robida et al. May 2010 B2
7720750 Brody et al. May 2010 B2
7735125 Alvarez et al. Jun 2010 B1
7742982 Chaudhuri et al. Jun 2010 B2
7747559 Leitner et al. Jun 2010 B2
7752236 Williams et al. Jul 2010 B2
7752554 Biggs et al. Jul 2010 B2
7761384 Madhogarhia Jul 2010 B2
7774270 MacCloskey Aug 2010 B1
7779456 Dennis et al. Aug 2010 B2
7779457 Taylor Aug 2010 B2
7788184 Kane Aug 2010 B2
7792864 Rice Sep 2010 B1
7793835 Coggeshall et al. Sep 2010 B1
7801828 Candella et al. Sep 2010 B2
7805391 Friedlander et al. Sep 2010 B2
7840459 Loftesness et al. Nov 2010 B1
7860769 Benson Dec 2010 B2
7865439 Seifert et al. Jan 2011 B2
7865937 White et al. Jan 2011 B1
7870078 Clark et al. Jan 2011 B2
7870599 Pemmaraju Jan 2011 B2
7874488 Parkinson Jan 2011 B2
7882548 Heath et al. Feb 2011 B2
7890433 Singhal Feb 2011 B2
7904360 Evans Mar 2011 B2
7904367 Chung et al. Mar 2011 B2
7908242 Achanta Mar 2011 B1
7912865 Akerman et al. Mar 2011 B2
7917715 Tallman, Jr. Mar 2011 B2
7925582 Kornegay et al. Apr 2011 B1
7929951 Stevens Apr 2011 B2
7933835 Keane et al. Apr 2011 B2
1012602 Beatson et al. May 2011 A1
7950577 Daniel May 2011 B1
7962404 Metzger, II et al. Jun 2011 B1
7962467 Howard et al. Jun 2011 B2
7970679 Kasower Jun 2011 B2
7970698 Gupta et al. Jun 2011 B2
7971246 Emigh et al. Jun 2011 B1
7975299 Balducci et al. Jul 2011 B1
7983979 Holland, IV Jul 2011 B2
7984849 Berghel et al. Jul 2011 B2
7988043 Davis Aug 2011 B2
7991201 Bous et al. Aug 2011 B2
7991689 Brunzell et al. Aug 2011 B1
7995994 Khetawat et al. Aug 2011 B2
7996521 Chamberlain et al. Aug 2011 B2
8001034 Chung et al. Aug 2011 B2
8001042 Brunzell et al. Aug 2011 B1
8001153 Skurtovich, Jr. et al. Aug 2011 B2
8005749 Ginsberg Aug 2011 B2
8006291 Headley et al. Aug 2011 B2
8009873 Chapman Aug 2011 B2
8019678 Wright et al. Sep 2011 B2
8020763 Kowalchyk et al. Sep 2011 B1
8024271 Grant Sep 2011 B2
8027518 Baker et al. Sep 2011 B2
8028168 Smithies et al. Sep 2011 B2
8028326 Palmer et al. Sep 2011 B2
8028329 Whitcomb Sep 2011 B2
8028896 Carter et al. Oct 2011 B2
8032449 Hu et al. Oct 2011 B2
8032927 Ross Oct 2011 B2
8037512 Wright et al. Oct 2011 B2
8042159 Basner et al. Oct 2011 B2
8042193 Piliouras Oct 2011 B1
8049596 Sato Nov 2011 B2
8055667 Levy Nov 2011 B2
8056128 Dingle et al. Nov 2011 B1
8058972 Mohanty Nov 2011 B2
8060915 Voice et al. Nov 2011 B2
8065525 Zilberman Nov 2011 B2
8069053 Gervais et al. Nov 2011 B2
8069084 Mackouse Nov 2011 B2
8069256 Rasti Nov 2011 B2
8069485 Carter Nov 2011 B2
20020019938 Aarons Feb 2002 A1
20020042879 Gould et al. Apr 2002 A1
20020059521 Tasler May 2002 A1
20020062185 Runge et al. May 2002 A1
20020062281 Singhal May 2002 A1
20020073044 Singhal Jun 2002 A1
20020077178 Oberberger et al. Jun 2002 A1
20020080256 Bates et al. Jun 2002 A1
20020087460 Hornung Jul 2002 A1
20020130176 Suzuki Sep 2002 A1
20020138751 Dutta Sep 2002 A1
20020173994 Ferguson Nov 2002 A1
20020184509 Scheidt Dec 2002 A1
20030004879 Demoff et al. Jan 2003 A1
20030009426 Ruiz-Sanchez Jan 2003 A1
20030046554 Leydier et al. Mar 2003 A1
20030048904 Wang et al. Mar 2003 A1
20030057278 Wong Mar 2003 A1
20030070101 Buscemi Apr 2003 A1
20030143980 Choi et al. Jul 2003 A1
20030149744 Bierre et al. Aug 2003 A1
20030200447 Sjoblom Oct 2003 A1
20030222500 Bayeur et al. Dec 2003 A1
20030233278 Marshall Dec 2003 A1
20040004117 Suzuki Jan 2004 A1
20040005912 Hubbe et al. Jan 2004 A1
20040010698 Rolfe Jan 2004 A1
20040026496 Zuili Feb 2004 A1
20040111335 Black et al. Jun 2004 A1
20040149820 Zuili Aug 2004 A1
20040149827 Zuili Aug 2004 A1
20040153656 Cluts et al. Aug 2004 A1
20040153663 Clark et al. Aug 2004 A1
20040158723 Root Aug 2004 A1
20040230538 Clifton et al. Nov 2004 A1
20040243514 Wankmueller Dec 2004 A1
20040243539 Skurtovich et al. Dec 2004 A1
20040243567 Levy Dec 2004 A1
20040250085 Tattan et al. Dec 2004 A1
20040254868 Kirkland et al. Dec 2004 A1
20050001028 Zuili Jan 2005 A1
20050005168 Dick Jan 2005 A1
20050010780 Kane et al. Jan 2005 A1
20050021476 Candella et al. Jan 2005 A1
20050021519 Ghouri Jan 2005 A1
20050065874 Lefner et al. Mar 2005 A1
20050065950 Chaganti et al. Mar 2005 A1
20050071282 Lu et al. Mar 2005 A1
20050075985 Cartmell Apr 2005 A1
20050081052 Washington Apr 2005 A1
20050086161 Gallant Apr 2005 A1
20050097364 Edeki et al. May 2005 A1
20050125226 Magee Jun 2005 A1
20050125686 Brandt Jun 2005 A1
20050138391 Mandalia et al. Jun 2005 A1
20050144143 Freiberg Jun 2005 A1
20050154671 Doan et al. Jul 2005 A1
20050165667 Cox Jul 2005 A1
20050203885 Chenevich et al. Sep 2005 A1
20050216953 Ellingson Sep 2005 A1
20050229007 Bolle et al. Oct 2005 A1
20050242173 Suzuki Nov 2005 A1
20050273333 Morin et al. Dec 2005 A1
20050279869 Barklage Dec 2005 A1
20060004622 Fanelli et al. Jan 2006 A1
20060004663 Singhal Jan 2006 A1
20060041464 Powers et al. Feb 2006 A1
20060045105 Dobosz et al. Mar 2006 A1
20060064374 Helsper et al. Mar 2006 A1
20060074798 Din et al. Apr 2006 A1
20060080230 Freiberg Apr 2006 A1
20060080263 Willis et al. Apr 2006 A1
20060089905 Song et al. Apr 2006 A1
20060101508 Taylor May 2006 A1
20060106605 Saunders et al. May 2006 A1
20060112279 Cohen et al. May 2006 A1
20060112280 Cohen et al. May 2006 A1
20060129840 Milgramm et al. Jun 2006 A1
20060140460 Coutts Jun 2006 A1
20060143073 Engel et al. Jun 2006 A1
20060144924 Stover Jul 2006 A1
20060149580 Helsper et al. Jul 2006 A1
20060149674 Cook et al. Jul 2006 A1
20060178971 Owen et al. Aug 2006 A1
20060179004 Fuchs Aug 2006 A1
20060200855 Willis Sep 2006 A1
20060204051 Holland Sep 2006 A1
20060206725 Milgramm et al. Sep 2006 A1
20060239512 Petrillo Oct 2006 A1
20060239513 Song et al. Oct 2006 A1
20060253583 Dixon et al. Nov 2006 A1
20060255914 Westman Nov 2006 A1
20060271456 Romain et al. Nov 2006 A1
20060271457 Romain et al. Nov 2006 A1
20060271507 Anzalone et al. Nov 2006 A1
20060271568 Balkir et al. Nov 2006 A1
20060273158 Suzuki Dec 2006 A1
20060277043 Tomes et al. Dec 2006 A1
20060282285 Helsper et al. Dec 2006 A1
20060282372 Endres et al. Dec 2006 A1
20060282395 Leibowitz Dec 2006 A1
20060287902 Helsper et al. Dec 2006 A1
20060294023 Lu Dec 2006 A1
20070011100 Libin et al. Jan 2007 A1
20070016521 Wang Jan 2007 A1
20070016522 Wang Jan 2007 A1
20070038568 Greene et al. Feb 2007 A1
20070040017 Kozlay Feb 2007 A1
20070040019 Berghel et al. Feb 2007 A1
20070043577 Kasower Feb 2007 A1
20070047770 Swope et al. Mar 2007 A1
20070048765 Abramson Mar 2007 A1
20070050638 Rasti Mar 2007 A1
20070061273 Greene et al. Mar 2007 A1
20070072190 Aggarwal Mar 2007 A1
20070073622 Kane Mar 2007 A1
20070073630 Greene et al. Mar 2007 A1
20070078786 Bous et al. Apr 2007 A1
20070083460 Bachenheimer Apr 2007 A1
20070087795 Aletto et al. Apr 2007 A1
20070100774 Abdon May 2007 A1
20070106517 Cluff et al. May 2007 A1
20070106611 Larsen May 2007 A1
20070107050 Selvarajan May 2007 A1
20070109103 Jedrey et al. May 2007 A1
20070110282 Millsapp May 2007 A1
20070124270 Page May 2007 A1
20070155411 Morrison Jul 2007 A1
20070157299 Hare Jul 2007 A1
20070168480 Biggs et al. Jul 2007 A1
20070174208 Black et al. Jul 2007 A1
20070179903 Seinfeld et al. Aug 2007 A1
20070180209 Tallman Aug 2007 A1
20070180263 Delgrosso et al. Aug 2007 A1
20070186276 McRae et al. Aug 2007 A1
20070192853 Shraim et al. Aug 2007 A1
20070198410 Labgold et al. Aug 2007 A1
20070205266 Carr et al. Sep 2007 A1
20070214037 Shubert et al. Sep 2007 A1
20070214076 Robida et al. Sep 2007 A1
20070214365 Cornett et al. Sep 2007 A1
20070219928 Madhogarhia Sep 2007 A1
20070220594 Tulsyan Sep 2007 A1
20070233614 McNelley et al. Oct 2007 A1
20070234427 Gardner et al. Oct 2007 A1
20070244807 Andringa et al. Oct 2007 A1
20070250704 Hallam-Baker Oct 2007 A1
20070250920 Lindsay Oct 2007 A1
20070266439 Kraft Nov 2007 A1
20070291995 Rivera Dec 2007 A1
20070292006 Johnson Dec 2007 A1
20070294104 Boaz et al. Dec 2007 A1
20080027857 Benson Jan 2008 A1
20080027858 Benson Jan 2008 A1
20080059236 Cartier Mar 2008 A1
20080059352 Chandran Mar 2008 A1
20080059366 Fou Mar 2008 A1
20080076386 Khetawat et al. Mar 2008 A1
20080098222 Zilberman Apr 2008 A1
20080103799 Domenikos et al. May 2008 A1
20080103811 Sosa May 2008 A1
20080103972 Lanc May 2008 A1
20080104021 Cai et al. May 2008 A1
20080114837 Biggs et al. May 2008 A1
20080120237 Lin May 2008 A1
20080126116 Singhai May 2008 A1
20080162383 Kraft Jul 2008 A1
20080177841 Sinn et al. Jul 2008 A1
20080189789 Lamontagne Aug 2008 A1
20080208548 Metzger et al. Aug 2008 A1
20080208726 Tsantes et al. Aug 2008 A1
20080217400 Portano Sep 2008 A1
20080244717 Jelatis et al. Oct 2008 A1
20080256613 Grover Oct 2008 A1
20080288430 Friedlander et al. Nov 2008 A1
20080288790 Wilson Nov 2008 A1
20080294689 Metzger et al. Nov 2008 A1
20080296367 Parkinson Dec 2008 A1
20080296382 Connell, II et al. Dec 2008 A1
20080300877 Gilbert et al. Dec 2008 A1
20090007220 Ormazabal et al. Jan 2009 A1
20090018934 Peng et al. Jan 2009 A1
20090021349 Errico et al. Jan 2009 A1
20090024417 Marks et al. Jan 2009 A1
20090024636 Shiloh Jan 2009 A1
20090026270 Connell, II et al. Jan 2009 A1
20090079539 Johnson Mar 2009 A1
20090094311 Awadallah et al. Apr 2009 A1
20090099960 Robida et al. Apr 2009 A1
20090106153 Ezra Apr 2009 A1
20090106846 Dupray et al. Apr 2009 A1
20090119299 Rhodes May 2009 A1
20090125439 Zarikian et al. May 2009 A1
20090126013 Atwood et al. May 2009 A1
20090138391 Dudley et al. May 2009 A1
20090141318 Hughes Jun 2009 A1
20090151005 Bell et al. Jun 2009 A1
20090158404 Hahn et al. Jun 2009 A1
20090204457 Buhrmann et al. Aug 2009 A1
20090205032 Hinton et al. Aug 2009 A1
20090206993 Di Mambro et al. Aug 2009 A1
20090216560 Siegel Aug 2009 A1
20090222362 Stood et al. Sep 2009 A1
20090222897 Carow et al. Sep 2009 A1
20090224875 Rabinowitz et al. Sep 2009 A1
20090224889 Aggarwal et al. Sep 2009 A1
20090226056 Vlachos et al. Sep 2009 A1
20090241168 Readshaw Sep 2009 A1
20090241173 Troyansky Sep 2009 A1
20090248198 Siegel et al. Oct 2009 A1
20090248497 Hueter Oct 2009 A1
20090254484 Forero et al. Oct 2009 A1
20090257595 de Cesare et al. Oct 2009 A1
20090259470 Chang Oct 2009 A1
20090259560 Bachenheimer Oct 2009 A1
20090259588 Lindsay Oct 2009 A1
20090259855 de Cesare et al. Oct 2009 A1
20090261189 Ellis, Jr. Oct 2009 A1
20090270126 Liu Oct 2009 A1
20090271617 Song et al. Oct 2009 A1
20090272801 Connell, II et al. Nov 2009 A1
20090276244 Baldwin, Jr. et al. Nov 2009 A1
20090281945 Shakkarwar Nov 2009 A1
20090281951 Shakkarwar Nov 2009 A1
20090307778 Mardikar Dec 2009 A1
20090326972 Washington Dec 2009 A1
20090328173 Jakobson et al. Dec 2009 A1
20100004965 Eisen Jan 2010 A1
20100024037 Grzymala-Busse et al. Jan 2010 A1
20100031030 Kao et al. Feb 2010 A1
20100037147 Champion et al. Feb 2010 A1
20100037308 Lin et al. Feb 2010 A1
20100042526 Martinov Feb 2010 A1
20100070620 Awadallah et al. Mar 2010 A1
20100077006 El Emam et al. Mar 2010 A1
20100085146 Johnson Apr 2010 A1
20100088233 Tattan et al. Apr 2010 A1
20100088338 Pavoni, Jr. et al. Apr 2010 A1
20100095357 Willis et al. Apr 2010 A1
20100100406 Lim Apr 2010 A1
20100131273 Aley-Raz et al. May 2010 A1
20100132043 Bjorn et al. May 2010 A1
20100145847 Zarikian et al. Jun 2010 A1
20100158207 Dhawan et al. Jun 2010 A1
20100169210 Bous et al. Jul 2010 A1
20100169947 Sarmah et al. Jul 2010 A1
20100205662 Ibrahim et al. Aug 2010 A1
20100218255 Ritman et al. Aug 2010 A1
20100229225 Sarmah et al. Sep 2010 A1
20100229230 Edeki et al. Sep 2010 A1
20100241501 Marshall Sep 2010 A1
20100250364 Song et al. Sep 2010 A1
20100250411 Ogrodski Sep 2010 A1
20100275265 Fiske et al. Oct 2010 A1
20100302157 Zilberman Dec 2010 A1
20100306101 Lefner et al. Dec 2010 A1
20100313273 Freas Dec 2010 A1
20100325442 Petrone Dec 2010 A1
20100332292 Anderson Dec 2010 A1
20110016042 Cho et al. Jan 2011 A1
20110040983 Grzymala-Busse et al. Feb 2011 A1
20110060905 Stack et al. Mar 2011 A1
20110119291 Rice May 2011 A1
20110126024 Beatson May 2011 A1
20110270727 Kasower Nov 2011 A1
20110276496 Neville et al. Nov 2011 A1
20110289032 Crooks et al. Nov 2011 A1
20110289322 Rasti Nov 2011 A1
20110295721 MacDonald Dec 2011 A1
20110295750 Rammal Dec 2011 A1
20110296529 Bhanoo et al. Dec 2011 A1
20110302412 Deng et al. Dec 2011 A1
20110302641 Hald et al. Dec 2011 A1
20130004033 Trugenberger Jan 2013 A1
Foreign Referenced Citations (1)
Number Date Country
WO-2009062111 May 2009 WO
Non-Patent Literature Citations (9)
Entry
Haglund, Two-factor Authentication With a Mobile Phone, Lund University, Nov. 2, 2007, pp. 1-62.
Aad et al, NRC Data Collection and Privacy by Design Principles, IEEE, Nov. 2010, pp. 1-5.
Young, Lee W., “International Search Report” prepared for PCT/US11/33940 as mailed Aug. 22, 2011, 3 pages.
Ross, et al., U.S. Appl. No. 13/093,664, filed Apr. 25, 2011.
Gottschalk, Jr., U.S. Appl. No. 13/236,687, filed Sep. 20, 2011.
Gottschalk, U.S. Appl. No. 13/398,471, filed Feb. 16, 2012.
Copenheaver, Blaine R., “International Search Report” for PCT/US2012/025456 as mailed May 21, 2012, 4 pages.
LeFebvre, F. et al., “A Robust Soft Hash Algorithm for Digital Image Signature”, IEEE, 2003, pp. 495-498.
Khan, Muhammad Khurram, “An Efficient and Secure Remote Mutual Authentication Scheme with Smart Cards”, IEEE, 2008, pp. 1-6.
Related Publications (1)
Number Date Country
20150295924 A1 Oct 2015 US
Continuations (1)
Number Date Country
Parent 13236687 Sep 2011 US
Child 14304910 US