As methods and devices for engaging in financial transactions have increased, old problems such as fraud and counterfeiting persist.
One of the primary sources of fraud, which is prevalent in the credit card industry is skimming. Skimming refers to the electronic copying of a card's magnetic stripe data to create counterfeit cards.
Skimming is predominantly a phenomenon afflicting magnetic stripe based transactions. This is because the magnetic stripe, which is placed on the back of a transaction card and stores a variety of data on three separate tracks, is a passive medium. In other words, the digital content of the magnetic stripe can be perfectly copied, without any difference between the copy and the original.
One of the primary means by which skimming can be prevented is for the consumer to closely monitor the whereabouts of his transaction card. This may allow the consumer to prevent the card from being swiped through inappropriate devices. However, as contactless cards evolve, the classic skimming problem comes along with it. In fact, in a wireless environment the opportunity to skim magnetic stripe data is more prevalent. In a wireless environment, a potential skimmer need not physically possess the card to be skimmed nor have access to any of the physical equipment (e.g. POS terminal, communication lines, etc.) which is required for skimming in a wire based environment. A skimmer can, without the knowledge of the consumer or merchant, intercept the wireless transaction and copy the data being transmitted from the card to POS terminal.
To address the above problems, a dCVV or a dynamic card verification value can be used. The dCVV can be generated using an algorithm which uses at least a counter and input data such as an account number, expiration date, and other information. The counter can increase by one each time a transaction is conducted. The dCVV can be independently generated by either a portable consumer device or POS terminal at the front end of a transaction and can be sent to a back end computer. The counter may be sent from the merchant to the back end computer so that it knows the current counter value associated with the portable consumer device. In other cases, the counter may simply be present at the back end computer. In the latter case, the counter increments every time the back end computer sees a transaction. The back end computer, using a similar algorithm to the one that generated the dCVV at the front end, the counter value, and input data, can independently generate a second dCVV. If the received dCVV and the generated dCVV match, the transaction can be considered authentic. If the dCVVs do not match, this may indicate that the transaction is fraudulent.
Some dCVVs, however, typically only include one dynamic data element to generate the dCVV. The dynamic data element may be counter. If the counter and other data elements that are used to create the dynamic CW are intercepted, the dynamic CVV could be used by an unauthorized person.
Embodiments of the invention address the above problems, and other problems, individually and collectively.
Embodiments of the invention are directed to methods and systems for generating verification values.
One embodiment of the invention is directed to a method comprising: generating a verification value in response to a transaction involving a portable consumer device, wherein the verification value is generated using a first dynamic data element and a second dynamic data element; and sending the verification value to a service provider so that the service provider can verify the verification value. The service provider can be, for example, a payment processing organization or an issuer of the portable consumer device.
Another embodiment of the invention is directed to a computer readable medium comprising: code for generating a verification value in response to a transaction involving a portable consumer device, wherein the verification value is generated using a first dynamic data element and a second dynamic data element; and code for sending the verification value with data in a magnetic stripe data format to a service provider so that the service provider can verify the transaction. The service provider can be, for example, a payment processing organization or an issuer of the portable consumer device.
Another embodiment of the invention is directed to a method comprising: receiving a verification value with data in a magnetic stripe data format in response to a transaction involving a portable consumer device, wherein the verification value is generated using a first dynamic data element and a second dynamic data element; and determining if the received verification value matches a verification value at a service provider computer.
These and other embodiments of the invention are described in further detail below.
Generally, embodiments of the present invention provide for methods and systems for dynamically generating a card verification value for each transaction and for utilizing such value to verify that the payment service is authentic and has not been skimmed. The dynamically generated Card Verification Value (referred to herein as the “dCVV”) is generated on the portable consumer device, embedded into the payment data, and transmitted to a point of sale terminal. In an alternate embodiment, payment data is received from a portable consumer device, a verification value is generated by a point of sale terminal, and the verification value is embedded into the payment data. The dCVV may be generated using at least two different dynamic data elements such as a counter and a time of day.
In another embodiment, data received by the point of sale terminal is interpreted as simply payment data (e.g. standard magnetic stripe Track 1 and/or Track 2 data without an embedded dCVV) by the point of sale terminal. The point of sale terminal passes on the received data in a magnetic stripe data format to a payment network which, in turn, passes the data on to the service provider in the magnetic stripe data format. As used herein, “magnetic stripe data format” may include a data format that is compatible with conventional magnetic stripe payment card system. Thus, although contactless cards and the like do not have a magnetic stripe, they may still provide data that can eventually be put into a magnetic stripe data format. If the service provider determines that the transaction is one for which a dCVV is required, the service provider independently generates a verification value. If the verification value generated by the service provider does not match the dCVV received from the portable consumer device, the transaction is identified as potentially fraudulent and disapproved.
In an alternate embodiment, data is received by the point of sale terminal and is used by the point of sale terminal to generate a verification value. The point of sale terminal passes on the received data to a payment network which, in turn, passes the data on to the service provider. The service provider independently generates a verification value. If the verification value generated by the service provider computer does not match the dCVV received from the point of sale terminal, the transaction is identified as potentially fraudulent and disapproved.
The service provider computer may comprise a processor, and a computer readable medium comprising instructions executable by the processor. The computer readable medium may comprise code for generating a verification value in response to a transaction involving a portable consumer device, wherein the verification value is generated using a first data dynamic element and a second dynamic data element, and code for sending the verification value to a service provider associated with the portable consumer device so that the service provider can verify the transaction.
For purposes of this application, the term “portable consumer device” can include any device comprising a microprocessor which may be used in a transaction or data exchange as described herein. Other portable consumer devices need not use a microprocessor. Without limiting the generality of the foregoing, “portable consumer device” can include an integrated circuit card (also commonly known as a smartcard), a memory card, a cellular telephone, a personal digital assistant, a mobile electronic device, or a computer.
For purposes of this application, “contactless” or “wireless” can include any communications method or protocol, including proprietary protocols, in which data is exchanged between two devices without the need for the devices to be physically coupled. Without limiting the generality of the foregoing, “contactless” or “wireless” can include data transmissions by laser, radio frequency, infrared communications, Bluetooth, or wireless local area network.
For purposes of this application, the term “payment service” can include any application deployed on a portable consumer device which causes the exchange of data between the portable consumer device and any other device or location. It should be appreciated that “payment service” is not limited to financial applications.
For purposes of this application, “payment data” can include, with respect to financial applications those data elements used by the payment service to execute a transaction, and with respect to non-financial transactions any necessary data elements exclusive of the present invention. For example, when the payment service is a magnetic stripe credit card transaction, “payment data” would comprise Track 1 and/or Track 2 data, as that is understood by one of ordinary skill in the credit card industry, such as the primary account number, expiration date, service codes, and discretionary data. “Payment data” may also comprise a unique card identification number or a unique identification number for a service provider. The payment data may reside in a memory located on the portable consumer device.
The portable consumer device can also maintain various dynamic data elements. An example of a dynamic data element is an application transaction counter (ATC). The ATC may initially be set by the service provider to a predetermined value. Thereafter, the ATC may be incremented with each transaction. Alternately, the ATC may be decremented from its initial predetermined value with each transaction. The ATC may be a value of any length. In addition, the service provider which deployed the payment service may maintain a corresponding ATC portable consumer device accessible to the service provider's computer. As discussed in more detail below, this corresponding ATC is used to identify payment services which may have been skimmed. In an alternate embodiment, a cryptogram, digital signature, or hash value based on transaction data may be used in place of or in conjunction with the ATC portable consumer device.
Examples of other dynamic data elements may include a time of day, a current transaction amount, a terminal ID, a merchant ID, and a randomly generated number from a terminal, etc. The data elements are dynamic in the sense that they can change with each transaction or nearly each transaction. The dynamic data elements may relate to a consumer's portable consumer device and/or may relate to the consumer generally.
In embodiments of the invention, the dCVV is generated using at least two dynamic data elements. By using at least two (e.g., at least three or four) dynamic data elements to create a dCVV, it is highly unlikely that a skimmer can determine the dCVV. The skimmer cannot simply skim the counter, but would also have to skim various other pieces of dynamic data in order to generate the dCVV.
The at least two dynamic data elements may be used, with or without other static data elements to create a dCVV. Examples of static data elements comprise a telephone number, a SIM card number, an account number, birthday, home address, expiration date, etc. Static data elements include those that typically do not change from transaction to transaction. For example, an account number associated with a portable consumer device generally does not change from transaction to transaction.
Each time the payment service is initiated, a dCVV is generated on the portable consumer device for authentication purposes.
It is apparent to one of ordinary still in the art that the first encryption key 120, the second encryption key 126, the third encryption key 130 and the fourth encryption key 134 may take any preselected value. In one embodiment of the present invention, the first encryption key 120, the second encryption key 126, and the fourth encryption key 134 are equivalent and of a different value from the third encryption key 130. Other permutations of the encryption key values utilized in the methodology of
In one embodiment, the first encryption key 120, the second encryption key 126, the third encryption key 130, and the fourth encryption key 134 take the value of unique keys derived from data existing on the portable consumer device. Upon deployment, each payment service is personalized by the service provider with a master derivation key. The master derived key may be deployed with payment services in batches (i.e. multiple payment services receive the same master derived key) or individually. Each portable consumer device can be personalized with the functionality to derive keys unique to the payment service.
Returning now to the result of the methodology set forth in
A second evaluation is then performed again beginning with the most significant digit of Block G 136 and examining each sequential nibble. If a nibble contains a hexadecimal value ranging from ten (A) to fifteen (F), inclusive, that value is extracted 310. The extracted value is then decimalized by subtracting the hexadecimal value A from the extracted value resulting in a decimalized value ranging from zero to five 315. This decimalized value is then concatenated on the right to the right most value of the holding string 320.
Once all nibbles in Block G have been twice examined as described, the three most-significant (i.e. left-most) nibbles of the holding string are extracted 325. This 3-digit value is the dCVV for the transaction. Other numbers of bits may be extracted from the twice-examined nibble string to generate the dCVV for a transaction. Furthermore, different nibbles, such as the rightmost nibbles, may be used as the dCVV for a transaction. The three leftmost nibbles, however, represent a preferred embodiment.
Once generated, the dCVV is embedded into the payment data transmitted from the portable consumer device to the point of sale terminal. The data received by the point of sale terminal may appear to the point of sale terminal as standard payment data. In other words, the point of sale terminal may not be able to determine if a dCVV is embedded and where such dCVV may be located. There is no indication to the point of sale terminal that a dCVV is embedded into the data received from the portable consumer device.
Alternately,
An aspect of the present invention is that the system of utilizing the dynamically created CW allows the service provider to make a determination of the authenticity of the payment service being utilized. This authentication step is not left to merchants, individual point of sale terminals, or other third parties or devices.
The payment data may also comprise at least the first and/or second dynamic data elements. Preferably, any dynamic data elements that are sent up to the service provider computer are sent in different data fields, at different times, and/or along different communication paths to the service provider computer. This would make it difficult for a skimmer to determine which dynamic data elements are used to generate the dCVV and where they are located.
In this respect, the exemplary record formats shown in
In some instances, a dynamic data element such as a counter (or other type of data element that can change) can be received at a back end computer along with a dCVV generated by a portable consumer device. The back end computer can determine if the counter is within a predetermined range. If it is, then the back end computer can independently generate another dCVV. If the received dCVV and the generated dCVV match, then the transaction can be considered authentic. As explained in co-pending U.S. patent application Ser. No. 11/764,370, entitled “Verification Error Reduction System”, filed Jun. 18, 2007, which is incorporated herein by reference, allowing the counter to fall within a range can decrease the number of declined transactions. Thus, in some embodiments of the invention, the first dynamic data element (e.g., a counter) can fall within a first range (e.g., between 5-10) and a second dynamic data element (time of day) may fall within a second range (e.g., between 12:00 and 12:05). If one or both of the dynamic data elements are within their predetermined ranges, than the authorization process may continue. If not, then the transaction may be declined and/or more information may be requested from the consumer for authentication purposes.
If the expected next ATC (and/or the expected next second dynamic data element) is received, the service provider computer can independently re-generate the dCVV for the given transaction 645 utilizing a similar or analogous process as described above. If the service provider generated dCVV matches the dCVV received from the portable consumer device 650, the service provider deems the payment application to be authentic 655. The service provider computer then replaces the ATC which was previously stored on the service provider computer with the ATC received from the portable consumer device 660 for subsequent authentications. If the service provider generated dCVV does not match the dCVV received from the portable consumer device, the transaction is potentially fraudulent and is terminated 665.
The methodology of
In a specific embodiment of
It should be understood that the present invention as described above can be implemented in the form of control logic using computer software in a modular or integrated manner. Based on the disclosure and teachings provided herein, a person of ordinary skill in the art will know and appreciate other ways and/or methods to implement the present invention using hardware and a combination of hardware and software
Any of the software components or functions described in this application, may be implemented as software code to be executed by a processor using any suitable computer language such as, for example, Java, C++ or Perl using, for example, conventional or object-oriented techniques. The software code may be stored as a series of instructions or commands on a computer readable medium, such as a random access memory (RAM), a read only memory (ROM), a magnetic medium such as a hard-drive or a floppy disk, or an optical medium such as a CD-ROM. Any such computer readable medium may reside on or within a single computational apparatus and may be present on or within different computational apparatuses within a system or network.
The above description is illustrative and is not restrictive. Many variations of the invention will become apparent to those skilled in the art upon review of the disclosure. The scope of the invention should, therefore, be determined not with reference to the above description, but instead should be determined with reference to the pending claims along with their full scope or equivalents.
One or more features from any embodiment may be combined with one or more features of any other embodiment without departing from the scope of the invention.
A recitation of “a”, “an” or “the” is intended to mean “one or more” unless specifically indicated to the contrary.
This application is a continuation application of U.S. patent application Ser. No. 13/308,419, filed Nov. 30, 2011, which is a continuation application of U.S. patent application Ser. No. 12/776,949, filed May 10, 2010, which is a continuation application of U.S. patent application Ser. No. 11/764,376, filed Jun. 18, 2007, which is a non-provisional of and claims priority to U.S. Provisional Patent Application Nos. 60/815,059, filed Jun. 19, 2006, 60/815,430, filed Jun. 20, 2006, and 60/884,089, filed Jan. 9, 2007, the Ser. No. 11/764,376 application also being a continuation-in-part application of U.S. patent application Ser. No. 10/642,878, filed Aug. 18, 2003. All of the above applications are herein incorporated by reference in their entireties for all purposes.
Number | Name | Date | Kind |
---|---|---|---|
3956615 | Anderson et al. | May 1976 | A |
4186871 | Anderson et al. | Feb 1980 | A |
4238853 | Ehrsam et al. | Dec 1980 | A |
4277837 | Stuckert | Jul 1981 | A |
4317957 | Sendrow | Mar 1982 | A |
4423287 | Zeidler | Dec 1983 | A |
4528442 | Endo | Jul 1985 | A |
5254843 | Hynes et al. | Oct 1993 | A |
5311594 | Penzias | May 1994 | A |
5434398 | Goldberg | Jul 1995 | A |
5465387 | Mukherjee | Nov 1995 | A |
5513250 | McAllister | Apr 1996 | A |
5530438 | Bickham et al. | Jun 1996 | A |
5577121 | Davis et al. | Nov 1996 | A |
5615110 | Wong | Mar 1997 | A |
5625689 | Indeck et al. | Apr 1997 | A |
5627355 | Rahman et al. | May 1997 | A |
5679940 | Templeton et al. | Oct 1997 | A |
5708422 | Blonder et al. | Jan 1998 | A |
5721781 | Deo et al. | Feb 1998 | A |
5737421 | Audebert | Apr 1998 | A |
5740244 | Indeck et al. | Apr 1998 | A |
5745576 | Abraham et al. | Apr 1998 | A |
5774525 | Kanevsky et al. | Jun 1998 | A |
5802176 | Audebert | Sep 1998 | A |
5819226 | Gopinathan et al. | Oct 1998 | A |
5832458 | Jones | Nov 1998 | A |
5834747 | Cooper | Nov 1998 | A |
5835599 | Buer | Nov 1998 | A |
5839119 | Krsul et al. | Nov 1998 | A |
5872834 | Teitelbaum | Feb 1999 | A |
5878337 | Joao et al. | Mar 1999 | A |
5883810 | Franklin | Mar 1999 | A |
5903830 | Joao et al. | May 1999 | A |
5914471 | Van De Pavert | Jun 1999 | A |
5914472 | Foladare et al. | Jun 1999 | A |
5920628 | Indeck et al. | Jul 1999 | A |
5956699 | Wong et al. | Sep 1999 | A |
5988497 | Wallace | Nov 1999 | A |
6005942 | Chan et al. | Dec 1999 | A |
6012144 | Pickett | Jan 2000 | A |
6016476 | Maes et al. | Jan 2000 | A |
6029154 | Pettitt | Feb 2000 | A |
6055505 | Elston | Apr 2000 | A |
6064990 | Goldsmith | May 2000 | A |
6081792 | Cucinotta et al. | Jun 2000 | A |
6095413 | Tetro et al. | Aug 2000 | A |
6112191 | Burke | Aug 2000 | A |
6122624 | Tetro et al. | Sep 2000 | A |
6157707 | Baulier et al. | Dec 2000 | A |
6219793 | Li et al. | Apr 2001 | B1 |
6234901 | Nagoshi et al. | May 2001 | B1 |
6260146 | Mos et al. | Jul 2001 | B1 |
6263447 | French et al. | Jul 2001 | B1 |
6282656 | Wang | Aug 2001 | B1 |
6298336 | Davis et al. | Oct 2001 | B1 |
6308890 | Cooper | Oct 2001 | B1 |
6330550 | Brisebois et al. | Dec 2001 | B1 |
6367011 | Lee et al. | Apr 2002 | B1 |
6442532 | Kawan | Aug 2002 | B1 |
6488206 | Flaig et al. | Dec 2002 | B1 |
6496936 | French et al. | Dec 2002 | B1 |
6505046 | Baker | Jan 2003 | B1 |
6523745 | Tamori | Feb 2003 | B1 |
6529725 | Joao et al. | Mar 2003 | B1 |
6535855 | Cahill et al. | Mar 2003 | B1 |
6592044 | Wong et al. | Jul 2003 | B1 |
6607136 | Atsmon et al. | Aug 2003 | B1 |
6612488 | Suzuki | Sep 2003 | B2 |
6647269 | Hendrey et al. | Nov 2003 | B2 |
6714918 | Hillmer et al. | Mar 2004 | B2 |
6715672 | Tetro et al. | Apr 2004 | B1 |
RE38572 | Tetro et al. | Aug 2004 | E |
6775539 | Deshpande | Aug 2004 | B2 |
6830183 | von Mueller et al. | Dec 2004 | B2 |
6832721 | Fujii | Dec 2004 | B2 |
6837425 | Gauthier et al. | Jan 2005 | B2 |
6839840 | Cooreman | Jan 2005 | B1 |
6839845 | Hsu et al. | Jan 2005 | B2 |
6857073 | French et al. | Feb 2005 | B2 |
6862575 | Anttila et al. | Mar 2005 | B1 |
6868391 | Hultgren | Mar 2005 | B1 |
6877661 | Webb et al. | Apr 2005 | B2 |
6899269 | Deland | May 2005 | B1 |
6904526 | Hongwei | Jun 2005 | B1 |
6913194 | Suzuki | Jul 2005 | B2 |
6944782 | von Mueller et al. | Sep 2005 | B2 |
6948656 | Williams | Sep 2005 | B2 |
6968180 | Kirby et al. | Nov 2005 | B2 |
6983882 | Cassone | Jan 2006 | B2 |
7003495 | Burger et al. | Feb 2006 | B1 |
7003497 | Maes | Feb 2006 | B2 |
7007840 | Davis | Mar 2006 | B2 |
7013293 | Kipnis et al. | Mar 2006 | B1 |
7024396 | Woodward | Apr 2006 | B2 |
7044394 | Brown | May 2006 | B2 |
7051002 | Keresman, III et al. | May 2006 | B2 |
7058611 | Kranzley et al. | Jun 2006 | B2 |
7058978 | Feuerstein et al. | Jun 2006 | B2 |
7096003 | Joao et al. | Aug 2006 | B2 |
7107250 | Harrison | Sep 2006 | B2 |
7143095 | Barrett et al. | Nov 2006 | B2 |
7152788 | Williams | Dec 2006 | B2 |
7225156 | Fisher et al. | May 2007 | B2 |
7243853 | Levy et al. | Jul 2007 | B1 |
7251624 | Lee et al. | Jul 2007 | B1 |
7257545 | Hung | Aug 2007 | B1 |
7264154 | Harris | Sep 2007 | B2 |
7343317 | Jokinen et al. | Mar 2008 | B2 |
7349668 | Ilan et al. | Mar 2008 | B2 |
D568388 | Hammad | May 2008 | S |
D568389 | Hammad | May 2008 | S |
D568390 | Law et al. | May 2008 | S |
7403908 | Jaramillo | Jul 2008 | B1 |
7420474 | Elks et al. | Sep 2008 | B1 |
7761374 | Sahota et al. | Jul 2010 | B2 |
7899753 | Everhart | Mar 2011 | B1 |
20010037453 | Mitty et al. | Nov 2001 | A1 |
20020002681 | Kawano et al. | Jan 2002 | A1 |
20020007320 | Hogan et al. | Jan 2002 | A1 |
20020032661 | Schuba et al. | Mar 2002 | A1 |
20020038287 | Villaret et al. | Mar 2002 | A1 |
20020046189 | Morita et al. | Apr 2002 | A1 |
20020049818 | Gihuly et al. | Apr 2002 | A1 |
20020091562 | Siegel et al. | Jul 2002 | A1 |
20020091945 | Ross | Jul 2002 | A1 |
20020095388 | Yu et al. | Jul 2002 | A1 |
20020095389 | Gaines | Jul 2002 | A1 |
20020096570 | Wong et al. | Jul 2002 | A1 |
20020099665 | Burger et al. | Jul 2002 | A1 |
20020108062 | Nakajima et al. | Aug 2002 | A1 |
20020116341 | Hogan et al. | Aug 2002 | A1 |
20020123972 | Hodgson et al. | Sep 2002 | A1 |
20020133462 | Shteyn | Sep 2002 | A1 |
20020147658 | Kwan | Oct 2002 | A1 |
20020153424 | Li | Oct 2002 | A1 |
20020158747 | McGregor et al. | Oct 2002 | A1 |
20020180584 | McGregor et al. | Dec 2002 | A1 |
20020194499 | Audebert et al. | Dec 2002 | A1 |
20030074317 | Hofi | Apr 2003 | A1 |
20030105964 | Brainard et al. | Jun 2003 | A1 |
20030115142 | Brickell et al. | Jun 2003 | A1 |
20030135463 | Brown et al. | Jul 2003 | A1 |
20030169881 | Niedermeyer | Sep 2003 | A1 |
20030200184 | Dominguez et al. | Oct 2003 | A1 |
20030208684 | Camacho et al. | Nov 2003 | A1 |
20030225703 | Angel | Dec 2003 | A1 |
20040015435 | Solomone et al. | Jan 2004 | A1 |
20040024638 | Restis | Feb 2004 | A1 |
20040031856 | Atsmon et al. | Feb 2004 | A1 |
20040059688 | Dominguez et al. | Mar 2004 | A1 |
20040064403 | Hasumi et al. | Apr 2004 | A1 |
20040078340 | Evans | Apr 2004 | A1 |
20040107170 | Labrou et al. | Jun 2004 | A1 |
20040156537 | Chung et al. | Aug 2004 | A1 |
20040171406 | Purk | Sep 2004 | A1 |
20040185830 | Joao et al. | Sep 2004 | A1 |
20040199470 | Ferry et al. | Oct 2004 | A1 |
20050043997 | Sahota et al. | Feb 2005 | A1 |
20050060233 | Bonalle et al. | Mar 2005 | A1 |
20050060730 | Soeda et al. | Mar 2005 | A1 |
20050065876 | Kumar | Mar 2005 | A1 |
20050071226 | Nguyen et al. | Mar 2005 | A1 |
20050071227 | Hammad et al. | Mar 2005 | A1 |
20050071228 | Bortolin et al. | Mar 2005 | A1 |
20050071235 | Nguyen et al. | Mar 2005 | A1 |
20050080730 | Sorrentino | Apr 2005 | A1 |
20050091152 | Suisa | Apr 2005 | A1 |
20050097320 | Golan et al. | May 2005 | A1 |
20050119978 | Ates | Jun 2005 | A1 |
20050122209 | Black | Jun 2005 | A1 |
20050149455 | Bruesewitz et al. | Jul 2005 | A1 |
20050170814 | Joao et al. | Aug 2005 | A1 |
20050171905 | Wankmueller et al. | Aug 2005 | A1 |
20050218229 | Morley et al. | Oct 2005 | A1 |
20050228986 | Fukasawa et al. | Oct 2005 | A1 |
20050268107 | Harris et al. | Dec 2005 | A1 |
20050273442 | Bennett et al. | Dec 2005 | A1 |
20060018523 | Saitoh et al. | Jan 2006 | A1 |
20060059110 | Madhok et al. | Mar 2006 | A1 |
20060136546 | Trioano et al. | Jun 2006 | A1 |
20060165060 | Dua | Jul 2006 | A1 |
20060202025 | Calabrese et al. | Sep 2006 | A1 |
20060219776 | Finn | Oct 2006 | A1 |
20060281439 | Benco et al. | Dec 2006 | A1 |
20060282382 | Balasubramanian et al. | Dec 2006 | A1 |
20060287955 | Moulart et al. | Dec 2006 | A1 |
20060290501 | Hammad et al. | Dec 2006 | A1 |
20060293027 | Hammad et al. | Dec 2006 | A1 |
20070017970 | Gauthier et al. | Jan 2007 | A1 |
20070034679 | Gauthier et al. | Feb 2007 | A1 |
20070055630 | Gauthier et al. | Mar 2007 | A1 |
20070057034 | Gauthier et al. | Mar 2007 | A1 |
20070136131 | Mankoff | Jun 2007 | A1 |
20070250380 | Mankoff | Oct 2007 | A1 |
20070260544 | Wankmueller et al. | Nov 2007 | A1 |
20070288641 | Lee et al. | Dec 2007 | A1 |
20070294182 | Hammad | Dec 2007 | A1 |
20080004121 | Gatto et al. | Jan 2008 | A1 |
20080005037 | Hammad et al. | Jan 2008 | A1 |
20080029593 | Hammad et al. | Feb 2008 | A1 |
20080034221 | Hammad et al. | Feb 2008 | A1 |
20080040271 | Hammad et al. | Feb 2008 | A1 |
20080040276 | Hammad et al. | Feb 2008 | A1 |
20080065553 | Faith et al. | Mar 2008 | A1 |
20080103982 | Hammad et al. | May 2008 | A1 |
20080116264 | Hammad et al. | May 2008 | A1 |
20080120214 | Steele et al. | May 2008 | A1 |
20080120236 | Faith et al. | May 2008 | A1 |
20080128513 | Hammad et al. | Jun 2008 | A1 |
20080163257 | Carlson et al. | Jul 2008 | A1 |
20080183480 | Carlson et al. | Jul 2008 | A1 |
20080201212 | Hammad et al. | Aug 2008 | A1 |
20080203151 | Dixon et al. | Aug 2008 | A1 |
20080203152 | Hammad et al. | Aug 2008 | A1 |
20080203170 | Hammad et al. | Aug 2008 | A1 |
20080208681 | Hammad et al. | Aug 2008 | A1 |
20080302876 | Mullen | Dec 2008 | A1 |
20080303632 | Hammad | Dec 2008 | A1 |
20090055892 | Lu et al. | Feb 2009 | A1 |
20090055893 | Manessis et al. | Feb 2009 | A1 |
20090171682 | Dixon et al. | Jul 2009 | A1 |
20090202081 | Hammad et al. | Aug 2009 | A1 |
20100262546 | Sahota et al. | Oct 2010 | A1 |
20110231315 | Bandyopadhyay et al. | Sep 2011 | A1 |
Number | Date | Country |
---|---|---|
2000-078128 | Mar 2000 | JP |
2000-298733 | Oct 2000 | JP |
2007-517272 | Jun 2007 | JP |
0025262 | May 2000 | WO |
03081832 | Oct 2003 | WO |
2005001635 | Jan 2005 | WO |
Entry |
---|
International Search Report from PCT/US04/26813, May 7, 2007. |
Written Opinion of the International Searching Authority from PCT/US04/26813, May 7, 2007. |
International Preliminary Report on Patentability from PCT/US04/26813, May 30, 2007. |
Japanese Office Action from JP 2006-524010 dated Sep. 7, 2010 (English translation only). |
Decision to Grant from JP 2006-524010 dated Mar. 29, 2011 (English translation only). |
Office Action dated Jan. 11, 2008 from U.S. Appl. No. 10/642,878 (9 pages). |
Office Action dated Oct. 3, 2008 from U.S. Appl. No. 10/642,878 (9 pages). |
Office Action dated Jun. 10, 2009 from U.S. Appl. No. 10/642,878 (6 pages). |
Applicant response dated May 12, 2008 to Office Action from U.S. Appl. No. 10/642,878 dated Jan. 11, 2008 (7 pages). |
Applicant response dated Mar. 24, 2009 to Office Action from U.S. Appl. No. 10/642,878 dated Oct. 3, 2008 15 pages). |
Fujitsu Microelectronics America Announces New Fingerprint Identification Technology for Cell Phones, Mobile Devices Mar. 11, 2002 by Fujitsu Microelectronics America, Inc at www.fujitsu.com/us/news/pr/fma—20020311.html. |
Number | Date | Country | |
---|---|---|---|
20130226802 A1 | Aug 2013 | US |
Number | Date | Country | |
---|---|---|---|
60815059 | Jun 2006 | US | |
60815430 | Jun 2006 | US | |
60884089 | Jan 2007 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 13308419 | Nov 2011 | US |
Child | 13763570 | US | |
Parent | 12776949 | May 2010 | US |
Child | 13308419 | US | |
Parent | 11764376 | Jun 2007 | US |
Child | 12776949 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 10642878 | Aug 2003 | US |
Child | 11764376 | US |