US 7,195,154 B2Grant
Method for generating customer secure card numbers
Issue Date:2007-03-27
•35 Claims
•2 Drawing Sheets
Abstract
A method for providing secure transactions generates a Secure Card Number (“SCN”) for a first entity that is transferred with a first entity identifier to a second entity and then to a money source that verifies that the transaction is valid by use of the first entity identifier and the SCN. The SCN includes a 0Transaction Information Block (“TIB”), a Counter Block, and an encrypted Personal Identification Number (“PIN”) Block. The SCN is transferred to the money source in an account number or a non-account data field. The money source can use the TIB to determine whether the SCN should be used once or multiple times or to identify one of several physical devices, all of which are issued to the first entity, used to generate the SCN. The money source validates the SCN by duplicating the encryption process used to create an encrypted PIN Block and comparing the result to the encrypted PIN Block received with the transaction. A Triple Data Encryption Standard algorithm encrypts a PIN Block generated from a PIN, a Sequence Insertion Number (“SIN”) and a known starting value. The SIN can be a combination of three seed values and a random value generated by a Pseudo Random Number Generator (“PRNG”) initialized with the seed values. A Counter value is associated with the Counter Block and the seed values.
Metadata
Assignee
- PrivaSys, Inc.
Inventor
- Larry Routhenstein
Application Information
Application Number:US 09/960,715
Filing Date:2001-09-21
Priority Date:2001-09-21
Art Unit:2876
Classifications
IPC:
G06K5/00G06F17/00
Patent Drawings (2 sheets)
Description
Cross Reference to Related Applications
[0001] The present application is related to U.S. application Ser. Nos. 09/667,081 and 09/667,089, filed Sep. 21, 2000, which are continuation-in-part applications of U.S. Ser. No. 09/659,434, filed Sep. 8, 2000, which is a continuation-in-part of U.S. Ser. No. 09/640,044, filed Aug. 15, 2000, which is a continuation-in-part of U.S. Ser. No. 09/619,859, filed Jul. 20, 2000, which is a continuation-in-part of U.S. Ser. No. 09/571,707, all of which disclosures are specifically incorporated herein by reference. This application is also related to another application being filed concurrently herewith, entitled Method for Generating Customer Secure Card Numbers Subject To Use Restrictions By An Electronic Card, Ser. No. 09/960,714.
Field of the Invention
[0002] The present invention is in the field of payment systems.
Background of the Invention
[0003] Three forms of money in widespread use today throughout the world are cash, checks and payment cards (debit or credit). Each has distinct advantages, and distinct disadvantages. Cash is readily accepted, easy to use and anonymous, but it does not earn interest, it can be lost or stolen, and it is not always readily accessible. Checks are not always accepted, but they offer many advantages, since they do not have to be written until the time of payment. However, they must be physically presented and they are not anonymous. Payment cards are readily, but not always, accepted, and they offer many advantages over checks. If the card is a credit card, payment can be deferred, but the transaction is not anonymous. If the card is a debit card, payment has usually been made prior to its use, but it is anonymous. Accordingly, it is apparent that different types of money have different advantages to different persons in different situations. This may be one reason why all these forms of money are still in widespread use, and are even used by the same persons at different times.
[0004] As society and international commerce have become more dependent upon electronic transactions, money has also become more electronic. Many attempts have been made to come up with suitable forms of electronic money that mimic the physical world, or even create new forms of electronic money. However, despite the enormous need for such money, and efforts by some of the best minds and most successful companies in the world, electronic money has suffered many setbacks and been far slower to materialize than many had hoped or predicted. The reasons are many and varied, but some of the obvious reasons are security, ease of use/operation, and unwillingness of the public and/or commerce to make radical changes or embrace new technology and/or procedures. As a result, many efforts, including several potentially promising efforts, have met with failure.
[0005] Even though new forms of electronic money have been slow to develop or gain widespread acceptance, electronic payments have still moved forward. Many banks now offer some form of electronic checking. And payment cards have been used for electronic transactions in e-commerce and m-commerce (mobile commerce). Still, there is widespread concern about the safety of such transactions, and recent news stories have uncovered widespread fraudulent activity associated with use of traditional credit card numbers in e-commerce over the Internet. In addition, there is growing concern about consumer privacy, or lack thereof, due to widespread electronic profiling of consumers who make electronic payments.
[0006] Although the media has been quick to cover fraud associated with use of credit cards over the Internet, it is often overlooked, at least by the public and the media (but not the credit card companies), that the majority of fraudulent activity concerning credit cards is not associated with e-commerce activity. Most fraud occurs in the “brick and mortar” world, and the numbers are daunting. Despite many attempts to combat unauthorized or fraudulent use of credit cards, it is estimated that credit card fraud now exceeds hundreds of millions, if not several billion, dollars per year. And this does not even count the cost of inconvenience to consumers, merchants and credit card issuer/providers, or the emotional distress caused to victims of such fraud, or the cost to society in terms of law enforcement and preventative activities.
[0007] Accordingly, there is a very real, long-felt need to reduce the amount of fraudulent activity that is associated with credit cards, and this need has only grown more acute as consumers and commerce search for better ways to purchase and sell goods and services via e-commerce and m-commerce. However, any solution needs to be something that is acceptable to the public at large. It should be easy to use. It should not be complicated or expensive to implement. Preferably, it should fit within the existing infrastructure, and not be something that requires a great deal of educational effort, or a radical change in behavior or habits of consumers. In other words, it should be user friendly, readily understandable and something that does not require a completely new infrastructure, which is a reason suggested by some as to why smart cards have not been widely accepted in the United States.
[0008] In addition, it is highly desirable that any solution to such problems be capable of widespread use, in many different platforms, for many different applications.
[0009] In U.S. Pat. No. 5,956,699 issued in September of 1999, Wong and Anderson were the first to introduce the methodology of a system for secure and anonymous credit card transactions on the Internet. This patent introduced a system which used an algorithm to use one's own selected Personal Identification Number (PIN) as one's own de facto digital signature. The algorithm instructs the cardholder how to insert one's PIN into one's valid credit card number before using it for any transactions on the Internet. The resultant scrambled up credit card number, which is tailored by the algorithm to having the same number of digits as before, is rendered useless on the Internet because the PIN insertion algorithm is changed automatically after every transaction. This methodology is not only capable of drastically reducing credit card fraud on the Internet, it is also capable of safeguarding one's anonymity, and thus privacy, in credit card purchases on the Internet.
[0010] After the issuance of U.S. Pat. No. 5,956,699, Wong et al. also invented an anonymous electronic card for generating personal coupons useful in commercial and security transactions, a method for implementing anonymous credit card transactions using a fictitious account name, as well as methods for generating one-time unique numbers that can be used in credit card transactions in the brick and mortar world, e-commerce, m-commerce and in many other applications.
[0011] The present invention seeks to provide new methods for generating and processing Secure Card Numbers (SCN) that can be used in all types of transactions in which a conventional credit card account number is accepted. In addition, the present invention conforms to the existing standards for PIN encryption as promulgated by the American Bankers Association (ABA), the American National Standards Institute (ANSI), the International Standards Organization (ISO), and the Federal Information Processing Standards (FIPS) Publications of the National Institute of Standards and Technology (NIST). Because the methodology is well suited for use in hardware and software applications, it has widespread applicability to many different types of transactions.
[0012] The present invention is related to the concept of customer one-time unique purchase order numbers (“Coupons”) as described in U.S. Ser. No. 09/640,044. An algorithm is executed that uses a user account number, a customer sequence number, a customer permutated user key, and a Transaction Information Block (TIB) as input variables to form an SCN that is correlated with a sequence number. Combining a user key with a user account number, a user insertion key correlated with the customer sequence number, and then encrypting the result using the Triple Data Encryption Standards (TDES), forms the customer permutated user key. A random number generator generates the user insertion key that is correlated with the sequence number. The TIB may provide several pieces of information, including the conditions under which the SCN will be valid (i.e., the SCN type), additional account indentification information, and the status of the device used for SCN generation. The sequence number can be changed after each SCN is generated and a new SCN can then be generated using a new user insertion variable correlated to the changed sequence number.
[0013] After an SCN is generated, it is transferred with a first entity identifier to a second entity (which can actually be several entities), which then transfers the information to a money source. An individual SCN is verified as being valid by the money source by duplicating the generation of the customer permutated user key for the specified first entity and the specified sequence number, and then comparing it to the customer permutated user key which is embedded in the provided SCN. Additionally, the money source verifies that the specified SCN type is valid given the specific conditions of the transaction. Once verified as valid, each SCN passes through a life cycle in accordance with conventional credit card processing practices and with its SCN type, in which it may be used for various types of transactions before being retired. If a preselected number of SCNs are received by the money source and determined to be invalid (either consecutively or within a predetermined timeframe), then an invalid user account number condition is set to prevent further attempts to verify SCNs for that first entity.
[0014] A user key can be entered into an input device, and validates the user key by comparing it to a stored user key. If the entered user key is valid, the user can generate an SCN. The sequence number changes each time a user key is entered into the input device.
Summary of the Invention
[0015] The present invention is generally directed to a method for providing one or more secure transactions between a first entity and at least one additional entity in which a Secure Card Number (“SCN”) is generated for the first entity, then transferred with a first entity identifier to a second entity and then transferred to a money source that verifies that the transaction is valid by use of the first entity identifier and the SCN. The SCN includes a Transaction Information Block (“TIB”), a Counter Block, and an encrypted Personal Identification Number (“PIN”) Block. The SCN can be transferred to the money source in an account number while the first entity identifier is transferred to the money source in a non-account data field or the first entity identifier can be transferred to the money source as an account number while the SCN is transferred to the money source in a non-account data field.
[0016] In a first, separate aspect of the present invention, the TIB can be used for invoking one or more restrictions on use of the SCN. The money source can use the TIB to determine whether the SCN should be a single-use SCN (i.e., can only be used for a single transaction by the first entity) or a multiple-use SCN (i.e., can be used for multiple transactions between the first entity and a single merchant). The TIB can also be used by the money source to identify the physcial device used to generate the SCN.
[0017] In another, separate aspect of the present invention, the money source validates the SCN by duplicating a PIN Block encryption process used to create the encrypted PIN and by then comparing the result to the encrypted PIN Block received with the transaction.
[0018] In still another, separate aspect of the present invention, the encrypted PIN Block is formed by using a Triple Data Encryption Standard algorithm (“TDES”) to encrypt a PIN Block. The PIN Block can be generated from a PIN associated with the first entity, a Sequence Insertion Number (“SIN”) and a starting value known to both the first entity and to the money source. The SIN can be a combination of a first set of seed values and a random value generated by a Pseudo Random Number Generator (“PRNG”) that was initialized with the first set of seed values. The first set of seed values is associated with a Counter value that is associated with Counter Block.
[0019] In yet another, separate aspect of the present invention, when the SCN is a nine digit number, the TIB is a one digit number, the Counter Block is a four digit number, and the encrypted PIN Block is a four digit number. The encrypted PIN Block can be created by dividing an 8-byte Sequence Insertion Number (“SIN”) into four 2-byte integers (three seed values and the random number), adding the PIN and a pre-assigned constant 4-digit value to each of the four 2-byte integers, concatenating the results to form an 8-byte input block which the TDES encrypts into an 8-byte output block, dividing the 8-byte output block into four 2-byte integers x1, x2, x3 and x4 and then using integers x1–x4 to produce the 4-digit encrypted PIN Block with a value P, wherein P=(Ax1+Bx2+Cx3+Dx4) mod 10000, each of the values A, B, C and D being pre-assigned odd integers.
[0020] Accordingly, it is a primary object of the present invention to provide a method for generating and processing customer Secure Card Numbers for use in transactions where conventional credit card numbers are accepted.
[0021] This and further objects and advantages will be apparent to those skilled in the art in connection with the detailed description of the preferred embodiment set forth below.
Brief Description of the Drawing
[0022] FIG. 1 illustrates a preferred embodiment of the present invention.
Detailed Description of the Preferred Embodiments
[0023] The present invention is related to U.S. Pat. Nos. 5,913,203, 5,937,394 and 5,956,699, the disclosures of which are all specifically incorporated herein by reference.
[0024] The preferred embodiment of the present invention is adapted for use in credit card transactions, and as such can be used in connection with a wide variety of instruments that can be used in connection with such financial transactions: electronic cards, software programs used in network applications, telephones (especially telephones used in what is now being referred to as m-commerce, or mobile commerce), or even physical imprint transactions. Moreover, it can be used whether such transactions are conducted in person, face-to-face, or whether such transactions are conducted by an indirect medium, such as a mail order transaction, a transaction conducted over a computer network (for example, the Internet), or a telephone transaction.
[0025] As is the case in most financial transactions, three parties are typically involved in completed credit card transactions according to the present invention. A party presents a credit card account number with the intent to initiate a monetary payment (or credit/return). In the context of the following description, this is the first entity or customer. Another party receives the credit card account number with the intent to receive a monetary payment (or credit/return), and this party can be a single party or two or more parties. In the context of the following description, the party or parties that are receiving the credit card account number are referred to as the second entity or merchant. Finally, there is at least one party, and usually multiple parties, that serve as intermediaries to the monetary payment (or credit/return). The second entity provides the credit card account number to this party over several transactions to effect the monetary payment (or credit/return): authorization, incremental authorization, authorization reversal, settlement, and credit/return. The intermediary group of one or more parties will be referred to in the context of the following description as a money source. Thus, the money source may be one or more banks, a credit card company or any other institution involved with issuance of credit cards or bank debit cards, such as a credit union or other institution, or a money source as described in U.S. Pat. No. 5,913,203.
[0026] In connection with the preferred embodiment, it is not necessary that the first entity use a real identity, although such an option is also acceptable. Instead, a pseudonym, such as a screen name or an alias, could be used to protect the first entity's privacy and provide additional security.
[0027] Although the first entity need not use a real identity, the first entity must establish an account with a money source. When the account is established, the first entity and the money source must agree upon a payment mechanism or protocol. In the case of a credit card or a bank card, this could be done in the same fashion as exists today, and the first entity could select a fictitious account name as is explained in greater detail in co-pending U.S. patent application Ser. No. 09/619,859. It is especially preferred that two different users not be allowed to select the same fictitious account name so that a fictitious account name also represents a unique identifier. However, the preferred embodiment could also be used in connection with a prepaid account. In such a scenario, the first entity could simply purchase a prepaid card and no real identity would ever be required.
[0028] When the first entity establishes an account with the money source, a user key must be selected. The user key can be a PIN, similar to that which is currently in widespread use in the United States in connection with automated teller machines. Both the first entity and the money source must have access to the user key, which can be selected by either entity. In order to be able to retrieve this user key, the money source must create a record associated with the first entity that includes the user key and a first entity identifier (whether this be the real name of the first entity or a fictitious account name).
[0029] Once the first entity has established an account with the money source and a user key has been selected, the first entity must be supplied with the means to generate a customer SCN. As already described, this could be hardware or software, but in either case it will include a user account number, a customer random number generator that will be used to generate user insertion keys that are correlated with a customer sequence number, and TDES encryption keys.
[0030] The TDES encryption standard is the accepted standard for protecting a PIN during data transmission of financial transactions, as described by ISO 9564-1-1991 (Banking—Personal Identification Number Management and Security—PIN Protection Principles and Techniques, Section 6.2), ISO 9564-2-1991 (Banking—Personal Identification Number Management and Security—Approved Algorithms for PIN Encipherment), ANSI X9.52-1998 (Triple Data Encryption Algorithm—Modes of Operation), and FIPS PUB 46-3 (Data Encryption Standard (DES), dated 1999), the disclosures of which are specifically incorporated herein by reference.
[0031] In order to effectively use TDES for PIN encryption, the PIN must be combined with a new set of randomly generated data for each transaction. Otherwise, the encrypted PIN would always be the same value. A customer random number generator, such as the one that is described in U.S. patent application Ser. No. 09/640,044, filed Aug. 15, 2000 and which is generally known as a Linear Congruential Generator (LCG), is used for this purpose. This random number generator is algorithmic (i.e., pseudo-random)—when starting with the same set of seeds, it always produces the same sequence of numbers. It can therefore be reproduced by the money source in order to validate a given SCN. Furthermore, since this pseudo random number generator generates its values in a reproducible sequence, each of the values in the sequence can be identified by a Counter value that indicates that number's location in the sequence. The set of random numbers generated and combined with the PIN are collectively referred to as the Sequence Insertion Number (SIN).
[0032] In the real world of credit card transactions, it is not possible to assume that transactions conducted by the first entity in a given order will always be received by the money source in that same order. Therefore, the money source method of SCN validation must be based on an embedded sequence value. The Counter value is used for this purpose in the preferred embodiment.
[0033] In general, this method can be used to generate SCNs of many different lengths. In the conventional credit card processing infrastructure, a credit card number is typically 16 digits in length. Such a number comprises three subnumbers: a 6 digit Bank Identification Number (BIN), a 9-digit account number, and a 1-digit checksum number. For the purpose of being compatible with the existing credit card processing infrastructure, the SCN could be 9 digits in length, and could take the place of the account number in the conventional 16-digit credit card number.
[0034] In the preferred embodiment, the 9-digit SCN itself comprises three subnumbers: a 1 digit TIB, a 4 digit Counter Block (which identifies the random number being used for encryption), and a 4 digit encrypted PIN Block.
[0035] The 1 digit TIB may take on up to 10 different values, each of which may indicate multiple pieces of information. The TIB can be used to determine which of a plurality of account numbers associated with the first entity should be used for the first transaction. The account numbers can represent, for example, different credit card accounts or different payment or credit cards. A first account number might be associated with the TIB value of 0, a second account number might be associated with the values of 1 and 2, a third account number might be associated with values of 3 and 4, and so forth, wherein any odd value may be restricted to a one transaction limitation while any even value may be used to invoke permission for multiple transactions at a single merchant. In the preferred embodiment, a TIB value of 0 indicates that the SCN may only be used for one transaction; any attempts to use it for subsequent transactions will result in a transaction denial from the money source. A value of 1 indicates the same transaction restrictions as 0, but also indicates that the device generating the SCN has a low battery power condition. A value of 2 indicates that the SCN may be used for multiple transactions, but only at a single merchant; any attempts to use it for subsequent transactions at a different merchant will result in a transaction denial from the money source. A value of 3 indicates the same transaction restrictions as 1, but also indicates that the device generating the SCN has a low battery power condition. Furthermore, a set of TIB values (4, 5, 6, 7) might represent the same restriction and status information as (0, 1, 2, 3), respectively, but further indicate that the transaction is associated with a different subentity (e.g., the first entity identifier identifies a married couple, and the TIB identifies each individual spouse.) Other values might also be used to enforce additional transaction restrictions in ways readily apparent to those skilled in the art.
[0036] The TIB can also be used by the money source to uniquely identify a physcial device (such as an electronic card) used to generate the SCN. This aspect of the TIB is especially useful when the money source issues more than one card to a first entity. Multiple cards might be issued to the same person (i.e., the first entity) for different uses, or multiple cards might be issued to the same person for use by different individuals (such as family members). In such instances, the TIB can identify which physical card, issued to the first entity, is used for a given transaction. When the TIB is used in this way, the TIB can be used as a customization variable to recognize multiple cards otherwise issued to a single first entity (which might also be a legal entity, such as a corporation).
[0037] The 4-digit Counter Block is unencrypted information provided so that the money source may decrypt and validate the SCN. It may be simply the actual Counter value (incremented after each use), but in the preferred embodiment, it is created by adding the Counter value to a starting value known to both the first entity and to the money source.
[0038] The 4-digit PIN Block is the encrypted information that is used to validate the fact that the SCN originated from the first entity. The PIN Block is formed using the PIN, the SIN, and a starting value known to both the first entity and to the money source. It is encrypted using TDES, which requires use of three 64-bit keys known to both the first entity and to the money source. In order to encrypt such a small number (16 bits) with such a high level of encryption (158 bits), the PIN must first be expanded to a 64 bit number, then encrypted, and finally reduced back to a 16 bit number—and in such a way that it is guaranteed to be different for each transaction.
[0039] The SIN is the product of an LCG random number generator that is initialized with three 2-byte integer seeds—the result of operating the LCG on these seeds is a 2-byte random value. The 8-byte SIN consists of the three seeds plus the random value. As a by-product of its operation, the LCG also produces three new seeds, which will be used for the next iteration of the LCG algorithm. The SIN may therefore be associated with a Counter value that indicates a unique location in the sequence of seeds and value generated by the LCG. This SIN is used as the random basis for each successively TDES-encrypted PIN Block, and guarantees a properly encrypted PIN Block for each transaction. To allow proper validation of the SCN, the Counter value stored in the Counter block is the one associated with the SIN used as the random basis for the PIN Block.
[0040] The creation of the PIN Block starts by dividing the 8-byte SIN into four 2-byte integers. The PIN and a predefined constant value are both added to each individual 2-byte integer. The results are then concatenated back again to form an 8-byte input block to the TDES algorithm, which encrypts them into an 8-byte output block. The output block is then divided back into four 2-byte integers (x1, x2, x3, x4). These four values are then used in the following formula to produce the 4-digit PIN Block value P:
[0041]
In this formula, the four values (A,B,C,D) are each odd integers. The “mod” calculation is a standard modulo arithmetic operation, and works as follows: if the resulting number is greater than 10,000 (or 20,000 or 30,000, etc.), then the value of 10,000 (or 20,000 or 30,000, etc.) is subtracted from it, leaving a positive four digit value.
In this formula, the four values (A,B,C,D) are each odd integers. The “mod” calculation is a standard modulo arithmetic operation, and works as follows: if the resulting number is greater than 10,000 (or 20,000 or 30,000, etc.), then the value of 10,000 (or 20,000 or 30,000, etc.) is subtracted from it, leaving a positive four digit value.
[0042] Once created, the SCN is transmitted along with the first entity identifier from the first entity to the second entity and, subsequently, to the money source. In one embodiment, the SCN is used in an account number that replaces the conventional credit card number, and the first entity identifier is a static 9 digit number pre-assigned to the first entity that is transferred to the money source in a non-account data field. In the case of an electronic swipe credit card transaction, the first entity identifier is dynamically encoded onto Track 1 and/or Track 2 of the magnetic stripe in the area known as the Discretionary Data Field, which comprises up to 13 digits of information. In the case of a transaction where the first entity is not present, such as a mail order, telephone order, or Internet order, the first entity identifier is transmitted as part of the Billing Address field in one of may possible forms. For example, it may be entered as “P.O. Box <first-entity-identifier”.
[0043] In an especially preferred embodiment, the SCN is not used in an account number to replace the conventional credit card number, but is instead used in conjunction with it—the conventional credit card number itself functions as the first entity identifier, and the SCN is used as a dynamic digital signature to positively identify the first entity and is transferred to the money source in a non-account field of data. In this case, the SCN is transmitted either in the Discretionary Data Field of Track 1 and/or Track 2 or via the Billing Address in a card-not-present transaction.
[0044] The Money Source validates the SCN by using the first entity identifier to lookup the information necessary to reproduce the PIN Block encryption for the first entity: the TDES keys, the LCG Seeds, and the PIN. The Money source determines the Counter value by examining the Counter Block, reproduces the calculation of the PIN Block, and then compares the results to the received PIN Block to perform the actual validation.
[0045] The Money Source also validates the usage of the SCN based on the embedded TIB. It therefore enforces the various policies based on the first entity's previous transaction history: single-use, multiple-use for single merchant, card-present only.
[0046] In the embodiment when the SCN is used in an account number in place of the conventional credit card number, it passes through the standard credit card transaction life-cycle: initial authorization, potential incremental authorization, potential authorization reversal, settlement, and potential credit/return. However, in an especially preferred embodiment, the SCN is only used for initial authorization—beyond that, the Money Source performs its standard transaction processing.
[0047] The Money Source may detect fraudulent transaction attempts in various ways. In both the embodiment where the SCN replaces the conventional credit card number, the Money Source may check for re-use of single-use SCNs, use of SCNs without first entity identifiers when the card is not present, re-use of multiple-use/single-merchant SCNs at a different merchant, or SCNs with invalid PIN Blocks. Each of these cases represents a different type of fraud. The Money Source may take various actions in response to each of these types of attacks, such as disabling the account after an excessive number of fraudulent transaction attempts, or returning the code indicating that the merchant should retain the credit card being used for the transaction.
[0048] In the preferred embodiment, the Money Source detects fraudulent authorization attempts such as re-use of single-use SCNs, re-use of multiple-use/single-merchant SCNs at a different merchant, SCNs with invalid PIN Blocks, or use of the conventional credit card number on an SCN-enabled account without inclusion of an SCN when the card is not-present. This last case covers simple Internet fraud attempts, but allows, for example, a manual-entry transaction at a POS machine or an imprint transaction. After detecting fraud attempts, the Money Source may take the same types of actions as described above.
[0049] It should be noted that the preferred embodiment allows the SCN, when paired with a conventional credit card number, to be validated by back-end software that is integrated with the issuing money source's authorization and settlement processing. An issuing money source can identify an SCN-enabled credit card account in an issuer-determined fashion (e.g., a unique Bank Identification Number). It then forwards select transaction information to the SCN-enabling software, which is installed behind the issuing money source's firewall, which validates the SCN. This means that software generating the SCN can be allowed operate in isolation—it does not have to be in communication with the back-end software—and thus it can be embedded in a credit card or other standalone device.
[0050] The inventions described above can be implemented by a money source for use with an electronic card. It is preferable that every user account utilizes the same Pseudo Random Number Generator (PRNG), such as the PRNG described in P. L'Ecuyer, “Efficient and Portable Combined Random Number Generators”, Communications of the ACM, 31(6):742-749,774, 1988, the disclosure of which is specifically incorporated herein by reference. However, each cardholder account has a different initial seed, and thus uses a different part of the PRNG sequence. Since the PRNG has an overall period of 1012, there is ample room for each account to have its own non-repeating subsequence of 10,000 values.
[0051] The PRNG is divided into two parts: seed generation (Formula 2) and value calculation (Formula 3). In these formulas (expressed using C code fragments), the set (Sx0, Sx1, Sx2) is a triplet of five-digit values in the range ([1,32362], [1,31726], [1,31656])), and represents the seed in the xth location in the sequence. Z is interim storage for the pseudo random number, and PRNG[x] indicates the pseudo random number in the xth location in the sequence. Note that for the practical usage of this algorithm, “x” corresponds to the current Counter value. For each transaction, Formula 2 generates the seed (based on the previous seed) and Formula 3 generates the PRNG value.
[0052]
[0053] In all cases, the initial PRNG seed (which generates value 0 in the PRNG sequence) is pre-assigned to the card. Additionally, the most recently used seed is stored in Random Access Memory (RAM). Thus, when an SCN must be generated, the card runs through both Formulas 2 and 3 exactly once, and then updates the seed storage in RAM. The Counter value is also stored in RAM, and is initialized to the value of 1 at the time the card is manufactured. Multiple values of the Counter are stored to detect accidental corruption. Each time an SCN is generated, the current value of the Counter is used. The Counter is then incremented by 1, and stored again for the next use.
[0054] Since the SCN is calculated in an algorithmic fashion, it is possible to precalculate the values for a given first entity, and store them on an electronic card. This embodiment is most useful where it is more advantageous to store a large amount of data on the electronic card than it is to perform the algorithms discussed above.
[0055] Use of the SCN technology described herein is secure when it requires the cardholder to enter a PIN in order to generate a unique SCN that is valid for only one transaction, and for only the specified cardholder. At no time during the transaction is the PIN at risk. By utilizing both encryption and random number generation technologies described herein, it is possible to achieve at least a 99.9% level of protection against fraud.
[0056] Although the foregoing detailed description is illustrative of preferred embodiments of the present invention, it is to be understood that additional embodiments thereof will be obvious to those skilled in the art. For example, the same inventive concepts disclosed herein could be used in a system in which a customer has two or more account numbers and/or identities, with the same or different user keys. In the case of an electronic card or telephone, this would allow the customer to select which account should be used (for example, to choose a business credit card for use with a business expense, a personal credit card for use with a personal expense, or a bank card at a local store for groceries and cash back). Alternatively, a customer might be permitted to use multiple user keys for the same account number and the same identity. This could allow some of the same functionality, or it could be used to classify the type or nature of the expense or transaction. Furthermore, the same SCN concept can be easily extended to non-financial transactions where user authentication is required, such as with electronic Identification cards. Further modifications are also possible in alternative embodiments without departing from the inventive concept.
[0057] Accordingly, it will be readily apparent to those skilled in the art that still further changes and modifications in the actual concepts described herein can readily be made without departing from the spirit and scope of the disclosed inventions as defined by the following claims.
Claims
What is claimed is:
1. A method for providing one or more secure transactions between a first entity and at least one additional entity, comprising the steps of:
(1) generating a Secure Card Number (“SCN”) for the first entity, wherein the SCN is comprised of:
(a) a Transaction Information Block (“TIB”);
(b) a Counter Block; and
(c) an encrypted Personal Identification Number (“PIN”) Block;
(2) transferring the SCN and a first entity identifier to a second entity in a first transaction;
(3) transferring the SCN and the first entity identifier from the second entity to a money source; and
(4) verifying that the first transaction is valid with the money source by use of the first entity identifier and the SCN.
2. A method as recited in claim 1, wherein the SCN is transferred to the money source in an account number and the first entity identifier is transferred to the money source in a non-account data field.
3. A method as recited in claim 1, wherein the first entity identifier is transferred to the money source as an account number and the SCN is transferred to the money source in a non-account data field.
4. A method as recited in claim 3, wherein the TIB is used for invoking one or more restrictions on use of the SCN.
5. A method as recited in claim 4, wherein the TIB is used by the money source to determine whether the SCN is a single-use SCN or a multiple-use SCN.
6. A method as recited in claim 5, wherein the TIB is used by the money source to identify a physical device used to generate the SCN.
7. A method as recited in claim 6, wherein the encrypted PIN Block is formed by using a Triple Data Encryption Standard algorithm (“TDES”) to encrypt a PIN Block.
8. A device as recited in claim 7, wherein the PIN Block is generated from a PIN associated with the first entity, a Sequence Insertion Number (“SIN”) and a starting value known to both the first entity and to the money source.
9. A method as recited in claim 8, wherein the SIN is a combination of a first set of seed values and a random value generated by a Pseudo Random Number Generator (“PRNG”) that was initialized with the first set of seed values.
10. A method as recited in claim 9, wherein the first set of seed values consists of three seed values.
11. A method as recited in claim 10, wherein the first set of seed values is associated with a Counter value.
12. A method as recited in claim 11, wherein the Counter Block is associated with the Counter value.
13. A method as recited in claim 12, wherein the money source validates the SCN by duplicating a PIN Block encryption process used to create the encrypted PIN and by then comparing the result to the encrypted PIN Block received with the first transaction.
14. A method as recited in claim 13, wherein the SCN is a nine digit number, the SCN Type is a one digit number, the Counter Block is a four digit number, and the encrypted PIN Block is a four digit number.
15. A method as recited in claim 14, wherein the encrypted PIN Block is created by dividing an 8-byte Sequence Insertion Number (“SIN”) into four 2-byte integers, adding the PIN and a pre-assigned constant 4-digit value to each of the four 2-byte integers, concatenating the results to form an 8-byte input block which the TDES encrypts into an 8-byte output block, dividing the 8-byte output block into four 2-byte integers x1, x2, x3 and x4 and then using integers x1–x4 in Formula 1 to produce the 4-digit encrypted PIN Block with a value P, wherein Formula 1 is P=(Ax1+Bx2+Cx3+Dx4) mod 10000, each of the values A, B, C and D being pre-assigned odd integers.
16. A method as recited in claim 15, wherein each of the three seed values and the random value is a 2-byte integer.
17. A method as recited in claim 16, wherein an electronic card generates the SCN.
18. A method as recited in claim 16, wherein a PIN is entered into an input device to generate the SCN.
19. A method as recited in claim 18, wherein the SCN and first entity identifier are transferred to the second entity in a form.
20. A method as recited in claim 19, wherein the SCN is transmitted through an Address Verification System Billing Address.
21. A method as recited in claim 20, wherein a unique SCN is assigned to each first entity which is valid only for mail order, telephone order, or internet transactions, and which is used for multiple transactions with multiple merchants.
22. A method as recited in claim 21, wherein the second entity uses the SCN to authenticate the first entity.
23. A method for providing one or more secure transactions between a first entity and at least one additional entity, comprising the steps of:
(1) using an electronic card to generate a Secure Card Number (“SCN”) for the first entity, wherein the SCN is comprised of:
(a) a Transaction Information Block (“TIB”);
(b) a Counter Block; and
(c) an encrypted Personal Identification Number (“PIN”) Block;
(2) transferring the SCN and a first entity identifier to a second entity in a first transaction;
(3) transferring the SCN and the first entity identifier from the second entity to a money source; and
(4) verifying that the first transaction is valid with the money source by use of the first entity identifier and the SCN;
wherein the TIB is used for invoking one or more restrictions on use of the SCN; and
wherein the SCN is transferred to the money source in an account number and the first entity identifier is transferred to the money source in a non-account data field.
24. A method for providing one or more secure transactions between a first entity and at least one additional entity, comprising the steps of:
(1) using an electronic card to generate a Secure Card Number (“SCN”) for the first entity, wherein the SCN is comprised of:
(a) a Transaction Information Block (“TIB”);
(b) a Counter Block; and
(c) an encrypted Personal Identification Number (“PIN”) Block;
(2) transferring the SCN and a first entity identifier to a second entity in a first transaction;
(3) transferring the SCN and the first entity identifier from the second entity to a money source; and
(4) verifying that the first transaction is valid with the money source by use of the first entity identifier and the SCN;
wherein the TIB is used for invoking one or more restrictions on use of the SCN; and
wherein the SCN is readable by a magnetic card reader.
25. A method as recited in claim 24, wherein the SCN is readable from either a Track 1 or a Track 2 of the electronic card.
26. A method for providing one or more secure transactions between a first entity and at least one additional entity, comprising the steps of:
(1) using an electronic card to generate a Secure Card Number (“SCN”) for the first entity, wherein the SCN is comprised of:
(a) a Transaction Information Block (“TIB”);
(b) a Counter Block; and
(c) an encrypted Personal Identification Number (“PIN”) Block;
(2) transferring the SCN and a first entity identifier to a second entity in a first transaction;
(3) transferring the SCN and the first entity identifier from the second entity to a money source; and
(4) verifying that the first transaction is valid with the money source by use of the first entity identifier and the SCN;
wherein the TIB is used for invoking one or more restrictions on use of the SCN; and
wherein the TIB is used by the money source to determine which of a plurality of account numbers associated with the first entity should be used for the first transaction.
27. A method for providing a secure transaction between a first entity and a second entity comprising:
(1) generating a Secure Card Number (“SCN”) for the first entity, wherein the SCN comprises a dynamic digital signature;
(2) transferring the SCN in a non-account data field and a first entity identifier in an account data field to a second entity in a first transaction;
(3) transferring the SCN and the first entity identifier from the second entity to a money source; and
(4) verifying that the first transaction is valid with the money source by use of the first entity identifier and the SCN.
28. A method as recited in claim 27, wherein the first entity identifier is transferred to the money source as an account number.
29. A method as recited in claim 27, wherein the dynamic digital signature is formed by using a Triple Data Encryption Standard algorithm (“TDES”).
30. A method as recited in claim 27, wherein the dynamic digital signature comprises an encrypted PIN.
31. A method as recited in claim 27, wherein the dynamic digital signature is, at least in part, encrypted, and wherein the money source validates the SCN by duplicating a dynamic digital signature encryption process and by then comparing the result to the dynamic digital signature received with the first transaction.
32. A method as recited in claim 27, wherein an electronic card generates the SCN.
33. A method as recited in claim 27, wherein a PIN is entered into an input device as a part of the generation of the SCN.
34. A method as recited in claim 27, wherein a unique SCN is assigned to each first entity which is valid only for mail order, telephone order, or internet transactions, and which is used for multiple transactions with multiple merchants.
35. A method as recited in claim 27, wherein the second entity uses the SCN to authenticate the first entity.
Patent Citations (174)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US3665161(A) | 1972-05-01 | Oberhart | Applicant |
| US3845277(A) | 1974-10-01 | Voss et al. | Applicant |
| US4016405(A) | 1977-04-01 | McCune et al. | Applicant |
| US4102493(A) | 1978-07-01 | Moreno | Applicant |
| US4214230(A) | 1980-07-01 | Fak et al. | Examiner |
| US4234932(A) | 1980-11-01 | Gorgens | Applicant |
| US4253017(A) | 1981-02-01 | Whitehead | Applicant |
| US4314352(A) | 1982-02-01 | Fought | Applicant |
| US4390968(A) | 1983-06-01 | Hennessy et al. | Applicant |
| US4437130(A) | 1984-03-01 | Hennessy et al. | Applicant |
| US4438326(A) | 1984-03-01 | Uchida | Applicant |
| US4443027(A) | 1984-04-01 | McNeely et al. | Applicant |
| US4458142(A) | 1984-07-01 | Bernstein | Applicant |
| US4614861(A) | 1986-09-01 | Pavlov et al. | Applicant |
| US4634845(A) | 1987-01-01 | Hale et al. | Applicant |
| US4650978(A) | 1987-03-01 | Hudson et al. | Applicant |
| US4679236(A) | 1987-07-01 | Davies | Applicant |
| US4689478(A) | 1987-08-01 | Hale et al. | Applicant |
| US4701601(A) | 1987-10-01 | Francini et al. | Applicant |
| US4707594(A) | 1987-11-01 | Roth | Applicant |
| US4742351(A) | 1988-05-01 | Suzuki | Applicant |
| US4755940(A) | 1988-07-01 | Brachtl et al. | Applicant |
| US4772782(A) | 1988-09-01 | Nonat | Applicant |
| US4791283(A) | 1988-12-01 | Burkhardt | Applicant |
| US4837822(A) | 1989-06-01 | Crosley et al. | Applicant |
| US4849613(A) | 1989-07-01 | Eisele | Applicant |
| US4868376(A) | 1989-09-01 | Lessin et al. | Applicant |
| US4918631(A) | 1990-04-01 | Hara et al. | Applicant |
| US4926480(A) | 1990-05-01 | Chaum | Applicant |
| US4928001(A) | 1990-05-01 | Masada | Applicant |
| US4959788(A) | 1990-09-01 | Nagata et al. | Applicant |
| US4960982(A) | 1990-10-01 | Takahira | Applicant |
| US4990759(A) | 1991-02-01 | Gloton et al. | Applicant |
| US5130519(A) | 1992-07-01 | Bush et al. | Applicant |
| US5168520(A) | 1992-12-01 | Weiss | Applicant |
| US5192947(A) | 1993-03-01 | Neustein | Applicant |
| US5220501(A) | 1993-06-01 | Lawlor et al. | Applicant |
| US5317636(A) | 1994-05-01 | Vizcaino | Applicant |
| US5371797(A) | 1994-12-01 | Bocinsky, Jr. | Applicant |
| US5373558(A) | 1994-12-01 | Chaum | Applicant |
| US5375037(A) | 1994-12-01 | Le Roux | Applicant |
| US5412192(A) | 1995-05-01 | Hoss | Applicant |
| US5426283(A) | 1995-06-01 | Berthozat et al. | Applicant |
| US5434398(A) | 1995-07-01 | Goldberg | Applicant |
| US5434919(A) | 1995-07-01 | Chaum | Applicant |
| US5438186(A) | 1995-08-01 | Nair et al. | Applicant |
| US5440108(A) | 1995-08-01 | Tran et al. | Applicant |
| US5444616(A) | 1995-08-01 | Nair et al. | Applicant |
| US5448047(A) | 1995-09-01 | Nair et al. | Applicant |
| US5455407(A) | 1995-10-01 | Rosen | Applicant |
| US5471045(A) | 1995-11-01 | Geronimi | Applicant |
| US5473690(A) | 1995-12-01 | Grimonprez et al. | Applicant |
| US5497411(A) | 1996-03-01 | Pellerin | Applicant |
| US5538442(A) | 1996-07-01 | Okada | Applicant |
| US5557518(A) | 1996-09-01 | Rosen | Applicant |
| US5568121(A) | 1996-10-01 | Lamensdorf | Applicant |
| US5578808(A) | 1996-11-01 | Taylor | Applicant |
| US5585787(A) | 1996-12-01 | Wallerstein | Applicant |
| US5590038(A) | 1996-12-01 | Pitroda | Applicant |
| US5590197(A) | 1996-12-01 | Chen et al. | Applicant |
| US5623552(A) | 1997-04-01 | Lane | Applicant |
| US5627355(A) | 1997-05-01 | Rahman et al. | Applicant |
| US5655008(A) | 1997-08-01 | Futch et al. | Applicant |
| US5671280(A) | 1997-09-01 | Rosen | Applicant |
| US5689247(A) | 1997-11-01 | Welner | Applicant |
| US5745555(A) | 1998-04-01 | Mark | Applicant |
| US5754652(A) | 1998-05-01 | Wilfong | Applicant |
| US5754653(A) | 1998-05-01 | Canfield | Applicant |
| US5754656(A) | 1998-05-01 | Nishioka et al. | Applicant |
| US5761309(A) | 1998-06-01 | Ohashi et al. | Applicant |
| US5790677(A) | 1998-08-01 | Fox et al. | Applicant |
| US5818030(A) | 1998-10-01 | Reyes | Applicant |
| US5825871(A) | 1998-10-01 | Mark | Applicant |
| US5831862(A) | 1998-11-01 | Hetrick et al. | Applicant |
| US5834747(A) | 1998-11-01 | Cooper | Applicant |
| US5834756(A) | 1998-11-01 | Gutman et al. | Applicant |
| US5844497(A) | 1998-12-01 | Gray | Applicant |
| US5850442(A) | 1998-12-01 | Muftic | Applicant |
| US5883810(A) | 1999-03-01 | Franklin et al. | Applicant |
| US5884271(A) | 1999-03-01 | Pitroda | Applicant |
| US5905246(A) | 1999-05-01 | Fajkowski | Applicant |
| US5913203(A) | 1999-06-01 | Wong et al. | Applicant |
| US5915226(A) | 1999-06-01 | Martineau | Applicant |
| US5917168(A) | 1999-06-01 | Nakamura et al. | Applicant |
| US5936226(A) | 1999-08-01 | Aucsmith | Applicant |
| US5936541(A) | 1999-08-01 | Stambler | Applicant |
| US5937394(A) | 1999-08-01 | Wong et al. | Applicant |
| US5940511(A) | 1999-08-01 | Wilfong | Applicant |
| US5953710(A) | 1999-09-01 | Fleming | Applicant |
| US5955961(A) | 1999-09-01 | Wallerstein | Applicant |
| US5956699(A) | 1999-09-01 | Wong et al. | Applicant |
| US5991412(A) | 1999-11-01 | Wissenburgh et al. | Applicant |
| US6000832(A) | 1999-12-01 | Franklin et al. | Examiner |
| US6003763(A) | 1999-12-01 | Gallagher et al. | Applicant |
| US6012634(A) | 2000-01-01 | Brogan et al. | Applicant |
| US6012636(A) | 2000-01-01 | Smith | Applicant |
| US6018717(A) | 2000-01-01 | Lee et al. | Applicant |
| US6024288(A) | 2000-02-01 | Gottlich et al. | Applicant |
| US6029150(A) | 2000-02-01 | Kravitz | Applicant |
| US6029890(A) | 2000-02-01 | Austin | Applicant |
| US6032134(A) | 2000-02-01 | Weissman | Applicant |
| US6038492(A) | 2000-03-01 | Nichols et al. | Applicant |
| US6047268(A) | 2000-04-01 | Bartoli et al. | Applicant |
| US6050493(A) | 2000-04-01 | Fertig | Applicant |
| US6068184(A) | 2000-05-01 | Barnett | Applicant |
| US6068192(A) | 2000-05-01 | McCabe et al. | Applicant |
| US6072870(A) | 2000-06-01 | Nguyen et al. | Applicant |
| US6075861(A) | 2000-06-01 | Miller, II | Applicant |
| US6078888(A) | 2000-06-01 | Johnson, Jr. | Applicant |
| US6078902(A) | 2000-06-01 | Schenkler | Applicant |
| US6089451(A) | 2000-07-01 | Krause | Applicant |
| US6098053(A) | 2000-08-01 | Slater | Applicant |
| US6101477(A) | 2000-08-01 | Hohle et al. | Applicant |
| US6111953(A) | 2000-08-01 | Walker et al. | Applicant |
| US6122625(A) | 2000-09-01 | Rosen | Applicant |
| US6132799(A) | 2000-10-01 | Corniglion et al. | Applicant |
| US6163771(A) | 2000-12-01 | Walker et al. | Applicant |
| USD436620(S) | 2001-01-01 | Webb et al. | Applicant |
| US6188309(B1) | 2001-02-01 | Levine | Applicant |
| US6205436(B1) | 2001-03-01 | Rosen | Applicant |
| US6206293(B1) | 2001-03-01 | Gutman et al. | Applicant |
| USRE37122(E) | 2001-04-01 | Levine et al. | Applicant |
| US6213403(B1) | 2001-04-01 | Bates, III | Applicant |
| US6215665(B1) | 2001-04-01 | Martin | Applicant |
| US6224109(B1) | 2001-05-01 | Yang | Applicant |
| US6227447(B1) | 2001-05-01 | Campisano | Applicant |
| US6230977(B1) | 2001-05-01 | Johnson | Applicant |
| US6257486(B1) | 2001-07-01 | Teicher et al. | Applicant |
| US6327578(B1) | 2001-12-01 | Linehan | Applicant |
| US6332134(B1) | 2001-12-01 | Foster | Applicant |
| US6339766(B1) | 2002-01-01 | Gephart | Applicant |
| US6343284(B1) | 2002-01-01 | Ishikawa et al. | Applicant |
| US6394343(B1) | 2002-05-01 | Berg et al. | Applicant |
| US6425523(B1) | 2002-07-01 | Shem-Ur et al. | Examiner |
| US6518927(B2) | 2003-02-01 | Schremmer et al. | Applicant |
| US6574730(B1) | 2003-06-01 | Bissell et al. | Applicant |
| US6607127(B2) | 2003-08-01 | Wong | Examiner |
| US6636833(B1) | 2003-10-01 | Flitcroft et al. | Applicant |
| US6805288(B2) | 2004-10-01 | Routhenstein et al. | Examiner |
| US6834270(B1) | 2004-12-01 | Pagani et al. | Examiner |
| US6915279(B2) | 2005-07-01 | Hogan et al. | Applicant |
| US6990470(B2) | 2006-01-01 | Hogan et al. | Applicant |
| US7058611(B2) | 2006-06-01 | Kranzley et al. | Applicant |
| US2001/0034720(A1) | 2001-10-01 | Armes | Applicant |
| US2001/0047335(A1) | 2001-11-01 | Arndt et al. | Examiner |
| US2002/0035548(A1) | 2002-03-01 | Hogan et al. | Applicant |
| US2002/0083010(A1) | 2002-06-01 | Kim | Applicant |
| US2002/0120584(A1) | 2002-08-01 | Hogan et al. | Applicant |
| US2003/0120615(A1) | 2003-06-01 | Kuo | Applicant |
| AU732877 | 1998-12-01 | Applicant | |
| EP661675(A2) | 1995-07-01 | Applicant | |
| EP722241(A2) | 1996-07-01 | Applicant | |
| EP1017030 | 2000-07-01 | Applicant | |
| EP1028401 | 2000-08-01 | Applicant | |
| JP355143679(A) | 1980-11-01 | Applicant | |
| JP402148374(A) | 1990-06-01 | Applicant | |
| JP405040864(A) | 1993-02-01 | Applicant | |
| WO92/16913 | 1992-10-01 | Applicant | |
| WO99/05633 | 1999-02-01 | Applicant | |
| WO99/38129 | 1999-07-01 | Applicant | |
| WO99/49424 | 1999-09-01 | Applicant | |
| WO99/57675 | 1999-11-01 | Applicant | |
| WO/25262 | 2000-05-01 | Applicant | |
| WO/30048 | 2000-05-01 | Applicant | |
| WO/33497 | 2000-06-01 | Applicant | |
| WO/49586 | 2000-08-01 | Applicant | |
| WO/52900 | 2000-09-01 | Applicant | |
| WO/54208 | 2000-09-01 | Applicant | |
| WO1/46902(A1) | 2001-06-01 | Applicant | |
| WO1/50429(A1) | 2001-07-01 | Applicant | |
| WO1/54082(A1) | 2001-07-01 | Applicant | |
| WO1/69556 | 2001-09-01 | Applicant | |
| WO1/71675 | 2001-09-01 | Applicant | |
| WO1/78024 | 2001-10-01 | Applicant |
Non-Patent Literature (13)
- Hogan et al. U.S. Appl. No. 60/280,776, entitled “Improved System and Method for Secure Payment Application (SPA) and Universal Cardholder Authentication,” filed on Apr. 2, 2001.Applicant
- Hogan et al U.S. Appl No. 60/255168, entitled “Method and System for Conducting Secure Electronic Commerce Transactions,” filed on Aug. 14, 2000.Applicant
- Hogan et al U.S. Appl. No. 60/226,227, entitled “Method and System for Conducting Secure MasterCard Payments Over a Computer Network,” filed on Aug. 18, 2000.Applicant
- Hogan et al U.S. Appl. No. 60/213,063, entitled “An Improved Method and System for Conducting Secure Payments Over a Computer Network,” filed on Jun. 21, 2000.Applicant
- Hogan et al U.S. Appl. No. 09/809,367, entitled “Method and System for Secure Payments Over a Computer Network,” filed on Mar. 15, 2001.Applicant
- Hogan et al U.S. Appl. No. 60/195,963, entitled “Method and System for Conducting Secure Payments Over a Computer Network,” filed on Apr. 11, 2000.Applicant
- Hogan et al. U.S. Appl. No. 60/274,785, entitled “System and Method for Secure Payment Application (SPA) and Universal Cardholder Authentication,” filed on Mar. 9, 2001.Applicant
- Hogan et al. U.S. Appl. No. 60/295,630, entitled “Method and Process for a Secure Payment Application Using a Universal Cardholder Authentication Field,” field on Jun. 4, 2001.Applicant
- Hogan et al. U.S. Appl. No. 60/307,575, entitled “Method and System for Conducting Transactions Over a Communication Network Using a Secure Payment Application,”filed on Jul. 24, 2001.Applicant
- Hogan et al. U.S. Appl., entitled “Method and System for Conducting Secure Electronic Commerce Transactions,” filed on Jun. 22, 2000.Applicant
- Hogan, USPTO File Wrapper March 2006 update for U.S. Appl. No. 09/833,049.Applicant
- EMV '96 Integrated Circuit Card Application Specification for Payment Systems, Version 3.1.1 (May 31, 1998).Applicant
- ISO/IEC JTC 1/SC 27 Information Technology - Security Techniques (May 10, 1999).Applicant