System and method for securely authorizing and distributing stored-value card data

Information

  • Patent Grant
  • 8706630
  • Patent Number
    8,706,630
  • Date Filed
    Friday, September 5, 2003
    20 years ago
  • Date Issued
    Tuesday, April 22, 2014
    10 years ago
Abstract
A computerized system and method for securely authorizing and distributing stored-value card data over a communications network is provided. The method allows for storing in the database a plurality of records comprising stored-value card data for each stored-value card as well as information identifying a plurality of trusted sources of stored-value card activation requests and/or a plurality of trusted communications networks for transmitting stored-value card activation requests. A transmitting step allows for a requesting terminal to transmit over a communications network a request to change the status of a stored-value card. The central processor then determines whether the requesting terminal and/or the communications network is a trusted source. Based on whether the requesting terminal or communications network is a trusted source or trusted communications network, the request can be processed and the card can be activated. A method for establishing a list of trusted sources and trusted communications networks is also provided.
Description
FIELD OF THE INVENTION

The present invention is generally related to remote data authorization and distribution. More particularly, the present invention is related to a system and method for securely authorizing and distributing stored-value card data between a plurality of users and a central processor over a communications network.


BACKGROUND OF THE INVENTION

Stored-value cards can be authorized and distributed over communications networks. Examples of communications networks include dedicated telephone lines, public telephone links, and the internet or other networked communication. The data of the stored-value cards is related to services and/or products prepaid by the owner or end user of the card. Examples of prepaid services that may be accommodated by the stored-value data include long distance telephone communication, wireless communication, paging and internet-enabled communication services, including wireless web access. Other examples of prepaid services and/or products that may be accommodated by the stored-value card include gift cards, prepaid gas cards, prepaid grocery cards, prepaid entertainment cards, downloadable ring tone cards, downloadable game cards, downloadable music cards that use MP3, MP4, WMV, WAV, or other music formats, any other downloadable software card, customer rewards cards, and any other type of stored-value cards for products, services, or both, that may be prepaid by the owner of the card.


Stored-value cards, such as prepaid long distance phone cards, are generally used in the telephone industry to allow customers to pre-purchase long distance calling time. Each of the cards has a printed identification number. Associated identification information can be magnetically stored therein or printed in a barcode. The identification number is also stored in a file in a database maintained by the card issuer. In the traditional business model, when the cards are sent to the retail location from which they will be sold, the corresponding records in the database are activated, thus allowing the card to be used immediately by a customer. To use the card as a prepaid long distance card, the customer dials a toll free number to access the card issuer's system, enters the identification number, and then makes the desired long-distance call.


These prior art prepaid phone card systems have several disadvantages. For example, since the cards are active while on the shelf in the retail location, the cards may be stolen by a thief and easily used. One way to address some of the drawbacks of prior art prepaid phone card systems would be to install activation terminals unique to the prepaid card issuer. This is referred to as a “closed system.” U.S. Pat. No. 5,577,109 to Stimson et al. discloses such a closed system. In the Stimson system, the cards are not preactivated. Each of the retail locations from which cards are to be sold is provided with a dedicated activation terminal which allows the retail operator to set the value of the card at the time of the sale. The activation terminal connects to the card issuer's system to pass along the value amount and to request activation of the card. Depleted cards can be recharged in the same manner as they are sold. A serious disadvantage of the Stimson system is that it requires single-function dedicated hardware to be installed in each retail location, resulting in a very inflexible and expensive system.


U.S. Pat. No. 6,000,608 to Dorf provides a multifunction card system including a prepaid phone card activating system which allows cards to be purchased in varying amounts and to be recharged without requiring the use of a closed system to handle the transactions. Although Dorf purports to alleviate some of the drawbacks of Stimson by using point-of-sale devices connected to a banking system, it is believed that Dorf fails to verify sources of card activation requests so as to enhance detection of potential security breaches that could ensue in any system accessible to a large number of users.


It would be further desirable to provide a system and method for selectively processing stored-value card requests, such as stored-value card activation, deactivation, and/or value change, based on the communications network over which the request is transmitted. Additionally, it would be further desirable to provide a system and method for selectively processing stored-value card requests based on the source of the request, wherein such request can be received over a variety of communications networks that are available to unauthorized users. It would be further desirable to provide a method of determining a plurality of communications networks and a plurality of sources of activation requests that are authorized to carry or make valid requests, respectively, either prior to or at the same time as such requests are made.


BRIEF SUMMARY OF THE INVENTION

Generally speaking, the foregoing needs are fulfilled by providing in one exemplary embodiment a computerized method for securely authorizing and distributing stored-value card data over a communications network. The method allows for storing in the database a plurality of records comprising stored-value card data for each stored-value card and a plurality of records comprising information identifying trusted sources of requests to change the status of a stored-value card and/or information identifying trusted communications networks known to transmit valid requests. Trusted sources can include any requestor, including merchant terminals on a dedicated line, merchant terminals at a particular or identified phone number, and merchant terminals at a particular or identified internet IP address. Trusted communications networks that are identified to be trusted sources may comprise the internet when the requestor has a static IP address or any other computer network such as a WAN or LAN, a dedicated data line such as a dedicated phone line, and a public switched telephone network that provides automatic number identification (ANI). A transmitting step allows for transmitting a request to change the status of a stored-value card over a communications network from a requesting terminal to the central processor. Such communications networks comprise dedicated data lines such as dedicated phone lines, frame relay or X.25 circuits, public telephone links such as a public switched telephone network, and the internet, including networks wherein the merchant terminal is part of a WAN or LAN. The central processor is configured to receive requests from merchant terminals over one or more communications networks and determine whether the respective terminal is a trusted source and/or whether the request was transmitted over a trusted communications network. A processing step allows for processing the request based on the determining step.


In yet another aspect thereof, the present invention fulfills the foregoing needs by providing a computer-readable medium encoded with computer program code for securely authorizing and distributing stored-value card requests over a communications network, the program code causing a computer to execute a method comprising: controlling a database coupled to the central processor; storing in the database a plurality of records comprising stored-value card data for each stored-value card as well as information identifying trusted sources for making stored-value card processing requests and/or information identifying trusted communications networks for carrying or transmitting stored-value card processing requests; receiving a request for processing the stored-value card over a communications network from a requesting terminal to the central processor; determining whether the respective requesting terminal is a trusted source of requests for processing and/or whether the communications network is a trusted communications network for carrying or transmitting requests for processing; and processing the request based on the determining step.


Other embodiments can be considered.


In yet another aspect thereof, the present invention fulfills the foregoing needs by providing a method for securely authorizing stored-value card transactions. The method includes an identifying step for identifying one or more trusted sources of stored-value card processing requests and/or one or more trusted communications networks for carrying and/or transmitting stored-value card processing requests. An assigning step allows for identifiers to be assigned to each identified trusted source and trusted communications network. A storing step allows for storing the identifiers in a database coupled to a processor configured to receive a request to process stored-value cards, wherein the request is received from a user terminal over a communications network. In another step, it is determined whether the respective requesting terminal is a trusted source of requests for processing and/or it is determined whether the communications network is a trusted communications network for carrying or transmitting requests for processing. Finally, the method allows for processing the request based on the determining step.


Other embodiments can be considered.


In yet another aspect thereof, the present invention fulfills the foregoing needs by providing a system for authorizing stored-value card requests over a communications network between a plurality of terminals and a central processor. The system comprises a database coupled to the central processor. The system also comprises a storage module configured to store in the database a plurality of records comprising stored-value card data for each stored-value card as well as information identifying trusted sources for making stored-value card processing requests and/or information identifying trusted communications networks for carrying or transmitting stored-value card processing requests. The system also comprises a value module configured to define in each stored record a parameter corresponding to the value of each respective stored-value card; a first processing module configured to process a request from a respective requesting terminal to the central processor, the central processor configured to accept the request based on whether the request originated from a trusted source and/or whether the request was transmitted or carried by a trusted communications network.


Other embodiments could be considered.


According to yet another embodiment of the invention, a method for securely authorizing stored-value card transactions is provided. The method comprises identifying one or more trusted sources of stored-value card processing requests and/or one or more trusted communications networks for carrying and/or transmitting stored-value card processing requests. An assigning step allows for assigning identifiers to each identified trusted source and trusted communications network. A storing step allows for storing the identifiers in a database coupled to a processor. A receiving step allows for receiving a request to process stored-value cards, wherein the request is received from a user terminal over a communications network. A determining step allows for determining whether the respective requesting terminal is a trusted source of requests for processing and/or determining whether the communications network is a trusted communications network for carrying or transmitting requests for processing. Finally, a processing step allows for processing the request based on the determining step.


Other embodiments could be considered.





DESCRIPTION OF THE DRAWINGS


FIGS. 1-4 respectively illustrate schematic block diagrams showing how various exemplary stored-value card user trees, as shown in FIGS. 1-3, may be connected via a communications network to a remote stored-value card data management system embodying the present invention;



FIG. 5 is an exemplary modular architecture of the telecommunications card data management system shown in FIGS. 1-3;



FIG. 6 is an exemplary flow chart illustrating one aspect of the present invention as may be implemented by the system of FIG. 5;



FIG. 7 is an exemplary flow chart illustrating another aspect of the present invention as may be implemented by the system of FIG. 4;



FIGS. 8A, 8B, and 8C are block diagrams illustrating different types of communications networks;



FIG. 9 is a block diagram illustrating an exemplary user tree and communication path of requests for stored-value cards between terminals and the central processor; and



FIG. 10 is an exemplary flow chart illustrating another aspect of the present invention as may be implemented by the system of FIG. 3.





Before any embodiment of the invention is explained in detail, it is to be understood that the invention is not limited in its application to the details of construction and the arrangements of components set forth in the following description or illustrated in the drawings. The invention is capable of other embodiments and of being practiced or being carried out in various ways. Also, it is to be understood that the phraseology and terminology used herein is for the purpose of description and should not be regarded as limiting.


DETAILED DESCRIPTION OF THE INVENTION


FIGS. 1-4 illustrate examples of entity trees that may benefit from the system and techniques of the present invention. For simplicity of illustration, the customer/distributor layer at the top is omitted. Each distributor can have subordinate to it any of the illustrated types of structures. Note that in each case, a merchant 2 is at the top, with a layer of locations 3 just above a layer of terminals 12.


As shown in FIGS. 1 through 3, by way of a communications network 10, e.g., a public switched phone network, a wireless network, a dedicated data circuit such as a dedicated phone line, a credit or debit card network, the Internet, an intranet, etc., over which credit or debit card transactions are authorized or denied, and/or a point-of-sale terminal 12, e.g., a credit or debit card terminal, is used to send an authorization request to a stored-value card data management system 14, such as may be managed and operated by the assignee of the present invention. System 14 comprises a central processor 16 coupled to a database 18. The central processor 16 can be a host computer, a computer server, a computer system with software applications that receive transactions and process them according to preset rules, and any other computer system. The database 18 stores a plurality of records including stored-value card data for each stored-value card issued by the assignee of the present invention. The database can also store information identifying trusted sources for making stored-value card processing requests, such as requests to activate a stored-value card, and it can additionally store information identifying trusted communications networks for carrying or otherwise transmitting stored-value card processing requests. The identification information can be a telephone number, a static IP address, a password, a PIN, a merchant and/or terminal ID, or another unique code that can be associated with a particular user, merchant terminal, or communications network. The code may be chosen by a user at the terminal, randomly assigned, or selected from a list of codes by the central processor 16 and assigned to the terminal. It will be appreciated that in the case of a credit or debit card network, each stored-value card transaction request is expected to be handled, on average, within a certain time period such as approximately two seconds, or else one could lose its certification to use that network.


A respective requesting terminal, using the communications network 10, may send an authorization request through a suitable host bank 20 to the central processor. The authorization request could also be routed straight to the communications network 10 without passing through a host bank 20. FIGS. 1 through 3 show an exemplary link architecture between the communications network and the central processor, optionally through the host bank. That is, the link architecture allows communication of card related data from the merchant, to the communications network, which in one exemplary embodiment would be the Visa network for a Visa-routed transaction, to the host bank, and then to the central processor. It will be appreciated that other link architectures may be implemented, such as a host-to-host architectural connection. In this case, the communications network, such as a dedicated link or the internet, would be directly between a merchant's “host” system and a “host” system of the assignee of the present invention. Thus, the present invention is not limited to applications that require a host bank being that a host-to-host connection does not require any host bank or Visa network to transfer the card-related data to the central processor.


The authorization request may include information about the card swiped and the terminal used to swipe it, such as the electronic signature of that terminal, an IP address of the terminal, a phone number of the terminal, or a password provided by the terminal. It should be appreciated that other methods may be used to capture identification of the card besides swiping it; for instance, the information can be barcode-scanned or entered manually at a keypad of a computer. Further, merchant terminals 12 may be any system that can transmit card identifier information over a communications network. Thus, merchant terminals 12 can be telephones, electronic cash registers, credit card machines, fax machines, computers, or other devices that can receive and transmit information.


In another aspect of the system of the present invention, as shown in FIGS. 3 and 4, merchants and terminals can be divided into groups, membership of which varies depending on whether the context of the grouping is for the purpose of executing any specific action out of a set of actions that a respective user may execute, such as card activation, billing, commission payments, reporting, inventory management, etc. For example, terminal A from Merchant X may be in activation group I with terminal B from merchant Y, yet for billing purposes the two terminals may be in different groups. Also, Merchant X may be affiliated with terminals A, B, and C, and thus A, B, and C may be classified in the same group. Merchant X may also be grouped with Merchant Y and its terminals D, E, and F. In this way, terminals A-F may be in the same activation group for instance. The central processor can be preconfigured to determine whether a terminal is a trusted source based on whether the requester is in the same group as another terminal or merchant that is considered a trusted source.


Terminals in a given group can share a communications network. For instance, all the terminals in a given group may share a dedicated data line that connects them to the central processor. Requests can then be authorized when the central processor recognizes that the request was received via the dedicated data line and determines that the dedicated data line is a trusted source. Similarly, terminals in a given group can share a set of static IP addresses. In one embodiment, terminals are assigned static IP addresses when they log on to a server operated by an entity associated with the group. The server entity assigns a terminal an IP address selected from a defined set of IP addresses. Each of the IP addresses in the defined set is a trusted source and therefore has identifying information stored at the database.


Management and definition of these groups is the responsibility of a module configured to store in the database a list of trusted sources and trusted communications networks. The database can also include a table indicative of the set of actions that a respective user may execute from a respective terminal.



FIG. 4 shows an exemplary entity tree for a store-value card merchant 2. One or more merchant terminals 12 are located at a particular location 3 of a merchant, such as a particular store location. One or more locations 3 will be associated with a stored-value card merchant 2. Stored-value card merchants 2 may then be affiliated or otherwise associated with other stored-value card merchants 2, which may in turn have further affiliations with additional stored-value card merchants 2. By means of such a stored-value card merchant 2 network, a given merchant 2 may be associated with one or more locations 3 and terminals 12 through other merchants 2. For the sake of simplicity of illustration, blocks representing the stored-value card data management system and other associated blocks are not shown in the user entity trees shown in FIG. 4. It will be appreciated, however, that each of such user entity trees will be similarly interconnected to the stored-value card data management system 14 as exemplarily illustrated in FIGS. 1 through 3 or as further described herein.



FIG. 5 illustrates further details in connection with stored-value card data management system 16. As shown in FIG. 5, central processor 16 includes a storage control module 34 that allows for storing in database 18 a plurality of stored-value card records 37 comprising stored-value card data for each stored-value card, information identifying trusted sources for making stored-value card processing requests, and information identifying trusted communications networks for carrying or transmitting stored-value card processing requests. An associating module 36 allows for associating in each stored record respective identifiers that uniquely match a respective stored-value card and a respective terminal, or to match a card or terminal with other associated identifier information. A card value module 35 allows for defining in each stored record a parameter corresponding to the value of each respective stored-value card. That parameter could comprise a monetary amount corresponding to the value of each respective stored-value card or such parameter could comprise time units corresponding to the value of each respective stored-value card, or both. The card value module 35 may also allow for defining the parameters or methods by which a card's value can be changed.


Stored-value card data transmitted over the communications network may be received by input/output module 33 so that a first processing module 30 may process a request of stored-value card activation to the central processor from a respective requesting terminal. The central processor thus allows for accepting or declining an activation request, or other processing request, based on whether the request is from a trusted source or whether the request is transmitted over a trusted communications network.


The processing modules may also comprise modules for changing value, refreshing value, redeeming value, switching the value to another product, service, or currency, or otherwise changing the status of the stored-value card. Other processing modules can be considered. The refreshing module may change the value of the card back to the card's original value. Alternately, the refreshing module may add the card's original value to the current value of the card. For instance, via the refreshing module, a card with a current value of $15 and an original value of $20 could be increased to $20 (original value) or to $35 (current value plus original value), depending on the type of refreshing module. Generally speaking, values can be changed in predetermined increments (like $10) or any amount that is not predetermined. The redeeming module may refund to the customer the value of the card or a portion of the value of the card, or it may provide a monetary or other credit to the customer's account. It may also convert the value of the card into other goods or services offered by the merchant, merchant partner(s), or any other entity associated with the sale of the card, including the central processing station.


In one aspect of the present invention, the stored-value card may only be authorized if the request is made by any of a set of trusted sources, or made through a communication that travels over a trusted communications network. Through means described above, terminals that are trusted sources can be associated with respective identifiers by the associating module 36. However, trusted sources may not have any associated identifiers before a given transaction; instead, trusted sources may be verified to be trusted sources through means described herein.


As further shown in FIG. 5, data from the terminal is received at the I/O module 33. In one embodiment, information about the communications network used to make the request can be identified to the first processing module 30 based on the source of the request signal received at the I/O module 33. For instance, a dedicated data line may have a dedicated input at the I/O module 33, and requests made over the dedicated line will therefore be recognized to be transmitted by the dedicated data line because they are received at the I/O module 33 through the dedicated input. Alternately, a dedicated data line can carry or add identification information as an addition to the request communication. For instance, a dedicated data terminal can be preconfigured to transmit the series of numbers “1234567” before or after every merchant terminal communication in order to identify that the merchant terminal communication is being transmitted over the dedicated data line. In this embodiment, the central processor 16 can then determine that the request was made over a dedicated line by analyzing the information identifying the dedicated data line.


A first processing module 30 configured to process a request of stored-value card activation will analyze this data and send back either an authorization or a disapproval to the requesting terminal. For instance, a first processing module 30 can access the database through the I/O module 33 and compare the information of the terminal with a list of trusted sources stored in the database. If the information of the terminal matches a trusted source data entry in the database, the request will be authorized. If authorized, a database coupled to the central processor can be updated to reflect any authorization or disapproval. A similar process can be used when information is received over a trusted communications network. The first processing module 30 identifies the communications network used to make the request and grants the request if it determines that the communications network is a trusted one. The first processing module 30 can make this determination by itself or by comparing identification information of the communications network to a list of trusted communications networks stored at the database 18.


As further shown in FIG. 5, a second processing module 31 allows for processing a request for changing the value associated with a respective stored-value card. The request is transmitted over the communications network to the central processor from a respective requesting terminal. The central processor thus further allows for accepting or declining the change value request based on whether the respective identifiers stored in the record for the stored-value card whose associated value is to be changed match the identifiers actually transmitted by the requesting terminal for that stored-value card and terminal. A third processing module 32 allows for processing a request of stored-value card deactivation to the central processor from a respective requesting terminal. In this case, the central processor is configured to accept or decline the deactivation request based on whether the request is from a trusted source or whether the request is transmitted over a trusted communications network.



FIG. 6 illustrates an exemplary flow chart 100 such as may be implemented by a stored-value card data management system embodying one aspect of the present invention. The method described in this flowchart is preferably used when a requesting terminal has already been assigned an associated identifier, such as the number 456 as used in the following example. As shown in step 52, a stored-value card serial No. 123 is associated with terminal No. 456. In step 53, a request for activation of stored-value card serial No. 123 is processed. In one embodiment, it may be processed as follows. A verification module would allow for determining whether that request came from terminal No. 456, as in step 54. Then the verification module determines whether card 123 has been assigned to the location containing No. 456, as shown in step 55. If the verification module determines that in fact such request was generated from terminal No. 456, and card 123 has been assigned to the location containing terminal 456, then the central processor would generate a message indicating that the request has been accepted, as in step 57. If the verification module determines that the requesting terminal is other than No. 456, or if the card is not assigned to the location, then a message would be issued declining the transaction, as shown in step 56.



FIG. 7 illustrates an exemplary flow chart 101 such as may be implemented by a stored-value card data management system embodying one aspect of the present invention. As shown in steps 64 and 65 of FIG. 7, a terminal with no associated identifier makes a request for changing the status of a stored-value card with exemplary serial No. 123, which serial number has not been associated with any terminal. The request may then be processed as follows. In step 66, a verification and/or authorization module would allow for determining whether the request originated from a trusted source, such as a source identified in the central processor's database. The operation of the verification module depends on the type of communications network on which the request was made, as shown further in FIG. 8. If the request is not from a trusted source, then the request is denied or otherwise held or halted in step 67. Appropriate action may then be taken, such as attempting to identify or locate the requester or merchant terminal, or invalidating the stored-value card with the identified serial number.


If the request is determined to be from a trusted source, then the request will continue to be processed. As shown in step 68, the unidentified merchant terminal may then be assigned an identifier, and the identifier may then be associated with the stored-value card identifier as in step 69. The request is then processed and/or accepted in step 70.



FIGS. 8A, 8B and 8C illustrate various exemplary communications networks, which can be used to verify that a request is made from a trusted source. In FIG. 8A, a merchant data channel interface 12A communicates with a central processing apparatus 17, which can be a central processor, host bank, or other centralized entity, via a dedicated data channel between a merchant and the central processing apparatus, such as dedicated telephone line 10A. Because the communications network is a dedicated data channel, only the merchant and the central processing apparatus have access to the communications network, in addition to those entities that may be granted access to the communications network by the merchant and central processing apparatus. Thus, the central processor authorizes all requests made over the dedicated data channel because such requests are deemed to be from a terminal affiliated with the trusted merchant who has access to the dedicated line. In this embodiment, the central processing apparatus determines that the request is from a trusted source if the request is received over a dedicated data source.


It may be appreciated that the central processing unit 16 can then add the requestor to the list of trusted sources by storing information identifying the trusted source in the database 18. This could be accomplished by assigning an identifier, such as a password or code, to the requester and storing said identifying information in the database 18 as a trusted source. Then, if the requestor later makes a request over a communications network that is not considered a trusted communications network, like a public switched telephone network, then the requestor can identify itself over the network while making a request. The central processor 16 can then determine that the requestor is a trusted source and accordingly grant the request. That requester may then be classified as a trusted source for subsequent transactions so that future requests will be automatically granted.


One way the processor can determine that future requests from a particular trusted requestor are indeed from the trusted requestor is to assign identifying information to the requestor at the time the requestor is first determined to be a trusted source, such as when the requester makes a request over a trusted communications network like a dedicated data line. In this embodiment, the processor 16 communicates the identifying information to the requestor over the communications network 10 and also stores the information in its database 18. When the trusted source makes subsequent requests over any communications network, it includes the identifying information in its request to the processor 16. The processor receives the request with the accompanying identifying information. It can then compare the identifying information to the records stored in the database 18. By comparing the identifying information to the identifying information stored in the database 18, the processor can determine whether the merchant is a trusted source.


In one exemplary embodiment of FIG. 8A, ABC Stores, Inc. (“ABC”), a hypothetical trusted source, has a dedicated data line connecting one or more of its merchant terminals to a central processing apparatus. ABC opens a new ABC store with new merchant terminals that are as yet unknown to the central processing apparatus. In particular, the ABC store has been assigned no identifying information, and the database does not contain any information specifically identifying this particular ABC store. The unidentified terminal of the new store makes a request over the dedicated line. Although the central processing apparatus has never verified the identity of the new ABC terminals, the central processing apparatus will process and grant the request because it treats all requests made over ABC's dedicated line as a request made by a trusted source. In effect, any requester on a dedicated line is automatically a trusted source. Other embodiments can be considered.


However, in another exemplary embodiment, the new ABC store terminal must first obtain an identifier before its request can be granted. Upon receiving the request and determining that the request was received over a dedicated line that is a trusted source, the central processing apparatus assigns an identifier to the requesting terminal and associates the identifier with the stored-value card's identifier. Then the request can be processed and the card can be activated. Other embodiments can be considered.


In another embodiment, the central processing apparatus sets up an identifier before the request. For instance, ABC notifies the central processor that a new ABC store is opening soon, and an identifier is reserved for that new ABC store in the event that a terminal at the new ABC store makes a request. Then when the requesting entity makes a request, the requesting identity is already identified. In this instance, the request could be processed without the step of assigning an identifier to the new terminal. However, additional identification could be added and/or assigned at the time of the first request as needed. For instance, the new store could be issued a default password, and then the new store could request and/or obtain a new password when it makes its first request to the central processor.


In FIG. 8B, an unidentified merchant with a unique phone number 12B communicates a request for a stored-value card to a central processing apparatus 17, such as a central processor 16, over a public switched phone line 10B. Such communication may use a modem, an interactive voice response system (IVR), or any other means of communicating over a public switched telephone network. The central processing apparatus can identify the unique phone number of the merchant based on the DNIS and ANI numbers that are carried on regular phone calls. Similarly, the “caller ID” feature can be used to identify the phone number of entities contacting a remote entity over a public switched phone line. The central processing apparatus can then determine if the identified phone number is a trusted source by comparing the merchant terminal's phone number with the phone numbers of the trusted sources stored in the database 18. If the central processing apparatus 17 determines that the phone number does belong to a trusted source, then the central processing apparatus 17 will process and grant the request. Otherwise, the request may be rejected.


Other methods of identifying merchant terminals can be considered.


In the embodiment of FIG. 8B, the merchant 12B communicates a request for a stored-value card to a central apparatus over a public switched phone line 10B. The merchant 12B enters a password or other identifying information over the phone line, such as by transmitting a series of tones during a phone call with a central processing apparatus 17. Other methods of communicating identification information over a phone line can be considered, such as by fax or internet communication. The central processing apparatus 17 then compares the identifying information of the merchant 12B with identifying information of the trusted sources listed in the database 18. Based on the comparison, the central processing apparatus determines whether the merchant 12B is a trusted source. If the central processing apparatus 17 determines that the merchant 12B is a trusted source, then the central processing apparatus 17 will process and grant the request. Otherwise, the request may be rejected. Other embodiments can be considered.


In FIG. 8C, a merchant computer terminal with a static IP (internet protocol) address submits a request by communicating with the central processing apparatus 17 via the internet 10C. Through methods well known in the art, a merchant computer terminal can connect to the internet through a modem, LAN, WAN, cable connection, or other internet connection. The merchant terminal is assigned a static IP address by its internet service provider, which could be a merchant, merchant group, or another service provider. The merchant terminal 12C communicates a request to the central processing apparatus 17. Through methods well known in the art, the central processing apparatus 17 determines the static IP address of the terminal 12C based on the received electronic communication. By comparing the static IP address with the static IP addresses of trusted sources, the central processing apparatus 17 can determine if the terminal 12C is a trusted source. If it is, then in a method similar to that described above for FIGS. 8A and 8B, the central processing apparatus 17 processes the request and activates the card. If it is not determined to be a trusted source, then the request may be rejected.


In one embodiment, the request is accompanied by information identifying the merchant computer terminal 12C. For instance, the merchant terminal 12C may enter a password, which is transmitted from the merchant computer 12C with a static IP address to the central processing apparatus 17. Through methods described above, the central processing apparatus 17 can then determine whether the merchant terminal 12C is a trusted source based on the password. If the merchant computer 12C is a trusted source, then the IP address may become a trusted source, such as by storing the IP address in the list of trusted sources in the database. However, because in some cases a given merchant computer 12C may have a different IP address the next time it logs onto the internet, the central processing apparatus 17 may purge such static IP addresses unless the merchant computer 12C is otherwise known to have a permanent static IP address.


In another embodiment, the central processing apparatus 17 does not store the IP address as a trusted source. In this embodiment, verification of the identification at the beginning of the request is sufficient to authorize the transaction, and no further authorization steps are necessary. Other embodiments can be considered.


In one embodiment, due to an arrangement with the merchant terminal's 12C internet service provider, the merchant has the same static IP address for every internet session. The central processing apparatus 17 stores this address in the database as an identifier for a trusted source. The merchant 12C makes a request over the internet from the same static IP address, and the central processing apparatus 17 processes and grants such request after it identifies the request as originating from a trusted static IP address, such as a trusted static IP address of a merchant terminal 12C.


In another embodiment, the merchant 12C will be assigned one of a set of static IP addresses, each of which are trusted sources. The merchant 12C can then make requests that will be processed, as described above, because it will always make such request using a static IP address that is a trusted source.



FIG. 9 shows an exemplary user tree and communication path between a merchant terminal and the host bank and central processor. As illustrated in FIG. 9, point-of-sale terminals 12 can communicate with the host bank and central processor by interfacing first with a merchant communication interface 12D. The merchant communication interface 12D can be connected to any number of point-of-sale terminals 12, which in turn can be connected to any number of merchants. The merchant communication interface 12D may itself be a point-of-sale terminal 12. For instance, the point-of-sale terminals 12 and the merchant communication interface 12D may be computers connected on a LAN (local area network) or a WAN (wide area network). Communications from multiple terminals 12 may first pass through a merchant network hub before the communications leave the merchant and pass through other communications networks such as the internet, a dedicated line, or an outside phone system.


Alternately, in FIG. 9, as in FIGS. 1 and 2, the point-of-sale terminal can interface directly with the communications network.


It must be noted that in the above FIGS. 7-9, the requesting terminal or other requesting entity may not have a prior identifier associated with it before the first request. Thus, to this extent, the requesting entity is not identified to the central processor and host bank. However, other information may already be known about the requesting entity. In the ABC example described for FIG. 8A above, the data management system 14 could already determine that the requestor was an ABC entity, such as an ABC store terminal, because only ABC entities have access to the dedicated line. It should be appreciated that the step of associating an identifier with a previously unidentified terminal can be removed entirely. It should also be appreciated that these methods apply equally to the request/activation process over phone lines and the internet.


Those skilled in the art may also appreciate that the service provider and/or card value can be chosen by the user upon purchase or activation, or at any time chosen by the user. When the requesting entity such as a merchant terminal requests a card or PIN, the requesting entity asks for a specific dollar, minute, or other value for the card. The central processor could then simply alter the existing record for the card, if one exists, in order to reflect a higher or lower dollar amount as requested by the user over the communications network. E.g., a customer could request that a given amount, such as $50, be assigned to a particular card. During the process of authenticating the transaction, the central processor could edit its records to reflect the new card value. Thus, card values can be variable. This is true whether the card values are initially fixed, or whether their value is unidentified and unassigned until the point of sale. Similarly, in the case of telecommunications service or any other kind of user services applicable to stored-value cards, the user may select the service provider at the point of sale, or later if the card must be redeemed by the user at a later date. At any point when the user interacts with the central processor, that processor has the ability to amend and alter the identifiers associated with a card as well as any other associated information, such as the card's current value or face value.


The stored-value card data management system in one exemplary embodiment enables a web-based, ID and password protected application available to anyone with internet access and the appropriate ID and Password. As described-above, the system comprises respective modules for card generation, merchant establishment, location establishment, terminal setup, and inventory assignment to merchants and/or locations. The system may also be used for other card-related actions, such as web-based activation, deactivation, value change, refresh, and value redemption.


The present invention can be embodied in the form of computer-implemented processes and apparatus for practicing the processes described above. The present invention can also be embodied in the form of computer program code containing computer-readable instructions embodied in tangible media, such as floppy diskettes, CD-ROMs, hard drives, or any other computer-readable storage medium, wherein, when the computer program code is loaded into and executed by a computer, the computer becomes an apparatus for practicing the invention. The present invention can also be embodied in the form of computer program code, for example, whether stored in a storage medium, loaded into and/or executed by a computer, or transmitted over some transmission medium, such as over electrical wiring or cabling, through fiber optics, or via electromagnetic radiation, wherein, when the computer program code is loaded into and executed by a computer, the computer becomes an apparatus for practicing the invention. When implemented on a general-purpose computer, the computer program code segments configure the computer to create specific logic circuits or processing modules.



FIG. 10 is an exemplary flow chart illustrating another aspect of the present invention as may be implemented by the system of FIG. 3. In step 71, a person(s), processor, computer, or other entity identifies one or more trusted sources that are authorized to make stored-value card requests. The trusted sources may include, in a preferred embodiment, a list of merchants authorized to request PINs. Similarly, in step 72, an entity identifies one or more trusted communications networks that are known to carry or transmit only valid stored-value card requests. The trusted communications networks may include, in a preferred embodiment, a list identifying the various dedicated data lines connecting authorized merchants or merchant terminals to the central processor. Steps 71 and 72 are described separately, but it should be understood that these two steps need not be done in order. Further, the system should be constantly updating its list of trusted sources as new sources and networks are determined to be trusted sources.


In step 73, an entity such as the central processor 16 assigns identification information to the identified trusted sources and identified trusted communications networks. The identification information may be a merchant terminal ID number or other identifier, such as a static IP address or phone number. For communications networks, the identifier may be an internal code used to identify a particular communications network from another network. For instance, different communications networks that have different inputs into the processor system can be identified by assigning different numbers to the different inputs. In step 74, the identifiers are stored in a database 18. It should be noted that communications networks may not have identifiers in the traditional sense of the word, and such identifiers may not be amenable to storing in a database. For instance, trusted communications networks may be identified by virtue of having a different connection or input to the processor than communications networks that are not trusted, and thus they can be identified by virtue of having the separate connection.


In step 75, a request is received from a merchant terminal. Here, merchant terminal can mean any entity that submits a request to the processor. In step 76, the processor determines whether the request is from a trusted source, i.e., whether the requesting merchant terminal is a trusted source. The processor can make its determination based on information identifying the requester. For instance, requestors can be verified to be trusted sources by correctly entering a password over a phone network. Phone requestors can also be verified by determining that the requestor's phone number is listed in the database as a trusted source. Requestors who request over the internet can be verified by having made the request from a trusted static IP address, or from a static IP address known to have previously submitted a correct password. The processor verifies the sources by comparing their identifier information such as passwords with the identification information stored in the database 18.


The processor also determines whether the communications network carrying the request is a trusted communications network. If the request carries an identifier that identifies the communications network, the processor can compare the identifier with the trusted identifiers in the database. This verification process can also be done by simply determining how the request arrived at the processor. For instance, if input #3 is a trusted source and the processor determines that the request arrived via input #3, then the processor can determine that the request was carried by a trusted source. Other methods can be used, which are well-known in the art.


If the request is determined to be from either a trusted source or a trusted communications network, then the request is processed and granted in step 77. If the request is not determined to be from a trusted source or trusted communications network, then in step 78 the request may be denied, other means of verification can be pursued, or the request can be put into a hold category.


Other embodiments can be considered. For instance, for many of the embodiments described above, the request can be any request, including a request for activation, deactivation, value change, or another request.


It will be understood that the specific embodiment of the invention shown and described herein is exemplary only. Numerous variations, changes, substitutions and equivalents will now occur to those skilled in the art without departing from the spirit and scope of the present invention. Accordingly, it is intended that all subject matter described herein and shown in the accompanying drawings be regarded as illustrative only and not in a limiting sense and that the scope of the invention be solely determined by the appended claims.

Claims
  • 1. A computerized method for securely authorizing and transacting specific processing requests for stored-value cards from an originating merchant location over an originating communications network, the method comprising: storing in a database coupled to a central processor a plurality of records comprising information identifying specific merchant locations, if any, and information identifying specific communications networks for carrying or transmitting stored value card processing requests, if any, that are authorized to transact specific processing requests, each of the specific merchant locations and specific communications networks identified by an identifier;receiving at the central processor a specific processing request for a stored value card, along with the identifier of the originating merchant location or the originating communication network;determining at the central processor whether the received identifier of the originating merchant location or the originating communication network is stored in the database as a trusted source for making the specific processing request;responsive to a determination that the received identifier is associated with a trusted merchant location that is stored in the database as a trusted source for making the specific processing request, performing the specific processing request;responsive to a determination that the received identifier is associated with a trusted communication network for making the specific processing request for the stored value card: performing the specific processing request; andcapturing an identifier of the originating merchant location from which the specific processing request was sent over the originating communications network, deeming that the originating merchant location is a trusted source based upon its use of a trusted communications network, and storing the captured identifier of the originating merchant location in the database as a trusted merchant location for future processing requests, if not already stored in the database.
  • 2. The computerized method of claim 1, wherein said stored-value card is selected from the group consisting of: a gift card, a prepaid gas card, a prepaid grocery card, a prepaid entertainment card, a card used for downloading ring tones, a card used for downloading software, a card used for downloading music files and a customer rewards card.
  • 3. The computerized method of claim 1, wherein the originating communications network is a dedicated data circuit.
  • 4. The computerized method of claim 1, wherein the specific processing request is a request to activate, deactivate, reload, refresh, redeem, or refund the stored value card.
  • 5. The computerized method of claim 4, wherein the originating merchant location is identified by a static IP address, and the determining step is based on whether the static IP address is recorded in the database as a trusted source of processing requests.
  • 6. The computerized method of claim 4 wherein the originating merchant location is identified by a static IP address, the originating merchant location enters a password to access a network wherein the password is based on or identical to the static IP address, the originating merchant location communicates with the central processor using the static IP address, and the determining step is based on whether the static IP address is recorded in the database as a trusted source of processing requests.
  • 7. The computerized method of claim 4, wherein the request to activate, deactivate, reload, refresh, or refund a stored value card is associated with a respective stored value card, the request being transmitted to the central processor from an originating merchant location, the central processor configured to accept the request to activate, deactivate, reload, refresh, or refund a stored value card based on whether the respective identifiers stored in the record for the stored-value card match identifiers actually transmitted by the originating merchant location for that stored-value card.
  • 8. The computerized method of claim 1 wherein the request is transmitted over a public switched telephone network and the merchant location is determined to be a trusted source by performing a step selected from the group consisting of: identifying the telephone number used by the merchant location, and communicating an acceptable password or merchant location identifier to the central processor.
  • 9. The computerized method of claim 1 further comprising selectively encoding the specific processing requests based on a table of predefined codes stored in the database, the predefined codes being associated with respective user groups or locations.
  • 10. The computerized method of claim 1, wherein said stored-value card is a card for a purpose, selected from the group consisting of: downloading music files, downloading games, enabling long distance telephone communication, enables wireless communication, enables paging services, enables internet communication services, and enables wireless web access.
  • 11. The computerized method of claim 1, further comprising: receiving at the central processor a request from a customer to add stored value to a customer account, the request including a first identifier, wherein the first identifier and the stored value are associated with the stored-value card, and wherein the customer account is managed by a provider; andproviding from the central processor a provider identifier associated with the provider to the customer, wherein the provider identifier is effective to add the associated stored value to the customer account.
  • 12. The computerized method of claim 11, further comprising: establishing at the central processor communication between the customer and a provider communications system managed by the provider.
  • 13. The computerized method of claim 12, further comprising: adding the associated stored value to the customer's account after receiving the provider identifier from the customer.
  • 14. A system for authorizing and transacting specific processing requests for stored-value cards from an originating merchant location over an originating communications network, comprising: a database;a storage module connected to the database and configured to store in the database a plurality of records comprising information identifying specific merchant locations, if any, and information identifying specific communications networks for carrying or transmitting stored value card processing requests, if any, that are authorized to transact specific processing requests for a stored value card, each of the specific merchant locations and specific communications networks associated with an identifier;a processing module in selectable communication with the database and storage module, the processing module configured to: process a request from the originating merchant location to the processing module the request comprising an identifier of the originating merchant location or the originating communication network, the processing module configured to perform the request based on whether the received identifier is stored in the database as a trusted source for making the specific processing request for the stored value card; andresponsive to a determination that the received identifier is associated with a trusted merchant location that is stored in the database as a trusted source for making the specific processing request for the stored value card, performing the specific processing request for the stored value card;responsive to a determination that the received identifier is associated with a trusted communication network for making the specific processing request for the stored value card: performing the specific processing request for the stored value card; andcapturing an identifier of the originating merchant location from which the specific processing request was sent over the originating communications network, deeming that the originating merchant location is a trusted source based upon its use of a trusted communications network, and storing the captured identifier of the originating merchant location in the database as a trusted merchant location for future stored-value card processing requests, if not already stored in the database.
  • 15. The system of claim 14, wherein the processing module is capable of performing a specific processing request selected from the group consisting of: a request to change a status of the stored-value card, activating the stored-value card, deactivating the stored-value card, changing the value of the stored-value card, refreshing the stored-value card, and redeeming the value of the stored-value card.
  • 16. The system of claim 14 wherein the originating communications network is a dedicated data circuit.
  • 17. The system of claim 14 wherein the originating network is the Internet.
  • 18. The system of claim 17, wherein the originating merchant location is identified by a static IP address, and the processing module is capable of determining whether the static IP address is recorded in the database as a trusted source of processing requests.
  • 19. The system of claim 17 wherein the originating merchant location is identified by a static IP address and the originating merchant location is capable of communicating with the processing module using the static IP address to determine whether the static IP address is recorded in the database as a trusted source of processing requests.
  • 20. The system of claim 14 wherein the processing module receives the request over a public switched telephone network and the processing module is capable of determining whether the merchant location is a trusted source of processing requests.
RELATED APPLICATIONS

This application is a continuation-in-part of U.S. application Ser. No. 10/411,971, filed Apr. 11, 2003, now U.S. Pat. No. 7,083,084, which is a continuation of U.S. application Ser. No. 09/641,363 filed on Aug. 18, 2000, now U.S. Pat. No. 6,575,361, which claims priority to U.S. Provisional Application No. 60/149,740 filed on Aug. 19, 1999, all of which are incorporated herein by reference. This application is related to U.S. application Ser. No. 10/253,243 filed on Sep. 24, 2002 and International Application No. PCT/US02/30281 filed Sep. 24, 2002, which claim priority to U.S. Provisional Application No. 60/396,404 filed Jul. 15, 2002 and U.S. Provisional Application No. 60/324,333 filed on Sep. 24, 2001, which are all incorporated herein by reference.

US Referenced Citations (544)
Number Name Date Kind
3553440 Dale Jan 1971 A
3958103 Oka et al. May 1976 A
4068213 Nakamura Jan 1978 A
4317957 Sendrow Mar 1982 A
4482802 Aizawa Nov 1984 A
4734858 Schlafly Mar 1988 A
4747049 Richardson May 1988 A
4755940 Brachtl Jul 1988 A
4767917 Ushikubo Aug 1988 A
4795892 Gilmore Jan 1989 A
4877947 Mori Oct 1989 A
4900904 Wright Feb 1990 A
4908521 Boggan Mar 1990 A
4943707 Boggan Jul 1990 A
5117355 Mccarthy May 1992 A
5202826 Mccarthy Apr 1993 A
5255182 Adams Oct 1993 A
5274845 Wang Dec 1993 A
5309506 Alexander May 1994 A
5365046 Haymann Nov 1994 A
5383113 Kight et al. Jan 1995 A
5384449 Peirce Jan 1995 A
5386455 Cooper Jan 1995 A
5465206 Hilt et al. Nov 1995 A
5465288 Falvey et al. Nov 1995 A
5477038 Levine Dec 1995 A
5500513 Langhans et al. Mar 1996 A
5502765 Ishiguro Mar 1996 A
5511114 Stimson Apr 1996 A
5524073 Stambler Jun 1996 A
5577109 Stimson Nov 1996 A
5578808 Taylor Nov 1996 A
5621201 Langhans Apr 1997 A
5621787 McKoy Apr 1997 A
5644721 Chung et al. Jul 1997 A
5657389 Houvener Aug 1997 A
5673309 Woynoski Sep 1997 A
5679938 Templeton Oct 1997 A
5679940 Templeton Oct 1997 A
5684291 Taskett Nov 1997 A
5696908 Muehlberger et al. Dec 1997 A
5696909 Wallner Dec 1997 A
5705798 Tarbox Jan 1998 A
5721768 Stimson et al. Feb 1998 A
5721781 Deo Feb 1998 A
5732136 Murphree Mar 1998 A
5740160 Ikegami et al. Apr 1998 A
5754655 Hughes et al. May 1998 A
5760381 Stich Jun 1998 A
5777305 Smith et al. Jul 1998 A
5777565 Hayashi et al. Jul 1998 A
5806045 Biorge et al. Sep 1998 A
5812668 Weber Sep 1998 A
5815561 Nguyen Sep 1998 A
5828740 Khuc Oct 1998 A
5844972 Jagadish Dec 1998 A
5850599 Seiderman Dec 1998 A
5868236 Rademacher Feb 1999 A
5870724 Lawlor et al. Feb 1999 A
5873072 Kight et al. Feb 1999 A
5887253 O'Neil et al. Mar 1999 A
5889863 Weber Mar 1999 A
5903633 Lorsch May 1999 A
5903830 Joao et al. May 1999 A
5903874 Leonard et al. May 1999 A
5903878 Talati et al. May 1999 A
5909492 Payne et al. Jun 1999 A
5918909 Fiala Jul 1999 A
5930363 Stanford Jul 1999 A
5945653 Walker Aug 1999 A
5955951 Wischerop et al. Sep 1999 A
5956636 Lipsit Sep 1999 A
5956695 Carrithers Sep 1999 A
5956700 Landry Sep 1999 A
5974311 Lipsit Oct 1999 A
RE36365 Levine Nov 1999 E
5987132 Rowney Nov 1999 A
5991413 Arditti et al. Nov 1999 A
5991748 Taskett Nov 1999 A
5991749 Morrill, Jr. Nov 1999 A
5991750 Watson Nov 1999 A
5999624 Hopkins Dec 1999 A
6000608 Dorf Dec 1999 A
6003014 Lee Dec 1999 A
6011287 Itoh et al. Jan 2000 A
6012049 Kawan Jan 2000 A
6016480 Houvener Jan 2000 A
6018570 Matison Jan 2000 A
6018717 Lee et al. Jan 2000 A
6029151 Nikander Feb 2000 A
6032133 Hilt et al. Feb 2000 A
6032135 Molano Feb 2000 A
6032859 Muehlberger Mar 2000 A
6038549 Davis Mar 2000 A
6047270 Joao et al. Apr 2000 A
6056289 Clapper, Jr. May 2000 A
6058300 Hanson May 2000 A
6058382 Kasai et al. May 2000 A
6062472 Cheung May 2000 A
6072870 Nguyen Jun 2000 A
6073842 Yoshinaga Jun 2000 A
6088682 Burke Jul 2000 A
6092053 Boesch et al. Jul 2000 A
6094643 Anderson Jul 2000 A
6098053 Slater Aug 2000 A
6105008 Davis Aug 2000 A
6108642 Findley Aug 2000 A
6119096 Mann et al. Sep 2000 A
6119105 Williams Sep 2000 A
6119106 Mersky et al. Sep 2000 A
6119946 Teicher Sep 2000 A
6124799 Parker Sep 2000 A
6129275 Urquhart et al. Oct 2000 A
6129276 Jelen et al. Oct 2000 A
6138106 Walker et al. Oct 2000 A
6142369 Jonstromer Nov 2000 A
6163843 Inoue Dec 2000 A
6167387 Lee-Wai-Yin Dec 2000 A
6169890 Vatanen Jan 2001 B1
6169975 White Jan 2001 B1
6169976 Colosso Jan 2001 B1
6173272 Thomas et al. Jan 2001 B1
6175823 Van Dusen Jan 2001 B1
6182894 Hackett et al. Feb 2001 B1
6185545 Resnick Feb 2001 B1
6188752 Lesley Feb 2001 B1
6189787 Dorf Feb 2001 B1
6190256 Walker Feb 2001 B1
6202933 Poore Mar 2001 B1
6208851 Hanson Mar 2001 B1
RE37122 Levine Apr 2001 E
6215999 Dorenbosch Apr 2001 B1
6220511 Holec Apr 2001 B1
6226364 O'Neil May 2001 B1
6226624 Watson May 2001 B1
6230145 Verderamo May 2001 B1
6237023 Yoshimoto May 2001 B1
6240397 Sachs May 2001 B1
6253027 Weber Jun 2001 B1
6256690 Carper Jul 2001 B1
6270012 Dawson Aug 2001 B1
6282566 Lee, Jr. Aug 2001 B1
6285749 Manto Sep 2001 B1
6289010 Voit Sep 2001 B1
6295522 Boesch Sep 2001 B1
6298336 Davis Oct 2001 B1
6302326 Symonds Oct 2001 B1
6304915 Nguyen Oct 2001 B1
6308887 Korman Oct 2001 B1
6311165 Coutts et al. Oct 2001 B1
6311170 Embrey Oct 2001 B1
6314171 Dowens Nov 2001 B1
6314520 Schell et al. Nov 2001 B1
6315195 Ramachandran Nov 2001 B1
6315206 Hansen Nov 2001 B1
6324525 Kramer Nov 2001 B1
6328341 Klure Dec 2001 B2
6330544 Walker et al. Dec 2001 B1
6330976 Dymetman et al. Dec 2001 B1
6332135 Conklin Dec 2001 B1
6333976 Lesley Dec 2001 B2
6351810 Gupta Feb 2002 B2
6363362 Burfield et al. Mar 2002 B1
6366893 Hannula et al. Apr 2002 B2
6375073 Aebi Apr 2002 B1
6381631 van Hoff Apr 2002 B1
6386457 Sorie May 2002 B1
6397196 Kravetz et al. May 2002 B1
6422462 Cohen Jul 2002 B1
6424706 Katz Jul 2002 B1
6434238 Chaum Aug 2002 B1
6434379 Despres Aug 2002 B1
6442532 Kawan Aug 2002 B1
6445780 Rosset Sep 2002 B1
6453035 Psarras et al. Sep 2002 B1
6454165 Dawson Sep 2002 B1
6467684 Fite et al. Oct 2002 B2
6473500 Risafi Oct 2002 B1
6478401 King et al. Nov 2002 B1
6490445 Holmes Dec 2002 B1
6494367 Zacharias Dec 2002 B1
6494637 Huber Dec 2002 B2
6502745 Stimson Jan 2003 B1
6504757 Hollmer et al. Jan 2003 B1
6507644 Henderson Jan 2003 B1
6516417 Pegrum et al. Feb 2003 B1
6525953 Johnson Feb 2003 B1
6529593 Nelson Mar 2003 B2
6529880 McKeen et al. Mar 2003 B1
6549770 Marran Apr 2003 B1
6575361 Graves et al. Jun 2003 B1
6581827 Welton Jun 2003 B2
6582827 Im Jun 2003 B1
6588658 Blank Jul 2003 B1
6591098 Shieh et al. Jul 2003 B1
6592035 Mandile Jul 2003 B2
6594640 Postrel Jul 2003 B1
6609113 O'Leary et al. Aug 2003 B1
6612487 Tidball et al. Sep 2003 B2
6615189 Phillips et al. Sep 2003 B1
6615190 Slater Sep 2003 B1
6618366 Furukawa et al. Sep 2003 B1
6622015 Himmel et al. Sep 2003 B1
6625438 Hanson Sep 2003 B2
6636489 Fingerhut Oct 2003 B1
6643503 Phillips Nov 2003 B1
6643504 Chow et al. Nov 2003 B1
6648222 McDonald Nov 2003 B2
6651885 Arias Nov 2003 B1
6659259 Knox et al. Dec 2003 B2
6675153 Cook et al. Jan 2004 B1
6678664 Ganesan Jan 2004 B1
6684269 Wagner Jan 2004 B2
6714918 Hillmer Mar 2004 B2
6745022 Knox Jun 2004 B2
6754636 Walker et al. Jun 2004 B1
6785537 Hicks Aug 2004 B2
6805289 Noriega et al. Oct 2004 B2
6820802 Biggar et al. Nov 2004 B2
6827260 Stoutenburg et al. Dec 2004 B2
6829596 Frazee Dec 2004 B1
6836765 Sussman Dec 2004 B1
6836962 Khandros et al. Jan 2005 B2
6837426 Tidball et al. Jan 2005 B2
6839744 Kloba et al. Jan 2005 B1
6848613 Nielsen et al. Feb 2005 B2
6868391 Hultgren Mar 2005 B1
6882984 Boyle Apr 2005 B1
6886742 Stoutenburg et al. May 2005 B2
6918537 Graves Jul 2005 B2
6925439 Pitroda Aug 2005 B1
6932268 Mccoy et al. Aug 2005 B1
6934529 Bagoren et al. Aug 2005 B2
6934689 Ritter et al. Aug 2005 B1
6941270 Hannula Sep 2005 B1
6948065 Grawrock Sep 2005 B2
6957336 Wheeler et al. Oct 2005 B2
6961412 Ruckart et al. Nov 2005 B2
6991157 Bishop et al. Jan 2006 B2
6992978 Humblet et al. Jan 2006 B1
7003495 Burger et al. Feb 2006 B1
7024174 Nagy et al. Apr 2006 B2
7024396 Woodward Apr 2006 B2
7028891 O'Neal Apr 2006 B2
7043451 Strayer et al. May 2006 B2
7054842 James May 2006 B2
7069248 Huber Jun 2006 B2
7072864 Brake et al. Jul 2006 B2
7073196 Dowd et al. Jul 2006 B1
7073198 Flowers et al. Jul 2006 B1
7083084 Graves et al. Aug 2006 B2
7085931 Smith et al. Aug 2006 B1
7086584 Stoutenburg et al. Aug 2006 B2
7090138 Rettenmyer Aug 2006 B2
7093761 Smith et al. Aug 2006 B2
7096003 Joao et al. Aug 2006 B2
7103347 Chow et al. Sep 2006 B2
7103577 Blair et al. Sep 2006 B2
7107249 Dively et al. Sep 2006 B2
7131578 Paschini et al. Nov 2006 B2
7131582 Welton Nov 2006 B2
7145989 Bond Dec 2006 B1
7168615 Smith et al. Jan 2007 B2
7171199 Rahman Jan 2007 B1
7194438 Sovio et al. Mar 2007 B2
7195151 Licciardello et al. Mar 2007 B2
7209889 Whitfield Apr 2007 B1
7209890 Peon et al. Apr 2007 B1
7222101 Bishop et al. May 2007 B2
7229006 Babbi et al. Jun 2007 B2
7243839 Beck et al. Jul 2007 B2
7246097 Movalli Jul 2007 B2
7249054 Keil Jul 2007 B2
7249097 Hutchison et al. Jul 2007 B2
7249175 Donaldson Jul 2007 B1
7260381 Lipsit Aug 2007 B2
7269256 Rosen Sep 2007 B2
7272385 Mirouze et al. Sep 2007 B2
7292998 Graves Nov 2007 B2
7293704 Smith Nov 2007 B2
7311249 Smith et al. Dec 2007 B2
7328190 Smith et al. Feb 2008 B2
7333955 Graves et al. Feb 2008 B2
7363265 Horgan Apr 2008 B2
7370012 Karns May 2008 B2
7376431 Niedermeyer May 2008 B2
7376583 Rolf May 2008 B1
7398248 Phillips et al. Jul 2008 B2
7437328 Graves et al. Oct 2008 B2
7483862 Robinson et al. Jan 2009 B1
7536349 Mik May 2009 B1
7566000 Agostino et al. Jul 2009 B2
7580859 Economy Aug 2009 B2
7650308 Nguyen et al. Jan 2010 B2
7690580 Shoemaker Apr 2010 B2
7866548 Reed et al. Jan 2011 B2
7941373 Chang et al. May 2011 B1
8046268 Hunt Oct 2011 B2
8060413 Castell et al. Nov 2011 B2
8082210 Hansen et al. Dec 2011 B2
8195568 Singhal Jun 2012 B2
20010000808 Lesley May 2001 A1
20010001321 Resnick May 2001 A1
20010001856 Gould May 2001 A1
20010005840 Verkama Jun 2001 A1
20010023415 Keil Sep 2001 A1
20010032878 Tsiounis et al. Oct 2001 A1
20010033752 Cook et al. Oct 2001 A1
20010034707 Sakaguchi Oct 2001 A1
20010042784 Fite Nov 2001 A1
20010044293 Morgan Nov 2001 A1
20020004889 Honma et al. Jan 2002 A1
20020009538 Arai Jan 2002 A1
20020022472 Watler et al. Feb 2002 A1
20020022966 Horgan Feb 2002 A1
20020023217 Wheeler et al. Feb 2002 A1
20020025797 Joao et al. Feb 2002 A1
20020035539 O'Connell Mar 2002 A1
20020040935 Weyant Apr 2002 A1
20020069139 Bernstein et al. Jun 2002 A1
20020077076 Suryanarayana Jun 2002 A1
20020077993 Immonen et al. Jun 2002 A1
20020088851 Hodes Jul 2002 A1
20020088855 Hodes Jul 2002 A1
20020091573 Hodes Jul 2002 A1
20020095387 Sosa et al. Jul 2002 A1
20020100803 Sehr Aug 2002 A1
20020101966 Nelson Aug 2002 A1
20020107804 Kravitz Aug 2002 A1
20020115424 Bagoren Aug 2002 A1
20020116329 Serbetcioglu et al. Aug 2002 A1
20020119767 Fieldhouse Aug 2002 A1
20020126532 Matsunaga et al. Sep 2002 A1
20020133457 Gerlach Sep 2002 A1
20020133467 Hobson et al. Sep 2002 A1
20020138351 Houvener Sep 2002 A1
20020138450 Kremer Sep 2002 A1
20020152123 Giordano et al. Oct 2002 A1
20020152179 Racov Oct 2002 A1
20020153414 Stoutenburg et al. Oct 2002 A1
20020161631 Banerjee et al. Oct 2002 A1
20020169623 Call et al. Nov 2002 A1
20020169713 Chang et al. Nov 2002 A1
20020175207 Kashef et al. Nov 2002 A1
20020190123 Anvekar et al. Dec 2002 A1
20030001005 Risafi et al. Jan 2003 A1
20030004737 Conquest et al. Jan 2003 A1
20030004889 Fiala Jan 2003 A1
20030004891 Van Rensburg et al. Jan 2003 A1
20030009382 D Arbeloff et al. Jan 2003 A1
20030014266 Brown et al. Jan 2003 A1
20030014360 Arditti Jan 2003 A1
20030019770 Hodes Jan 2003 A1
20030028481 Flitcroft et al. Feb 2003 A1
20030033246 Slater Feb 2003 A1
20030038175 Welton Feb 2003 A1
20030046222 Bard Mar 2003 A1
20030055782 Slater Mar 2003 A1
20030061157 Hirka et al. Mar 2003 A1
20030069846 Marcon Apr 2003 A1
20030070080 Rosen Apr 2003 A1
20030078835 Pluchinske Apr 2003 A1
20030088462 Carrithers et al. May 2003 A1
20030092435 Boivin May 2003 A1
20030105672 Epstein Jun 2003 A1
20030115126 Pitroda Jun 2003 A1
20030126079 Roberson et al. Jul 2003 A1
20030135462 Brake Jul 2003 A1
20030144909 Flaherty et al. Jul 2003 A1
20030144935 Sobek Jul 2003 A1
20030163389 Murten et al. Aug 2003 A1
20030172031 Graves et al. Sep 2003 A1
20030174823 Justice Sep 2003 A1
20030187780 Arthus et al. Oct 2003 A1
20030194988 Knox Oct 2003 A1
20030200179 Kwan Oct 2003 A1
20030200184 Dominguez et al. Oct 2003 A1
20030204457 Arias Oct 2003 A1
20030205616 Graves et al. Nov 2003 A1
20030212796 Willard Nov 2003 A1
20030218062 Noriega et al. Nov 2003 A1
20030220884 Choi et al. Nov 2003 A1
20030222135 Stoutenburg Dec 2003 A1
20030226042 Fukushima Dec 2003 A1
20030233317 Judd Dec 2003 A1
20030236704 Antonucci Dec 2003 A1
20040007618 Oram et al. Jan 2004 A1
20040009760 Laybourn et al. Jan 2004 A1
20040019568 Moenickheim et al. Jan 2004 A1
20040024697 Landa et al. Feb 2004 A1
20040039639 Walker et al. Feb 2004 A1
20040039702 Blair et al. Feb 2004 A1
20040046035 Davila et al. Mar 2004 A1
20040049427 Tami et al. Mar 2004 A1
20040054587 Dev et al. Mar 2004 A1
20040064412 Phillips et al. Apr 2004 A1
20040068448 Kim Apr 2004 A1
20040078332 Ferguson et al. Apr 2004 A1
20040107170 Labrou et al. Jun 2004 A1
20040114766 Hileman et al. Jun 2004 A1
20040118914 Smith et al. Jun 2004 A1
20040128395 Miyazaki Jul 2004 A1
20040129777 Smith Jul 2004 A1
20040133511 Smith et al. Jul 2004 A1
20040153402 Smith et al. Aug 2004 A1
20040159700 Khan et al. Aug 2004 A1
20040162058 Mottes Aug 2004 A1
20040167821 Baumgartner Aug 2004 A1
20040172339 Snelgrove et al. Sep 2004 A1
20040181453 Ray Sep 2004 A1
20040182922 Talarico, Jr. Sep 2004 A1
20040188516 De Myttennaere Sep 2004 A1
20040195316 Graves et al. Oct 2004 A1
20040199431 Ganesan et al. Oct 2004 A1
20040199474 Ritter Oct 2004 A1
20040205023 Hafer et al. Oct 2004 A1
20040206814 Kawai et al. Oct 2004 A1
20040210449 Breck Oct 2004 A1
20040210476 Blair et al. Oct 2004 A1
20040210519 Oppenlander Oct 2004 A1
20040215560 Amalraj et al. Oct 2004 A1
20040215564 Lawlor Oct 2004 A1
20040215573 Teutenberg Oct 2004 A1
20040218741 Welton Nov 2004 A1
20040230536 Fung et al. Nov 2004 A1
20040232225 Bishop Nov 2004 A1
20040249766 Ganesan et al. Dec 2004 A1
20040260602 Nakaminami et al. Dec 2004 A1
20040260646 Berardi et al. Dec 2004 A1
20040267663 Karns Dec 2004 A1
20050001027 Bahar Jan 2005 A1
20050027655 Sharma et al. Feb 2005 A1
20050033645 Duphily Feb 2005 A1
20050051619 Graves et al. Mar 2005 A1
20050060248 O'Neal Mar 2005 A1
20050061872 Paschini et al. Mar 2005 A1
20050071268 Riddett Mar 2005 A1
20050075958 Gonzalez Apr 2005 A1
20050079863 Macaluso Apr 2005 A1
20050080678 Economy Apr 2005 A1
20050086171 Abe et al. Apr 2005 A1
20050092828 Phillips et al. May 2005 A1
20050092829 Phillips et al. May 2005 A1
20050103839 Hewel May 2005 A1
20050107068 Smith et al. May 2005 A1
20050108096 Burger et al. May 2005 A1
20050125300 McGill et al. Jun 2005 A1
20050125348 Fulton et al. Jun 2005 A1
20050127169 Foss et al. Jun 2005 A1
20050131815 Fung et al. Jun 2005 A1
20050143051 Park Jun 2005 A1
20050149387 O'Shea et al. Jul 2005 A1
20050182678 Walker et al. Aug 2005 A1
20050182720 Willard et al. Aug 2005 A1
20050184145 Law et al. Aug 2005 A1
20050199705 Beck et al. Sep 2005 A1
20050202850 Kuty Sep 2005 A1
20050203835 Nhaissi Sep 2005 A1
20050228717 Gusler et al. Oct 2005 A1
20050228720 Pavlic et al. Oct 2005 A1
20050234820 Mackouse Oct 2005 A1
20050240472 Postrel Oct 2005 A1
20050240526 Hill Oct 2005 A1
20050242171 Smets et al. Nov 2005 A1
20050242193 Smith et al. Nov 2005 A1
20050259589 Rozmovits et al. Nov 2005 A1
20050261968 Randall et al. Nov 2005 A1
20050263587 Martinez Dec 2005 A1
20050269401 Spitzer et al. Dec 2005 A1
20050269402 Spitzer et al. Dec 2005 A1
20050278216 Graves Dec 2005 A1
20060019634 Hawkes Jan 2006 A1
20060020543 Sheehan et al. Jan 2006 A1
20060023856 Welton Feb 2006 A1
20060026073 Kenny, Jr. Feb 2006 A1
20060030306 Kuhn Feb 2006 A1
20060035632 Sorvari et al. Feb 2006 A1
20060053056 Alspach-Goss Mar 2006 A1
20060085335 Crawford et al. Apr 2006 A1
20060100927 Zormati May 2006 A1
20060113376 Reed et al. Jun 2006 A1
20060123243 Shimosato et al. Jun 2006 A1
20060144926 Jacobs Jul 2006 A1
20060157556 Halbur et al. Jul 2006 A1
20060161490 Chakiris Jul 2006 A1
20060163343 Changryeol Jul 2006 A1
20060163347 Foss, Jr. et al. Jul 2006 A1
20060167780 Friedman Jul 2006 A1
20060169766 Hoch Aug 2006 A1
20060186196 Schultz et al. Aug 2006 A1
20060207856 Dean Sep 2006 A1
20060213968 Guest et al. Sep 2006 A1
20060213980 Geller et al. Sep 2006 A1
20060213985 Walker et al. Sep 2006 A1
20060217996 Graves Sep 2006 A1
20060229985 Lalwani et al. Oct 2006 A1
20060231609 Lazarowicz et al. Oct 2006 A1
20060231611 Chakiris et al. Oct 2006 A1
20060235754 Walker Oct 2006 A1
20060249569 Jain Nov 2006 A1
20060249570 Seifert et al. Nov 2006 A1
20060255125 Jennings et al. Nov 2006 A1
20060255135 Smith Nov 2006 A1
20060261150 Seifert et al. Nov 2006 A1
20060271489 Flanagan et al. Nov 2006 A1
20060277146 Dively et al. Dec 2006 A1
20060289621 Foss, Jr. Dec 2006 A1
20070007333 Foss et al. Jan 2007 A1
20070043682 Drapkin et al. Feb 2007 A1
20070057045 Beck et al. Mar 2007 A1
20070063024 Guillot Mar 2007 A1
20070108269 Benco et al. May 2007 A1
20070118478 Graves et al. May 2007 A1
20070119920 Hogg et al. May 2007 A1
20070167161 Cheng et al. Jul 2007 A1
20070179865 Hibler et al. Aug 2007 A1
20070185782 Shooks et al. Aug 2007 A1
20070187490 Feldman et al. Aug 2007 A1
20070284434 Fletcher Dec 2007 A1
20080010215 Rackley, III et al. Jan 2008 A1
20080033817 Billmaier et al. Feb 2008 A1
20080041938 Wise Feb 2008 A1
20080052770 Ali et al. Feb 2008 A1
20080091545 Jennings et al. Apr 2008 A1
20080103972 Lanc May 2008 A1
20080109356 Sutton May 2008 A1
20080109374 Levergood et al. May 2008 A1
20090078755 Sullivan et al. Mar 2009 A1
20090157554 Hobson et al. Jun 2009 A1
20090298427 Wilkinson et al. Dec 2009 A1
20100005025 Kumar et al. Jan 2010 A1
20100063906 Nelsen et al. Mar 2010 A1
20100130172 Vendrow et al. May 2010 A1
20100186076 Ali et al. Jul 2010 A1
20100306107 Nahari Dec 2010 A1
20100317319 Gorman et al. Dec 2010 A1
20110068168 Graves et al. Mar 2011 A1
20110082772 Hirson Apr 2011 A1
20110087592 Van Der et al. Apr 2011 A1
20110173083 Reed et al. Jul 2011 A1
20110196753 Hodgdon et al. Aug 2011 A1
20110270693 Paschini et al. Nov 2011 A1
20130024916 Evans Jan 2013 A1
20130041767 Hollander et al. Feb 2013 A1
Foreign Referenced Citations (28)
Number Date Country
19641776 Mar 1997 DE
0406841 Jul 1990 EP
1197906 Apr 2002 EP
1 164 777 Oct 2003 EP
1 361 775 Nov 2003 EP
1361775 Nov 2003 EP
1522972 Sep 2004 EP
1534043 Nov 2004 EP
1519332 Mar 2005 EP
1705610 Mar 2006 EP
2333878 Aug 1999 GB
2006309729 Nov 2006 JP
9638801 Dec 1996 WO
9641462 Dec 1996 WO
9710560 Mar 1997 WO
9746961 Dec 1997 WO
9844429 Oct 1998 WO
9849658 Nov 1998 WO
9963744 Dec 1999 WO
0050986 Aug 2000 WO
WO0102233 Jan 2001 WO
WO 0102233 Mar 2001 WO
03079159 Sep 2003 WO
2004001646 Dec 2003 WO
2004012118 Feb 2004 WO
2005024591 Sep 2004 WO
2005098770 Oct 2005 WO
WO2005098770 Oct 2005 WO
Non-Patent Literature Citations (92)
Entry
ISA/European Patent Office, “Notification of Transmittal of the International Search Report and the Written Opinion of the International Searching Authority, or the Declaration”, mailed in related PCT/US2004/029426 on Jan. 20, 2005, 12 pages.
Shermach, Kelly: The Vibrant World of Loyalty. Credit Card Management, vol. 15, n.5, Aug. 2002. pp. 30-40.
Michlig, Greg: Fork in the Road. Credit Card Management, vol. 22, n.10, Oct. 1999. pp. 36-38.
Shermach, Kelly: The Vibrant World of Loyalty: Creative Levels are High. Credit Card Management, vol. 15, n.5, Aug. 2002.
Hypercom Introduces Quick Service Payment Options for the Retail and Restaurant Countertop and Drive-Through. Business Wire, Apr. 11, 2002. p. 140.
NOVA Teams with Prior to Offer Merchants Online Affinity Program. Phillips Business Information, vol. 14, Iss. 17, Sep. 8, 1999.
Refocus Efforts to Prevent Fraud. Phillips Business Information, vol. 11, Iss. 25, Dec. 23, 1996.
Technology Stems credit Card Fraud. Phillips Business Information, vol. 13, Iss. 24, Nov. 20, 1996.
Dahl, Judy: Card Fraud. Credit Union Magazine, vol. 2, n6. Jun. 2006. pp. 46-51.
Krebsbach, Karen: ID Verification: Biometric IDs Come of Age. Bank Technology, Jul. 2003. p. 10.
Michlig Greg: To Catch a Thief. Credit Union Management, vol. 24, n1. Jan. 2001. pp. 48-50.
Anderson, Douglas, et al.: Risk Management Monograph. Retail Delivery Strategies, vol. 6, Autumn 1995. pp. 7-22.
Smart Card Update. Retail Delivery System News. Phillips Business Information. vol. 2, Iss. 19. Sep. 26, 1997.
Shaw, John: The European Development Director at Carlson Campaign. Apr. 8, 2004. p. 7.
Borosky, Mark: A Long and Winding Road. Credit Card Management, vol. 8, N3, Jun. 1995. pp. 58-63.
The Gale Group: Online bill Payment May Exceed $200 Billion in 2003, NACHA Says. Electronic Commerce News, vol. 8, n. 12. Jun. 9, 2003.
The Gale Group: Outside Help for Online Banking. Information Week. Mar. 16, 1998. p. 85.
Fisher, Betty-Lin: Ohio Study Warns Utility Customers of Potential Payment Troubles. Knight-Ridder Tribune Business News, Akron Beacon Journal. Sep. 8, 2004.
Certergy Awarded Five-Year Agreement with Chartway. PR Newswire (US). Aug. 27, 2003.
Online Bill Payment Comes of Age, according to NACHA. PR Newswire, May 27, 2003.
Online Bill Payment May Exceed $200 Billion in 2003. Phillips Business Information, vol. 14, Issue 12. Jun. 5, 2003.
Credit Card Issuer Has No Duty to Verify Payment Checks. Bankers Letter of the Law, vol. 36, N12. Dec. 2002.
Lucas, Peter. Retail Cards Get Connected. Credit Card Management, vol. 14, N11, Jan. 2002. pp. 18-23.
Barthell, Matt: Consumer Poll—Checks Lead in Convenience. American Banker, vol. 159, No. 225. Nov. 22, 2004. p. 15.
E2Interactive, Inc et al. v. Blackhawk Network, Inc. Case No. 09-CV-629. Western District of Wisconsin. Complaint for Patent Infringement and Demand for Jury Trial.
E2Interactive, Inc et al. v. Blackhawk Network, Inc. Case No. 09-CV-629. Western District of Wisconsin. U.S. Patent No. 7,578,439. Patent at Issue.
E2Interactive, Inc et al. v. Blackhawk Network, Inc. Case No. 09-CV-629. Western District of Wisconsin. Plaintiffs E2Interactive, Inc. and Interactive Communications International, Inc.'s Motion to Dismiss and Strike Blackhawk Network, Inc.'s Inequitable Conduct Counterclaim and Affirmative Defense.
E2Interactive, Inc et al. v. Blackhawk Network, Inc. Case No. 09-CV-629. Western District of Wisconsin. Civil Cover Sheet.
E2Interactive, Inc et al. v. Blackhawk Network, Inc. Case No. 09-CV-629. Western District of Wisconsin. Summons in a Civil Action.
E2Interactive, Inc et al. v. Blackhawk Network, Inc. Case No. 09-CV-629. Western District of Wisconsin. Report on the Filing or Determination of an Action Regarding a Patent or Trademark.
E2Interactive, Inc et al. v. Blackhawk Network, Inc. Case No. 09-CV-629. Western District of Wisconsin. Blackhawk Network Inc.'s Answer to Complaint and Counterclaim.
E2Interactive, Inc et al. v. Blackhawk Network, Inc. Case No. 09-CV-629. Western District of Wisconsin. Plaintiffs' Answer to Defendant's Counterclaims.
E2Interactive, Inc et al. v. Blackhawk Network, Inc. Case No. 09-CV-629. Western District of Wisconsin. Blackhawk Network Inc.'s Amended Answer to Complaint and Amended Counterclaims.
E2Interactive, Inc et al. v. Blackhawk Network, Inc. Case No. 09-CV-629. Western District of Wisconsin. Blackhawk Network Inc.'s Memorandum in Opposition to Motion to Dismiss and Strike Blackhawk's Inequitable Conduct Counterclaim and Affirmative Defense.
Request for Ex Parte Reexamination of U.S. Patent No. 7,578,439.
Exhibits A—H of Request for Ex Parte Reexamination of U.S. Patent No. 7,578,439.
USPTO Grant of Ex Parte Reexamination of U.S. Patent No. 7,578,439.
Non-Final Office Action in Ex Parte Reexamination of U.S. Patent No. 7,578,439, Reexam Control No. 90/011,070.
Request for Inter Parties Reexamination of U.S. Patent No. 7,578,439, Reexam Control No. 95/001,464.
Preliminary Invalidity Contentions of U.S. Patent No. 7,578,439.
Petition to Review Denial of Inter Parties Reexamination of U.S. Patent No. 7,578,439, Reexam Control No. 95/001,464.
International Standard ISO 8583, “Financial transaction card originated messages—Interchange message specifications,” Second Edition, Dec. 15, 1993 (“ISO 8583”).
William Wood, POS Terminals nab credit violators, Data Communications, Oct. 1982 at 114 (“Wood 1982”).
Press Release, First Data Corp, CES/NaBANCO Introduces Stored Value Card Technology: Blockbuster Video is First Merchant Partner, Jan. 15, 1996.
Blockbuster Wraps Prepaid Product in Greeting Cards for Dad and Grad, Debit Card News, Jun. 18, 1997, at 3.
Blockbuster Seeks Branding Partner, Debit Card News, Sep. 28, 1995, at 8.
Press Release, First Data Corp., First Data Supports Pilot for Shell Oil Pre-paid Card, Aug. 29, 1996.
MicroTrax, Ltd., PC Electronic Payment Systems Reference Manual, 1995.
ValueLink Product Information, 1997.
Craig Levitt, Busy Signal, Supermarket Business, Sep. 1998, at 131.
Call Them Just Another Product, Supermarket Business, Feb. 1996, at 81.
Allene Symons, Calling Cards Ring Clear for Drug Chains, Drug Store News, Mar. 1, 1999, at 39.
Bari Adelman, Jockeying for Position, Supermarket Business, Jan. 1999, at 59.
Kmart's Newest Blue Light Special: Cash Cards, Credit Card News, Aug. 15, 1997, at 7.
LCI International Introduces Breakthrough S.A.F.E.R. (SM) System for Universal Point-of-Sale Activation of Prepaid Calling Cards, Business Wire, May 4, 1998, at 1.
Press Release, Qwest Communications International Inc., Qwest Communications selected as Preferred Provider of Prepaid Phone Cards for CITGO Petroleum Corporation, May 3, 1999.
Patricia A. Murphy, New Breeds of Debit Cards Offer Expanded Opportunities for Retailers, Stores, May 1999, at 76.
Lisa Guss, Phone Cards: It's Your Call, Supermarket Business, Jan. 1998, at 51.
Pictured Much Smaller Than Actual Size, Supermarket News, May 1994.
Retailers Expand Stored Value Cards as Alternative to Paper Gift Certificates, Stores, Nov. 1998, at 28.
Michael Hartnett, Retailers Flock to Pre-paid Phone Cards, Stores, Jul. 1996, at 54.
Carol Radice, Ringing Up Sales, Progressive Grocer, Jan. 1996, at 141.
Seth Mendelson, Serious Numbers, Oct. 1996, at 51.
SmarTalk Launches Point-of-Sale Activation for Prepaid Phone Cards Via American Express Card Authorization System, Business Wire, Aug. 24, 1998, at 1.
SmarTalk Will Use the American Express Brand to Go Global, Credit Card News, Jan. 15, 1998, at 6.
Sprint Streamlines Card Activation, Supermarket Business, Dec. 1997, at 43.
Laurie Freeman, Supermarkets Get the Call, Supermarket Business, May 1999, at 127.
Smart Card Update, Retail Delivery Systems News, Sep. 26, 1997.
Press Release, DataCash Ltd., Innovative & Improved Services with DataCash 2.4, Oct. 7, 1998.
In Search of the Complete Web Payment System, Electronic Commerce News, May 27, 1996, at 1.
EFT at the Point-of-Sale, ICP Banking Software, Autumn 1985, at 9.
European Patent Office, “Description of DE 19641776.”.
David Legg, Debit Cards—the Retailer's Perspective, Banking World, Jun. 1988, at 60.
Robert Jennings, First Data and Celltel Offering Wireless Credit Authorization, American Banker, Mar. 21, 1995, at 11.
Matt Barthel, Nyce Offers a PC System for Point-of-Sale Operations, American Banker, Mar. 31, 1992, at 3.
Rob Wells, Authorizing a Credit-Card Sale is Incredible 20-Second Journey in Electronic Banking, The Sale Lake Tribune, Dec. 19, 1993, at F10.
Roger Clarke, Privacy Issues in Smart Card Applications in the Retail Financial Sector, in Smart Cards and the Future of Your Money, Jun. 1996, at 157.
Robert Fram et al., Altered States: Electronic Commerce and Owning the Means of Value Exchange, 1999 Stan. Tech. L. Rev. 2 (1999),http://stlr.stanford.edu/STLR/Articles/99—STLR—2.
Gerald Sruber, The Electronic Purse: An Overview of Recent Developments and Policy Issues, Bank of Canada, Jan. 1996.
John P. Caskey & Gordon H. Sellon, Jr., Is the Debit Card Revolution Finally Here?, Federal Reserve Bank of Kansas City Economic Review, Fourth Quarter 1994, at 79.
Stacey L. Schreft, Looking Forward: The Role for Government in Regulating Electronic Cash, Federal Reserve Bank of Kansas City Economic Review, Fourth Quarter 1997, at 59.
Basle, Security of Electronic Money, Report by the Committee on Payment and Settlement Systems and the Group of Computer Experts of the Central Banks of the Group of Ten Countries, Aug. 1996.
William Roberds, What's Really New about the New Forms of Retail Payment?, Federal Reserve Bank of Atlanta Economic Review, First Quarter 1997, at 32.
Felix Stalder & Andrew Clement, Exploring Policy Issues of Electronic Cash: The Mondex Case, Canadian Journal of Communication, vol. 24, No. 2 (1999).
IBM 4680 General Sales Application Electronic Funds User's Guide, First Edition, Dec. 1990.
Electronic Funds Transfer Feature Enhancement: User's Guide, First Edition, Sep. 1995.
IBM 4680-4690 Advanced Payment System for General Sales Application, Second Edition, Jul. 1996.
U.S. Appl. No. 60/108,762, “Electronic Payment System”, David Resnick, Published Feb. 6, 2001.
U.S. Appl. No. 60/141,994, “Precash Payment System”, David Resnick, published Feb. 6, 2001.
European Search Report, Application No. 04256999.6-2412, dated May 7, 2007.
International Search Report, PCT Application No. PCT/US07/66598, dated Nov. 13, 2007, 9 pages.
Sep. 26, 1997, Smart Card Update, vol. 2, Issue 19; Retail Delivery Systems News; Phillips Business Information.
Related Publications (1)
Number Date Country
20050051619 A1 Mar 2005 US
Provisional Applications (1)
Number Date Country
60149740 Aug 1999 US
Continuations (1)
Number Date Country
Parent 09641363 Aug 2000 US
Child 10411971 US
Continuation in Parts (1)
Number Date Country
Parent 10411971 Apr 2003 US
Child 10655828 US