US 5,623,547 AGrant
Value Transfer System
Issue Date:1997-04-22
•27 Claims
•6 Drawing Sheets
Abstract
A value transfer system which allows value to be transferred between electronic purses comprises computer which controls the loading of purses with value and the redemption of value from purses, a special bulk purse or purses and a value meter securely linked thereto which registers the total net value issued to the bulk purse or purses. Draw-down of value and redemption of value transactions are effected with the bulk purses.
Metadata
Assignee
- Jonhig Limited
Inventors
- Timothy L. Jones
- Graham R. L. Higgins
Application Information
Application Number:US 400003&
Filing Date:1995-03-06
Priority Date:1990-04-12
Art Unit:222
Classifications
IPC:
H04L 900H04L 932H04L 930H04L 906
Field of Search:
3802354;9;23;24;25;28;29;30;49;50;52379;380;381
Patent Drawings (6 sheets)
Description
Background of the Invention
1. Field of the Invention
The invention relates to a value transfer system for cashless transactions.
2. Discussion of Prior Art
Several kinds of cashless financial transaction services are available. These include credit cards and debit cards which customers may use with a wide range of retailers. Each transaction is accompanied by the provision of customer account details required for the actual transfer of funds between the specific customers and the specific retailers.
Another form of cashless card system is the prepayment card system, where a card is purchased prior to a series of transactions and a value record recorded on it is appropriately decremented on each transaction. A phone card is an example of a prepayment card.
Such prior systems are inflexible and are no general substitute for cash in low value high volume transactions. Various proposals have been put forward to allow the interchange of money values between "electronic purses". For example, U.S. Pat. No. 4,839,504 (Casio Computer Co Ltd) discloses a system where a user is able to load money value on to an integrated circuit (IC) card, otherwise known as a smart card, by communication with his bank. At the bank the same value is applied to a separate IC account set up for the user. Purchases are able to be made by transfer of money values from the IC card to retailer equipment off-line from the bank. Each transaction requires transmission to the retailer and retention by him of details which include the purchaser's identity. Ultimately, in claiming funds from the bank the retailer presents a list of transaction details and there is account reconciliation to allow the IC account of the appropriate purchaser to be adjusted.
Procedures which, as above, require ultimate account reconciliation for every transaction are attended by two disadvantages. The first is practical. The storing, transmitting and reconciling of purchaser details for every transaction places an impossible burden on equipment if all cash type transactions are contemplated. Processing all such transactions efficiently in an acceptable time is not possible, even with the most modern equipment. The second objection is social. The anonymity of cash would be lost and potential would exist for details of personal spending habits to be derived.
The second of the above objections have been addressed by Chaum in "Controlling your Information with a Card Computer" ("Concepts Applications Activities" published by TeleTrust March 1989). Chaum proposes a system of "blind signatures" of money value items effected by an authorising entity such as a bank. This is a way of preventing ready identification of purchasers. However, a problem remains in that double payment by a purchaser must be detectable and Chaum meets this difficulty by including, in the data transferred in an off-line transaction, encrypted information concerning the purchaser. This information is relayed to the bank when the retailer claims credit and is used at the bank to detect double use of the same "electronic cash". Also, each signed item is recorded at the bank to make possible ultimate reconciliation of claims against these items, albeit without customer identification. The problems of storage, transmission and processing of individual transaction information remain. Additionally, Chaum introduces another difficulty. His system requires that each item of signed "electronic cash" should be treated as a unit and is incapable of division. Again this means that the system is inappropriate for small value high volume transactions.
Summary of the Invention
The present invention seeks to provide a practical solution to the problem of providing a framework suitable for cashless small value high volume transactions.
According to the invention there is provided a value transfer system having a computer; a plurality of electronic purses; exchange devices whereby purses may communicate with each other to transfer value in transactions which are off-line from the computer; draw-down means for loading purses with value under control of the computer; redemption means for redeeming value from purses under control of the computer; a value meter; one or more of said purses being bulk purses which are capable of having value loaded and redeemed via the value meter, the value meter recording one or more float value records whereby the net value released to the bulk purse or purses may be derived, the net value being the difference between the total of values drawn down to the bulk purse or purses and the total of values redeemed from the bulk purse or purses, the float value record being non-specific with regard to individual draw-downs and redemptions.
The value meter may have an interface whereby the float value record may be adjusted on command so as to create or destroy value within the bulk purse or purses.
Preferably there is provided, in each purse, storage means which stores a purse value record which is accumulative and, in each purse or associated exchange device, a microprocessor, transactions being conducted between purse pairs, one of which, the sending purse, sends value and the other of which, the receiving purse, receives value, the microprocessors being programmed so that in each off-line transaction the purse value record in the sending purse is decreased by a chosen and variable transaction value and the purse value record in the receiving purse is increased by the same transaction value.
By providing a float value record which is non-specific anonymity is ensured and reconciliation with customer accounts for all subsequent purse to purse transactions is unnecessary.
The above combination of features allows transactions to be effected and entirely completed without subsequent recourse or reference to any third party, and in particular without reference to the computer. The advantages in terms of anonymity and computer processing time are clear. A retailer, for example, may make claims to redeem value from time to time, the nature and identity of all the off-line transactions which contribute to the retailer purse value record playing no part in the claim.
Preferably the purses have means whereby a transaction between a pair of purses is given a unique identifier and the microprocessors are programmed to respond to the identifiers to prevent a given transaction being repeated. No reference is then required to the computer to determine whether the same "electronic cash" is being used twice. In claiming to redeem value the computer is accessed and it will be possible to determine whether the same claim is being made twice, either directly or, since a claim may be simply another transaction, by means of a transaction identifier. The transaction identifier is preferably sent from the transmitting purse to the receiving purse, being conveniently derived from data identifying the receiving purse and a receiving purse transaction sequence number or electronic date/time stamp obtained from the receiving purse in a preliminary "hand-shaking" operation. In this way the receiving purse can monitor the transaction and any attempt to transmit the same value record twice will be foiled.
Security of the system demands that cryptographic techniques be employed to prevent fraud. The most effective cryptographic techniques are asymmetrical in that they require different keys to encrypt and decrypt information. One well-known and suitable cryptographic technique is that attributed to Rivest, Shamir and Adleman, known as the RSA system. It is envisaged that both purses of a communicating pair may employ the RSA system equally in a balanced way for algorithmic processing. However, whereas RSA encryption is straight-forward, relatively powerful computing facilities are required to execute RSA decryption conventionally in a short time. In order to overcome this difficulty, in the interests of economy and speed, it is proposed in accordance with a feature of the invention that an unbalanced system be used in which the processing capability required by consumer purses is significantly less than that required by retailer purses.
Each user of an asymmetrical key cryptographic system has a key pair, namely a public key and a secret key. Messages to another are encrypted using the other's (remote) public key which is made available, perhaps by a key exchange procedure. Received messages are decrypted using the local secret key. Use of a public key is far less demanding of computing power than use of a secret key so that conventionally encryption requires less computing overhead than decryption. Therefore, in implementing an unbalanced system of the kind described it is expedient to remove the requirement that the consumer purse performs conventional RSA decryption.
A first way of reducing the cryptographic burden in the consumer purse is to provide it with a simpler, symmetrical, cryptographic system. Such a system uses the same key for encryption and decryption. An example is the DES cryptographic system (Data Encryption Standard--US FIPS 46,1976). Retailer purses retain the full power of the RSA system.
A second method is to use the consumer purse's own public key/secret key system for the interchange of data. In an exchange of keys the consumer purse sends its secret key to the retailer purse. In the transmission of data to the retailer purse the consumer purse would encrypt using its own public key and the retailer purse would decrypt using the consumer purse's secret key.
Security can be enhanced by using electronically certified data, for example digitally signed data, in the transaction process. Each purse on issue will be allocated a characteristic number and will have that number signed by the secret key of an asymmetrical global cryptographic system. The result will be a global signing of the number and this is stored in the purse. All purses will carry the public key of the global pair so that on receipt of another's globally signed number it will be possible to verify that it is valid. The numbers can be regarded as globally certified. Since transactions will require the exchange of encryption keys it is convenient, although not necessary, to arrange that the globally certified numbers are the encryption keys to be exchanged.
The electronic purses may take a number of physical forms. They will include computer processing facilities which may be incorporated in IC or "smart" cards, key fobs, wallets or the like or built into electronic equipment such as point-of-sale equipment or calculators, for example.
Communication with the computer will generally be established by telephone and purses may be incorporated in telephones or modems, since it is possible that desired transactions may be conducted entirely by telephone. However, a more generally convenient arrangement is to have a portable purse such as an IC card which is loaded via modem connection either by a device specific to the individual or by automatic teller machine, for example.
Purses may communicate with each other for the transfer of values by means of communication devices. These may have slots for two purses or may each hold a purse and communicate with each other by infra-red light or electromagnetic radiation, for example.
Reference was made above to the difficulty of providing fast asymmetrical cryptographic facilities in very small and inexpensive devices such as IC cards. Clearly, it is more readily possible to provide such facilities in a communication device or in a modem. Therefore, even though consumer purses may lack full computing power themselves, this may be provided by communication devices which have access to the consumer purse memories and public keys. Thus, while it is readily possible to exchange value records person to person if all purses have full asymmetrical cryptographic facilities this is also possible if the purses are simple and intelligent communication devices are used.
At least the retailers' equipment will generally have the capability to store transaction information. This may be in memory or on disk or on another card or by some other means. Indeed, the equipment may comprise a transfer device for transferring value from the consumer's IC card to a retailer's IC card. The storage capacity of the retailers' equipment need not be large since it is only an accumulated total which needs to be stored, However, it is envisaged that in addition to the transaction values, other information, for example about the identity of the consumer and/or retailer may be exchanged to allow a transaction print-out to be derived locally for analysis purposes. Codes for the goods may be included.
As well as the usual point-of-sale terminals either attended or unattended, the retailers' equipment may include automatic vending machines, travel ticket dispensers, car parking machines, road toll booths, etc. Although security to use a purse may be provided by the requirement to key a PIN code, this is not essential and a preferred arrangement dispenses with this requirement to facilitate use. However, it is envisaged that each purse may have a PIN protected memory and an unprotected memory, the system being such that by use of a terminal or pocket exchange device, value records may be transferred by use of the PIN code from the protected to the unprotected part of the purse.
As mentioned above, individuals may carry their own pocket exchange devices to allow interchanges of transaction values person to person. Refunds may be given or cheques "cashed" by retailers in an equivalent manner.
Value records may be loaded on to the purses in selected currencies for use in appropriate countries.
While it is possible that the system of the present invention could be run by a single financial institution it is envisaged that various financial institutions of a federal, national or international nature would have their own computers with value meters and float value records, the totality of the float value records representing the total value in circulation (in all purses), the funds represented thereby being apportioned between the participating institutions as agreed on the basis of their respective regulated float files.
Brief Description of the Drawings
The invention will further be described with reference to the accompanying drawings, of which:
FIG. 1 is a schematic drawing of a banking computer system in accordance with the invention;
FIG. 2 is a diagram illustrating the value meter;
FIG. 3 is a diagram illustrating an example of a value transaction procedure using a full RSA cryptographic system;
FIG. 4 is a diagram illustrating an example of a value transaction procedure using a secret key transmission technique;
FIG. 5 is a diagram illustrating an example of a value transaction procedure using a mixed RSA/DES cryptographic system;
FIGS. 6 and 7 depict one possible embodiment of typical devices of the invention.
Detailed Discussion of Preferred Embodiments
Referring to FIG. 1 there are shown three clearing banks 1, 2 and 3 with respective computers 1a, 2a and 3a. The computers have files containing account details of the banks' consumer and retailer customers. Each computer also has a value meter 1b, 2b, 3b which shows a float value record. The actual funds represented by the non-specific float value records may reside in one or more of banks 1, 2 or 3, or elsewhere.
Each bank has a bulk purse 1c, 2c, 3c which is connected to the respective value meter and which has a memory with a purse value record. Terminals 5 are connected by telephone selectively to computers 1, 2 and 3. Typically terminals 5 may be home computer terminals or terminals available in public places. Consumers have electronic purses in the form of IC cards 6. These cards have microprocessors and memories. In the memory of each card is stored a purse value record 7. The cards have contacts 8, whereby the cards can interact with terminals 5 via card readers 9. My making appropriate requests at the keyboard of the terminal, a consumer may be connected to the computer of his bank, 1, 2 or 3 and may request a value record to be loaded to his purse. If the bank authorises the request, the bulk purse is instructed to institute a draw-down of value to load purse value record 7 with the value requested. The card is now ready for use.
Further electronic purses are contained in terminals 10, 11 which are equipped with IC card readers 9, located at different points-of-sale. To use his card the consumer presents it to the retailer where it is inserted into reader 9. The required value of the transaction is keyed in and by agreement the total held in the purse value record of the purse 6 is reduced by the amount of the transaction. The purse value record of the purse held within the terminal 10 or 11 is increased by the same transaction value. The consumer takes his goods and is free to use the card up to the total held in the purse value record of his purse in other retailers' equipment.
Periodically a retailer may redeem value represented by the purse value record held in the purse of his terminal 10 or 11, irrespective of the consumers' identities and without presenting any details of the individual transactions that have given rise to the total accumulated value. This may be done by connecting the terminal 10 or 11 to the retailer's bank 1, 2 or 3 as appropriate and requesting a redemption of value. The bank's computer then instructs a redemption transaction which accepts value from the terminal purse. The bank computer credits the retailer's account with funds. The value meters form the basis for allowing control of the total amount of value in circulation in all the purses and for apportioning, on an agreed basis, funds representing the total value.
The bulk purses 1c, 2c, 3c differ from the other purses in being capable of having value loaded and redeemed via the value meter, as well as by purse to purse transactions. In all other respects the purses are technically similar, it being understood in particular that the same cryptographic techniques for bulk purse to other purse transactions (on-line) used are the same as for off-line transactions. FIG. 2 shows the value meter as including an indicator 12 which shows a float value record. This is, in this case, the net value released to the bulk purse 1c, being the difference between the total of values drawn down via the meter and the total of values redeemed via the meter. It will be appreciated that the individual gross draw-down and redeemed values may be indicated as well as or instead of the net value, it being readily possible to derive the net value from the gross values, even if not directly indicated. The link 13 between the value meter and that of each of its bulk purses is secure. The purse may be physically adjacent to the value meter and security ensured by physical locks etc. Alternatively, the bulk purse may be remote from the value meter and security is achieved by cryptographic techniques. It is important to ensure that the value meter always accurately represents the value released to the bulk purse and no fraudulent alteration can take place. Each value meter has an interface 14 which may be a link to the bank computing facility or a keyboard unit. Authorised personnel may enter values to be added to or subtracted from the float value record, representing a creation or destruction of value to be circulated. Thus, value to be circulated may be adjusted in bulk, perhaps daily, instead of on demand in response to individual draw-downs and claims.
Using the float value record in this way allows off-line interchange of value, given suitable terminals, between consumers and retailers, retailers and consumers and consumers and consumers, without the need to maintain large numbers of accounts or detailed account to account reconciliations.
Consumers themselves may adjust the purse value records in their purses by person to person interchange or by refunds etc from retailers. It is envisaged that purse value records may be transferred to individual accounts by a claiming procedure from the float value record in a similar manner as retailers' claims.
Purses may be used on an international basis by loading different currencies in them. It is envisaged that each country or group of countries will hold a float value record in the appropriate currency. Application by a consumer to load his purse with a foreign currency may result in his domestic account being debited by the appropriate amount in his own currency and the respective foreign currency float value record being increased.
A purse value record held in a purse may be converted to a different currency on request, the conversion being effected at the appropriate rate and resulting in a transfer of value from the float value record of one currency to that of another currency and a corresponding conversion of funds between the currencies.
FIG. 3 shows the procedure during an off-line transaction in a first embodiment of the invention. Both purses have full RSA asymmetrical cryptographic capability. The sending purse has a store SS which holds an accumulative value record Svr and the following RSA keys: sender public and secret keys Pks and Sks and global public key Pkg. In addition there is a certified data message [Pks]*Skg. This is the sender purse's unique public key signed by the master computer with its global secret key Skg. The public key Pks is thus electronically certified as valid by the system. The receiver purse has a store RS which holds an accumulative value record Rvr and the receiver purse's own RSA public and secret keys Pkr,Skr, the global public key Pkg and a certified public key data message [Pkr]*Skg.
The first step of the transaction procedure is for the receiving purse to issue a transaction identifier number R. This is derived from a combination of the receiving purse identity and a transaction sequence number for that purse. Two-way communication between the purses is established, perhaps locally by direct connection or by infra-red link or the like or remotely by modem and telephone. The following steps are followed:
1. The receiving purse transmits a request message which is [Pkr]*Skg+[R]*Skr.
2. The sending purse is able to check [Pkr]*Skg by use of the public global key Pkg. This gives the sending purse the authentic key Pkr to verify [R]*Skr and hence recover R.
3. A value V which is required to be transferred is decremented from the purse value record Svr.
4. The sending purse constructs a transaction value message VR from value V it wishes to transfer and from the request message R. This is signed with the sender's secret key and the following transaction value message is transmitted to the receiving purse:
5. The receiving purse obtains the public key Pks by use of the public key Pkg thereby verifying the message [Pks]*Skg.
6. Use of the public key Pks thus found verifies [VR]*Sks and hence recover VR.
7. R is checked to ensure that it carries the identity of the receiving purse and the appropriate transaction number. If not, the transaction is aborted.
8. If all is well, the value V is added to the purse value record of the receiving purse.
9. A signed acknowledgement is sent to the sending purse.
Transaction logs Stl and Rtl are held by the sending and receiving purse stores. The logs may carry such details as are required for analysis of transactions locally, but in the simplest form the logs carry records only of any transaction which has failed for some reason. This can be used for checking An the event of a dispute.
RSA encryption and decryption require calculation of the expression x.sup.y mod n where y is different for encryption and decryption. In particular the index y for encryption (embodied in the public key) is small and the corresponding index for decryption (embodied in the secret key) is very much larger. As a consequence, while modest computing power can handle encryption in an acceptably short time the same is not true for decryption. The creation of a certified (eg digitally signed) message has an equivalent processing overhead to decryption, the checking of such a message has an equivalent processing overhead to encryption. The embodiments illustrated in FIGS. 4 and 5 provide arrangements which allow one of the pair of communicating purses to be of lower computing power, and therefore less expensive, than the other. In these arrangements some purses of the system (retailer purses) have full RSA capability (encryption and decryption capability) whereas the remainder (consumer purses) include a symmetrical key cryptographic system for transmitting transaction value record messages. A suitable symmetrical key cryptographic system is the DES system. This requires for encryption and decryption a level of computing power similar to the power required for RSA encryption.
Referring to FIG. 4 there is illustrated the transaction procedure between two purses where the sending purse is a consumer purse and the receiving purse is a retailer purse. The retailer purse has full RSA capability whereas the consumer purse has a lower power computing facility. The sending purse has a store CS which holds an accumulative value record Cvr and the RSA global public key Pkg. In addition there is a DES key DESc and a certified data message [DESc]*Skg which is the sending purse's unique DES key signed by the master computer with its global secret key Skg. The receiving purse has a store RS which is identical with the store RS of the FIG. 3 embodiment, holding Pkr, Skr, Pkg and [Pkr]*Skg.
The first step in the transaction procedure is for the receiving purse to issue a transaction identifier R as in the embodiment of FIG. 3. Then the following steps are taken:
1. The receiving purse transmits its certified public key message [Pkr]*Skg.
2. The sending purse checks the signed message and derives Pkr.
3. The sending purse encrypts its certified message using Pkr. Since the index y of a public key such as Pkr is small, encryption with it is computationally easy. The message sent to the receiving purse is
4. The receiving purse decrypts the message firstly with its secret key Skr to derive [DESc]*Skg which itself is checked with Pkg to give verification and derive DESc.
5. The receiving purse transmits the message [R]*DESc which is the transaction identifier R encrypted with a DES integrity algorithm.
6. The send purse decrypts the message in DES, derives the transaction identifier R and constructs the transaction value message VR in the same way as in the FIG. 3 embodiment.
7. The sending purse decrements the value V from its purse value record and sends the message [VR]*DESc to the receiving purse.
8. The receiving purse decrypts [VR]*DES and cheeks that R is correct. If not the transaction is aborted.
9. If all is well the value V is added to the receiving purse's purse, value record and an acknowledgement message is sent to the sending purse.
Referring now to FIG. 5 there is shown a transaction procedure which allows the purses to have unbalanced computing power while using the keys of an symmetrical cryptographic system. In FIG. 5 the store RS of the receiving purse has the same keys as in the FIG. 3 embodiment. The computing power of the sending purse is less than that of the receiving purse and instead of the signed public key, the sending purse holds a signed secret key [Sks]*Skg (which also incorporates Pks).
A transaction procedure has the following steps:
1. The receiving purse transmits the signed message [Pkr]*Skg.
2. The sending purse checks the signed message with Pkg, verifying [Pkr]*Skg and hence recovering Pkr.
3. The sending purse encrypts its signed message with Pkr and sends E.sub.Pkr [[Sks]*Skg].
4. The receiving purse decrypts the message firstly with the use of its secret key Skr to give [Sks]*Skg and then uses the global public key Pkg to verify [Sks]*Skg, thereby recovering Sks.
5. The receiving purse signs the transaction identifier R with Sks and sends [R]*Sks.
6. The sending purse derives R by the use of Pks.
7. The sending purse decrements its purse value record by the required amount V, and constructs and sends a value message E.sub.Pks [VR].
8. The receiving purse decrypts the message with the use of Sks to derive V and R. R is checked and if it is incorrect the transaction is aborted.
9. If all is well the purse value record of the receiving purse is incremented by V, the key Sks in the receiving purse is discarded and an acknowledgement message is sent to the sending purse.
FIG. 6 shows one embodiment of the invention in the form the pocket exchange device referred to above. This device PED is battery powered or solar powered and has an LCD screen 15 and IC card reader 16. The consumer's card is inserted in reader 16 and it may then be interrogated by means of keys 17 to 21. Keys 17 allow the user to scroll through log entries and balances resident on the card, accessed via keys 19 and 20. Keys 18 and 21 allow interchange between two cards, via an intermediate store within the device.
FIG. 7 depicts a device such as may be found at a retailer's point-of-sale. Similar terminals without retailer functions may be located in financial institutions or in other public places for the use of consumers in accessing their bank account for the purpose of loading and unloading their cards. The device T consists of a point-of-sale terminal, bearing an LCD (or other) display 22, and an IC card reader 23. By means of keyboard 24 the total of a retail transaction may be entered into the terminal. Keys 25 and 26 initiate the transaction with the IC card, inserted in reader 23. After hours, the retailer can prepare the terminal for transmission of value to the bank's host by depressing key 27.
Claims
We claim:
1. A value transfer system, said system comprising: a computer system; a plurality of electronic purses; exchange devices comprising means for communication between purses to transfer value in transactions which are off-line from the computer system; draw-down means for loading purses with value under control of the computer system; redemption means for redeeming value from purses under control of the computer system; a value meter system; and one or more of said purses comprising bulk purses having value loaded and redeemed via the value meter system, the value meter system recording at least one float value record containing information of the net value released to the bulk purse or purses, the net value being the difference between the total of values drawn down to the bulk purse or purses and the total of values redeemed from the bulk purse or purses, the float value record being non-specific with regard to individual transactions.
2. A value transfer system as claimed in claim 1 wherein the value meter system has an interface means for adjusting each float value record on command to create or destroy value within the bulk purse or purses.
3. A value transfer system as claimed in claim 1 comprising, in each purse, storage means for storing an accumulative purse value record and, for each purse, a microprocessor, transactions being conducted between purse pairs comprising a sending purse and a receiving purse, the sending purse sends value and the receiving purse receives value, said microprocessor comprising a means for controlling each transaction for the sending and receiving purses and, in each transaction the purse value record in the sending purse is decreased by a chosen and variable transaction value and the purse value record in the receiving purse in increased by the same transaction value.
4. A value transfer system as claimed in claim 3 wherein the microprocessor, in a transaction between members of a purse pair, comprises a means for providing a transaction identifier for the transaction specific to at least one of the purses and unique within that purse.
5. A value transfer system as claimed in claim 4 wherein said transaction identifier is specific to the receiving purse and is unique within the receiving purse by the inclusion of a receiving purse transaction sequence number.
6. A value transfer system as claimed in claim 4 wherein the microprocessor for each transaction, comprises means for sending a request message including the transaction identifier from the receiving purse to the sending purse, incorporating the transaction identifier in a transaction value message sent from the sending purse to the receiving purse and controlling acceptance of the transaction value message in the receiving purse on the basis of the validity of the transaction identifier received.
7. A value transfer system as claimed in claim 1 wherein the microprocessor includes means for implementing an asymmetrical cryptographic system having different public and secret keys and each purse includes means for storing at least a public key of the cryptographic system.
8. A value transfer system as claimed in claim 7 wherein each purse stores in said means for storing data signed in the cryptographic system by the master computer with a global secret encryption key, the signed data thereby being electronically certified, and each transaction includes the steps of checking certified purse data by means of the global public key.
9. A value transfer system as claimed in claim 7 wherein each purse stores in said means for storing its own unique public/secret key pair in the cryptographic system and the transmission of transaction data is encrypted and decrypted using said public/secret key pair.
10. A value transfer system as claimed in claim 9 in which in a transaction the microprocessor associated with a first purse has greater computing power than the microprocessor associated with the second purse, and the transaction includes the steps of sending to the first purse the secret key of the second purse key pair and encrypting data at the second purse using the public key of the second purse key pair.
11. A value transfer system as claimed in claim 7 wherein in a transaction the microprocessor associated with a first purse has greater computer power than the microprocessor associated with the second purse, the second purse includes an encryption key for a symmetrical cryptographic system and the transaction includes the steps of sending to the first purse the symmetrical system key of the second purse and encrypting data at the second purse using the symmetrical system key.
12. A value transfer system as claimed in claim 1 wherein the computer system comprises a plurality of computers and the value meter system comprises a plurality of value meters, each value meter associated with a respective one of said computers.
13. A value transfer system, said system comprising: a computer system; a plurality of electronic purses; exchange devices comprising means for communication between said purses and for transferring value between said purses in transactions which are off-line from the computer system; draw-down means for loading said purses with a value under control of the computer system; redemption means for redeeming a value from said purses under control of the computer system; a value meter system; and at least one of said purses comprising a bulk purse, said value meter system including means for loading and redeeming value in said bulk purse, the value meter system including means for recording at least one float value record containing information of a net value released to said at least one purse, said net value comprising the difference between a total of values drawn down to said at least one purse and a total of values redeemed from said at least one purse, said at least one float value record comprising non-specific value information with regard to individual transactions.
14. A value transfer system as claimed in claim 13 wherein the value meter system includes an interlace means for adjusting each float value record on command for creating or destroying value within said at least one purse.
15. A value transfer system as claimed in claim 13, wherein each purse includes a storage means for storing an accumulative purse value record, wherein transactions between purse pairs involve a sending purse and a receiving purse, said sending purse sends a value and said receiving purse receives a value, said value transfer system further including a microprocessor in one of a sending purse, a receiving purse and an associated exchange device, said microprocessor comprising a means for controlling each transaction for said sending purse and said receiving purse wherein, in each transaction, a purse value record in the sending purse is decreased by a chosen and variable transaction value and a purse value record in the receiving purse in increased by the same transaction value.
16. A value transfer system as claimed in claim 15 wherein said microprocessor, in a transaction between members of a purse pair, comprises a means for providing a transaction identifier for a transaction specific to at least one of the sending and receiving purses and unique within that purse.
17. A value transfer system as claimed in claim 16 wherein said transaction identifier is specific to the receiving purse and includes a receiving purse transaction sequence number.
18. A value transfer system as claimed in claim 16 wherein said microprocessor, for each transaction, comprises means for (a) sending a request message, including said transaction identifier, from the receiving purse to the sending purse, (b) incorporating the transaction identifier in a transaction value message sent from the sending purse to the receiving purse and (c) controlling acceptance of the transaction value message in the receiving purse on the basis of the validity of the transaction identifier received.
19. A value transfer system as claimed in claim 13 wherein said microprocessor includes means for implementing an asymmetrical cryptographic system having different public and secret keys and each purse includes means for storing at least a public key of the cryptographic system.
20. A value transfer system as claimed in claim 19, wherein each storage means includes means for storing data signed in the cryptographic system, said computer system comprising means for providing a global secret encryption key, for electronically certifying said signed data in said storage means, and for checking each transaction including said certified signed data by means of a global public key.
21. A value transfer system as claimed in claim 19 wherein each of said purse storage means includes a stored unique public/secret key pair in the cryptographic system and said microprocessor includes means, responsive to said public/secret key pair, for encrypting and decrypting the transmission of transaction data.
22. A value transfer system as claimed in claim 21, wherein each purse includes a microprocessor associated therewith and a microprocessor associated with a first purse has greater computing power than a microprocessor associated with a second purse, and the transaction includes the steps of sending to the first purse the secret key of the second purse key pair and encrypting data at the second purse using the public key of the second purse key pair.
23. A value transfer system as claimed in claim 19 wherein each purse includes a microprocessor associated therewith and, in a transaction, a microprocessor associated with a first purse has greater computer power than a microprocessor associated with a second purse, the second purse includes an encryption key for a symmetrical cryptographic system and the transaction includes the steps of sending to the first purse the symmetrical system key of the second purse and encrypting data at the second purse using the symmetrical system key.
24. A value transfer system as claimed in claim 13 wherein the computer system comprises a plurality of computers and the value meter system comprises a plurality of value meters, each value meter associated with a respective one of said computers.
25. A method of transferring a value (V) between a sending purse and a receiving purse, using a cryptographic system with said purses having cryptographic capability, said sending purse and said receiving purse each having a global secret/public key pair (Skg, Pkg), each of said sending and receiving purses including, respectively, a store (SS, RS), a value record in said store (Svr, Rvr), a public key (Pks, Pkr), a secret key (Sks, Skr), and a certified public key data message ([Pks]*Skg, [Pkr]*Skg), said method comprising the steps of: in said receiving purse, issuing a transaction identification number (R.sub.i) and, transmitting a request message ([Pkr]*Skg+[R]*Skr) to said sending purse; in said sending purse, checking said request message to authenticate and determine the receiving purse public key (Pkr) and the transaction identification number (R.sub.i); in the sending purse, decrementing the value to be transferred (V) from the sending purse value record (Svr); in the sending purse, constructing a transaction message (VR.sub.i), signing the transaction message with the sending purse secret key (Sks), forming a transaction value message ([Pks]*Skg+[VR.sub.i ]*Sks) and sending said transaction value message to said receiving purse; in the receiving purse, obtaining the sending purse public key (Pks) using the public key (Pkg) and verifying the message ([Pks]*Skg); in the receiving purse, using the recovered sending purse public key (Pks), recovering the transaction message (VR.sub.r) and determining the recovered value to be transferred (V) and the recovered transaction identification number (R.sub.r); in the receiving purse, checking to insure that the recovered transaction identification number (R.sub.r) matches the issued transaction identification number (R.sub.i), aborting the transaction without a match and, with a match, incrementing the receiving purse value record (Rvr) by the value to be transferred (V); and in the receiving purse, providing an acknowledgement to said sending purse.
26. A method of transferring a value (V) between a consumer purse and a retailer purse, using a cryptographic system with said consumer and retailer purses each having a global secret/public key pair (Skg, Pkg), said consumer purse having a store (CS), a cumulative value record (Cvr) in said consumer store, a DES key (DESc) and certified data message ([DESc]*Skg) and said retailer purse having a store (RS), a retailer value record (Rvr) in said retailer store, a public key (Pkr), a secret key (Skr), and a certified public key data message ([Pkr]*Skg), said method comprising the steps of: in said retailer purse, transmitting said certified public key data message ([Pkr]*Skg) to said consumer purse; in said consumer purse, checking said certified public key data message ([Pkr]*Skg) to authenticate and determine the retailer purse public key (Pkr); in said consumer purse, encrypting the certified data message ([DESc]*Skg) and forwarding the encrypted message (E.sub.Pkr [[DESc]*Skg]) to said retailer purse; in said retailer purse, decrypting said encrypted message to derive the certified data message ([DESc]*Skg) and then derive, using the public key (Pkr), the DES key (DESc); in said retailer purse, issuing a transaction identification number (R.sub.i), encrypting the transaction identification number (R.sub.i) with the DES key (DESc) and transmitting a resultant request message ([R.sub.i ]*DESc); in said consumer purse, decrypting said request message ([R.sub.i ]*DESc), deriving the transaction identification number (R.sub.i), and constructing a transaction message (VR.sub.i); in said consumer purse, decrementing the value (V) from the value record (Cvr) in the consumer store (CS) and sending the modified transaction message ([VR.sub.i ]*DESc); and in the retailer purse, decrypting the modified transaction message ([VR.sub.i ]*DESc), recovering the transaction identification number (R.sub.r) and checking to insure that the recovered transaction identification number (R.sub.r) matches the issued transaction identification number (R.sub.i) and, aborting the transaction without a match and, with a match, incrementing the retailer value record (Rvr) by the value (V) and sending a transaction acknowledgement to said consumer purse.
27. A method of transferring a value (V) between a sending purse and a receiving purse each having a global secret/public key pair (Skg, Pkg), said sending purse having a reduced computing power as compared to said receiving purse, said sending purse including a store (SS), a value record (Svr), a secret key (Sks) and a signed secret key ([Sks]*Skg) which includes a sending purse public key (Pks), and said receiving purse including a receiver store (RS), a value record (Rvr) in said receiver store, a receiver public key (Pkr), a receiver secret key (Skr), and a certified public key data message ([Pkr]*Skg), said method comprising the steps of: in said receiving purse, transmitting the certified public key data message ([Pkr]*Skg); in said sending purse, verifying the certified public key data message ([Pkr]*Skg) with the global public key (Pkg) and recovering the receiver public key (Pkr); in said sending purse, encrypting the signed secret key ([Sks]*Skg) and transmitting the encrypted signed secret key (E.sub.Pkr [[Sks]*Skg]); in said receiving purse, decrypting the encrypted signed secret key (E.sub.Pkr [[Sks]*Skg]) with the receiver secret key (Skr) to provide the sending purse signed secret key ([Sks]*Skg), verifying the sending purse signed secret key ([Sks]*Skg) with the public global key (Pkg) and recovering the sending purse secret key (Sks); in said receiving purse, issuing a transaction identification number (R.sub.i), signing the transaction identification number (R.sub.i) with the sending purse secret key (Sks) to form and transmit the signed transaction identification number ([R.sub.i ]*Sks); in said sending purse, deriving the transaction identification number (R.sub.i) using the sending purse public key (Pks); in said sending purse, decrementing the sending purse value record (Svr) by the value (V), creating a transaction message (VR.sub.i), encrypting the transaction message (VR.sub.i) and transmitting the encrypted transaction message (E.sub.Pks [VR.sub.i ]); in said receiving purse, decrypting said encrypted transaction message (E.sub.Pks [VR.sub.i ]) using the sending purse secret key (Sks) and recovering the value (V) and the transaction identification number (R.sub.r); and in said receiving purse, checking to insure that the recovered transaction identification number (R.sub.r) matches the issued transaction identification number (R.sub.i) and aborting the transaction without a match and, with a match, incrementing the receiving purse value record (Rvr) by the value (V), discarding the sending purse secret key (Sks) and sending a transaction acknowledgement to said sending purse.
Patent Citations (76)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US3573747 | 1971-04-01 | Adams et al. | |
| US3749887 | 1973-07-01 | Giuliani | |
| US3852571 | 1974-12-01 | Hall et al. | |
| US3906460 | 1975-09-01 | Halpern | |
| US3932730 | 1976-01-01 | Ambrosio | |
| US3934122 | 1976-01-01 | Riccitelli | |
| US3937925 | 1976-02-01 | Boothroyd | |
| US4053735 | 1977-10-01 | Foudos | |
| US4120452 | 1978-10-01 | Kimura et al. | |
| US4172552 | 1979-10-01 | Case et al. | |
| US4179064 | 1979-12-01 | Yoshioka et al. | |
| US4214230 | 1980-07-01 | Fak et al. | |
| US4218582 | 1980-08-01 | Hellman et al. | |
| US4224666 | 1980-09-01 | Giraud | |
| US4256955 | 1981-03-01 | Giraud et al. | |
| US4270042 | 1981-05-01 | Case | |
| US4302810 | 1981-11-01 | Bouricius et al. | |
| US4305059 | 1981-12-01 | Benton | |
| US4320387 | 1982-03-01 | Powell | |
| US4321672 | 1982-03-01 | Braun et al. | |
| US4404649 | 1983-09-01 | Nunley et al. | |
| US4442345 | 1984-04-01 | Mollier et al. | |
| US4443027 | 1984-04-01 | McNeely et al. | |
| US4453074 | 1984-06-01 | Weinstein | |
| US4460965 | 1984-07-01 | Trehn et al. | |
| US4467139 | 1984-08-01 | Mollier | |
| US4511970 | 1985-04-01 | Okano et al. | |
| US4523087 | 1985-06-01 | Benton | |
| US4536647 | 1985-08-01 | Atalla et al. | |
| US4549075 | 1985-10-01 | Saada et al. | |
| US4597046 | 1986-06-01 | Musmanno et al. | |
| US4614861 | 1986-09-01 | Pavlov et al. | |
| US4625276 | 1986-11-01 | Benton et al. | |
| US4629872 | 1986-12-01 | Hallberg | |
| US4630201 | 1986-12-01 | White | |
| US4634845 | 1987-01-01 | Hale et al. | |
| US4642768 | 1987-02-01 | Roberts | |
| US4650978 | 1987-03-01 | Hudson et al. | |
| US4667088 | 1987-05-01 | Kramer et al. | |
| US4673802 | 1987-06-01 | Ohmae et al. | |
| US4689478 | 1987-08-01 | Hale et al. | |
| US4692601 | 1987-09-01 | Nakano | |
| US4697073 | 1987-09-01 | Hara | |
| US4705211 | 1987-11-01 | Honda et al. | |
| US4722055 | 1988-01-01 | Roberts | |
| US4727243 | 1988-02-01 | Savar | |
| US4727244 | 1988-02-01 | Nakano et al. | |
| US4734568 | 1988-03-01 | Watanabe | |
| US4736094 | 1988-04-01 | Yoshida | |
| US4742215 | 1988-05-01 | Daughters et al. | |
| US4748668 | 1988-05-01 | Shamir et al. | |
| US4750119 | 1988-06-01 | Cohen et al. | |
| US4751640 | 1988-06-01 | Lucas et al. | |
| US4752676 | 1988-06-01 | Leonard et al. | |
| US4752877 | 1988-06-01 | Roberts et al. | |
| US4757185 | 1988-06-01 | Onishi | |
| US4759064 | 1988-07-01 | Chaum | |
| US4766539 | 1988-08-01 | Fox | |
| US4767920 | 1988-08-01 | Kitta et al. | |
| US4799156 | 1989-01-01 | Shavit et al. | |
| US4827112 | 1989-05-01 | Yoshino et al. | |
| US4837422 | 1989-06-01 | Dethloff et al. | |
| US4879747 | 1989-11-01 | Leighton et al. | |
| US4962530 | 1990-10-01 | Cairns | |
| US4964164 | 1990-10-01 | Fiat | |
| US4968873 | 1990-11-01 | Dethloff et al. | |
| US4973828 | 1990-11-01 | Naruse et al. | |
| US4977595 | 1990-12-01 | Ohta et al. | |
| US4985833 | 1991-01-01 | Oncken | |
| US4987593 | 1991-01-01 | Chaum | |
| US4992646 | 1991-02-01 | Collin | |
| US4995081 | 1991-02-01 | Leighton | |
| US5191193 | 1993-03-01 | Le Roux | |
| EPX172670 | 1986-02-01 | ||
| WOXWO91/16691 | 1991-10-01 | ||
| WOXWO93/08545 | 1993-04-01 |
Non-Patent Literature (16)
- Foerster; "Electronic Cash and Chip Cards: Thoughts on payment Transactions Effected by Private Households"; Bank und Markt Haft 2; Apr. 1983, pp. 19-20.
- Atwood; "The Case For Object-Oriented Databases"; IEEE Spectrum, Feb. 1991.
- Okamoto and Ohta; "Universal Electronic Cash"; Cryptography Symposium; 1991; pp. 324-337.
- Article 4A; Uniform Commercial Code; Callaghan & Company, Apr. 1990; pp. 511-598.
- Even et al.; "Electronic Wallet;" 1984 International Zurich Seminar on Digital Communications; 1984; pp. 199-201.
- Chaum; "Privacy Protected Payments Unconditional Payer and/or Payee Untraceability;" Smart Card 2000, 1989.
- Chaum; "Untraceable Electronic Cash"; Smart Card 2000.
- Chaum; "Achieving Electronic Privacy;" Scientific American, Aug. 1992.
- O'Reilly; "Ireland's Pocket Revolution: The Micro Thin Replaces Cash, Cheques, and Cards;" Retail Banker International, Feb. 20, 1984 at 4.
- Nakamoto; "Japanese Take to the Prepaid Plastic Card Business;" Financial Times, Nov. 17, 1988, at 7.
- Rowe; "Au Revoir le Cash?" Banking Technology, Jul.-Aug. 1991, at 46.
- Chaum; "Security Without Identification: Transaction Systems to Make Big Brother Obsolete;" Communications of the ACM; Oct. 1985; vol. 28, No. 10; pp. 1030-1044.
- Okamoto et al.; "Disposable Zero-Knowledge Authentications and Their Applications to Untraceable Electronic Cash;" NTT Communications and Information Processing Laboratories; Nippon Telegraph and Telephone Corporation; pp. 481-496.
- Advances in Cryptology - CRYPTO '88 Proceedings, Aug. 21-25, 1988, University of California, Santa Barbara, California, "Lecture Notes in Computer Science," Edited by G. Goos and J. Hartmanis, Springer-Verlag, pp. 496-506.
- GEI/CB V4, Jun. 1988, P. Remery et al, "Electronic Payment".
- L'Echo des Recherches, N.sup.o 134, 4.sup.e trimestre 1988, P. Remery et al., "Le paiement electronique".