Systems and methods for multifactor authentication

Information

  • Patent Grant
  • 10726417
  • Patent Number
    10,726,417
  • Date Filed
    Tuesday, September 18, 2012
    11 years ago
  • Date Issued
    Tuesday, July 28, 2020
    3 years ago
Abstract
The invention provides an authentication system and method. In particular, the invention provides a method for performing a financial authentication utilizing a token associated with a user, the method comprising the token generating a set of display characters that are viewable by the user, the token generating the display characters using logic; the user transforming a portion of the set of display characters using a transformation process, based on knowledge of the user, so as to form a display character sequence; the user outputting the display character sequence to an authentication entity; and the authentication entity authenticating the display character sequence using the logic and knowledge of the transformation.
Description
BACKGROUND OF THE INVENTION

Authenticating people, particularly remotely, has been a difficult operation to make resistant to attack. Since single authenticating techniques are vulnerable to theft, it has become attractive to various groups to devise ways to do multi factor authentication, where more than one of (something you have, something you know, something you are) is used in demonstrating the identity of a person whose identity is to be established.


Typically, doing this has involved using relatively complex or expensive devices such as cards with keyboards on them (where you authenticate to the card and then use it), fingerprint readers, or digital certificates requiring public/private encryption to validate the presenter is in possession both of a password and of a private key.


All this complexity has delayed widespread use of such systems, since the cost of giving out hundreds of millions of copies of them has been kept high by the need to authenticate two or more things, and the cost of building the system components.


SUMMARY AND BRIEF DESCRIPTION OF THE INVENTION

The invention provides an authentication system and method. In particular, the invention provides a method for performing a financial authentication utilizing a token associated with a user, the method comprising the token generating a set of display characters that are viewable by the user, the token generating the display characters using logic; the user transforming a portion of the set of display characters using a transformation process, based on knowledge of the user, so as to form a display character sequence; the user outputting the display character sequence to an authentication entity; and the authentication entity authenticating the display character sequence using the logic and knowledge of the transformation.





BRIEF DESCRIPTION OF THE DRAWINGS

The present invention can be more fully understood by reading the following detailed description together with the accompanying drawings, in which any like reference indicators are used to designate like elements, and in which:



FIG. 1 is a diagram showing aspects of an encryption process in accordance with one embodiment of the invention;



FIG. 2 is a flowchart showing further aspects of the encryption process in accordance with one embodiment of the invention;



FIG. 3 is a block diagram showing an authentication system in accordance with one embodiment of the invention;



FIG. 4 is a block diagram showing further details of an authentication system, and in particular the authentication entity system, in accordance with one embodiment of the invention;



FIG. 5 is a diagram showing processing associated with display characters in accordance with one embodiment of the invention;



FIG. 6 is a high level flowchart showing an authentication process in accordance with one embodiment of the invention;



FIG. 7 is a flowchart showing further details of the “customer generates authentication information” step of FIG. 6 in accordance with one embodiment of the invention;



FIG. 8 is a flowchart showing in further detail the “authentication entity system authenticates the billing information, including authenticating the display character sequence” step of FIG. 6 in accordance with one embodiment of the invention;



FIG. 9 is a flowchart showing in further detail the “authenticator character generating portion generates an authorizing character sequence based on the authentication characters” step of FIG. 8 in accordance with one embodiment of the invention;



FIG. 10 is a flowchart showing in further detail the “display character sequence is compared to the authorizing character sequence” step of FIG. 8 in accordance with one embodiment of the invention; and



FIG. 11 is a diagram showing further aspects of an encryption process relating to a purchase amount in accordance with one embodiment of the invention.





DETAILED DESCRIPTION OF THE INVENTION

Hereinafter, various aspects of embodiments of the invention will be described. As used herein, any term in the singular may be interpreted to be in the plural, and alternatively, any term in the plural may be interpreted to be in the singular.


What is proposed here is a system and method which provides a form of two factor authentication which resists theft of the authentication tokens even by someone who can intercept the authentication messages in total, in accordance with one embodiment of the invention. The invention can be supported using relatively very simple hardware.


One embodiment uses a token which displays numbers that change (either with time or with uses, but in ways that cannot be easily predicted by observation) but whose values can be tracked and predicted by an authenticating authority (who issued the tokens generally). In accordance with one embodiment of the invention, the token will display a set of numbers which will have their positions labeled (e.g., 1 through 6, for a 6 digit display). FIG. 1 is a diagram illustrating such a token 100.


In accordance with one embodiment of the invention, a customer will be told ahead of time, “choose three positions of the display 10, as shown in FIG. 1, you will select in order, and remember the positions and order you picked.” The customer authenticates by getting his token to display a new set of numbers (which should change so that their values are effectively unpredictable), and then to report the values in the three positions he chose and told the authenticating authority about earlier.



FIG. 1 shows the display of the token 100 in an “off” position. Once the customer activates the display in some manner, i.e., pushes a button, the token is turned on, and numbers are seen on the display. Thus, as shown in FIG. 1, suppose the display 10 reads:



5
3
7
9
2
1


and the customer decided to report position 5, 1, and 4 in that order. The customer would then transmit the 5th, 1st, and 4th digits in order: 259


Note that this authenticates the customer as an individual since the customer demonstrates that he knows the pattern registered earlier, but also it shows the customer has the token he was given. Thus, at a stroke he has provided a two factor authenticator. Note too that someone who can see the digits sent cannot replay them usefully. That person does not know the pattern, nor does she have the token, and she must have both to use the token successfully.


In accordance with one embodiment of the invention, another set of labels may be provided under the display, like 01, 23, 45, 67, 89. In processing a transaction, the customer is asked, later in a transaction, to encode a few digits of the transaction amount as positions of the display, and then requested to transmit the digits. This too can be easily verified by a payment processor (who has the amount as part of a payment record), and it shows that someone with the token agreed to the payment amount. In effect, this is a signing by the customer (who would have authenticated as an individual moments before with the same token) of the transaction amount. Similarly, any external observer will be unable to deduce any of this from the digits transmitted. The customer may be told what the purchase amount is. Accordingly, for example, if the customer is told the purchase amount was $872.00, the customer would report the characters shown in the position five, position five and position two, i.e., if the display was labeled 0, 1-2, 3-4, 5-6, 7-8, 9.


In further illustration, FIG. 11 shows a token 30 so labeled. In this example, the displayed number is 537921. Accordingly, with a purchase amount of $872, the customer would report the displayed numbers in the positions, 5, 5, 2, i.e., the customer would report the numbers 223. In this manner, an authentication entity can confirm that the customer indeed knows what the customer is agreeing to, e.g., a dollar amount. It is appreciated that such processing adds complexity, but may be desired in some circumstances, e.g., in high dollar transactions. To reduce the complexity, a prompt screen might be provided to the customer so as to take them through the process, e.g., a window on a web page.


It is appreciated that an alternative data manipulation that can be done by the user-customer could be used here instead of the pattern selection described above. That is, the customer does need to manipulate the displayed numbers in some manner known to him (and the authenticating authority) so as to generate an output from such manipulation. However, the selection scheme described above may be desirable since it appears easy to use and remember by the customer


In implementation of the invention, it is not needed that numbers be used on the display. That is, any of a wide variety of graphics, letters, symbols, glyphs, runes, images or other indicia, for example, might be used in lieu (or in combination) with numbers.


It should be appreciated that the various features of the present invention may be used in conjunction with other encryption technology and/or features. In particular, the various features of the present invention may be used in combination with any of the features described in U.S. patent application Ser. No. 10/419,107 filed Apr. 21, 2003, which is incorporated herein by reference in its entirety.


In explanation of further aspects, in accordance with one embodiment of the invention, the problem being addressed is in the area of authentication. Authentication of customers to a bank is vital since the entire business is involved with caring for other peoples' money and using it per their instructions. If the owners cannot be identified, their instructions cannot be followed and the business collapses. When trying to identify people over computer links, this is harder than otherwise. One of the major issues is that spyware and other man in the middle attacks on information passed for authentication are very common. By providing people with a token that can produce an effectively random number which an authority can compute as well, anytime it is needed, people might be able to prove clearly that they have the token. Unfortunately, theft of tokens (even from the mails) is also common. It is desirable in addition to know for high value transactions that one is dealing with the person who claims to be dealing with you rather than knowing only that whoever you are dealing with has the person's token. Moreover, while it is common practice just to ask for another password or PIN (personal identification number), these are all too easily intercepted. The proposed scheme here solves those problems.


Hereinafter, the invention will be described from a further perspective, in accordance with one embodiment. Given that two parties who must authenticate one to the other both have means to generate an effectively random number (which means it is computationally infeasible to compute the next such number from the prior ones without a secret shared by the two) which can nevertheless be generated by both and tracked so that the one doing the authentication can (1) figure out the value the other one has, (2) find some transformation of the number or part of it which can be easily done by hand, and (3) have both parties agree to this transform (which can be thought of as a simple encryption) ahead of time. Now when the one not doing the authentication needs to authenticate the other, make sure they have generated a “random” number and have the one being authenticated perform the agreed on operation and report the value thereof. This may be as simple as picking an order in which to report several of the digits of the random number, as described above. Then, the one doing the authentication performs the same transform on his copy of the random number and checks if the value is correct. Note that anyone observing the numbers picked will see only the random numbers, not the secret method by which they were produced, and thus will have nothing very useful in attempting a replay or PIN theft.


To explain further, the ideas of doing a second encryption, and that of permuting numbers or using a Caesar cipher, are old. However, the scheme here, because it is used with effectively random numbers, is much stronger than a permutation or Caesar cipher or other hand encryption method because of the absence of usable order in the material being encoded. An attacker must solve a cipher on a “plaintext” random number which in general is generated every time needed and used once. This makes it exceedingly difficult for a man in the middle to steal the person's authentication. Also, whatever token system is used to provide the pseudo random numbers and track them or synchronize them needs no additional complexity. This makes the scheme more cost effective than systems using conventional passwords or PINs, digital certificates, and other such complexities.



FIG. 2 is a flowchart in accordance with one embodiment of the invention. As shown, the present invention provides a novel way to authenticate a customer or other person.


The invention might be compared to a known one-time pad. One time pad cryptography is usually illustrated with the pad values being XORed with data. In effect, embodiments of the invention perform an encryption hand operation on display characters displayed by a token. As shown in the example of FIG. 2, if the “random number” choices are changed appropriately, we could produce 3 digit outputs from 000 to 999, i.e., the entire range possible. This means we may have no test possible to pick the correct key as an observer in the middle. This makes the operation the user undertakes (which might be the illustrated permutation or anything else convenient) far stronger than what the same operation on normal text might be. The user operation remains a simple one, but the fact that it operates on one time data which is effectively random makes it basically as strong as the randomness. Where the cipher and key are well chosen which may be used for computing the numbers to be synchronized the resulting ciphertext may be treated as random and the discussion above holds.



FIG. 3 is a block diagram showing an authentication system 100 in accordance with one embodiment of the invention. The authentication system 100 includes a user authentication device 120. The user authentication device 120 may be in the form of a token, for example. The user authentication device 120 provides the user with display characters (for example numbers) 192 (see FIG. 3) that are used by the user to effect an authentication, as discussed below.


As shown in FIG. 3, the user authentication device 120 includes a display character generating portion 124 and a display portion 130. The display portion 130 includes a pluarality of display positions 138, i.e., display positions (131-136). Each display position 138 is a display, i.e., such as an LCD display, that displays a number, or any other character, so as to be visually observed by a user 110, in accordance with one embodiment of the invention.


The display character generating portion 124 generates the characters that are displayed in the display portion 130. In particular, the display character generating portion 124 uses predetermined logic (i.e., a suitable algorithm) to populate the display positions 138. This logic provides a predetermined progression of numbers, or other characters, that may be similarly generated by an authentication entity system 140.


In accordance with one embodiment of the invention, the user authentication device 120 has a button 121, which may be pressed by a user 110. Upon pressing the button 121, the display character generating portion 124 generates the characters that are displayed in the display portion 130. Accordingly, the user 110 interfaces with the user authentication device 120 using the button and visually, in accordance with one embodiment of the invention.


The user authentication device 120 further includes a device memory portion 126. The device memory portion 126 serves as a memory or database, as is needed to perform the various functions of the user authentication device 120.


As shown in FIG. 3, the authentication system 100 also includes an authentication entity system 140 and an illustrative merchant 180. Illustratively, the user 110 (using the user authentication device 120) interfaces with the merchant 180 so as effect a desired transaction. The transaction might be over the telephone, the Internet, or any other communication channel, as desired.


Accordingly, the systems and methods of embodiments of the invention may be used in any “transaction”, including a conveyance of information, in which authentication of a user is needed or desired. Such transaction might include a telephone transaction, Internet transaction (such as an Internet purchase), network transaction, infrared transaction, radio signal transaction, credit card transaction, debit card transaction, smart card transaction, ACH transaction, stock trade transaction, mutual fund transaction, swap, PAYPAL® transaction, BILL ME LATER® transaction, electronic funds transfer transaction, financial application transaction, an arrangement to set up payments to an entity, a verification, an ATM transaction, and/or a message, for example. For example, such a transaction might include a message from one human user to another human user, a human user communicating with an electronic device, and/or two electronic devices communicating with each other. The transaction may or may not be in a financial context, i.e., for example, the message might be authorizing the opening of a door or the transfer of a non-financial related message, for example.


Accordingly, FIG. 3 shows a communication channel 160 over which the transaction is performed. The communication channel 160 carries an authorization request 162. Subsequent to the request being processed by the authentication entity system 140, the communication channel 160 then carries an authorization 164, in the example of FIG. 3. However, it is of course appreciated that the authentication entity system 140 might alternatively not authorize the requested transaction. As shown in FIG. 3, the authorization request 162 and the provided authorization is passed through the merchant 180. However, in an alternative embodiment, the authorization request 162 and/or the authorization provided 164 might be communicated to the authentication entity system 140 in some other manner, such as by some third party, and not via the merchant 180. Further, it is appreciated that the user authentication device 120 need not take on the form of the device shown in FIGS. 1 and 3, for example. That is, for example, the user authentication device 120 might be in the form of a software program running on a computer, or in some other alternative form.



FIG. 4 is a block diagram showing further details of the authentication entity system 140. The authentication entity system 140 includes an input portion 142 and an entity memory portion 144. The input portion 142 interfaces with the communication channel 160 so as to communicate data, i.e., such as the authorization request 162 and the authorization provided 164 information. The entity memory portion 144 serves as a database to store various data associated with, and needed by, operation of the authentication entity system 140.


The authentication entity system 140 also includes an authenticating processing portion 150. The authenticating processing portion 150 performs the various processing of the authentication entity system 140. In particular, the authenticating processing portion 150 includes an authenticator character generating portion 152 and a comparison portion 154. The authenticator character generating portion 152 generates an authorizing character sequence 198 to be used to authenticate the transaction initiated by the user 110. In turn, the comparison portion 154 performs a comparison between the authorizing character sequence 198 (generated by the authenticator character generating portion 152) and the display character sequence 194 (provided by the user-customer).



FIG. 5 is a diagram showing further features in accordance with one embodiment of the invention. Specifically, FIG. 5 shows aspects of the generation and the manipulation of the display characters 192 (generated by the display character generating portion 124) and the authentication characters 196 (generated by the authenticator character generating portion 152). Both the portions (124, 152) use the same logic (i.e., random logic as described above) to generate sets of characters (192, 196) in some predetermined manner. That is, the display character generating portion 124 will generate the same characters as the authenticator character generating portion 152 in a progressive manner. As used herein, the generation of a new set of characters by the portions (124, 152) is characterized as generating the next “logic step”. To explain in other words, the display characters 192 associated with a particular logic step, will be the same as the authentication characters 196, if for the same logic step, in accordance with one embodiment of the invention. Thus, the particular logic step (that each of the display character generating portion 124 and the authenticator character generating portion 152 are at) will dictate the particular set of characters that are generated.


As described in detail herein, once the display characters 192 are generated on the user authentication device 120, the user observes only the particular display positions 138 that the user is assigned, i.e., the user might make this choice upon activation of the user authentication device 120. As described in the example above, the user might have picked the 1, 4 and 5 positions to be the selected positions (from which the user 110 actually uses the characters). The user 110 then orders the select display characters 192 in a predetermined manner. In particular, FIG. 1 described above shows an example of this ordering. Once the selected display characters are ordered, this results in a “display character sequence” 194, as used herein. It is this display character sequence 194 that is submitted to authenticate the desired transaction, in accordance with one embodiment of the invention in which ordering is used as the transformation to the display characters 192.


In a parallel manner to the user 110, the authentication entity system 140 generates authentication characters 196, selects particular authentication characters 196 as agreed upon with the customer, and then orders the selected authentication characters 196. In this manner, the authentication entity system 140 generates a sequence of characters (e.g. a number) that may be compared with the display character sequence 194 (submitted by the user/customer).


It is appreciated that the authentication entity system 140 may perform variations on the above processing methodology. That is, the authentication entity system 140 may not in fact generate all the authentication characters 196, but rather only the select authentication characters 196 that will indeed be used in the ordered set, which constitutes the authorizing character sequence 198. This approach might somewhat limit needed processing since the authentication entity system 140 is of course aware that only select characters in the authentication characters 196 will indeed be used. However, this approach would generally not be performed with the user authentication device 120, since the inclusion of all the display characters 192 (and subsequent disregarding of some of the display characters 192 by the user 110) is part of the encryption process.


In further explanation of the invention, FIG. 6 is a high level flowchart showing an authentication process in accordance with one embodiment of the invention. As shown in FIG. 6, the process starts in step 200. Then, in step 202 in this example, the customer initiates a transaction. In this example, the transaction is with a merchant. After step 202, the process passes to step 204.


In step 204, the merchant requests various information from the customer so as to process the transaction. Accordingly, in step 206, the customer enters item information, i.e., regarding the particular item that the customer is purchasing, and shipping information. It should of course be appreciated that the merchant may request, and the customer may enter, any of a variety of desired information. After step 206 of FIG. 6, the customer prepares billing information. Specifically, in step 210, the customer generates authentication information to accompany the customer's submission of other billing information. Further details of step 210 are described in conjunction with FIG. 7 below.


Then, in step 220 of FIG. 6, the customer enters the billing information including authentication information, i.e., including a display character sequence for use by an authentication entity system in authenticating the transaction. After step 220, the process passes to step 230 of FIG. 6.


In step 230, all the information (item, shipping, billing) that the customer has prepared is sent to the merchant. Then, in step 240, the merchant sends the authentication information on to the authentication entity system, i.e., for authentication of the transaction that the customer is requesting the merchant to process. Then in step 250, the authentication entity system authenticates the billing information, including authenticating the display character sequence that the customer has provided. Further details of step 250 are described below with reference to FIG. 8.


After step 250 of FIG. 6, the process passes to step 280. In step 280, the authentication entity system sends authorization, or alternatively denial, of the transaction back to the merchant. Then, the process passes to step 282. In step 282, the merchant authorizes the transaction if the authentication entity system authenticated the display character sequence. It is appreciated that other authentication processing may accompany the authentication of the customer's display character sequence, i.e., such as authentication of a personal identification number (PIN). That is, in general, the systems and methods of the invention as described herein may be used in conjunction with other security/authentication measures or technologies.


After step 282 of FIG. 6, the process passes to step 284. In step 284, the process of FIG. 6 ends.



FIG. 7 is a flowchart showing further details of the “customer generates authentication information” step 210 of FIG. 6 in accordance with one embodiment of the invention. The subprocess of FIG. 7 starts in step 210 and passes to step 212. In step 212, the customer pushes a button on the user authentication device, which the customer has been provided. In response to the customer pushing the button, or in some other manner interfacing with the user authentication device, in step 214, the user authentication device advances to a next number sequence based on logic contained in the user authentication device (i.e., the user authentication device 120 displays information associated with the next “logic step” as described above). This logic may be in the form of an algorithm that generates a plurality of display characters in some predetermined manner, i.e., in a manner that an authentication entity system 140 may perform a generation of the same numbers based on the same logic.


Accordingly, in step 215 of FIG. 7, the user authentication device displays a number sequence on the display portion, i.e., one number for each display position. However, it is of course appreciated that the invention is not limited to the use of numbers. That is, any suitable character or other indicia might be used in lieu of or in conjunction with numbers.


Then, in step 216, the customer recalls the particular positions that the user is assigned. That is, out of six display positions, the customer only uses three numbers (associated with three display positions) so as to generate a display character sequence. In step 216, the customer further reads the numbers from those particular assigned positions in a particular assigned order.


Accordingly, in step 218, the customer now has a display character sequence to include in the billing information.


After step 218, the process passes to step 219 of FIG. 7. In step 219, the process returns to step 220 of FIG. 6.



FIG. 8 is a flowchart showing in further detail the “authentication entity system authenticates the billing information, including authenticating the display character sequence” step 250 of FIG. 6 in accordance with one embodiment of the invention. The subprocess of FIG. 8 starts in step 250 and passes to step 252.


In step 252 of FIG. 8, the authentication entity system inputs the billing information, including the display character sequence from the customer. Then, in step 253, the authenticator character generating portion (in the authentication entity system) advances to the next logic step, i.e., in parallel to the user authentication device 120. That is, the authenticator character generating portion generates authentication characters based on the same logic as is implemented in the user authentication device. It should be appreciated that some synchronization feature may be used to coordinate the particular step in logic, i.e., in generating the next logic step. After step 253 of FIG. 8, the process passes to step 254.


In step 254, the authenticator character generating portion in the authentication entity system generates an authorizing character sequence based on the authentication characters.


Further details of step 254 are discussed below with reference to FIG. 9. Then, in step 256 of FIG. 8, the display character sequence is compared to the authorizing character sequence. Further details of step 256 are discussed below with reference to FIG. 10. After step 256, the process passes to step 258.


In step 258 of FIG. 8, based on a match or no match, the authentication entity system determines if authorization should be given. Then in step 259 of FIG. 8, the subprocess of FIG. 8 returns to step 280 of FIG. 6.



FIG. 9 is a flowchart showing in further detail the “authenticator character generating portion generates an authorizing character sequence based on the authentication characters” step 254 of FIG. 8 in accordance with one embodiment of the invention. In this illustrative subprocess, after starting in step 254 of FIG. 9, the subprocess passes to step 262. In step 262, the authenticator character generating portion retrieves information regarding particular fixed positions that the user is assigned. Then, the process passes to step 264.


In step 264, the authenticator character generating portion retrieves the authentication characters disposed in such particular fixed positions. This processing is in parallel to the selection of numbers (from the display positions) as is performed by the customer. The, in step 266, the authenticator character generating portion orders the retrieved authentication characters using an order that the user is assigned. As a result, the authenticator character generating portion generates an “authorizing character sequence”, which is to be compared with the “display character sequence” that is provided by the user. As shown in FIG. 9, other transformation processes might be used in lieu of ordering select characters. That is, any suitable transformation, e.g. such as ordering or adding a value of one, might be used to convert a plurality of selected characters (shown on the token display) to a display character sequence.


Thus, as otherwise noted herein, it is appreciated that some other transformation might be used in lieu of the ordering of the display characters 192. For example, numbers might be added, some mathematical transformation may be applied, and/or the same number might be used twice, for example, as well as other variations described herein.


After step 266 of FIG. 9, the process passes to step 268. In step 268, the subprocess of FIG. 9 returns to step 256 of FIG. 8.



FIG. 10 is a flowchart showing in further detail the “display character sequence is compared to the authorizing character sequence” step 256 of FIG. 8 in accordance with one embodiment of the invention. After starting in step 256 of FIG. 10, the subprocess passes to step 272.


In step 272, the authentication entity comparison portion compares: the authorizing character sequence versus the display character sequence (obtained from the customer). After step 272, the process passes to step 274. In step 274, the comparison portion considers any variation between the authorizing character sequence versus the display character sequence based on predetermined thresholds.


In other words, it might be the situation that the display character sequence does not exactly match the authorizing character sequence. However, if the variation is limited, then the variation might be acceptable so that the authentication entity system will still authenticate the transaction. The particulars of what is acceptable and what is not acceptable variation may be based on thresholds, as is desired.


After step 274 of FIG. 10, the process passes to step 276. In step 276, the comparison portion outputs data regarding match or no match back to the merchant. As a result, the merchant will process or not process the desired transaction. Then, in step 278 of FIG. 10, the process returns to step 258 of FIG. 8. Processing then continues as described above with reference to FIG. 8.


In summary, in accordance with one embodiment of the invention, the scheme described herein uses the idea of a remote token synchronized with or tracked with a central authentication database, and uses a cipher as the secret to authenticate the user. The use of the cipher, which may typically be relatively simple, together with the remote token system provides a novel combination in accordance with one embodiment of the invention.


In accordance with embodiments of the invention, the method described herein may be implemented in innumerable different ways, i.e., such as picking different simple ciphers. But there must be local and remote effectively random numbers, in accordance with one embodiment of the invention, so that a simple operation on the numbers can be computed by a person and used to authenticate that the person is the right person to be using the token, rather than simply confirming that the toke is correct.


In summary, the invention relates to the notion of using second encryption with a token that generates changing numbers, so that the second encryption embeds or combines additional information with the token's number, so that authentication depends on both. The additional information might be a pattern or other information remembered by an individual, some parameter (like amount) of a payment or transaction, or any other information it is desired to verify.


The invention further relates to the notion of combining information in such a way that someone who can figure what the token will be generating might use it to reconstruct some information remotely, with no fear of the information being intercepted by man in the middle attacks. For example, this functionality is discussed above in conjunction with using a purchase amount to generate a display character sequence, i.e., using the purchase amount and matching digits (of the purchase amount) with labels under the display positions.


As discussed above, the authentication entity system 140 authenticates a display character sequence that is provided by the customer. In accordance with one embodiment of the invention, the authentication entity system 140 does not allow multiple submissions of a display character sequence. To explain, the multiple submission checking portion 156 (of the authentication entity system 140) may perform a check on a newly submitted display character sequence. This check determines whether the particular display character sequence has been previously submitted, e.g., previously submitted in a particular period of time. If the multiple submission checking portion 156 determines that the particular display character sequence has been previously submitted, the authenticating processing portion 150 will not authenticate the display character sequence. For example, this might occur in the situation when a customer fails to press button 121 (on the user authentication device 120) to generate a new number sequence. That is, a repeat display character sequence (based on the repeat number sequence) will not be authenticated. The check for multiple display character sequences provides a further fraud prevention measure. To effect such checking, it should of course be appreciated that the authenticating processing portion 150 may be provided with the ability to keep track of which display character sequences have been observed.


As described above, in accordance with one embodiment of the invention, the customer pushes a button on the user authentication device 120 and a number sequence is displayed. From the number sequence, the customer selects characters to form the display character sequence. It is appreciated that if the number sequence is all fives, i.e., 5 5 5 5 5 5 (or even 2 2 2 2 4 4), then the particular order that the user has selected will be irrelevant. For this reason, the content of the number sequence displayed on the user authentication device 120 may want to be controlled, i.e., so as to avoid excessive repeat of numbers or other characters.


In accordance with a further aspect of the invention, it is appreciated that it may be needed to synchronize the user authentication device 120 with the authenticating processing portion 150. For example, it might be the situation that the user authentication device 120 has been exposed to multiple presses of the button (e.g., by a child). If the authenticating processing portion 150 receives a display character sequence that does not match with the next generated authorizing character sequence, the authenticating processing portion 150 may “run ahead.”


That is, the authenticating processing portion 150 may run ahead with the authorizing character sequences assuming that there have been presses of the button 121 which were not submitted to the authentication entity system 140. The authenticating processing portion 150 may run ahead some predetermined number of times, until it finds a match, or alternately it reaches the predetermined number of times and concludes the display character sequence should not be authenticated.


Other approaches may be used to synchronize the user authentication device 120 to the authenticating processing portion 150. For example, all the display characters (displayed on the user authentication device 120) may be provided to the authenticating processing portion 150 (in the order that the characters are displayed) so as to perform synchronization. That is, given all the display characters in the displayed order, the authenticating processing portion 150 can then determine the correct point in the progression of the authentication characters.


Alternatively, the customer may provide two sets of display characters or two sets of display character sequences. These two sets, for example, might then be used by the authenticating processing portion 150 to synchronize with the user authentication device 120. i.e., based on the two sets of display characters, the authenticating processing portion 150 could determine where in the progression the user authentication device 120 is disposed.


In accordance with one embodiment of the invention, the user authentication device 120 may be used in multiple manners. For example, a customer may use the authentication device 120 to generate the display character sequence as described above, i.e., by selecting the display characters in a particular order. Such use may be implemented for Internet transactions, for example. However, in one embodiment, the same user authentication device 120 may also be used by submitting all the display characters to the merchant (and in turn the authenticating processing portion 150). A higher exchange rate may be applied to the second use as compared with the exchange rate applied to the first use. For example, such differential in exchange rate might be applied since the second use bears higher risk than the first use. Illustratively, the second use might occur in a situation in which the user authentication device 120 is used in a restaurant, and a person other than the customer is effecting the transaction.


In accordance with a further embodiment of the invention, a single token may be given to a family, or provided to be used in some other situation in which multiple persons will use the same token, i.e., the same user authentication device 120. In this situation, the user authentication device 120 will proceed through a progression of display characters, i.e., upon presses of the button 121. However, different users of the user authentication device 120 will be assigned different display positions to read characters, as well as a different order in which to place those observed characters. Accordingly, for example, if a brother were provided the display character sequence of FIG. 1, the brother will give the 259 number as shown in FIG. 1.


However, if the sister were given the same 537921 display number, the sister might be assigned [position 5] [position 4] [position 1], i.e., and thus her display character sequence would be 295. Such embodiment allows different persons to collectively use the same user authentication device 120, while documenting which person used the user authentication device 120 for which transaction. In other words, each persons might be assigned there own display character sequence. Alternatively, it is of course appreciated that multiple tokens may be used in a single household.


Further, in accordance with one embodiment of the invention, the same person might use the same user authentication device 120, but be assigned different display character sequences for different uses of the user authentication device 120. For example, given a display number of 537921, the single user may be assigned ([position 5] [position 4] [position 1] (display character sequence would be 295)) for effecting financial transaction versus ([position 5] [position 1] [position 4] (display character sequence would be 256)) for opening their garage door.


Relatedly, it is of course appreciated that the systems and methods of the invention as described herein may be used for any of a variety of situations that an authentication procedure is required. For example, the invention may be used for effecting financial transactions, accessing information, opening doors, controlling access to devices (e.g. access to a computer) and/or other situations where an authentication procedure is needed. In particular the invention may be used to prevent fraud in high risk and/or high value transactions, e.g., Internet, telephone and ATM transactions. It is also to be appreciated that the reduced risk of fraud associated with using the invention might typically result in a lower interchange fee, as compared to financial transactions using other known authentication methods.


Further, it is appreciated that the authentication device 120 may take any of a variety of forms and/or be combined with other devices. For example, the user authentication device 120 may be used or combined with a cellular phone, a PDA, an RFID device, and/or other devices. For example, it should be appreciated that the display character sequence, as described herein, may be used in the place of a traditional PIN (personal identification number). Accordingly, the display character sequence might be used in an ATM transaction. Such might be used to prevent ATM Fraud.


Hereinafter, various embodiments and aspects of embodiments will be described.


In one embodiment, the invention herein described is a method by which token authentication can be incorporated in payment systems with very minor changes at issuer sites and using mainly existing merchant facilities. The method may use a token which will generate a display of numbers which changes either with time or with uses—and whose values are unpredictable to the external observer who has not complete information about the internal (hidden) mechanisms, i.e., processing.


One aspect of the invention is the use of the display of such a token or the use of a function or selection from that display (the selection or function being done by the customer as something he remembers) as an authenticator reported instead of the existing CVV2 or CVC2 (or equivalent for other card brands) card authenticator string. The CVV2 field is normally printed on the back of payment cards and is often asked for in phone or net transactions. Its value is checked mainly by the card issuer. The checking routine described herein can easily be adapted to check the correctness of the token-derived numbers for that particular token. Accordingly, this field is already present, it is already handled by payment networks. Thus, the use of the display character sequence (in lieu of the CVV2 or CVC2) presents few problems either for merchant expense or network changes and only very minor expense for the issuer.


As noted above, a further aspect relating to one embodiment of the invention is the use of a token display in place of PIN values. Facilities for entering PIN values already are widespread anywhere payment cards exist, and a replacement for a PIN value where the replacement changes (and especially one which depends on the token the customer has and on the selection pattern he knows) gives a much stronger authentication of the customer than a fixed PIN. Using this replacement may require no new network or merchant changes, and as PINs are checked by issuer only, the changes to issuer system would be basically limited to the PIN validation routines, which are well known and can be readily added to, i.e., so that issuer would validate the display character sequence, as opposed to a PIN.


Accordingly, in summary, it is noted that the display from a token with a display of variable numbers, or a function or permutation or selection from that display, may be used as an authenticator instead of CVV2 or CVC2 in credit card processing. Further, the display from such a card, or a permutation or selection from such a display, might be used instead of a PIN in card transactions or the logical equivalent thereof.


As described above, when a customer pushes the button on the token, e.g., the button 121 on the user authentication device 120, the display will show some numbers. In one embodiment, two digits display the least significant digits of an internal counter and 3 to 6 digits (preferably 6) display part of the result of encrypting the internal counter using an encryption key which is hidden within the card, and which may different for every card, i.e., the key should be different enough that anyone analyzing the innards of a card cannot compute the key for a different card even though he may know the complete keys of several other cards. Values may be supplied for these “diversified keys”. In one embodiment, the encryption algorithm used may be a “strong” crypto algorithm, as strong as triple DES or better, but may depend on the particular use.


In one embodiment, when the button 121 is pressed, the idea is that the internal counter increments, and the Bank tracks its value, with the aid of the 2 digit low order display. It may be acceptable if the display is in octal radix instead of decimal if cost effective. The display needs to be visible either while the button is pressed, or for an interval after the button is pressed, so that the customer has at least 30 seconds (and preferably longer) to refer to it as he may need to compare it to other displays or transcribe it or recite it over the phone. The button must of course be very well debounced, and could well be used to e.g. drive a one-shot multivibrator so that it could be impossible to increment the counter more than once a minute. Something may be provided to ensure that the counter will increment by one only and not by large counts, i.e., even if the button is electrically noisy.


In one embodiment, the device may live for the 2-3 years that a credit card is issued for. Thus the power supply must suffice for this and for the expected number of uses the device will have. It may be preferable, in particular from a marketing perspective to have the device housed in a credit card. As noted herein, the incorporation of RFID functions may also be used.


In accordance with one embodiment of the invention, the invention authenticates a bank to a customers. On web pages we will want to assure customers they are talking to the real bank. Therefore we can ask them for the 2 digit counter display they see on pushing their button, and using our tracking data predict the internal counter value. By encrypting that with the card's key (we may have to ask for customer name or account number too), we can predict the display and tell the customer “your display will read nnnnnnnn if you are talking to the real bank. If not, hang up immediately and give no further information.”


In one embodiment, the token is authenticated to the bank. In this aspect of use of the inventive token, the bank asks a customer to push the button and read the display. The process includes using the 2 digit display (which may be positioned alongside the display characters) to help determine what the counter is and compute the display and see if they match. If they don't, it is possible to try to assume the counter might be 100 or 200 or more. Accordingly, a few more encryptions may be attempted to see if the token value provided by the customer is indeed OK. Accordingly, a 2 digit display may be used in addition to the display of FIG. 1 so as to assist in determining where the customer is disposed in the progression of the token displays, i.e., if the customer's kids have been playing with the token button.


In accordance with a further aspect of the invention, a process may authenticate the customer to the bank. As described above, each customer is requested to pick an order in which to report digits of the display. We can have the digits numbered in print on the cards to facilitate this. Then the customer pushes his button, reports digits in the order he said he would use. Thus if the display shows:


77 561839


and the customer said he would report digits in order 5,1,6,3 (which he has to remember), he tells us the “77” part (if it is agreed upon for him to do so) and reports 3, 5, 9, 1 (the 5th, 1st, 6th, and 3rd digits of the random part). This relies on the token AND the customer memory. Also anyone in the middle who might be watching or recording what keys are pressed (remember lots of customer PCs have key loggers running) gets only random digits. Thus it doesn't matter if someone tries to record what the customer typed: it will change every time. Notice too that if the customer authenticates this way, it shows he has the token AND knows the pattern all at one go. The number of combinations is 6*5*4*3=360, high enough to cut accidental matches decently. We could ask for more than 4 digits if a higher number of combinations were required.


As also described above, it may be that we will want to end any web transactions by authenticating a second time, so that a thief who broke in and tried to use the credentials later, i.e., for a different transaction, would be detected.


In use of the described device for credit card transactions, instead of web, the customer may simply report the value of the display (or possibly the first several digits of the display) when asked for CVV2. It is noted that CVV2 reports may be 5 or more digits long, so the counter value AND some ciphertext could be reported. Alternatively the first part of the ciphertext could be reported for CVV2 if no more than 3 digits were accepted. At the back end, we would assume the counter incremented by 1 and compare, repeating for higher counter values till a comparison matched or we gave up, i.e., we would roll the counter ahead until we identified a match. In accordance with one embodiment of the invention, the back end has to track the counter in all cases. We expect that merchants will quickly start accepting CVV2, and accepting longer CVV2, to handle these devices since the quality of identification will be much higher than otherwise on phone or net orders, and they may eliminate substantial monies in fraud losses for merchants per year.


As described above, the user authentication device 121, e.g., a token, of the invention may be in a variety of forms. Also, the user authentication device 120 may be used in conjunction with a variety of features, as described below.


Optical light emitting devices (OLED) generally need to be fabricated on thin substrates with some electronics to control current flow to the light emitting polymers. It might be sensible to think of building a backplane for such devices (which are very thin and flexible) on which you also etch transistors and the like to perform the counting, debouncing, crypto, and possibly display timing as well, in one embodiment. A bit of flash memory may be built onto this backplane (to hold the counter value and a diversified key, if so desired. This would mean that all connections become part of a printed circuit, and the arrangement might be in the form of a small rectangle laid down in the inside of a card, to be covered by a transparent cover. Then the connections might only be to a battery and button.


In accordance with one embodiment of the invention, a piezoelectric element may be used for power. In such an arrangement, the customer would press on a printed circle, i.e., to press the element and generate electricity, avoiding button contacts. Also, pressing or bending energy might be used, if workable.


In accordance with one embodiment of the invention, a thin RFID IC bonded onto a display backplane would allow the cryptography, accumulation, password setup, etc. all to be done on a not too heavily altered RFID chip.


Initializing the crypto key might be done via fuses, via RFID, or a capacitive feed scheme which could use pulse trains to set the keys up one bit at a time without needing full contact. This can be shared separately if need be. Other schemes can be used.


A variety of power sources may be used to power the button 121. For example, photoelectric cells, electrets, and/or known battery arrangements may be used.


It is noted that the device must be reliable during its life, even though it will typically live in a wallet or purse.


In accordance with one embodiment of the invention, the user authentication device 120 may include a display that has 2 parts, i.e., a 2 digit field and a longer field (which might be 6 digits long, for example). Every time the customer presses the button, the 2 digit field increments and the longer field gets a set of what look like random numbers. No two card sequences are like.


In accordance with one aspect of the invention described above, an authenticating entity may wish to insure that a transaction amount is approved by the customer. The customer may take the first few digits of the amount (the purchase amount) and use them as positions to report on the display. As described above we might have display digits representing 2 digits each and have the customer enter the displayed numbers at those positions. What gets actually transmitted is a few random digits, but they can be checked against the amount as well as the device identity, proving that someone with the same device who authenticated moments before sent an acceptance for the amount of the transaction.


The systems and methods of the invention provide a wide variety of advantages. In accord with some embodiments, the inventive device may largely eliminate phishing: there is no point in stealing things like card numbers or account numbers when the variable device is required to get money. In accord with some embodiments, the inventive device may vastly reduce phone or net fraud. This will cut both issuer and merchant losses. In accord with some embodiments, the inventive device may eliminate intra-family fraud so long as individual devices are given to each person and so long as the people don't give their patterns away. In accord with some embodiments, the inventive device may make customer data cheaper to handle because less of it will be privacy sensitive. People don't mind when their phone numbers are given out most of the time. If their card number can't be used to rob them or damage their credit, they won't care if it is given out either. In accord with some embodiments, the inventive device may cut fraud in ATMs and/or at merchants if the device is used to generate pseudo PINs which would authenticate transactions. Because the transmitted data is in effect encrypted, even cameras watching PIN pads will be useless in stealing such credentials. It is noted that most merchants have PIN pads already which could be used in implementation of the invention. In addition, the device shows the customer that his credentials are being generated securely and shows that its issuer is doing something very tangible in protecting the customer's identity. The savings to merchants are sizeable and should in addition give some merchants good incentives to prefer these devices and to give incentives to customers to use them.


Further examples of use of the user authentication device 120, in accordance with embodiments of the invention, are set forth below.


In accordance with one embodiment of the invention, for net use, i.e., a purchase over the Internet, the customer might give his username and password. Then, the customer gives the value of the low order digits. The authentication entity then determines what the ciphertext (0:2) should be and conveys such to the customer, telling customer “if this doesn't match your display, you are talking to a fraud site. Then, if ciphertext (0:3) is OK, the authentication entity may ask the customer to enter ciphertext (3:5) and check that it is also valid. For example as used in this example, 3:5 means the digits shown in positions 3, 4 and 5.


To explain further, in an embodiment, the customer might provide half of the displayed digits to an authentication entity. Based on these provided digits, the authentication entity can then (if needed) determine where the customer is in the progression of the token. The authentication entity can then generate displayed characters (corresponding to those displayed by the customer), and the authentication entity then provides at least a portion of such displayed characters back to the customer. For example, the authentication entity might provide a portion or all of the displayed characters back to the customer. In this manner, the authentication entity knows they are dealing with a particular customer and the customer knows they are dealing with a particular authentication entity. Variations of this embodiment are of course possible regarding what portion of a character displayed is provided by what entity, e.g., what characters are provided by the customer and what characters are provided by the authentication entity. Further, the two parties authenticating may of course perform any agreed upon transformation to the characters displayed on the token (or other device), i.e., such as providing select numbers in a particular order, or adding a 1 to each displayed number, for example, or any other suitable transformation. Accordingly, the providing of a select number of digits in a particular order is merely one transformation that might be performed.


As noted above, the authentication entity might provide a portion or all of the displayed characters back to the customer (or a transform of the displayed characters), and in this manner, the customer knows they are dealing with a particular authentication entity. Alternatively, or in addition to, the authentication entity might provide a portion or all of the next pattern, e.g., the next set of display characters, which may then be verified by the customer. The next pattern may also of course be transformed in some manner. Thus, in some agreed upon manner to authenticate, the authentication entity (or the customer) may convey to the other a portion or all of the display characters (or their equivalent such as the authentication characters 196), some transform of the display characters, and/or a portion or all of the next set of display characters (which may also be transformed), for example.


In accordance with one aspect of the invention relating to use with credit card transactions, the issuer might offer a direct validation service to merchants. The issuer could then do as much of the authentication processing as desired. Further, it would place the issuer in a position to check passwords or take a voice sample, or perform various other authentication, as may be desired. Further, the issuer might use ciphertext (3:5) instead of CVV2 in transaction information that was sent with the charge. It is noted the reported track 2 data may be used to capture two or so digits of low order counter in discretionary data fields. As issuer, we would recognize that the presented CVV2 was a variable one and validate accordingly, i.e., either searching the next several counter values for the customer, or using the discretionary data fields to reduce the amount of crypto to be done, e.g. reduce the need to roll ahead in search of a match.


In accordance with one embodiment of the invention, for ATM processing, the card may be inserted, and read by the ATM. The card would then be ejected and the customer enters the value of counter low digits, checks that the right ciphertext is displayed by the ATM (i.e., the display character sequence as described above), and only then enters her PIN and/or other ciphertext, as may be desired. This processing would convey the customer had some reason to think the ATM was communicating with the issuer before giving his PIN.


In accordance with one embodiment of the invention, the system uses different digits of ciphertext to authenticate to the customer that he is talking to the bank first, then to authenticate to the bank that the customer is who he claims to be. That is, the process checks that the card's identity is real. Tying the card to the customer requires asking for another password/PIN, or sampling voice, or the like. It might be that voice or a PIN recognition measures are required for higher value transactions, and not for low value ones.


For phone orders, the customer may be asked for the low digits of the counter and the ciphertext (at least one of the sets). Either a Bank authentication service could be called with this information and the card number/customer name, or the low digits could be passed in discretionary characters in Track 2 of card image data. (For time based card displays some of the ciphertext could be used as CVV2 not needing any additional data passed back.) Merchants knowing the variable number matched would be assured it would be less likely chargebacks could occur because the authentication was stronger. In one embodiment, the invention would exist on every credit card, and the only area needing change would be the issuer backend, i.e., the routine that checks CVV2. Such backend would know or compute the diversified key on the card, and track and encrypt the card counter and verify the ciphertext. Accordingly, processing change would be negligible.


In accordance with embodiments of the invention, it is appreciated that non-numeric indicia might be used along with, or in lieu of, the numerics described above, as may be desired. That is any symbol, graphic, picture, or other information representation, for example, might be used in lieu of, or along with, the numerics discussed above, as may be desired.


Further, it is appreciated that a constant value (i.e., a constant: number, symbol, graphic, picture, or other information representation, for example) might be used along with a variable value, or a set of variable values, which are described above.


As described above, FIGS. 1-4 and 10 show embodiments of structure and system of the invention. Further, FIGS. 5-10 show various steps in accordance with one embodiment of the invention. It is appreciated that the systems and methods described herein may be implemented using a variety of technologies. Hereinafter, general aspects regarding possible implementation of the systems and methods of the invention will be described.


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


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


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


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


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


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


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


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


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


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


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


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


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


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


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


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

Claims
  • 1. A method of authenticating a transaction involving a user authentication device, a merchant, and an authentication entity system, the method comprising: registering, by the authentication entity system, a sequence of position labels with a user identifier;receiving, by the authentication entity system, a transaction request from a merchant electronic device;storing, by the authentication entity system, the transaction request;generating, by the authentication entity system, a plurality of fields for the transaction request;assigning, by the authentication entity system, a position label to each field of the plurality of fields;assigning, by the authentication entity system, a character to each field of the plurality of fields;generating, by the authentication entity system, a first sequence using the assigned characters;displaying, by the authentication entity system, the first sequence on the user authentication device;receiving, by the authentication entity system, from the user authentication device, a second sequence and the user identifier, wherein the second sequence is a subset of the first sequence;retrieving, by the authentication entity system, the position label for each character in the second sequence;comparing, by the authentication entity system, the retrieved sequence of position labels to the registered sequence of position labels;determining, by the authentication entity system, that the retrieved sequence of position labels match the registered sequence of position labels; andbased on the determining, authorizing, by the authentication entity system, the stored transaction request.
  • 2. The method of claim 1, wherein the registered sequence of position labels is set by the user.
  • 3. The method of claim 1, wherein the registered sequence of position labels is based on an amount of a transaction in the transaction request.
  • 4. The method of claim 1, wherein at least one character comprises at least one wildcard.
  • 5. The method of claim 1, wherein the characters are alphanumeric characters.
  • 6. The method of claim 1, wherein the characters are randomly generated.
  • 7. The method of claim 1, wherein the characters are generated periodically.
  • 8. The method of claim 1, wherein the characters are generated for each transaction.
  • 9. The method of claim 1, wherein the display of the first sequence is displayed on the customer electronic device with an indication of each character's position identifier.
RELATED APPLICATIONS

This application is a Continuation (CON) of U.S. patent application Ser. No. 11/137,409, filed May 26, 2005, which is a Continuation-in-Part (CIP) application of U.S. patent application Ser. No. 10/419,107 filed Apr. 21, 2003, now U.S. Pat. No. 7,899,753, which is a Continuation-in-Part (CIP) application of U.S. patent application Ser. No. 10/105,471 filed Mar. 25, 2002, the disclosures of each of which incorporated by reference into the present application in its entirety. The subject matter of this application is related to the subject matter of U.S. Provisional Application Ser. No. 60/646,622 filed Jan. 26, 2005, assigned or under obligation of assignment to the same entity as this application, from which application priority is claimed for the present application. The subject matter of this application is also related to the subject matter of U.S. Provisional Application Ser. No. 60/661,488 filed Mar. 15, 2005, assigned or under obligation of assignment to the same entity as this application, from which application priority is claimed for the present application. Provisional application U.S. Ser. No. 60/646,622 and Provisional application U.S. Ser. No. 60/661,488 are both incorporated herein by reference in their entirety.

US Referenced Citations (836)
Number Name Date Kind
2005003 Patton et al. Jun 1935 A
2405500 Guanella Aug 1946 A
3634669 Soumas et al. Jan 1972 A
3665162 Yamamoto et al. May 1972 A
3705385 Batz Dec 1972 A
3860870 Furuya Jan 1975 A
3938090 Borison et al. Feb 1976 A
3946206 Darjany Mar 1976 A
4013962 Beseke et al. Mar 1977 A
4047033 Malmberg et al. Sep 1977 A
4123747 Lancto et al. Oct 1978 A
4160120 Barnes et al. Jul 1979 A
4200770 Hellman et al. Apr 1980 A
4249180 Eberle et al. Feb 1981 A
4255811 Alder Mar 1981 A
4302810 Bouricius et al. Nov 1981 A
4316055 Feistel Feb 1982 A
4405829 Rivest et al. Sep 1983 A
4453074 Weinstein Jun 1984 A
4454414 Benton Jun 1984 A
4465206 Sorel et al. Aug 1984 A
4471164 Henry Sep 1984 A
4523087 Benton Jun 1985 A
4529870 Chaum Jul 1985 A
4545838 Minkus et al. Oct 1985 A
4575621 Dreifus Mar 1986 A
4582985 Lofberg Apr 1986 A
4605844 Haggan Aug 1986 A
4614861 Pavlov et al. Sep 1986 A
4634845 Riley Jan 1987 A
4650981 Foletta Mar 1987 A
4663500 Okamoto et al. May 1987 A
4689478 Hale et al. Aug 1987 A
4697072 Kawana Sep 1987 A
4700055 Kashkashian, Jr. Oct 1987 A
4701601 Francini et al. Oct 1987 A
4723246 Weldon, Jr. Feb 1988 A
4746787 Okada Apr 1988 A
4747050 Brachtl et al. May 1988 A
4747139 Taaffe May 1988 A
4750119 Robertson Jun 1988 A
4752676 Leonard et al. Jun 1988 A
4754418 Hara Jun 1988 A
4766293 Boston Aug 1988 A
4766539 Fox Aug 1988 A
4789928 Fujisaki Dec 1988 A
4822985 Boggan et al. Apr 1989 A
4831242 Englehardt May 1989 A
4831526 Luchs May 1989 A
4845347 McCrindle Jul 1989 A
4868376 Lessin et al. Sep 1989 A
4868877 Fischer Sep 1989 A
4870259 Boggan et al. Sep 1989 A
4882675 Nichtberger et al. Nov 1989 A
4890324 Jansen Dec 1989 A
4897533 Lyszczarz Jan 1990 A
4906826 Spencer Mar 1990 A
4908521 Boggan et al. Mar 1990 A
4923288 Allen et al. May 1990 A
4928001 Masada May 1990 A
4943707 Boggan Jul 1990 A
4953085 Atkins Aug 1990 A
4954985 Yamazaki Sep 1990 A
4961142 Elliott et al. Oct 1990 A
4965568 Atalla et al. Oct 1990 A
4968873 Dethloff et al. Nov 1990 A
4975840 DeTore et al. Dec 1990 A
4977501 Lefevre Dec 1990 A
4978401 Bonomi Dec 1990 A
4980913 Skret Dec 1990 A
4984272 McIlroy et al. Jan 1991 A
4992940 Dworkin Feb 1991 A
5001755 Skret Mar 1991 A
5005200 Fischer Apr 1991 A
5016274 Micali et al. May 1991 A
5018196 Takaragi et al. May 1991 A
5025372 Burton et al. Jun 1991 A
5049728 Rovin Sep 1991 A
5054067 Moroney et al. Oct 1991 A
5055662 Hasewaga Oct 1991 A
5072380 Randelman et al. Dec 1991 A
5080748 Bonomi Jan 1992 A
5095194 Barbanell Mar 1992 A
5117355 McCarthy May 1992 A
5161244 Maurer Nov 1992 A
5163098 Dahbura Nov 1992 A
5175416 Mansvelt Dec 1992 A
5180901 Hiramatsu Jan 1993 A
5192947 Neustein Mar 1993 A
5196840 Leith et al. Mar 1993 A
5202286 Nakatani Apr 1993 A
5202826 McCarthy Apr 1993 A
5206803 Vitagliano Apr 1993 A
5212792 Gerety et al. May 1993 A
5218631 Katz Jun 1993 A
5225664 Iijima Jul 1993 A
5231668 Kravitz Jul 1993 A
5247190 Friend et al. Sep 1993 A
5253294 Maurer Oct 1993 A
5257486 Holmwall Nov 1993 A
5267314 Stambler Nov 1993 A
5276311 Hartmut Jan 1994 A
5367572 Weiss Jan 1994 A
5287268 McCarthy Feb 1994 A
5287269 Dorrough et al. Feb 1994 A
5297026 Hoffman Mar 1994 A
5302810 Gauthier et al. Apr 1994 A
5305456 Boitana Apr 1994 A
5311594 Penzias May 1994 A
5315504 Lembie May 1994 A
5319710 Atalla et al. Jun 1994 A
5326959 Perazza Jul 1994 A
5326960 Tannenbaum Jul 1994 A
5328809 Holmes et al. Jul 1994 A
5341428 Schatz Aug 1994 A
5339239 Manabe et al. Sep 1994 A
5349633 Katz Sep 1994 A
5350906 Brody et al. Sep 1994 A
5351187 Hassett Sep 1994 A
5352877 Morley Oct 1994 A
5359183 Skodlar Oct 1994 A
5365575 Katz Nov 1994 A
5382784 Eberhardt Jan 1995 A
5383113 Knight Jan 1995 A
5397881 Mannik Mar 1995 A
5399502 Friend et al. Mar 1995 A
5401827 Holmes et al. Mar 1995 A
RE34915 Nichtberger et al. Apr 1995 E
5424524 Ruppert et al. Jun 1995 A
5432326 Noblett et al. Jul 1995 A
5450477 Amarant et al. Sep 1995 A
5450491 McNair Sep 1995 A
5453601 Rosen Sep 1995 A
5455407 Rosen Oct 1995 A
5459306 Stein et al. Oct 1995 A
5465206 Hilt et al. Nov 1995 A
5466919 Henry Nov 1995 A
5466920 Nair et al. Nov 1995 A
5471669 Lidman Nov 1995 A
5477038 Levine et al. Dec 1995 A
5477040 Lalonde Dec 1995 A
5479494 Clitherow Dec 1995 A
5479530 Nair et al. Dec 1995 A
5482139 Rivalto Jan 1996 A
5483444 Malark Jan 1996 A
5483445 Pickering Jan 1996 A
5495981 Warther Mar 1996 A
5500514 Veeneman et al. Mar 1996 A
5500890 Rogge et al. Mar 1996 A
5511114 Stimson et al. Apr 1996 A
5512654 Holmes et al. Apr 1996 A
5513102 Auriemma Apr 1996 A
5521363 Tannenbaum May 1996 A
5524073 Stambler Jun 1996 A
5530232 Taylor Jun 1996 A
5530235 Stefik et al. Jun 1996 A
5532689 Bueno Jul 1996 A
5537314 Kanter Jul 1996 A
5541583 Mandelbaum Jul 1996 A
5544086 Davis et al. Aug 1996 A
5544246 Mandelbaum et al. Aug 1996 A
5553120 Katz Sep 1996 A
5555303 Stambler Sep 1996 A
5577109 Stimson et al. Nov 1996 A
5578808 Taylor Nov 1996 A
5581064 Riley et al. Dec 1996 A
5583933 Mark Dec 1996 A
5585787 Wallerstein Dec 1996 A
5590038 Pitroda Dec 1996 A
5592553 Guski et al. Jan 1997 A
5592560 Deaton et al. Jan 1997 A
5604542 Dedrick Feb 1997 A
5608785 Kasday Mar 1997 A
5612868 Off Mar 1997 A
5615277 Hoffman Mar 1997 A
5617474 Ditzig et al. Apr 1997 A
5621787 McKoy et al. Apr 1997 A
5621812 Deaton et al. Apr 1997 A
5649114 Deaton et al. Apr 1997 A
5642485 Deaton et al. May 1997 A
5637845 Kolls Jun 1997 A
5638457 Deaton et al. Jun 1997 A
5642279 Stone Jun 1997 A
5644723 Deaton et al. Jul 1997 A
5644727 Atkins Jul 1997 A
5644778 Burks et al. Jul 1997 A
5646998 Stambler Jul 1997 A
5649117 Landry Jul 1997 A
5649118 Carlisle et al. Jul 1997 A
5653914 Holmes et al. Aug 1997 A
5657390 Elgamal et al. Aug 1997 A
5661807 Guski et al. Aug 1997 A
5664110 Green et al. Sep 1997 A
5664157 Takahira et al. Sep 1997 A
5665953 Mazzamuto Sep 1997 A
5672678 Holmes et al. Sep 1997 A
5675607 Alesio et al. Oct 1997 A
5675662 Deaton et al. Oct 1997 A
5677521 Garrou Oct 1997 A
5677955 Doggett et al. Oct 1997 A
5680459 Hook et al. Oct 1997 A
5684291 Taskett Nov 1997 A
5687322 Deaton et al. Nov 1997 A
5689100 Carrithers et al. Nov 1997 A
5689650 McClelland et al. Nov 1997 A
5692132 Hogan Nov 1997 A
5696907 Tom Dec 1997 A
5698837 Furuta Dec 1997 A
5699528 Hogan Dec 1997 A
5703344 Bezy et al. Dec 1997 A
5704046 Hogan Dec 1997 A
5705798 Tarbox Jan 1998 A
5706452 Ivanov Jan 1998 A
5708422 Blonder et al. Jan 1998 A
5710458 Iwasaki Jan 1998 A
5710886 Christensen et al. Jan 1998 A
5710887 Chelliah Jan 1998 A
5710889 Clark et al. Jan 1998 A
5715399 Bezos Feb 1998 A
5721768 Stimson et al. Feb 1998 A
5721781 Deo et al. Feb 1998 A
5724423 Khello Mar 1998 A
5727153 Powell Mar 1998 A
5728998 Novis et al. Mar 1998 A
5729693 Holda-Fleck Mar 1998 A
5734154 Jachimowicz et al. Mar 1998 A
5734838 Robinson et al. Mar 1998 A
5736728 Matsubara Apr 1998 A
5737421 Audebert Apr 1998 A
5740549 Reilly et al. Apr 1998 A
5742775 King Apr 1998 A
5742845 Wagner Apr 1998 A
5745049 Akiyama et al. Apr 1998 A
5745555 Mark Apr 1998 A
5745706 Wolfberg et al. Apr 1998 A
5749075 Toader et al. May 1998 A
5760381 Stich et al. Jun 1998 A
5764770 Schipper et al. Jun 1998 A
5765141 Spector Jun 1998 A
5770843 Rose et al. Jun 1998 A
5770849 Novis et al. Jun 1998 A
5774870 Storey Jun 1998 A
5777305 Smith et al. Jul 1998 A
5777306 Masuda Jul 1998 A
5777903 Piosenka et al. Jul 1998 A
5778067 Jones et al. Jul 1998 A
5781909 Logan et al. Jul 1998 A
5787156 Katz Jul 1998 A
5787404 Fernandez-Holman Jul 1998 A
5789733 Jachimowicz et al. Aug 1998 A
5793302 Mark Aug 1998 A
5794207 Walker Aug 1998 A
5796827 Coppersmith et al. Aug 1998 A
5799087 Rosen Aug 1998 A
5802176 Audebert Sep 1998 A
5805719 Pare et al. Sep 1998 A
5806042 Kelly et al. Sep 1998 A
5806044 Powell Sep 1998 A
5806045 Biorge Sep 1998 A
5807627 Friend et al. Sep 1998 A
5809478 Greco Sep 1998 A
5815657 Williams et al. Sep 1998 A
5815658 Kuriyama Sep 1998 A
5815665 Teper et al. Sep 1998 A
5819234 Slavin et al. Oct 1998 A
5819237 Garman Oct 1998 A
5825871 Mark Oct 1998 A
5825890 Elgamal et al. Oct 1998 A
5826023 Hall et al. Oct 1998 A
5832090 Raspotnik Nov 1998 A
5832211 Blakley, III et al. Nov 1998 A
5832457 O'Brien Nov 1998 A
5835061 Stewart Nov 1998 A
5835576 Katz Nov 1998 A
5838812 Pare et al. Nov 1998 A
5838903 Blakely, III et al. Nov 1998 A
5839113 Federau et al. Nov 1998 A
5845259 West et al. Dec 1998 A
5845260 Nakano et al. Dec 1998 A
5848190 Kleehammer et al. Dec 1998 A
5852811 Atkins Dec 1998 A
5852812 Reeder Dec 1998 A
5857079 Claus et al. Jan 1999 A
5857175 Day Jan 1999 A
5857709 Chock Jan 1999 A
5859419 Wynn Jan 1999 A
5862323 Blakely, III et al. Jan 1999 A
5864609 Cross et al. Jan 1999 A
5864828 Atkins Jan 1999 A
5864830 Armetta et al. Jan 1999 A
5864871 Kitain et al. Jan 1999 A
5866889 Weiss et al. Feb 1999 A
5870718 Spector Feb 1999 A
5870721 Norris Feb 1999 A
5870723 Pare et al. Feb 1999 A
5875437 Atkins Feb 1999 A
5878141 Daly et al. Mar 1999 A
5883377 Chapin, Jr. Mar 1999 A
5883810 Franklin et al. Mar 1999 A
5884271 Pitroda Mar 1999 A
5884278 Powell Mar 1999 A
5884285 Atkins Mar 1999 A
5884312 Dustan et al. Mar 1999 A
5887065 Audebert Mar 1999 A
5890138 Godin et al. Mar 1999 A
5890140 Clark et al. Mar 1999 A
H1794 Claus Apr 1999 H
5897620 Walker et al. Apr 1999 A
5898838 Wagner Apr 1999 A
5903878 Talati et al. May 1999 A
5905246 Fajkowski May 1999 A
5905908 Wagner May 1999 A
5907142 Kelsey May 1999 A
5911135 Atkins Jun 1999 A
5911136 Atkins Jun 1999 A
5915244 Jack et al. Jun 1999 A
5920629 Rosen Jul 1999 A
5920844 Hotta et al. Jul 1999 A
5920847 Kolling et al. Jul 1999 A
5923734 Taskett Jul 1999 A
5926800 Baronowski et al. Jul 1999 A
5930217 Kayanuma Jul 1999 A
5931764 Freeman et al. Aug 1999 A
5933817 Hucal Aug 1999 A
5936541 Stambler Aug 1999 A
5937068 Audebert Aug 1999 A
5940811 Norris Aug 1999 A
5952641 Korshun Sep 1999 A
5953423 Rosen Sep 1999 A
5953710 Fleming Sep 1999 A
5955961 Wallerstein Sep 1999 A
5963648 Rosen Oct 1999 A
5970478 Walker et al. Oct 1999 A
5970479 Shepherd Oct 1999 A
5970480 Kalina Oct 1999 A
5974148 Stambler Oct 1999 A
5974399 Giuliani et al. Oct 1999 A
RE36365 Levine et al. Nov 1999 E
5984180 Albrecht Nov 1999 A
5984191 Chapin, Jr. Nov 1999 A
5987434 Libman Nov 1999 A
5987454 Hobbs Nov 1999 A
5988509 Taskett Nov 1999 A
5991413 Arditti et al. Nov 1999 A
5991748 Taskett Nov 1999 A
5991750 Craig Nov 1999 A
6003762 Hayashida Nov 1999 A
5999971 Buckland Dec 1999 A
6000608 Dorf Dec 1999 A
6000832 Franklin et al. Dec 1999 A
6002383 Shimada Dec 1999 A
6004681 Epstein et al. Dec 1999 A
6006988 Behrmann et al. Dec 1999 A
6009415 Shurling et al. Dec 1999 A
6014636 Reeder Jan 2000 A
6014638 Burge et al. Jan 2000 A
6014645 Cunningham Jan 2000 A
6014749 Gloor et al. Jan 2000 A
6016476 Maes et al. Jan 2000 A
6016482 Molinari et al. Jan 2000 A
6016954 Abe et al. Jan 2000 A
6019284 Freeman et al. Feb 2000 A
6026370 Jermyn Feb 2000 A
6026398 Brown et al. Feb 2000 A
6029139 Cunningham et al. Feb 2000 A
6029890 Austin Feb 2000 A
6032136 Brake, Jr. et al. Feb 2000 A
6036099 Leighton Mar 2000 A
6038292 Thomas Mar 2000 A
6038552 Fleischl et al. Mar 2000 A
6041315 Pollin Mar 2000 A
6044402 Jacobson et al. Mar 2000 A
6045042 Ohno Apr 2000 A
6047067 Rosen Apr 2000 A
6047268 Bartoli et al. Apr 2000 A
6049463 O'Malley et al. Apr 2000 A
6049773 McCormack et al. Apr 2000 A
6049782 Gottesman et al. Apr 2000 A
6058378 Clark et al. May 2000 A
6061660 Eggleston et al. May 2000 A
6064985 Anderson May 2000 A
6065120 Laursen et al. May 2000 A
6065675 Teicher May 2000 A
6067531 Hoyt et al. May 2000 A
6068183 Freeman et al. May 2000 A
6069968 Shaw et al. May 2000 A
6070147 Harms et al. May 2000 A
6070153 Simpson May 2000 A
6076068 DeLapa et al. Jun 2000 A
6076072 Libman Jun 2000 A
6078888 Johnson, Jr. Jun 2000 A
6078891 Riordan et al. Jun 2000 A
6081900 Subramaniam et al. Jun 2000 A
6091817 Bertina et al. Jul 2000 A
6092056 Tull, Jr. et al. Jul 2000 A
6092057 Zimmermann et al. Jul 2000 A
6092192 Kanevsky et al. Jul 2000 A
6095412 Bertina et al. Aug 2000 A
6095416 Grant et al. Aug 2000 A
6098053 Slater Aug 2000 A
6105006 Davis et al. Aug 2000 A
6105011 Morrison, Jr. Aug 2000 A
6105865 Hardesty Aug 2000 A
6115458 Taskett Sep 2000 A
6115642 Brown et al. Sep 2000 A
6119932 Maloney et al. Sep 2000 A
6122623 Garman Sep 2000 A
6128598 Walker et al. Oct 2000 A
6128599 Walker et al. Oct 2000 A
6129274 Suzuki Oct 2000 A
6134536 Shepherd Oct 2000 A
6134592 Montulli Oct 2000 A
6138911 Fredregill et al. Oct 2000 A
6138917 Chapin, Jr. Oct 2000 A
6141666 Tobin Oct 2000 A
6144848 Walsh et al. Nov 2000 A
6145741 Wisdom et al. Nov 2000 A
6148297 Swor et al. Nov 2000 A
6161096 Bell Dec 2000 A
6161113 Mora et al. Dec 2000 A
6163770 Gamble et al. Dec 2000 A
6163771 Walker Dec 2000 A
6164533 Barton Dec 2000 A
6167385 Hartley-Urquhart Dec 2000 A
6169975 White et al. Jan 2001 B1
6173267 Cairns Jan 2001 B1
6182048 Osborn et al. Jan 2001 B1
6182059 Angotti et al. Jan 2001 B1
6182220 Chen et al. Jan 2001 B1
6182894 Hackett et al. Feb 2001 B1
6186793 Brubaker Feb 2001 B1
6188309 Levine Feb 2001 B1
6189787 Dorf Feb 2001 B1
6195644 Bowie Feb 2001 B1
6202053 Christiansen et al. Mar 2001 B1
6202066 Barkley Mar 2001 B1
6202158 Urano et al. Mar 2001 B1
RE37122 Levine et al. Apr 2001 E
6213391 Lewis Apr 2001 B1
6219639 Bakis et al. Apr 2001 B1
6223168 McGurl et al. Apr 2001 B1
6226752 Gupta et al. May 2001 B1
6227447 Campisano May 2001 B1
6243688 Kalina Jun 2001 B1
6256664 Donoho et al. Jul 2001 B1
6263316 Khan et al. Jul 2001 B1
6265977 Vega et al. Jul 2001 B1
6278981 Dembo et al. Aug 2001 B1
6278996 Richardson et al. Aug 2001 B1
6292786 Deaton et al. Sep 2001 B1
6295522 Boesch Sep 2001 B1
6298336 Davis et al. Oct 2001 B1
6308268 Audebert Oct 2001 B1
6315195 Ramachandran Nov 2001 B1
6317834 Gennaro et al. Nov 2001 B1
6327575 Katz Dec 2001 B1
6327578 Linehan Dec 2001 B1
6330543 Kepecs Dec 2001 B1
6336099 Barnett et al. Jan 2002 B1
6339423 Sampson et al. Jan 2002 B1
6341724 Campisano Jan 2002 B2
6343323 Kalpio et al. Jan 2002 B1
6343743 Lamla Feb 2002 B1
6345261 Feidelson Feb 2002 B1
6345766 Taskett et al. Feb 2002 B1
6349290 Horowitz et al. Feb 2002 B1
6349291 Varma Feb 2002 B1
6360954 Barnardo Mar 2002 B1
6363381 Lee et al. Mar 2002 B1
6366220 Elliott Apr 2002 B1
6366682 Hoffman et al. Apr 2002 B1
6373969 Adler Apr 2002 B1
6381587 Guzelsu Apr 2002 B1
6385591 Mankoff May 2002 B1
6385652 Brown et al. May 2002 B1
6386444 Sullivan May 2002 B1
6397202 Higgins et al. May 2002 B1
6401125 Makarios et al. Jun 2002 B1
6402039 Freeman et al. Jun 2002 B1
6405182 Cuervo Jun 2002 B1
6411933 Maes et al. Jun 2002 B1
6411947 Rice et al. Jun 2002 B1
6422459 Kawan Jul 2002 B1
6422462 Cohen Jul 2002 B1
6424949 Deaton et al. Jul 2002 B1
6429927 Borza Aug 2002 B1
6434259 Hamid et al. Aug 2002 B1
6438666 Cassagnol et al. Aug 2002 B2
6446053 Elliott Sep 2002 B1
6446210 Borza Sep 2002 B1
6449765 Ballard Sep 2002 B1
6450407 Freeman et al. Sep 2002 B1
6463039 Ricci et al. Oct 2002 B1
6467684 Fite et al. Oct 2002 B2
6470357 Garcia, Jr. et al. Oct 2002 B1
6473500 Risafi et al. Oct 2002 B1
6484144 Marlin et al. Nov 2002 B2
6484148 Boyd Nov 2002 B1
6484149 Jammes Nov 2002 B1
6487641 Cusson et al. Nov 2002 B1
6490601 Markus et al. Dec 2002 B1
6498657 Kuntz et al. Dec 2002 B1
6498861 Hamid et al. Dec 2002 B1
6505168 Rothman et al. Jan 2003 B1
6507912 Matyas, Jr. et al. Jan 2003 B1
6519763 Kaufer et al. Feb 2003 B1
6526404 Slater et al. Feb 2003 B1
6539363 Allgeier et al. Mar 2003 B1
6539424 Dutta Mar 2003 B1
6560578 Eldering May 2003 B2
6560581 Fox et al. May 2003 B1
6574348 Venkatesan et al. Jun 2003 B1
6574603 Dickson et al. Jun 2003 B1
6580814 Ittycheriah et al. Jun 2003 B1
6581839 Lasch et al. Jun 2003 B1
6584505 Howard et al. Jun 2003 B1
6587835 Treyz et al. Jul 2003 B1
6589291 Boag et al. Jul 2003 B1
6592044 Wong et al. Jul 2003 B1
6594640 Postrel Jul 2003 B1
6601761 Katis Aug 2003 B1
6607127 Wong Aug 2003 B2
6609106 Robertson Aug 2003 B1
6609111 Bell Aug 2003 B1
6609654 Anderson et al. Aug 2003 B1
RE38255 Levine et al. Sep 2003 E
6615189 Phillips et al. Sep 2003 B1
6615190 Slater Sep 2003 B1
6624761 Fallon Sep 2003 B2
6625582 Richman et al. Sep 2003 B2
6631849 Blossom Oct 2003 B2
6640302 Subramaniam et al. Oct 2003 B1
6641049 Luu Nov 2003 B2
6641050 Kelley et al. Nov 2003 B2
6651168 Kao et al. Nov 2003 B1
6668321 Nendell et al. Dec 2003 B2
6668322 Wood et al. Dec 2003 B1
6671818 Mikurak Dec 2003 B1
6675127 LaBlanc et al. Jan 2004 B2
6675261 Shandony Jan 2004 B2
6684212 Day et al. Jan 2004 B1
6684248 Janacek et al. Jan 2004 B1
6684384 Bickerton et al. Jan 2004 B1
6687245 Fangman et al. Feb 2004 B2
6693544 Hebbecker Feb 2004 B1
6697947 Matyas, Jr. et al. Feb 2004 B1
6714987 Amin et al. Mar 2004 B1
6718482 Sato et al. Apr 2004 B2
6718535 Underwood Apr 2004 B1
6725269 Megiddo Apr 2004 B1
6727802 Kelly et al. Apr 2004 B2
6735695 Gopalakrishnan et al. May 2004 B1
6738779 Shapira May 2004 B1
D490840 Arakaki et al. Jun 2004 S
D491186 Arakaki et al. Jun 2004 S
D491953 Arakaki et al. Jun 2004 S
6745938 Sullivan Jun 2004 B2
6751654 Massarani et al. Jun 2004 B2
6754833 Black et al. Jun 2004 B1
6755341 Wong et al. Jun 2004 B1
6763388 Tsimelzon Jul 2004 B1
6766370 Glommen et al. Jul 2004 B2
6769605 Magness Aug 2004 B1
6785810 Lirov et al. Aug 2004 B1
D496365 Liu et al. Sep 2004 S
6789115 Singer et al. Sep 2004 B1
6792572 Frohlick Sep 2004 B1
6802008 Ikefuji et al. Oct 2004 B1
6805287 Bishop Oct 2004 B2
6805288 Routhenstein et al. Oct 2004 B2
6810395 Bharat Oct 2004 B1
D498236 Liu et al. Nov 2004 S
6819219 Bolle et al. Nov 2004 B1
6820061 Postrel Nov 2004 B2
6826696 Chawla et al. Nov 2004 B1
6829586 Postrel Dec 2004 B2
6832587 Wampula et al. Dec 2004 B2
6842739 Postrel Jan 2005 B2
6847991 Kurapati Jan 2005 B1
6856970 Campbell et al. Feb 2005 B1
6865547 Brake, Jr. et al. Mar 2005 B1
6868391 Hultgren Mar 2005 B1
6868426 Mankoff Mar 2005 B1
6892231 Jager May 2005 B2
6907566 McElfresh et al. Jun 2005 B1
6925481 Singhal et al. Aug 2005 B2
6931382 Laage et al. Aug 2005 B2
6934848 King et al. Aug 2005 B1
6937976 Apte Aug 2005 B2
6938020 Nakayama et al. Aug 2005 B2
6938158 Azuma Aug 2005 B2
6947898 Postrel Sep 2005 B2
6950936 Subramaniam et al. Sep 2005 B2
6954932 Nakamura et al. Oct 2005 B2
6957337 Chainer et al. Oct 2005 B1
6965939 Cuomo et al. Nov 2005 B2
6970830 Samra et al. Nov 2005 B1
6976164 King et al. Dec 2005 B1
6980962 Arganbright et al. Dec 2005 B1
6983421 Lahti et al. Jan 2006 B1
6992786 Breding et al. Jan 2006 B1
6999938 Libman Feb 2006 B1
7006983 Packes et al. Feb 2006 B1
7010512 Gillin et al. Mar 2006 B1
7020696 Perry et al. Mar 2006 B1
7032110 Su et al. Apr 2006 B1
7047222 Bush May 2006 B1
7051199 Berson et al. May 2006 B1
7051330 Kaler et al. May 2006 B1
7051929 Li May 2006 B2
7058817 Ellmore Jun 2006 B1
7069434 Ilnicki et al. Jun 2006 B1
7076453 Jammes et al. Jul 2006 B2
7080036 Drummond et al. Jul 2006 B1
7089203 Crookshanks Aug 2006 B1
7089208 Levchin et al. Aug 2006 B1
7089503 Bloomquist et al. Aug 2006 B1
7093020 McCarty et al. Aug 2006 B1
7093282 Hillhouse Aug 2006 B2
7103556 Del Rey et al. Sep 2006 B2
7117239 Hansen Oct 2006 B1
7124101 Mikurak Oct 2006 B1
7134075 Hind Nov 2006 B2
7137006 Grandcolas et al. Nov 2006 B1
7139686 Critz Nov 2006 B1
7143174 Miller et al. Nov 2006 B2
7155614 Ellmore Dec 2006 B2
7161506 Fallon Jan 2007 B2
7163153 Blossom Jan 2007 B2
7185094 Marquette et al. Feb 2007 B2
7188181 Squier et al. Mar 2007 B1
7191952 Blossom Mar 2007 B2
7195154 Routhenstein Mar 2007 B2
7197470 Arnett Mar 2007 B1
7203909 Horvitz et al. Apr 2007 B1
7225249 Barry May 2007 B1
7228155 Saunders Jun 2007 B2
7249112 Berardi et al. Jul 2007 B2
7272857 Everhart Sep 2007 B1
7299201 Jammes Nov 2007 B2
7312707 Bishop et al. Dec 2007 B1
7321864 Gendler Jan 2008 B1
7353383 Skingle Apr 2008 B2
7357331 Blossom Apr 2008 B2
7370011 Bennett May 2008 B2
7395241 Cook et al. Jul 2008 B1
7400274 Fallon et al. Jul 2008 B2
7417568 Fallon et al. Aug 2008 B2
7444672 Ellmore Oct 2008 B2
7461265 Ellmore Dec 2008 B2
7472171 Miller et al. Dec 2008 B2
7480631 Merced et al. Jan 2009 B1
7490064 Allin et al. Feb 2009 B2
7493288 Biship et al. Feb 2009 B2
7506806 Bonalle et al. Mar 2009 B2
7599856 Agrawal et al. Oct 2009 B2
7624277 Simard Nov 2009 B1
20010002487 Grawrock et al. May 2001 A1
20010011243 Dembo et al. Aug 2001 A1
20010011250 Paltenghe et al. Aug 2001 A1
20010016835 Hansmann et al. Aug 2001 A1
20010027441 Wankmueller Oct 2001 A1
20010027474 Nachman et al. Oct 2001 A1
20010029464 Schweitzwer Oct 2001 A1
20010032183 Landry Oct 2001 A1
20010032312 Runje et al. Oct 2001 A1
20010034663 Teveler et al. Oct 2001 A1
20010034682 Knight et al. Oct 2001 A1
20010038033 Habib Nov 2001 A1
20010044293 Morgan Nov 2001 A1
20010047342 Cuervo Nov 2001 A1
20010054003 Chien et al. Dec 2001 A1
20010054059 Marks et al. Dec 2001 A1
20010056398 Scheirer Dec 2001 A1
20020002479 Almog et al. Jan 2002 A1
20020010627 Lerat Jan 2002 A1
20020019803 Muller Feb 2002 A1
20020023108 Daswani et al. Feb 2002 A1
20020026418 Koppel et al. Feb 2002 A1
20020029269 McCarty et al. Mar 2002 A1
20020031230 Sweet et al. Mar 2002 A1
20020032613 Buettgenbach et al. Mar 2002 A1
20020032650 Hauser et al. Mar 2002 A1
20020042808 Smith et al. Apr 2002 A1
20020046255 Moore et al. Apr 2002 A1
20020062235 Wahlbin et al. May 2002 A1
20020069172 Omshehe et al. Jun 2002 A1
20020077964 Brody et al. Jun 2002 A1
20020077978 O'Leary et al. Jun 2002 A1
20020087447 McDonald et al. Jul 2002 A1
20020087471 Ganesan et al. Jul 2002 A1
20020091572 Anderson et al. Jul 2002 A1
20020091631 Usui Jul 2002 A1
20020095365 Slavin et al. Jul 2002 A1
20020095443 Kovack Jul 2002 A1
20020099936 Kou et al. Jul 2002 A1
20020104878 Seifert et al. Aug 2002 A1
20020111890 Sloan et al. Aug 2002 A1
20020116271 Mankoff Aug 2002 A1
20020120627 Mankoff Aug 2002 A1
20020128977 Nambiar et al. Sep 2002 A1
20020143703 Razvan et al. Oct 2002 A1
20020143874 Marquette et al. Oct 2002 A1
20020147662 Anderson Oct 2002 A1
20020152163 Bezos et al. Oct 2002 A1
20020156900 Marquette et al. Oct 2002 A1
20020165820 Anvekar et al. Nov 2002 A1
20020174010 Rice, III Nov 2002 A1
20020174016 Cuervo Nov 2002 A1
20020178113 Clifford et al. Nov 2002 A1
20020198806 Blagg et al. Dec 2002 A1
20030001888 Power Jan 2003 A1
20030004828 Epstein Jan 2003 A1
20030023549 Armes et al. Jan 2003 A1
20030028518 Mankoff Feb 2003 A1
20030034388 Routhenstein et al. Feb 2003 A1
20030037131 Verma Feb 2003 A1
20030040995 Daddario et al. Feb 2003 A1
20030041165 Spencer et al. Feb 2003 A1
20030046249 Wu Mar 2003 A1
20030053609 Risafi et al. Mar 2003 A1
20030055871 Roses Mar 2003 A1
20030061168 Routhenstein Mar 2003 A1
20030084002 Ericson et al. May 2003 A1
20030085286 Kelley et al. May 2003 A1
20030088489 Peters et al. May 2003 A1
20030097574 Upton May 2003 A1
20030101119 Persons et al. May 2003 A1
20030105672 Epstein et al. Jun 2003 A1
20030105981 Miller et al. Jun 2003 A1
20030131357 Kim Jul 2003 A1
20030135462 Brake, Jr. et al. Jul 2003 A1
20030140004 O'Leary et al. Jul 2003 A1
20030144935 Sobek Jul 2003 A1
20030149594 Beazley et al. Aug 2003 A1
20030154171 Karp et al. Aug 2003 A1
20030163403 Chen et al. Aug 2003 A1
20030163700 Paatero Aug 2003 A1
20030167229 Ludwig et al. Sep 2003 A1
20030172040 Kemper et al. Sep 2003 A1
20030182246 Johnson et al. Sep 2003 A1
20030187787 Freund Oct 2003 A1
20030195808 Brown et al. Oct 2003 A1
20030200180 Phelan et al. Oct 2003 A1
20030204460 Robinson et al. Oct 2003 A1
20030216965 Libman Nov 2003 A1
20030218066 Fernandes et al. Nov 2003 A1
20030225688 Dobbins Dec 2003 A1
20040019563 Sines et al. Jan 2004 A1
20040024672 Brake, Jr. et al. Feb 2004 A1
20040029569 Khan et al. Feb 2004 A1
20040030626 Libman Feb 2004 A1
20040031856 Atsmon et al. Feb 2004 A1
20040039588 Libman Feb 2004 A1
20040049702 Subramaniam et al. Mar 2004 A1
20040094624 Fernandes et al. May 2004 A1
20040098351 Duke May 2004 A1
20040111610 Slick et al. Jun 2004 A1
20040117409 Scahill et al. Jun 2004 A1
20040133787 Doughty et al. Jul 2004 A1
20040146159 Rosen Jul 2004 A1
20040149544 Dal Ferro Aug 2004 A1
20040153378 Perkowski Aug 2004 A1
20040159700 Khan et al. Aug 2004 A1
20040162773 Del Rey et al. Aug 2004 A1
20040186773 George et al. Sep 2004 A1
20040210498 Freund Oct 2004 A1
20040215507 Levitt et al. Oct 2004 A1
20040215514 Quinlan Oct 2004 A1
20040225880 Mizrah Nov 2004 A1
20040230843 Jensen Nov 2004 A1
20040232223 Beenau et al. Nov 2004 A1
20040236688 Bozeman Nov 2004 A1
20040239481 Beenau Dec 2004 A1
20040243498 Duke Dec 2004 A1
20040252012 Beenau et al. Dec 2004 A1
20040254991 Malik et al. Dec 2004 A1
20050015588 Lin Jan 2005 A1
20050027649 Cech Feb 2005 A1
20050033619 Barnes et al. Feb 2005 A1
20050035847 Bonalle et al. Feb 2005 A1
20050040242 Beenau et al. Feb 2005 A1
20050055306 Miller et al. Mar 2005 A1
20050060579 Dickelman et al. Mar 2005 A1
20050071230 Mankoff Mar 2005 A1
20050071637 Shirakawa Mar 2005 A1
20050075932 Mankoff Apr 2005 A1
20050077349 Bonalle et al. Apr 2005 A1
20050080747 Anderson et al. Apr 2005 A1
20050082362 Anderson et al. Apr 2005 A1
20050086160 Wong et al. Apr 2005 A1
20050086177 Anderson et al. Apr 2005 A1
20050091126 Junger Apr 2005 A1
20050091138 Awatsu Apr 2005 A1
20050091492 Benson et al. Apr 2005 A1
20050116024 Beenau et al. Jun 2005 A1
20050120180 Schornbach et al. Jun 2005 A1
20050144450 Voice Jun 2005 A1
20050171898 Bishop et al. Aug 2005 A1
20050193056 Schaefer et al. Sep 2005 A1
20050193208 Charrette et al. Sep 2005 A1
20050206499 Fisher Sep 2005 A1
20050216421 Barry et al. Sep 2005 A1
20050278641 Mansour et al. Dec 2005 A1
20050289051 Allin et al. Dec 2005 A1
20060005039 Hsieh Jan 2006 A1
20060029261 Hoffman et al. Feb 2006 A1
20060036553 Gupta et al. Feb 2006 A1
20060041540 Shannon Feb 2006 A1
20060116949 Wehunt et al. Jun 2006 A1
20060173706 Allin et al. Aug 2006 A1
20060249574 Brown et al. Nov 2006 A1
20060259766 Rasti Nov 2006 A1
20060261927 Kelly et al. Nov 2006 A1
20060271397 Allin et al. Nov 2006 A1
20060271477 Allin et al. Nov 2006 A1
20060271478 Allin et al. Nov 2006 A1
20060271479 Allin et al. Nov 2006 A1
20060271480 Allin et al. Nov 2006 A1
20060274970 Seki et al. Dec 2006 A1
20070019806 Conley et al. Jan 2007 A1
20070034700 Poidomani et al. Feb 2007 A1
20070078771 Allin et al. Apr 2007 A1
20070136211 Brown et al. Jun 2007 A1
20070156521 Yates Jul 2007 A1
20070186252 Maggio Aug 2007 A1
20070203850 Singh et al. Aug 2007 A1
20070208671 Brown et al. Sep 2007 A1
20070215688 Routhenstein Sep 2007 A1
20070234408 Burch et al. Oct 2007 A1
20070265924 Schwarz Nov 2007 A1
20080010202 Schwarz Jan 2008 A1
20080184315 Ellis et al. Jul 2008 A1
20090043651 Schwarz Feb 2009 A1
20090100508 Labaton Apr 2009 A1
20090192940 Mann, III et al. Jul 2009 A1
Foreign Referenced Citations (34)
Number Date Country
2293321 Jun 1998 CA
2430549 Jun 2002 CA
0855659 Jul 1998 EP
959440 Nov 1999 EP
1014318 Jun 2000 EP
1022664 Jul 2000 EP
1056043 Nov 2000 EP
1089516 Apr 2001 EP
2275654 Sep 1994 GB
2376787 Dec 2002 GB
2377071 Dec 2002 GB
2377314 Jan 2003 GB
H10-187467 Jul 1998 JP
2003-24329 Nov 2000 JP
2001-134672 May 2001 JP
2005-242976 Sep 2005 JP
WO 9429112 Dec 1994 WO
WO 9741673 Nov 1997 WO
WO 9810368 Mar 1998 WO
WO 9905633 Feb 1999 WO
WO 9940507 Aug 1999 WO
WO 0118656 Mar 2001 WO
WO 0169347 Sep 2001 WO
WO 01088659 Nov 2001 WO
WO 01088659 Nov 2001 WO
WO 0217082 Feb 2002 WO
WO 2004-079603 Sep 2004 WO
WO 2005043277 May 2005 WO
WO 2005-101975 Nov 2005 WO
WO 2006-011904 Feb 2006 WO
WO 2006-011904 Feb 2006 WO
WO 2006-060370 Jun 2006 WO
WO 2006-105092 Oct 2006 WO
WO 2006-116772 Nov 2006 WO
Non-Patent Literature Citations (119)
Entry
Hasting, Nelson et. al., A Case Study of Authenticated and Secure File Transfer The Iowa Campaign Finance Reporting System (1997).
Alshawi, M et. al., An IFC Web Based Collaborative Construction Computer Environment Wisper, Sep. 1999.
Fusaro, Roberta, Builders Moving to Web tools Computerworld, Nov. 16, 1998, vol. 32, No. 46, pp. 51, 53.
Microsoft, CNBC on MSN Money Microsoft Money 2003 Deluxe, Aug. 2002.
Marlin, Chasing Document Management, Inform, vol. 13, No. 4, Apr. 199, p. 76-82.
Construction Financing to Build Your Own Home, ISBN 0962864307, Jul. 1990.
Seibert, Paul, Facilities Planning & Design for Financial Institutions Bankline Publications, 1996, ISBN 1-55738-780-X (1996).
Owen, David, Facilities Planning & Relocation RSMeans, ISBN 0-87629-281-3 (1993).
Larsen, Amy, Internet goes to Work for Builders, InterWeek, Nov. 16, 1998, Issue 741.
Radosevich, Is Work Flow Working?, CNN.com, Apr. 6, 1999 at <http//www.cnn.com/TECH/computing/9904/06/workflow/ent.idg, p. 1 of 5, retrieved from the internet on Nov. 28, 2005.
Frank, John N. Frank, Beyond Direct Mail, Credit Card Management, vol. 9, Iss. 5, Aug. 1996, 4 pgs.
Kilian-Kehr, Roger, Kilian-Kehr, Mobile Security with Smartcards, Dissertation, Apr. 8, 2002 (Summary Only).
Mary C. Lacity, et al., Mary C. Lacity, et al., The Information Systems Outsourcing Bandwagon, Sloan Management Review, vol. 35, No. 1, Fall 1993, p. 73-86.
Omware, Inc., Web Pages, Feb. 2000, Retrieved from http//web.archive.org/web20000226033405/www.omware.com/products.html, Retrieved from the internet on Nov. 28, 2005.
Youll, James, Peer to Peer Transactions in Agent Mediated Electronic Commerce, Aug. 10, 2001.
Point for Windows Version 3.x Interface Marketing Guide.pdf (1999).
Primavera Expedition User Guide (1998).
Primavera Systems Delivers Expedition Express,Business Wire, Feb. 23, 1999.
Van Collie, Shimon Craig, Problem Disbursement Control Needed Construction Loan Tool from PriMerit NewTrend, Apr. 1990.
Deckmyn, Dominique, San Francisco manages $45M project via web-based Service, Computerworld, Aug. 9, 1999, vol. 33, No. 32, p. 14.
Mosig, Richard, Software Review the Construction Project Manager Cost Engineering, Jan. 1996, vol. 38, No. 1, pp. 7-8.
Hernandez, Tomas et al., Software Solutions, Building Design & Construction, Nov. 1999, vol. 40, No. 11, pp. 38-40.
Taylor, Telecommunications Demand Analysis in Transition, Proceedings of the 31st Hawaii International Conference on System Sciences, vol. 5, Jan. 6-9, 1998, pp. 409-415.
Brown, Keith, The Buiders Revolution, Internet Archive Wayback Machine, Jan. 1998.
Cotts, David, The Facility Management Handbook Second Edition AMACM, ISBN 0-8144-030-8 (1999).
Carden, Philip, The New Face of Single Sign-on, Network Computing, http//www.networkcomputing.com, printed Dec. 29, 2000, 4 pages.
Yee, Bennet, Using Secure Coprocessors, May 1994.
5500—FDIC General Counsel's Opinion No. 8—Stored Value Cards, 61 Fed. Reg. 40490, http://www.fdic.gov/regulations/laws/rules/5500-500.html, Aug. 2, 1996.
Song, A Card That Asks for ID, Time Magazine, Apr. 12, 2004, 1 page.
A Store Card Issuer Looks for Lift from Electronic Gift Certificates, Credit. Card News, Feb. 1, 1995, 2 pages.
Hotchkiss, ATM's at the head of their class, Bank Marketing, vol. 29, No. 3, Mar. 1997, pp. 26-32.
Edwards, ATMs The Hot New Media Buy, ABA Banking Journal, Mar. 1999, pp. 58, 60.
Fickenscher, Amex Prepaid Offering is Latest Card for Firms Regarding Employees, American Banker, vol. 161, No. 151, Aug. 8, 1996, pp. 1-2.
Neumann, An Enhanced Neural Network Technique for Software Risk Analysis, IEEE Transactions on Software Engineering, vol. 28, No. 9, Sep. 1, 2002, pp. 904-912.
Associates First Capital Corporation, Hoover's Inc., The Industry Standard: The Newsmagazine of the Internet Economy, thestandard.net/companies/company-display, Apr. 6, 1999.
Brehl, Banks issue cash-card pledge, The Toronto Star, Oct. 9, 1997, 1 page.
Blockbuster running test of a stored value card, The American Banker, Sep. 1, 1995.
Meece, Boatman's Prepaid Cards for Worker-Incentive Firm, American Banker, Jul. 2, 1996, p. 12.
Boatmen's Floats Stored Value into the Employee Incentive Waters, Debit Card News, vol. 2, Issue 2, Jul. 16, 1996, 3 pages.
CESNaBANCO introduces stored value card technology blockbuster video is first merchant partner.
CardEx Incentives, www.cardex.com, Apr. 6, 1999.
CardFlash, Apr. 5, 2005.
Vandenengel, Cards on the Internet: Advertising on a $3 Bill, Industry Intelligence, Feb. 1, 1995, pp. 46-48.
Kutler, Cash Card Creator Looking Beyond Mondex, Feb. 9, 1995.
Rosen, Cash Just Isn't Flexible Enough: Shops of the Future Will Only Take Cards, Daily Express, Technology Section, Feb. 10, 1995, 1 page.
Bank, Cash, Check,Charge—What's Next?, Seattle Times, Mar. 6, 1995.
Morgan et al., Categorizing Risks for Risk Ranking, vol. 20, No. 1, Jun. 22, 2005, pp. 49-58.
Common electronic purse specifications, Business Requirements, Version 6.0, Dec. 1998.
Guidotti, Comparing Environmental risks: A Consultative Approach to Setting Priorities at the Community Level, Public Health Rev 1994, vol. 22, Jun. 16, 2005, pp. 321-337.
Britt, Competing in Auto Lending, America's Community Banker, vol. 5, No. 11, Nov. 1, 1996, pp. 33-37.
Consortium created to manage common electronic purse specification, Cardtech Securtech, Chicago, www.visa.com/av/news/PRmisc051199.vhtml, May 11, 1999.
Mobasher et al., Creating Adaptive Web Sites Through Usage-Based Clustering of URLs, Knowledge and Data Engineering Exchange Workshop, Chicago, IL and Los Alamitos, CA, 1999, pp. 19-25.
Lamond, Credit Card Transactions Real World and Online, Paying by Credit Card—Real World and Online, http://www.virtualschool.edu/mon/ElectronicProperty/klamond/credit, printed Jul. 8, 2005, 17 pages.
D.C. Area Safeway Stores Look for Increase in Sales Volume and Revenue with Cards, Card News, vol. 6, No. 25, Dec. 30, 1991, pp. 7-9.
Piskora, Debit Cards Seen Poised for New Markets, American Banker, Credit/Debit/ATMs, Mar. 7, 1995, p. 16.
E-Z Pass, Web page, http://www.ezpass.com-Disc_portNewYork.html, Nov. 12, 2001.
E-Z Pass, Web page, http:\\www.ezpass.com-Disc_ny_annual.html, Nov. 12, 2001.
E-Z Pass, Web page, http:\\www.ezpass.com-frameMain.html, Nov. 12, 2001.
E-Z Pass, Web page, http:\\www.ezpass.com-whatis.html, Nov. 12, 2001.
Business Times, Electronic Purse Can Free You from ATM Drag, Business Times, www.btimes.co.za, printed Feb. 23, 2001, 1 page.
Electronic Purse, SCIA (Smart Card Industry Association), About Smart Cards, www.scia.org, printed Feb. 23, 2001, 1 page.
Sanchez-Klein, Electronic purse alliance planned, Computerworld Online News, Jul. 29, 1998, printed Feb. 23, 2001, 2 pages.
Electronic purse card to be launched tomorrow, New Straits Times, News Clippings, Sep. 18, 1999, printed Feb. 23, 2001, 3 pages.
First Data markets stored-value cards, Cards International, Jan. 30, 1996, p. 5.
First USA—Activate Today and Get One Hour Free Calling Card Calls, Call 1-800-555-2535, First USA, 6 pages.
First USA—Call 1(800)335-2453 to Receive One Free Hour of Domestic Long Distance Calling (No Strings Attached), First USA, 6 pages.
First USA Platinum Connect, First USA Bank, First USA Promotional Mailing, Oct. 1997, 6 pages.
First Union Issues Smart Cards to Fort Benning Recruits, CardFax, vol. 1999, No. 60, Mar. 26, 1999, 1 page.
Norris, First data unit develops blockbuster cash card, Omaha World Hearld Sunrise Edition, Business Section, Jan. 19, 1996, p. 16.
Frequently asked questions, ECARD, www.eregard.com, printed Sep. 23, 2001, 7 pages.
Machlis, Have it the smart way: Burger King program drives smart-card use, Computerworld, printed Feb. 23, 2001, 1 page.
Here's the calling convenience you asked for: 1-800-call-ATT . . . For All Calls, AT&T, Appendix A: For Card Carriers, 1999, 7 pages.
Hoovers, General Mills, Inc. Corporate Profile relied upon to show the history of the company, http:/cobrands.hoovers.com/global/cobrands/proquest/history.xhtml?COID=10639, Jul. 12, 2005, 2 pages.
Konrad, IBM Had a Bunch of Unusual Ideas in 2003, www.philly.com, printed Jan. 21, 2004, posted on Jan. 13, 2004, 2 pages.
Incentive Firms Find Debit Cards a Rewarding Experience (Off-line debit card issuers converge efforts with companies looking for effective incentives to boost employee productivity and to motivate individuals to buy their products), Debit Card News, vol.
Coulton, Incentives Field Moving to Card-Based Series 14, American Banker, Mar. 26, 1998, 3 pages.
Introducing SpendingMoney(TM), Armetta: Marketing & Design Product Concept Report, Oct. 9, 1996, 15 pages.
Introducing the First USA Platinum Connect Card, First USA Promotional Mailing, Dec. 1997, 2 pages.
Key Bank Holiday Offer, http://www.key.com/swiftgift/home.html, printed Apr. 5, 1999.
MailFrontier Survey Finds that Consumers Hold Financial Institutions Accountable for Online Identitiy Theft, www.mailfrontier.com, Palo Alto, CA, Nov. 2004.
O'Conner, Maritz Gets MasterCard's Stamp of Approval, Business Travel News, Aug. 19, 1996, 2 pages.
Clark, Microsoft, Visa to Jointly Develop PC Electronic-Shopping Software, The Wall Street Journal, Nov. 9, 1994, Nov. 9, 1994 WSJ B9.
More Retailers Turn to Co-Branding, Chain Store Age Executive with Shopping Center Age, Feb. 1, 1995, 3 pages.
Bogle, Mutual Funds at the Millennium: Fund Directors and Fund Myths, The Vanguard Group to the '40 Act Institute of PLI (Practicing Law Institute), New York, NY, May 15, 2000, 15 pages.
New 1-800-CALL-ATT Campaign Promotes One Number For All Calls, AT&T Marketing, News Release, www.att.com/press/0297/970217.csa.htm, Feb. 17, 1997, 2 pages.
Payment data, www.paymentdata.com, Mar. 5, 2004.
Dugas, Payroll May Ask: Paper or Plastic?, USA Today, 3B, Aug. 14, 2001, 1 page.
Proton world and Europay to co-operate in creation of new CEPS-compliant e-purse application, Press Release 1999, Waterloo, Belgium, Jun. 28, 1999, 2 pages.
Brown et al., Purchasing Card Magic: Eli Lilly Finds Accounts Payable Flying High With Plastic, Corporate Cashflow, vol. 15, No. 12, Nov. 1994, 2 pages.
Purse Application for Cross Border Use in Euro, Cordis, Pace 1st 1999-11531 Pace, www.cordis.lu, printed Feb. 23, 2001, 3 pages.
SK100 Smart Card Electronic Purse Balance Reader, SK100 Balance Reader, http://perso.wanadoo.fr, printed Feb. 23, 2001, 1 page.
Miller, Section E.2.1: Kerberos Authentication and Authorization System, Project Athena, Cambridge, MA, Dec. 21, 1987, 39 pages.
Souccar, Smart Cards: 1st Union Smart Card Pilot Enlists a Second Army Base, American Banker, Digital Frontiers, vol. 164, No. 61, Mar. 31, 1999, 3 pages.
Smart card for loyalty and e-purse applications eclipses capability of conventional mag-stripe cards, Press Release, www.1.sib.com, Apr. 21, 1997, printed Feb. 23, 2001, 3 pages.
SmartAxis: Load Cash on to your E-Purse Card, Supported Currencies and Schemes, www.smartaxis.co.uk, printed Feb. 23, 2001, 9 pages.
Spurgin, Sopininmon! or What's Happening in the Retail Credit Card Environment, Credit World Journal, vol. 85, No. 4, Mar. 1, 1997, pp. 20-23.
Lacker, Stored Value Cards: Costly Private Substitutions for Government Currency, Economic Quarterly, 1996, Economic Quarterly, v82, n3, p. 1(25), ISSN: 1069-7225, 17 pages.
Lzarony, Stuck for a gift? Give a prepaid credit card, www.bankrate.com, Dec. 21, 1998, 1 page.
Key, Swift Gift ‘Wows’ Internet Shoppers, PR Newswire, www.key.com/swiftgift/home.html, Dec. 2, 1998, 1 page.
The Campus Card Conundrum, Card Technology, Journal ISSN: 1093-1279, p. 25+, Feb. 1998, pp. 1-8.
The Electronic Purse Reaches the Car Park, http:\\docs.vircom.net/mobility/parking, printed Feb. 23, 2001, 2 pages.
The Evolution of a New Consumerism, Chain Store Age, vol. 73, Jun. 1997, pp. 8-9.
Stoughton, The Gift of Credit, www.washingtonpost.com/wp-srv/business, Dec. 14, 1998.
Stuber, The electronic purse: An overview of recent development and issues, Bank of Canada, Technical Report No. 74, www.bankofcanada.ca, Jan. 1996, printed Feb. 23, 2001, 2 pages.
Understanding the benefits: Smartcity offers a number of important benefits to both the card issuers and their customers, http://www.icl.com/smartcards/benefits.htm, printed Feb. 27, 2001, 2 pages.
Langheinrich et al., Unintrusive Customization Techniques for Web Advertising, Computer Networks, vol. 31, 1999, pp. 1259-1272.
Universal Card free lifetime membership extended 3 months, AT&T Marketing, www.att.com/press/0297/970217.csa.html, Dec. 4, 1990, 2 pages.
Visa Cash—Where can I get it?, www.visa-asia.com/pd/cash/where.html, Feb. 23, 2001.
Visa Cash, www.visa-asia.com/pd/cash/main.html, Feb. 23, 2001.
Visa International and SERMEPA Announce Plans for Cross Border Visa Cash Based on CEPS, www.visa.com/av/news/praaamisc111699.vhtml, Nov. 16, 1999.
Visa first to launch electronic purse load via GSM mobile phone, www.cellular.co.za, Johannesburg, ZA, printed Feb. 23, 2001, 4 pages.
Visa releases visa cash electronic purse specifications based on CEPS, www.visa.com/av/news/PRaamisc042099.vhtml, San Francisco, Apr. 20, 1999.
Hansell, Visa to unveil electronic purse cards, New York Times, printed Feb. 23, 2001, 2 pages.
Welcome to Card Express CardEx, CardEx website archived by web.archive on Oct. 31, 1996, http://web.archive.org/web/*/http://www.cardex.com, retrieve Oct. 18, 2003, 7 pages.
Welcome to Card Express, The CardEx Incentive Card, as disclosed in the CardEx web site archived by web.archive.org on Feb. 7, 1998, http://web.archive.org/web/*/http://www.cardex.com, retrieve Oct. 18, 2003, 8 pages.
Swiftgift, Welcome to Swiftgift, Swiftgift, www.swiftgiftcard.com, Dec. 8, 1998, 10 pages.
Machlis et al., Will smart cards replace ATMs?, Computerworld, printed Feb. 23, 2001, 3 pages.
Schwab, Charles, Now 7 Ways for a better Total Return for Your Money; Schwat 1, The Inventor's Asset Management Account, Charles R. Schwab, Charles Schwab & Co., Inc., 16 pages.
Smart Cards: Big Brother's Little Helpers, The Privacy Committee of New South Wales, No. 66, Aug. 1995.
Continuations (1)
Number Date Country
Parent 11137409 May 2005 US
Child 13621995 US
Continuation in Parts (2)
Number Date Country
Parent 10419107 Apr 2003 US
Child 11137409 US
Parent 10105471 Mar 2002 US
Child 10419107 US