US 6,449,599 B1Grant
Network sales system
Issue Date:2002-09-10
•23 Claims
•25 Drawing Sheets
Abstract
A network-based sales system includes at least one buyer computer for operation by a user desiring to buy a product, at least one merchant computer, and at least one payment computer. The buyer computer, the merchant computer, and the payment computer are interconnected by a computer network. The buyer computer is programmed to receive a user request for purchasing a product, and to cause a payment message to be sent to the payment computer that comprises a product identifier identifying the product. The payment computer is programmed to receive the payment message, to cause an access message to be created that comprises the product identifier and an access message authenticator based on a cryptographic key, and to cause the access message to be sent to the merchant computer. The merchant computer is programmed to receive the access message, to verify the access message authenticator to ensure that the access message authenticator was created using the cryptographic key, and to cause the product to be sent to the user desiring to buy the product.
Metadata
Assignee
- Open Market, Inc.
Inventors
- Andrew C. Payne
- Lawrence C. Stewart
- David J. Mackie
Application Information
Application Number:US 09/304,723
Filing Date:1999-05-04
Priority Date:1994-10-24
Art Unit:7
Classifications
IPC:
G06F 1760
Field of Search:
705 27705 25705 26705 1380 4380 24380 25
Patent Drawings (25 sheets)
Description
Cross Reference to Related Application
[0002] This is a continuation of U.S. patent application Ser. No. 08/878,396, filed Jun. 18, 1997, now U.S. Pat. No. 5,909,492 which is a continuation of U.S. patent application Ser. No. 08/328,133, filed Oct. 24, 1994 now U.S. Pat. No. 5,715,314.
Reference to Microfiche Appendices
[0003] Microfiche Appendices A-G are included in parent application Ser. No. 08/328,133, now U.S. Pat. No. 5,715,314.
Background of the Invention
[0004] This invention relates to user-interactive network sales systems for implementing an open marketplace for goods or services over computer networks such as the Internet.
[0005] U.S. Pat. No. 5,724,424, to David K. Gifford and entitled “Digital Active Advertising,” the entire disclosure of which is hereby incorporated herein in its entirety by reference, describes a network sales system that includes a plurality of buyer computers, a plurality of merchant computers, and a payment computer. A user at a buyer computer asks to have advertisements displayed, and the buyer computer requests advertisements from a merchant computer, which sends the advertisements to the buyer computer. The user then requests purchase of an advertised product, and the buyer computer sends a purchase message to the merchant computer. The merchant computer constructs a payment order that it sends to the payment computer, which authorizes the purchase and sends an authorization message to the merchant computer. When the merchant computer receives the authorization message it sends the product to the buyer computer.
[0006] The above-mentioned patent application also describes an alternative implementation of the network sales system in which, when the user requests purchase of an advertised product, the buyer computer sends a payment order directly to the payment computer, which sends an directly to the payment computer, which sends an authorization message back to the buyer computer that includes an unforgeable certificate that the payment order is valid. The buyer computer then constructs a purchase message that includes the unforgeable certificate and sends it to the merchant computer. When the merchant computer receives the purchase request it sends the product to the buyer computer, based upon the pre-authorized payment order.
Summary of the Invention
[0007] In one aspect, the invention provides a network-based sales system that includes at least one buyer computer for operation by a user desiring to buy a product, at least one merchant computer, and at least one payment computer. The buyer computer, the merchant computer, and the payment computer are interconnected by a computer network. The buyer computer is programmed to receive a user request for purchasing a product, and to cause a payment message to be sent to the payment computer that comprises a product identifier identifying the product. The payment computer is programmed to receive the payment message, to cause an access message to be created that comprises the product identifier and an access message authenticator based on a cryptographic key, and to cause the access message to be sent to the merchant computer. The merchant computer is programmed to receive the access message, to verify the access message authenticator to ensure that the access message authenticator was created using the cryptographic key, and to cause the product to be sent to the user desiring to buy the product.
[0008] The invention provides a simple design architecture for the network sales system that allows the merchant computer to respond to payment orders from the buyer computer without the merchant computer having to communicate directly with the payment computer to ensure that the user is authorized to purchase the product and without the merchant computer having to store information in a database regarding which buyers are authorized to purchase which products. Rather, when the merchant computer receives an access message from the buyer computer identifying a product to be purchased, the merchant computer need only check the access message to ensure that it was created by the payment computer (thereby establishing for the merchant computer that the buyer is authorized to purchase the product), and then the merchant computer can cause the product to be sent to the buyer computer who has been authorized to purchase the product.
[0009] In another aspect, the invention features a network-based sales system that includes at least one buyer computer for operation by a user desiring to buy products, at least one shopping cart computer, and a shopping cart database connected to the shopping cart computer. The buyer computer and the shopping cart computer are interconnected by a computer network. The buyer computer is programmed to receive a plurality of requests from a user to add a plurality of respective products to a shopping cart in the shopping cart database, and, in response to the requests to add the products, to send a plurality of respective shopping cart messages to the shopping cart computer each of which includes a product identifier identifying one of the plurality of products. The shopping cart computer is programmed to receive the plurality of shopping cart messages, to modify the shopping cart in the shopping cart database to reflect the plurality of requests to add the plurality of products to the shopping cart, and to cause a payment message associated with the shopping cart to be created. The buyer computer is programmed to receive a request from the user to purchase the plurality of products added to the shopping cart and to cause the payment message to be activated to initiate a payment transaction for the plurality of products added to the shopping cart.
[0010] In another aspect, the invention features a network-based link message system that includes at least one client computer for operation by a client user and at least one server computer for operation by a server user. The client computer and the server computer are interconnected by a computer network. The client computer is programmed to send an initial link message to the server computer. The server computer is programmed to receive the initial link message from the client computer and to create, based on information contained in the initial link message, a session link message that encodes a state of interaction between the client computer and the server computer. The session link message includes a session link authenticator, computed by a cryptographic function of the session link contents, for authenticating the session link message. The server computer is programmed to cause the session link message to be sent to the client computer. The client computer is programmed to cause the session link message to be sent to a computer in the network that is programmed to authenticate the session link message by examining the session link authenticator and that is programmed to respond to the session link message based on the state of the interaction between the client computer and the server computer.
[0011] In another aspect, the invention features a network-based sales system that includes a merchant database having a plurality of digital advertisements and a plurality of respective product fulfillment items, at least one creation computer for creating the merchant database, and at least one merchant computer for causing the digital advertisements to be transmitted to a user and for causing advertised products to be transmitted to the user. The creation computer and the merchant computer are interconnected by a computer network. The creation computer is programmed to create the merchant database, and to transmit the digital advertisements and the product fulfillment items to the merchant computer. The merchant computer is programmed to receive the digital advertisements and product fulfillment items, to receive a request for a digital advertisement from a user, to cause the digital advertisement to be sent to the user, to receive from the user an access message identifying an advertised product, and to cause the product to be sent to the user in accordance with a product fulfillment item corresponding to the product.
[0012] In another aspect, the invention features a hypertext statement system that includes a client computer for operation by a client user and one or more server computers for operation by a server user. The client computer and the server computers are interconnected by a computer network. At least one of the server computers is programmed to record purchase transaction records in a database. Each of the purchase transaction records includes a product description. The server computer is programmed to transmit a statement document that includes the purchase transaction records to the client computer. The client computer is programmed to display the product descriptions, to receive a request from the client user to display a product corresponding to a product description displayed by the client computer, and to cause a product hypertext link derived from a purchase transaction record to be activated. At least one of the server computers is programmed to respond to activation of the product hypertext link by causing the product to be sent to the client computer.
[0013] In another aspect, the invention features a network payment system that includes at least one buyer computer for operation by a user desiring to buy a product and at least one payment computer for processing payment messages from the buyer computer. The buyer computer and the payment computer are interconnected by a computer network. The buyer computer is programmed to cause a payment message to be sent to the payment computer. The payment message includes a product identifier identifying the product that the user desires to buy. The payment computer is programmed to receive the payment message, to cause an access message to be created to enable the user to access the product, and to record a purchase transaction record in the settlement database. The buyer computer is programmed to cause a request for purchase transaction records to be sent to the payment computer. The payment computer is programmed to receive the request for purchase transaction records and to cause a document derived from the purchase transaction records to be sent to the buyer computer.
Brief Description of the Drawings
[0014] FIG. 1 is a block diagram of a network sales system in accordance with the present invention.
[0015] FIG. 2 (2-A through 2-I) is a flowchart diagram illustrating the operation of a purchase transaction in the network sales system of FIG. 1.
[0016] FIG. 3 (3-A through 3-B) is a flowchart diagram illustrating the use of a shopping cart for the purchase of products in connection with the network sales system of FIG. 1.
[0017] FIG. 4 (4-A through 4-C) is a flowchart diagram illustrating the operation of a smart statement in the network sales system of FIG. 1.
[0018] FIG. 5 is a screen snapshot of an advertising document that the merchant computer sends to the buyer computer in FIG. 2.
[0019] FIG. 6 is a screen snapshot of a confirmation document that the payment computer sends to the buyer computer in FIG. 2.
[0020] FIG. 7 is a screen snapshot of a new account document that the payment computer sends to the buyer computer in FIG. 2.
[0021] FIG. 8 is a screen snapshot of an account name prompt that the buyer computer creates in FIG. 2.
[0022] FIG. 9 is a screen snapshot of a document that the payment computer sends to the buyer computer in FIG. 2 and that provides an option either to repurchase or to use a previously purchased access.
[0023] FIG. 10 is a screen snapshot of a fulfillment document that the merchant computer sends to the buyer computer in FIG. 2.
[0024] FIG. 11 is a screen snapshot of a smart statement document that the payment computer sends to the buyer computer in FIG. 4.
[0025] FIGS. 12 and 13 are screen snapshots of a transaction detail document that the payment computer sends to the buyer computer in FIG. 4.
[0026] FIG. 14 is a screen snapshot of a customer service form that the payment computer sends to the buyer computer in FIG. 4.
Detailed Description
[0027] With reference to FIG. 1, a network sales system in accordance with the present invention includes a buyer computer 12 operated by a user desiring to buy a product, a merchant computer 14, which may be operated by a merchant willing to sell products to the buyer or by a manager of the network sales system, a payment computer 16 typically operated by a manager of the network sales system, and a creation computer 20 typically operated by the merchant. The buyer, merchant, payment, and creation computers are all inter-connected by a computer network 10 such as the Internet.
[0028] Creation computer 20 is programmed to build a “store” of products for the merchant. A printout of a computer program for use in creating such a “store” in accordance with the present invention is provided as Appendix F.
[0029] The products advertised by merchant computer 14 may be, for example, newspaper or newsletter articles available for purchase by buyers. Creation computer 20 creates a digital advertisement database 18 that stores advertising documents (which may for example be in the form of summaries of newspaper or newsletter articles, accompanied by prices) and product fulfillment items (which may be the products themselves if the products can be transmitted over the network, or which may be hard goods identifiers if the products are hard goods, i.e., durable products as opposed to information products). Creation computer 20 transmits contents of the advertising document database 18 to merchant computer 14 to enable the merchant computer to cause advertisements and products to be sent to buyers. Merchant computer 14 maintains advertising documents locally in advertising document database 15. In an alternative embodiment, the creation computer does not have a local digital advertisement database, but instead updates a remote advertising document database on a merchant computer. These updates can be accomplished using HTML forms or other remote database technologies as is understood by practitioners of the art.
[0030] Payment computer 16 has access to a settlement database 22 in which payment computer 16 can record details of purchase transactions. The products may be organized into various “domains” of products, and payment computer 16 can access settlement database 22 to record and retrieve records of purchases of products falling within the various domains. Payment computer 16 also has access to a shopping cart database 21 in which a “shopping cart” of products that a user wishes to purchase can be maintained as the user shops prior to actual purchase of the contents of the shopping cart.
[0031] With reference to FIG. 2, a purchase transaction begins when a user at buyer computer 12 requests advertisements (step 24) and buyer computer 12 accordingly sends an advertising document URL (universal resource locator) to merchant computer 14 (step 26). The merchant computer fetches an advertising document from the advertising document database (step 28) and sends it to the buyer computer (step 30). An example of an advertising document is shown in FIG. 5. Details of URLs and how they are used are found in Appendix G.
[0032] The user browses through the advertising document and eventually requests a product (step 32). This results in the buyer computer sending payment URL A to the payment computer (step 34). Payment URL A includes a product identifier that represents the product the user wishes to buy, a domain identifier that represents a domain of products to which the desired product belongs, a payment amount that represents the price of the product, a merchant computer identifier that represents merchant computer 14, a merchant account identifier that represents the particular merchant account to be credited with the payment amount, a duration time that represents the length of time for which access to the product is to be granted to the user after completion of the purchase transaction, an expiration time that represents a deadline beyond which this particular payment URL cannot be used, a buyer network address, and a payment URL authenticator that is a digital signature based on a cryptographic key. The payment URL authenticator is a hash of other information in the payment URL, the hash being defined by a key shared by the merchant and the operator of the payment computer.
[0033] In an alternative embodiment, step 34 consists of the buyer computer sending a purchase product message to the merchant computer, and the merchant computer provides payment URL A to the buyer computer in response to the purchase product message. In this alternative embodiment, payment URL A contains the same contents as above. The buyer computer then sends the payment URL A it has received from the merchant computer to the payment computer.
[0034] When the payment computer receives the payment URL it verifies whether the payment URL authenticator was created from the contents of the payment URL using the cryptographic key (step 36). If not, the payment computer sends a document to the buyer computer indicating that access to the network sales system is denied (step 38). Otherwise, the payment computer determines whether the expiration time has past (step 40). If it has, the payment computer sends a document to the buyer computer indicating that the time has expired (step 41). Otherwise, the payment computer checks the buyer computer network address to see if it matches the one specified in the payment URL (step 42). If it does not match, the payment computer sends a document to the buyer computer indicating that access to the network payment system is denied (step 43). Otherwise, the payment computer sends a payment confirmation document to the buyer computer, the payment confirmation document including an “open” link and a “continue” link (step 44).
[0035] An example of a confirmation document is shown in FIG. 6. The confirmation document asks the user to click on a “continue” button if the user already has an account with the payment computer, or to click on an “open” button if the user does not already have an account and wishes to open one.
[0036] If the user clicks on the “open” button (step 46), the buyer computer sends payment URL C to the payment computer (step 48), payment URL C being similar to payment URL A but also indicating that the user does not yet have an account. The payment computer creates a new account document (step 50) and sends it to the buyer computer (step 52). An example of a new account document is shown in FIG. 7. When the user receives the new account document he enters the new account name, an account password, a credit card number, the credit card expiration date, and security information such as the maiden name of the user's mother (step 54), and presses a “submit” button (not shown in FIG. 7). The buyer computer sends the new account information to the payment computer (step 56), which enters the new account in the settlement database (step 58).
[0037] If the user clicks on the “continue” button (step 60), the buyer computer sends payment URL B to the payment computer (step 62), payment URL B being similar to payment URL A but also indicating that the user already has an account. The payment computer then instructs the buyer computer to provide the account name and password (steps 64 and 66), and the buyer computer prompts the user for this information by creating an account name prompt (example shown in FIG. 8) and a similar password prompt. The user enters the information (step 68) and the buyer computer sends the account name and password to the payment computer (step 70).
[0038] The payment computer verifies whether the user name and password are correct (step 72). If they are not correct, the payment computer sends a document to the buyer computer indicating that access to the network sales system is denied (step 74). Otherwise, the payment computer determines whether additional security is warranted, based on, e.g., whether the payment amount exceeds a threshold (step 73). If additional security is warranted, the payment computer creates a challenge form document and sends it to the buyer computer (step 75). The user enters the security information (step 77), the buyer computer sends the security information to the payment computer (step 79), and the payment computer determines whether the security information is correct (step 81). If it is not correct, the payment computer sends a document to the buyer computer indicating that access to the network sales system is denied (step 83).
[0039] If the security information is correct, or if additional security was not warranted, the payment computer checks the settlement database to determine whether the user has unexpired access to the domain identifier contained in the payment URL (step 82). If so, the payment computer sends to the buyer computer a document providing an option either to repurchase or to use the previously purchased access (step 84). An example of such a document is shown in FIG. 9. The user can respond to the recent purchase query document by choosing to access the previously purchased document (step 85) or to go ahead and buy the currently selected product (step 86).
[0040] If the user chooses to access the previously purchased document, the buyer computer skips to step 92 (see below). If the user chooses to buy the currently selected product, the payment computer calculates an actual payment amount that may differ from the payment amount contained in the payment URL (step 87). For example, the purchase of a product in a certain domain may entitle the user to access other products in the domain for free or for a reduced price for a given period of time.
[0041] The payment computer then verifies whether the user account has sufficient funds or credit (step 76). If not, the payment computer sends a document to the buyer computer indicating that the user account has insufficient funds (step 78). Otherwise, the payment computer creates an access URL (step 80) that includes a merchant computer identifier, a domain identifier, a product identifier, an indication of the end of the duration time for which access to the product is to be granted, the buyer network address, and an access URL authenticator that is a digital signature based on a cryptographic key. The access URL authenticator is a hash of other information in the access URL, the hash being defined by a key shared by the merchant and the operator of the payment computer. The payment computer then records the product identifier, the domain, the user account, the merchant account, the end of duration time, and the actual payment amount in the settlement database (step 88).
[0042] The payment computer then sends a redirect to access URL to the buyer computer (step 90), which sends the access URL to the merchant computer (step 92). The merchant computer verifies whether the access URL authenticator was created from the contents of the access URL using the cryptographic key (step 94). If not, the merchant computer sends a document to the buyer computer indicating that access to the product is denied (step 96).
[0043] Otherwise, the merchant computer verifies whether the duration time for access to the product has expired (step 98). This is done because the buyer computer can request access to a purchased product repeatedly. If the duration time has expired, the merchant computer sends a document to the buyer computer indicating that the time has expired (step 100). Otherwise the merchant computer verifies that the buyer computer network address is the same as the buyer network address in the access URL (step 101), and if so, sends a fulfillment document to the buyer computer (step 102), which is displayed by the buyer computer (step 104). An example of a fulfillment document is shown in FIG. 10. Otherwise, the merchant computer sends a document to the buyer computer indicating that access is not allowed (step 103).
[0044] With reference now to FIG. 3, when the merchant computer sends the advertising document to the buyer computer, the user may request that a product be added to a shopping cart in the shopping cart database rather than request that the product be purchased immediately. The buyer computer sends a shopping cart URL to the payment computer (step 108), the shopping cart URL including a product identifier, a domain identifier, a payment amount, a merchant computer identifier, a merchant account identifier, a duration time, an expiration time, and a shopping cart URL authenticator that is a digital signature based on a cryptographic key. The shopping cart URL authenticator is a hash of other information in the shopping cart URL, the hash being defined by a key shared by the merchant and the operator of the payment computer.
[0045] The payment computer verifies whether the shopping cart URL authenticator was created from the contents of the shopping cart URL using a cryptographic key (step 110). If not, the payment computer sends a document to the buyer computer indicating that access to the network sales system is denied (step 112). Otherwise, before any modification to a user's shopping cart is allowed, user authentication is performed (step 113) in a manner analogous to steps 40-81. Once the user is authenticated, the payment computer creates or updates a payment URL for the shopping cart (step 114).
[0046] The user then either requests more advertisements (step 24 in FIG. 2) and possibly adds another product to the shopping cart, requests display of the shopping cart (step 116), or requests purchase of the entire contents of the shopping cart (step 124). If the user requests display of the shopping cart (step 116), the buyer computer sends a fetch shopping cart request to the payment computer (step 118), and the payment computer and buyer computer (step 119) perform steps analogous to steps 64-81. The payment computer returns the contents of the shopping cart to the buyer computer (step 120), which displays the contents of the shopping cart (step 122). If the user requests that the entire contents of the shopping cart be purchased (step 124) the buyer computer causes the payment URL for the shopping cart to be activated (step 126) and the payment URL is processed in a manner analogous to the processing of payment URLs for individual products (beginning with step 36 in FIG. 2).
[0047] With reference now to FIG. 4, a user can request display of a “smart statement” that lists purchase transactions for a given month (step 128). When the buyer computer receives such a request, it sends a smart statement URL to the payment computer (step 130).
[0048] When the payment computer receives the smart statement URL, it verifies whether the smart statement URL authenticator was created from the contents of the smart statement URL using a cryptographic key (step 132). If not, the payment computer sends a document to the buyer computer indicating that access is denied (step 134). Otherwise, the payment computer checks to determine whether the buyer network address in the smart statement URL matches the buyer computer's actual network address (step 136). If not, the payment computer sends a document to the buyer computer indicating that access is denied (step 138). Otherwise (step 140), the payment computer and buyer computer perform a set of steps analogous to steps 64-81 in FIG. 2 (payment computer requests account name and password, user provides the requested information, and payment computer verifies the information).
[0049] In an alternative embodiment steps 132-138 are omitted.
[0050] After verification of account information is complete, the payment computer retrieves the requested settlement data from the settlement database, creates a smart statement document for the buyer, and sends the smart statement document to the buyer computer (step 142). An example of a smart statement document is shown in FIG. 11. Each purchase transaction record in the smart statement document includes the data of the transaction, the name of the merchant, an identification of the product, and the payment amount for the product. The smart statement document also includes a transaction detail URL for each purchase transaction (these URLs, or hypertext links, are discussed below and are not shown in FIG. 11). The smart statement document also identifies previous statements that the user may wish to have displayed.
[0051] The buyer computer displays the retrieved document (step 144), and the user may request transaction details for a particular transaction listed on the smart statement (step 146). If so, the buyer computer sends a transaction detail URL (or “payment detail URL”) to the payment computer (step 148). The transaction detail URL includes a transaction identifier, a buyer network address, and a transaction detail URL authenticator. When the payment computer receives the transaction detail URL, it performs (step 150) a set of steps analogous to steps 132-140 (verification of URL authenticator, buyer network address, and account information). The payment computer then retrieves from the settlement database data corresponding to the payment transaction specified in the transaction detail URL, creates a transaction detail document, and sends it to the buyer computer (step 152).
[0052] An example of a transaction detail document is shown in FIGS. 12 and 13. The document displays a number of items of information about the transaction, including the transaction date, end of the duration time (“expiration”), a description of the product, the payment amount, the domain corresponding to the product, an identification of the merchant, and the merchant's address.
[0053] The smart statement document and the transaction detail document both include customer service URLs (hypertext links) that allow the user to request customer service (i.e., to send comments and suggestions to the payment computer). When the user requests customer service (step 154), the buyer computer sends the customer service URL to the payment computer (step 156), which creates a customer service form and sends it to the buyer computer (step 158). An example of a customer service form is shown in FIG. 14. The user types comments into the customer service form (step 160), and the buyer computer sends the user's comments to the payment computer (step 162). The payment computer then posts the user comments and sends a thank you document to the buyer computer (step 164).
[0054] A user may request display of a produce included in the smart statement. When the user requests that the product be displayed (step 166), the buyer computer sends the access URL contained in the smart statement document to the merchant computer (step 168), and the buyer computer and merchant computer perform a set of steps analogous to steps 94-104 in FIG. 2 (authentication of access URL, verification whether duration time has expired, verification of buyer network address, and transmission of fulfillment document to buyer computer).
[0055] Whenever the present application states that one computer sends a URL to another computer, it should be understood that in preferred embodiments the URL is sent in a standard HTTP request message, unless a URL message is specified as a redirection in the present application. The request message includes components of the URL as described by the standard HTTP protocol definition. These URL components in the request message allow the server to provide a response appropriate to the URL. The term “URL” as used the present application is an example of a “link,” which is a pointer to another document or form (including multimedia documents, hypertext documents including other links, or audio/video documents).
[0056] When the present application states that one computer sends a document to another computer, it should be understood that in preferred embodiments the document is a success HTTP response message with the document in the body of the message. When the present application states that a server sends an account name and password request message to the client, it should be understood that in preferred embodiments the account name and password request message is an unauthorized HTTP response. A client computer sends account name and password information to a server as part of a request message with an authorization field.
[0057] The software architecture underlying the particular preferred embodiment is based upon the hypertext conventions of the World Wide Web. Appendix A describes the Hypertext Markup Language (HTML) document format used to represent digital advertisements, Appendix B describes the HTML forms fill out support in Mosaic 2.0, Appendix C is a description of the Hypertext Transfer Protocol (HTTP) between buyer and merchant computers, Appendix D describes how documents are named with Uniform Resource Locators (URLs) in the network of computers, and Appendix E describes the authentication of URLs using digital signatures.
[0058] A printout of a computer program for use in creating and operating such a “store” in accordance with the present invention is provided as Appendix F. A printout of a computer program for use in operating other aspects of the network sales system in accordance with the present invention is provided in Appendix G.
[0059] There has been described a new and useful network-based sales system. It is apparent that those skilled in the art may make numerous modifications and departures from the specific embodiments described herein without departing from the spirit and scope of the claimed invention.
Claims
What is claimed is:
1. A network-based sales system, comprising:
a merchant database comprising a plurality of digital advertisements and a plurality of respective product fulfillment items;
at least one creation computer for creating said merchant database; and
at least one merchant computer for causing said digital advertisements to be transmitted to a user and for causing advertised products to be transmitted to said user;
said creation computer and said merchant computer being interconnected by a computer network;
said creation computer being programmed to create said merchant database, and to transmit said digital advertisements and said product fulfillment items to said merchant computer;
said merchant computer being programmed to receive said digital advertisements and product fulfillment items, to receive a request for a digital advertisement from a user, to cause said digital advertisement to be sent to said user, to receive from said user an access message identifying an advertised product, and to cause said product to be sent to said user in accordance with a product fulfillment item corresponding to said product.
2. A network-based sales system in accordance with claim 1, wherein each of said digital advertisements comprises an abstract of a product and a price.
3. A network-based sales system in accordance with claim 2, wherein:
at least one of said product fulfillment items comprises a product itself; and
said creation computer is programmed to transmit said product to said merchant computer with said digital advertisements.
4. A method of processing shopping cart messages sent between a first computer and a second computer, the first computer and the second computer being interconnected by a public packet switched computer network in which communications between the first computer and the second computer are according to hypertext transfer protocol, the method comprising:
at the second computer, receiving from the first computer a shopping cart message, the shopping cart message comprising a universal resource locator that includes at least one identifier incorporated therein pertaining to a respective shopping cart and an authenticator that comprises a digital signature based on a cryptographic key, and
examining the shopping cart message at the second computer and returning shopping cart data to the first computer in response to the shopping cart message.
5. The method of claim 4 wherein the first computer is a client computer and the second computer is a server computer.
6. The method of claim 4 wherein the digital signature is a hash of information in the universal resource locator.
7. The method of claim 4 further comprising the step of authenticating the shopping cart message by checking the authenticator.
8. The method of claim 4 wherein the at least one identifier pertaining to the shopping cart comprises a product identifier.
9. The method of claim 4 wherein the at least one identifier of pertaining to the shopping cart comprises a domain identifier.
10. The method of claim 4 wherein the at least one identifier of pertaining to the shopping cart comprises a payment amount.
11. The method of claim 4 wherein the at least one identifier pertaining to the shopping cart comprises a merchant computer identifier.
12. The method of claim 4 wherein the at least one identifier pertaining to the shopping cart comprises a merchant account identifier.
13. The method of claim 4 wherein the at least one identifier pertaining to the shopping cart comprises a duration time.
14. The method of claim 4 wherein the at least one identifier pertaining to the shopping cart comprises an expiration time.
15. The method of claim 4 further comprising receiving at the second computer from the first computerfurther shopping cart messages related to the shopping cart and updating a payment universal resource locator corresponding to the shopping cart in response to the further shopping cart messages.
16. A network-based system for processing shopping cart messages, comprising:
a first computer; and
a second computer;
the first computer and the second computer being interconnected by a public packet switched computer network in which communications between the first computer and the second computer are according to hypertext transfer protocol;
the first computer being programmed to transmit a shopping cart message to the second computer, the shopping cart message comprising a universal resource locator that includes at least one identifier incorporated therein pertaining to a respective shopping cart and an authenticator that comprises a digital signature based on a cryptographic key;
the second computer being programmed to examine the shopping cart message at the second computer and to return shopping cart data to the first computer in response to the shopping cart message.
17. The system of claim 16 wherein the first computer is a client computer and the second computer is a server computer.
18. A method of operating a payment computer in a public packet switched computer network comprising at least one buyer computer for operation by a user desiring to buy a product and at least one payment computer, the method comprising:
receiving, at the payment computer, a payment message that the buyer computer has sent to the payment computer for purchasing a product in response to a user request, the payment message comprising a product identifier identifying the product, the payment message comprising a universal resource locator containing all information required by the payment computer for authorizing purchase of the product and an authenticator that comprises a digital signature based on a cryptographic key; and
at the payment computer, authorizing, based on the payment message, purchase of the product.
19. The method of claim 18 wherein the digital signature is a hash of information in the universal resource locator.
20. The method of claim 18 further comprising the step of authenticating the payment message by checking the authenticator.
21. A network-based system for processing payment messages, comprising:
a buyer computer; and
a payment computer;
the buyer computer and the payment computer being interconnected by a public packet switched computer network;
the buyer computer being programmed to send to the payment computer a payment message for purchasing a product in response to a user request, the payment message comprising a product identifier identifying the product, the payment message comprising a universal resource locator containing all information required by the payment computer for authorizing purchase of the product and an authenticator that comprises a digital signature based on a cryptographic key;
the payment computer being programmed to receive the payment message and to authorize, based on the payment message, purchase of the product.
22. A method of processing shopping cart messages sent between a client computer and a server computer, the client computer and the server computer being interconnected by a public packet switched computer network in which communications between the client computer and the server computer are according to hypertext transfer protocol, the method comprising:
responding to a shopping cart message received from the client computer through the network, by returning to the client computer a hypertext page corresponding to a shopping cart associated with the shopping cart message; and
responding to further shopping cart requests related to the shopping cart, the further shopping cart messages being universal resource locators that include at least one identifier incorporated therein pertaining to respective shopping carts and an authenticator that comprises a digital signature based on a cryptographic key, and tracking the further shopping cart requests related to the shopping cart.
23. A network-based system for processing shopping cart messages, comprising:
a client computer; and
a server computer;
the client computer and the server computer being interconnected by a public packet-switched computer network in which communications between the client computer and the server computer are according to hypertext transfer protocol;
the client computer being programmed to incorporate into a universal resource locator at least one identifier pertaining to a respective shopping cart;
the server computer being programmed to respond to a shopping cart message received from the client computer through the network, the shopping cart message comprising the universal resource locator, by returning to the client computer a hypertext page corresponding to the shopping cart message; and
the server computer being programmed to respond to further shopping cart messages related to the shopping cart, the further shopping cart messages being universal resource locators that include at least one identifier incorporated therein pertaining to respective shopping carts and an authenticator that comprises a digital signature based on a cryptographic key, and to track the further shopping cart messages related to the shopping cart.
Patent Citations (80)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US4305059(A) | 1981-12-01 | Benton | Applicant |
| US4528643(A) | 1985-07-01 | Freeny, Jr. | Applicant |
| US4529870(A) | 1985-07-01 | Chaum | Applicant |
| US4578530(A) | 1986-03-01 | Zeidler | Applicant |
| US4734858(A) | 1988-03-01 | Schlafly | Applicant |
| US4755940(A) | 1988-07-01 | Brachtl et al. | Applicant |
| US4759063(A) | 1988-07-01 | Chaum | Applicant |
| US4759064(A) | 1988-07-01 | Chaum | Applicant |
| US4775935(A) | 1988-10-01 | Yourick | Applicant |
| US4795890(A) | 1989-01-01 | Goldman | Applicant |
| US4799156(A) | 1989-01-01 | Shavit et al. | Applicant |
| US4812628(A) | 1989-03-01 | Boston et al. | Applicant |
| US4827508(A) | 1989-05-01 | Shear | Applicant |
| US4891503(A) | 1990-01-01 | Jewel | Applicant |
| US4922521(A) | 1990-05-01 | Krikke et al. | Applicant |
| US4926480(A) | 1990-05-01 | Chaum | Applicant |
| US4935870(A) | 1990-06-01 | Burk, Jr. et al. | Applicant |
| US4947028(A) | 1990-08-01 | Gorog | Applicant |
| US4947430(A) | 1990-08-01 | Chaum | Applicant |
| US4949380(A) | 1990-08-01 | Chaum | Applicant |
| US4972318(A) | 1990-11-01 | Brown et al. | Applicant |
| US4977595(A) | 1990-12-01 | Ohta et al. | Applicant |
| US4982346(A) | 1991-01-01 | Girouard et al. | Applicant |
| US4987593(A) | 1991-01-01 | Chaum | Applicant |
| US4991210(A) | 1991-02-01 | Chaum | Applicant |
| US4992940(A) | 1991-02-01 | Dworkin | Applicant |
| US4996711(A) | 1991-02-01 | Chaum | Applicant |
| US5025373(A) | 1991-06-01 | Keyser, Jr. et al. | Applicant |
| US5060153(A) | 1991-10-01 | Nakagawa | Applicant |
| US5077607(A) | 1991-12-01 | Johnson et al. | Applicant |
| US5105184(A) | 1992-04-01 | Pirani et al. | Applicant |
| US5220501(A) | 1993-06-01 | Lawlor et al. | Applicant |
| US5247575(A) | 1993-09-01 | Sprague et al. | Applicant |
| US5276736(A) | 1994-01-01 | Chaum | Applicant |
| US5305195(A) | 1994-04-01 | Murphy | Applicant |
| US5311594(A) | 1994-05-01 | Penzias | Applicant |
| US5319542(A) | 1994-06-01 | King, Jr. et al. | Applicant |
| US5321751(A) | 1994-06-01 | Ray et al. | Applicant |
| US5336870(A) | 1994-08-01 | Hughes | Applicant |
| US5341429(A) | 1994-08-01 | Stringer et al. | Applicant |
| US5347632(A) | 1994-09-01 | Filepp et al. | Applicant |
| US5351186(A) | 1994-09-01 | Bullock et al. | Applicant |
| US5351293(A) | 1994-09-01 | Michener et al. | Applicant |
| US5383113(A) | 1995-01-01 | Kight et al. | Applicant |
| US5414833(A) | 1995-05-01 | Hershey et al. | Applicant |
| US5475585(A) | 1995-12-01 | Bush | Applicant |
| US5521631(A) | 1996-05-01 | Budow et al. | Applicant |
| US5535229(A) | 1996-07-01 | Hain, Jr. et al. | Applicant |
| US5557516(A) | 1996-09-01 | Hogan | Applicant |
| US5557518(A) | 1996-09-01 | Rosen | Applicant |
| US5557798(A) | 1996-09-01 | Skeen et al. | Applicant |
| US5590197(A) | 1996-12-01 | Chen et al. | Applicant |
| US5592378(A) | 1997-01-01 | Cameron et al. | Applicant |
| US5594910(A) | 1997-01-01 | Filepp et al. | Applicant |
| US5596642(A) | 1997-01-01 | Davis et al. | Applicant |
| US5596643(A) | 1997-01-01 | Davis et al. | Applicant |
| US5604802(A) | 1997-02-01 | Holloway | Applicant |
| US5621797(A) | 1997-04-01 | Rosen | Applicant |
| US5623547(A) | 1997-04-01 | Jones et al. | Applicant |
| US5642419(A) | 1997-06-01 | Rosen | Applicant |
| US5664110(A) | 1997-09-01 | Green et al. | Examiner |
| US5664111(A) | 1997-09-01 | Nahan et al. | Examiner |
| US5694551(A) | 1997-12-01 | Doyle et al. | Applicant |
| US5715314(A) | 1998-02-01 | Payne et al. | Applicant |
| US5724424(A) | 1998-03-01 | Gifford | Examiner |
| US5727164(A) | 1998-03-01 | Kaye et al. | Examiner |
| US5734719(A) | 1998-03-01 | Tsevdos et al. | Applicant |
| US5826241(A) | 1998-10-01 | Stein et al. | Applicant |
| US5848399(A) | 1998-12-01 | Burke | Examiner |
| US5897622(A) | 1999-04-01 | Blinn et al. | Examiner |
| US5909492(A) | 1999-06-01 | Payne et al. | Examiner |
| US5920847(A) | 1999-07-01 | Kolling et al. | Applicant |
| US6006199(A) | 1999-12-01 | Berlin et al. | Examiner |
| EP172670 | 1986-02-01 | Applicant | |
| EP-542-298 | 1993-05-01 | Applicant | |
| GB2102606 | 1983-02-01 | Applicant | |
| JP4-10191 | 1992-01-01 | Applicant | |
| JP5-158963 | 1993-06-01 | Applicant | |
| WO91/16691 | 1991-10-01 | Applicant | |
| WO93/10503 | 1993-05-01 | Applicant |
Non-Patent Literature (104)
- Anon., Newsbytes News Network, “Electronic Book Helps Put Documentation on Internet,” Jun. 21, 1994.Applicant
- Burke, R.R., “The Virtual Store: A New Tool for Consumer Research,” Stores, vol. 76, No. 8, pp. RR1-RR3, Aug. 1994.Applicant
- P. Remeery et al., “Le Paiement electronique”, pp. 15-23, 1988, L'Echo des RECHERCHES, No. 134.Applicant
- CCITT Blue Book, vol. VIII; pp. 48-81, Nov. 14-25, 1988.Applicant
- Rafael Hirschfeld, “Making Electronic Refunds Safer”; Sections 1, 2, 4 and 6, 1992.Applicant
- Low et al., “Anonymous Credit Cards”, pp. 1-16.Applicant
- Lai et al., “Endorsements, Licensing, and Insurance for Distributed System Services”, Information Sciences Institute Univ. of Southern CA., Assoc. for Computing Machinery 1994.Applicant
- Allen & Hamilton, How to Buy information with a First Virtual Account, Apr. 11, 1994, pp. 3-71.Applicant
- “Advanced Electronic Credit Authorization Through the Amherst Group SNET”, News Release, pp. 1-2.Applicant
- Computer Fraud & Security Bulletin, “Underlying Security Mechanisms,” Mar. 1997.Applicant
- Abadi, M. et al.; “Authentication and Delegation with Smart-Cards” Report 67; Systems Research Center; Digital Equipment Corporation; Palo Alto, California; Oct. 22, 1990, revised Jul. 30, 1992.Applicant
- American National Standard; “Financial Institution Retail Message Authentication”; ANSI X9.19; 1986.Applicant
- American National Standard; “Interchange Message Specification for Debit and Credit Card Message Exchange Among Financial institutions”; ANSI X9.2; 1988.Applicant
- Anderson, Ross J.; “UEPS—A Second Generation Electronic Wallet”; Proc. of the Second European Symposium on Research in Computer Security (ESORICS); Touluse, France; pp. 411-418; Nov., 1992.Applicant
- Anderson, Ross ; “Why Cryptosystems Fail”; Proc. 1st Conf. Computer and Comm. Security; pp. 215-227; Nov., 1993.Applicant
- Bank Administration Institute; Payment Systems in Eleven Developed Countries; “United States”; pp. 215-235; 1989.Applicant
- Batelann; Butler; Chan; Chen; Evenchick; Hughes; Jen; Jeng; Millett; Riccio; Skoudis; Starace; Stoddard; “An Internet Billing Server Prototype Design”; Carnegie Mellon University; 1992.Applicant
- Batelaan; Butler; Chan; Chen; Evenchick; Hughes; Jen; Jeng Millett; Riccio; Skoudis; Starace; Stoddard;Applicant
- “An Internet Billing Server: System Requirements”; Carnegie Mellon University; Master of Science thesis; 1992.Applicant
- Bellcore Internal E-Mail, Nov. 24, 1993.Applicant
- Bender, M.; “EFTS: Electronic Funds Transfer Systems”; Kennikat Press; Port Washington, New York; pp. 43-46; 1975.Applicant
- Bodner; Carlos; Evans; Garcia; Ha; Harris; Reece; Russo; Sekino; Walker; “An Internet Billing Server: Analysis of Distributed Computing and Cross Platform Issues”; Carnegie Mellon University; thesis; 1993.Applicant
- Bodner; Carlos; Evans; Garcia; Ha; Harris; Reece; Russo; Sekino; Walker; “An Internet Billing Server: Availability, Reliability & Scalability Issues in the MS4 Billing Server Design & Prototype”; thesis; 1993.Applicant
- Bodner; Carlos; Evans; Garcia; Ha; Harris; Reece; Russo; Sekino; Walker; “The Internet Billing Server: Design Document”; Carnegie Mellon University Information Networking Institute; Master of Science thesis; 1993.Applicant
- Bodner; Carlos; Evans; Garcia; Ha; Harris; Reece; Russo; Sekino; Walker; “The Internet Billing Server: Prototype Requirements”; Carnegie Mellon University Information Networking Insititute; thesis; 1993.Applicant
- Bos et al.; “SmartCash: A Practical Electronic Payment System”; pp. 1-8; Aug., 1990.Applicant
- Bürk et al.; “Value Exchange Systems Enabling Security and Unobservability”; Computers & Security, 9; pp. 715-721; 1990.Applicant
- Chaum et al.; “Achieving Electronic Privacy”; Scientific American; pp. 319-327; 1988.Applicant
- Chaum, D.L. et al.; Implementing Capability-Based Protection Using Encryption; Electronics Research Laboratory, College of Engineering, University of California, Berkeley, California; Jul. 17, 1978.Applicant
- Chaum et al.; “Untraceable Electronic Cash”; Advances in Cryptology; pp. 319-327; 1988.Applicant
- Cohen, Danny; “Computerized Commerce”; ISI Reprint Series ISI/RS-89-243; Oct., 1989; Reprinted from Information Processing 89, Proceedings of the IFIP World Computer Congress, held Aug. 28-Sep. 1 1989.Applicant
- Cohen, Danny; “Electronic Commerce”; University of Southern California, Information Sciences Institute, Research Report ISI/RR-89-244; Oct., 1989.Applicant
- Compuserve International; Compuserve Information Service Users Guide; pp. 109-114; 1986.Applicant
- Computer Shopper; “Internet for Profit”; pp. 180-182, 187, 190-192, 522-528, 532, 534; Nov., 1994.Applicant
- Davies, D.W. and Price, W.L.; “Security for Computer Networks: An Introduction to Data Security in Teleprocessing and Electronic Funds Transfer”; John Wiley & Sons; Dec. 5, 1985; pp. 304-336.Applicant
- Dukach, Semyon; “SNPP: A Simple Network Payment Protocol”; MIT Laboratory for Computer Science; Cambridge, Massachusetts; 1993.Applicant
- Even et al.; “Electronic Wallet”; pp. 383-386; 1983.Applicant
- Gifford, David and Spector, Alfred; “Case Study: The CIRRUS Banking Network”; Comm. ACM 8, 28′ pp. 797-8078 Aug., 1985.Applicant
- Gifford, David K.; “Cryptographic Sealing for Information Secrecy and Authentication”; Stanford University and Xerox Palo Alto Research Center; Communications of the ACM; vol. 25, No. 4; Apr., 1982.Applicant
- Gifford, David; “Notes on Community Information Systems” NIT LCS TM-419; Dec., 1989.Applicant
- Gligor, Virgil D. et al.; “Object Migration and Authentication”; IEEE Transactions of Software Engineering; vol. SE-5, No. 6; Nov., 1979.Applicant
- Harty et al.; “Case Study: The VISA Transaction Processing System”; 1988.Applicant
- Information Network Institute, Carnegie Mellon University; Internet Billing Server; Prototype Scope Document; Oct. 14, 1993.Applicant
- Intel Corporation; Power Technology; Marketing Brochure.Applicant
- International Organization for Standardization; “International Standard: Bank Card Originated Messages—Interchange Message Specifications—Content for Financial Transactions”; ISO 8583; 1987.Applicant
- Intuit Corp Quicken User's Guide; “Paying Bills Electronically”; pp. 171-192; 1993.Applicant
- Jansson, Lennart; “General Electronic Payment System”; 7th Proceedings of the International Conference on Computer Communication; pp. 832-837; 1985.Applicant
- Krajewski, M. et al.; “Applicability of Smart Cards to Network User Authentication”; Computing Systems; vol. 7, No. 1; 1994.Applicant
- Krajewski, M.; “Concept for a Smart Card Kerberos”; 15th National Computer Security Conference; Oct., 1992.Applicant
- Krajewski, M.; “Smart Card Augmentation of Kerberos”; Privacy and Security Research Group Workshop on Network and Distributed System Security; Feb., 1993.Applicant
- Lampson, Butler; Abadi, Martin; Burrows, Michael; and Wobber, Edward; “Authentication in Distributed Systems: Theory and Practice”; ACM Transactions on Computer Systems: vol. 10, No. 4; Nov., 1992; pp. 265-310.Applicant
- Mak, Stephen; “Network Based Billing Server”; Carnegie Mellon University Information Networking Institute; Masters of Science thesis; 1991.Applicant
- Medvinsky et al.; “Electronic Currency for the Internet”; Electronic Markets; pp. 30-31; Sep., 1993.Applicant
- Medvinsky et al.; “NetCash: A Design for Practical Electronic Currency on the Internet”; Proc. 1st ACM Conf. on Comp. and Comm. Security; Nov., 1993.Applicant
- Miller, S.P.; Neuman, B.C.; Schiller, J.I.; Saltzer, J.H.; “Kerberos Authentication and Authorization System”; Project Athena Technical Plan, Section E.2.1; Massachusetts Insittute of Technology; Oct., 1988.Applicant
- Mosaic Communications Corp. press release; “Mosaic Communications Unveils Netwok Navigator and Server Software for the Internet”; Sep. 12, 1994.Applicant
- Needham, Roger M. and Schroeder, Michael D.; “Using Encryption for Authentication in Large Networks of Computers”; Communications of the ACM; vol. 21, No. 12; Dec., 1978; pp. 993-999.Applicant
- National Westminster Bank Group; “Clearing House Automated Payments System”; pp. 1-29Applicant
- Needham, Roger M.; “Adding Capability Access to Conventional File Servers”; Xerox Palo Alto Research Center; Palo Alto, California.Applicant
- Neuman, B. Clifford; “Proxy-Based Authorization and Accounting for Distributed Systems”; Proceedings of the International Conference on Distributed Computing Systems; May 25-28, 1993; Conf. 13; IEEE pp. 283-291.Applicant
- Okamoto et al.; “Universal Electronic Cash”; pp. 324-337; 1991.Applicant
- Pfitzmann et al.; “How to Break and Repair a ‘Provably Secure’ Untraceable Payment System”; pp. 338-350; 1991.Applicant
- Rescorla, E. and Schiffman, A.; “The Secure HyperText Transfer Protocol”; Enterprise Integration Technologies; Jun., 1994.Applicant
- Rivest, R.; “The MD5 Message-Digest Algorithm”; MIT Laboratory for Computer Science and RSA Data Security, Inc.; Apr., 1992.Applicant
- Rivest, R.L. et al., “A Method for Obtaining Digital Signatures and Public-Key Cryptosystems,” Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, Massachusetts.Applicant
- Schamüller-Bichl, I.; “IC-Cards in High-Security Applications”; Selected Papers from the Smart Card 2000 Conference; Springer Verlag; pp. 177-199; 1991.Applicant
- Sirbu, Marvin A.; “Internet Billing Service Design and Prototype Implementation”; An Internet Billing Server; pp. 1-19; 1993.Applicant
- Society for Worldwide Interbank Financial Telecommunications. S.C.; “A S.W.I.F.T. Overview”.Applicant
- Tenebaum, Jay M. and Schiffman, Allan M.; “Development of Network Infrastructure and Services for Rapid Acquisition”; adapted from a white paper submitted to DARPA by MCC in collaboration with EIT and ISI.Applicant
- Vittal, J. “Active Message Processing: Messages as Messengers”; pp. 175-195; 1981.Applicant
- Voydock, Victor et al.; “Security Mechanisms in High-Level Network Protocols”; Computing Surveys; vol. 15, No. 2; Jun., 1981.Applicant
- Takei, “Videotex Information System and Credit System Connecting with MARS-301 of JNR,” Japanese Railway Engineering, No. 94, Sep. 1985, pp. 9-11.Applicant
- Pongratz, et al, “IC Cards in Videotex Systems,” Smart Card 2000, 1989, pp. 179-186.Applicant
- Waidner, et al, “Loss-Tolerance for Electronic Wallets,” Fault-Tolerant Computing: 20th International Symposium, Jun. 1990, pp. 140-147.Applicant
- Floch, Privacy Protected Payments: An Implementation of a Transaction System, Dec. 1988, pp. 1-28.Applicant
- Beutelspacher, et al, “Payment Applications with Multifunctional Smart Cards,” Smart Card 2000: The Future of IC Cards, Oct. 1987, pp. 95-101.Applicant
- Tanaka, et al, “Untraceable Electronic Funds Transfer System,” Electronics and Communications in Japan, 1989, pp. 47-54.Applicant
- Perry, “Electronic Banking Goes to Market,” IEEE Spectrum, Feb. 1988, pp. 46-49.Applicant
- Hakola, et al, “A System for Automatic Value Exchange,” Proceedings—Fall Joint Computer Conference, 1966, pp. 579-589.Applicant
- “CompuServe Videotex Network Offers Marketing Research Service, Ad Test,” Marketing News, Nov. 25, 1983 p. 21.Applicant
- Fujioka, et al, “ESIGN: An Efficient Digital Signature Implementation for Smart Cards,” Advances in Cryptology-Eurocrypt '91, Apr. 1991, pp. 446-457.Applicant
- “Electronic In-Home Shopping: “Our Stores are Always Open”, ” Chain Store Age Executive, Mar. 1985, pp. 111,116.Applicant
- “Suddenly, Videotex is Finding an Audience,” Business Week, Oct. 19, 1987, pp. 92-94.Applicant
- Staskauskas, “The Formal Specification and Design of a Distributed Electronic Funds Transfer System,” IEEE Transactions on Computers, Dec. 1998, pp. 1515-1528.Applicant
- Stol, Privacy Protected Payments-A Possible Structure for a Real Implementaiton and Some Resource Considerations, Feb. 1998.Applicant
- Ph. van Heurck, “TRASEC: Belgian Security System for Electronic Funds Transfers,” Computers & Security, 1987, pp. 261-268.Applicant
- Weber, “Controls in Electronic Funds Transfer System,” Computers & Security, 1989, pp. 209-221.Applicant
- Shain, “Security in Electronic Funds Transfer System,” Computers & Security, 1989, pp. 123-137.Applicant
- Burk, et al, “Digital Payment Systems Enabling Security and Observability,” Computers & Security, 1989, pp. 399-415.Applicant
- Andrade, et al, “Open On-Line Transaction Processing with the Tuxedo System,” COMPCON Spring 1992, Feb. 1992, pp. 366-371.Applicant
- Damgard, “Payment Systems and Credential Mechanisms with Provable Security Against Abuse by Individuals,” Advances in Cryptology—CRYPTO ′88, 1988, pp. 328-325.Applicant
- Tunstall, “Electronic Currency,” Smart Card 2000: The future of IC Cards, Oct. 1987, pp. 47-48.Applicant
- Strazewski, “Computerized Service Sets Shoppers Hacking,” Advertising Age, Feb. 22, 1988, p. 62.Applicant
- Messmer, “NIST Stumbles on Proposal for Public Key Encryption,” Network World, Jul. 27, 1992, p. 1.Applicant
- Knapskog, Privacy Protected Payments- Realization of a Protocol That Guarantees Payor Anonymity, Advances in Cryptology-Eurocrypt ′88, May 1988, pp. 107-122.Applicant
- “Redcoats Join Communications Fight.” Industry Week, Feb. 22, 1982, pp. 108-109.Applicant
- Williams, “Debit Program Cuts Fraud; CompuServe Plan a Success,” Pensions & Investment Age, Feb. 4, 1985, pp. 21-32.Applicant
- Consumers Plugging Into New Electronic Mall, Advertising Age, Mar. 4, 1985. p. 74.Applicant
- “Taking Advantage of the Past,” Advertising Age, Apr. 11, 1983, pp. M36-37.Applicant
- “Mall Offers Holiday Treat for Hackers,” Advertising Age, Nov. 13, 1985, p. 76.Applicant
- Kenny, “EDI Security: Risks and Solutions,” COMPSEC 1992; The Ninth World Conference on Computer Security, Audit, and Control, Nov. 1992, pp. 341-352.Applicant
- Ferrarini, “Direct Connections for Software Selections,” Business Computer Systems, Feb. 1984, pp. 35-38.Applicant
- P. Rémery et al., “Le paiement électronique”, pp. 15-23, 1988, L'Écho des RECHERCHES, No. 134.Applicant
- CCITT Blue Book, vol. VIII; pp. 48-81, Nov. 14-25, 1988.Applicant