text:
Techniques for providing secure electronic communications, for example communications relating to asset trading, are described. Symmetrical usage of encryption keys by first and second parties engaged in these communications provide enhanced security. The establishment of trusted registries, e.g., databases, which include electronic asset representations, allow for trades to be enacted without significant human intervention.
1. A method for electronic communication between a first and second party comprising the steps of:
retrieving, from a database, a doubly-encrypted record;
decrypting, by said first party, said doubly encrypted record using said first party's secret key to generate a singly encrypted record;
re-encrypting, by said first party, said singly encrypted record using said second party's public key;
transmitting said re-encrypted record to said second party;
decrypting, by said second party, said re-encrypted record using said second party's secret key to generate said singly encrypted record; and
decrypting, by said second party, said singly encrypted record using a third party's public key.
2. The method of claim 1, wherein said step of transmitting further comprises the step of:
transmitting said re-encrypted record over an air interface.
3. The method of claim 1, wherein said third party is a guaranteeing institution.
4. An apparatus comprising:
a memory device which stores doubly encrypted bit patterns associated with monetary denominations; and
a device for for receiving said doubly encrypted bit patterns over a communications channel and for storing said doubly encrypted bit patterns in said memory device,
wherein said communications channel optionally employs a third communications encryption, and said device deciphers said third communications encryption to obtain said doubly encrypted bit patterns, and
wherein said doubly encrypted bit patterns are encrypted once using a first party's secret key and once using a public key associated with said memory device.
5. The apparatus of claim 4, wherein said receiving/storing device and memory device are housed within a card.
6. The apparatus of claim 4, wherein said receiving/storing device and memory device are housed within a mobile phone.
7. A method for electronically transferring money between an electronic wallet and a point-of-sale terminal comprising the steps of:
storing, in said electronic wallet, doubly encrypted bit patterns representing said money;
decrypting, in said electronic wallet, at least one of said doubly encrypted bit patterns to generate at least one singly encrypted bit pattern;
re-encrypting, in said electronic wallet, said at least one singly encrypted bit pattern using a public key of said point-of-sale terminal; and
electronically transferring said at least one re-encrypted bit pattern from said electronic wallet to said point-of-sale terminal.
8. The method of claim 7, wherein said step of storing further comprises the steps of:
encrypting said bit patterns using a secret key of a guaranteeing institution; and
encrypting said bit patterns using a public key of said electronic wallet to generate said doubly encrypted bit patterns.
9. The method of claim 7, wherein said step of decrypting further comprises the step of:
decrypting said at least one of said doubly encrypted bit patterns using a secret key of said electronic wallet.
10. The method of claim 7, wherein said electronic wallet is a smart card.
11. The method of claim 7, wherein said electronic wallet is a mobile phone.
12. The method of claim 7, further comprising the step of:
transmitting, from said point-of-sale terminal to said electronic wallet, said public key of said point-of-sale terminal.
13. The method of claim 7, further comprising the step of:
retrieving, from a memory device within said electronic wallet, said public key of said point-of-sale terminal.
14. A method for registering a bit pattern representative of an asset comprising the steps of:
generating a description of said asset;
encrypting said description using an institution's secret key to create a single encrypted description;
encrypting said single encrypted description using an owner of said asset's public key to create said bit pattern;
transmitting said bit pattern to a registry;
decrypting said bit pattern using said institution's public key to yield said single encrypted description; and
authenticating said single encrypted description.
15. The method of claim 14, wherein said step of authenticating further comprises the step of:
performing a cyclic redundancy check on said single encrypted description after said decrypting step.
16. The method of claim 14, wherein said step of transmitting further comprises the step of:
transmitting an identity of said institution along with said bit pattern.
17. The method of claim 16, wherein said step of decrypting further comprises the step of:
retrieving, at said registry, said institution's public key using said transmitted identity.
18. A method for trading electronic representations of assets comprising the steps of:
withdrawing, by a first party, from a first registry a first electronic representation of a first asset;
marking, by said first registry, said first electronic representation of said first asset as unavailable;
decrypting, by said first party, said first electronic representation of said first asset using said first party's secret key;
re-encrypting, by said first party, said first electronic representation of said first asset using a second party's public key; and
transmitting said first electronic representation of said first asset to said second party.
19. The method of claim 18, further comprising the steps of:
decrypting, by said second party, said first electronic representation of said first asset using said second party's secret key;
decrypting, by said second party, said first electronic representation of said first asset using a first guaranteeing institution's public key; and
reviewing a description of said first electronic representation of said first asset.
20. The method of claim 19, further comprising the steps of:
withdrawing, by said second party, from a second registry a second electronic representation of a second asset;
marking, by said second registry, said second electronic representation of said second asset as unavailable;
decrypting, by said second party, said second electronic representation of said second asset using said second party's secret key;
re-encrypting, by said second party, said second electronic representation of said second asset using said first party's public key; and
transmitting said second electronic representation of said second asset to said first party.
21. The method of claim 20, further comprising the steps of:
decrypting, by said first party, said second electronic representation of said second asset using said first party's secret key;
decrypting, by said first party, said second electronic representation of said second asset using a second guaranteeing institution's public key; and
reviewing a description of said second electronic representation of said second asset.
22. The method of claim 21, further comprising the steps of:
transmitting, by said first party to one of said first and second registries, said withdrawn version of said first electronic representation of said first asset, said first electronic representation of said first asset re-encrypted with said second party's public key and a bit pattern expected in exchange from said second party; and
transmitting, by said second party to a same one of said first and second registries, said withdrawn version of said second electronic representation of said second asset, said second electronic representation of said second asset re-encrypted with said first party's public key and a bit pattern expected in exchange from said first party.
23. The method of claim 22, further comprising the steps of:
comparing said bit pattern expected in exchange from said second party with said withdrawn version of said second electronic representation of said second asset;
comparing said bit pattern expected in exchange from said first party with said withdrawn version of said first electronic representation of said first asset; and
trading if both of said comparing steps result in a match by deleting said marked first and second electronic representations of said first and second assets in said first and second registries, respectively, and replacing same with said first electronic representation of said first asset re-encrypted with said second party's public key and said second electronic representation of said second asset, said second electronic representation of said second asset re-encrypted with said first party's public key, respectively.
24. The method of claim 23, further comprising the step of:
performing a cyclic redundancy check on said first electronic representation of said first asset.
25. The method of claim 23, further comprising the step of:
performing a cyclic redundancy check on said second electronic representation of said second asset.
26. The method of claim 18, wherein said first and second registries comprise a same database.
27. The method of claim 21, wherein said first and second guaranteeing institution are a same guaranteeing institution.
28. The method of claim 14, further comprising the steps of:
generating a cyclic redundancy check code using said description;
including said cyclic redundancy check code as part of said bit pattern transmitted to said registry.
29. The method of claim 28, wherein said step of generating a cyclic redundancy check code further comprises the step of:
using a nonlinear code computation to generate said cyclic redundancy check code.
30. A method of providing secure electronic trades between a first party agreeing to trade a first asset and a second party agreeing to trade a second asset in return for said first asset comprising the steps of:
communicating, by said first party, with a first financial institution to obtain a first bit pattern describing said first asset, said first bit pattern being encrypted using a first cipher key known only to said first institution and further encrypted using a second cipher key supplied by said first party;
communicating, by said second party, with a second financial institution to obtain a second bit pattern describing said second asset, said second bit pattern being encrypted using a third cipher key known only to said second institution and further encrypted using a fourth cipher key supplied by said second party;
deciphering, by said first party, said first bit pattern using a cipher key inverse of said second cipher key known only to said first party and re-encrypting said first bit pattern using said fourth cipher key;
deciphering, by said second party, said first bit pattern using a cipher key inverse of said fourth cipher key known only to said second party and re-encrypting said second bit pattern using said second cipher key; and
exchanging, by electronic transmission between said first and second parties, said re-encrypted first and second bit patterns.
31. The method of claim 30 in which said first and second financial institutions are the same financial institution.
32. The method of claim 30 in which said first and third cipher keys are the same and their respective inverse keys are also the same.
33. The method of claim 30 in which at least one of said cipher keys comprises a first and second number, the first number being a product of 'n' large primes P1,P2 . . . P(n) and the second number being a factor of the value 1+(P1-1)(P2-1) . . . (P(n)−1), where 'n' is equal to at least two.
34. The method of claim 14, wherein said registry is located in a telecommunication switch.
35. An apparatus comprising:
a memory device for storing doubly encrypted bit patterns associated with monetary denominations; and
a device for deciphering a first doubly encrypted bit pattern associated with a first monetary denomination using a deciphering key to produce a once deciphered bit pattern, immediately re-encyphering said once deciphered bit pattern using a ciphering key to produce a second doubly encrypted bit pattern, and transmitting said second doubly encrypted bit pattern,
wherein said second doubly encrypted bit pattern is associated with the first monetary denomination, and
wherein the device removes from memory the once deciphered bit pattern after said re-encyphering and said transmitting.
The present invention relates generally to techniques and systems for securing and synchronizing electronic communications between parties, e.g., over the Internet, and more particularly electronic communications involving financial transactions.
Methods for providing electronic or virtual cash by, for example, using "smart" cards having processors embedded therein are known in the art as an alternative to traditional plastic credit cards for guaranteeing payment from a buyer to a seller. These prior proposed methods secure the trade in one direction only, namely they provide some guarantee to the seller that he will get paid, but no guarantee to the buyer that he has received or will receive the wares, property or service expected.
A description of techniques relating to smart cards and the like may be found, for example, on the Internet at WWW.DIGICASH.COM. These techniques are concerned with eliminating the inconvenience to the merchant associated with the need to verify the authenticity of credit cards by making a telephone call to the issuing institution. Such systems are suitable primarily when the merchandise is physically inspected and accepted by the buyer at a retail outlet, for example. The one-way security guarantees provided by electronic cash make use of public key encryption algorithms, e.g., RSA, in which a message may be encrypted with a secret key but decrypted with a published key, or vice versa, depending on whether it is desired to ensure that no false messages can be sent or whether it is desired to prevent messages being intercepted and decrypted. As is also known, both techniques can be used at once to authenticate the source and to prevent interception.
Other forms of electronic trading have evolved in the context of stock markets and exchanges such as the NASDAQ, the Chicago Grain Exchange and the like, a purpose of which is to facilitate brokerage services by providing computer assistance in preparing paperwork of the traditional kind, such as transaction confirmations and settlements. The sort of electronic trading assistance provided by these computer systems used at major exchanges is therefore not concerned with providing an automated means of registering the ownership of assets and guaranteeing the nature and existence of assets, so much as providing mechanisms for traditional brokers to execute transactions more efficiently. Such systems are described for example in U.S. Pat. Nos. 5,375,055, 5,297,031, 5,297,032, 5,101,353 and 5,305,200.The nature and existence of assets being exchanged in these conventional trading systems still relies for its guarantees upon a trusted human broker.
Conventionally, many parallel systems exist for registering the ownership of major assets, including, for example, the Department of Motor Vehicles (DMV) for registering ownership of motor vehicles; the local courthouses, for registering the ownership and descriptions of real estate, as well as brokerages and banks for registering the ownership of cash, stocks and bonds and other commercial paper. These prior art systems, originally conceived to be run entirely by human clerical effort, have only relatively recently evolved to use computers to facilitate the manipulation of paper according to traditional principles in order to accomplish a greater volume of transactions with reduced clerical effort. Thus, it would be desirable to provide new systems and techniques for securing and synchronizing trade communications without the involvement of a traditional human broker or trusted institution to provide additional transactional efficiency.
Exemplary embodiments of the present invention use a public key encryption algorithm to create encrypted descriptions of assets that are recorded in an electronic database as a trusted registry. Several such registries may exist, allowing a distributed system. The description of an asset is created by a properly authorized and regulated issuing institution, such as a bank, and the description is encrypted using a secret key known only to that institution. At this stage, the description of the asset may be decrypted and read by anyone using the published "public key" of the authorized institution. For example, a Federally Insured Deposit may be described by a database record encrypted using a secret key known only to the Federal Reserve Bank, but the record can be decrypted and read using the public key of the Federal Reserve. A person decrypting the record can be assured that the record could only have been created by the Federal Reserve as no other person has access to the correct encryption key.
The present invention includes further encryption of database records using the public key of the owner of the assets that the record describes. These doubly-encrypted records can only be deciphered using the secret key of the owner, without which they are a worthless collection of seemingly random binary bits or computer symbols. Thus it is of no value to a third person to steal such a record as it cannot be converted into something of tradeable value without knowledge of the owner's secret key.
When a first party agrees to transfer an asset to a second party as part of an electronic trade, the owner retrieves the doubly-encrypted asset description from the database and decrypts it using his secret key. The first party then re-encrypts the asset using the public key of the other party and transmits the result to the second party. Only the second party can decrypt the transmitted message using his secret key, so the information cannot be stolen in transit. The second party decrypts the message using his or her secret key and then decrypts it again using the public key of the issuing or guaranteeing institution. If the description of the asset matches the expectations of the second party, he or she can be assured that the asset exists and its tradeability is guaranteed by the issuing institution, without needing to contact the issuing institution.
Reciprocally, the second party transmits the description of a second asset being exchanged for the first party's asset. This second asset may, for example, comprise a cash deposit guaranteed by a different institution, but using the same method, i.e. using the secret key of the guaranteeing institution to "sign" the description of the deposit. The message from the second party to the first party is similarly encrypted using the first party's public key to prevent exposure in transit.
When both parties are satisfied with the respective descriptions of the asset being exchanged, both parties transmit respective messages to the trusted electronic registry or registries, encrypted using their secret keys, which the registry can decrypt using the public keys of the parties, thus verifying their authenticity. Each message identifies the record in the registry that the respective owner is agreeing to trade, for example by providing to the registry the encrypted symbol pattern of that record as it is currently stored in the registry, and the re-encrypted symbol pattern that represents the asset as belonging to the new owner. The message also informs the registry of the encrypted symbol pattern to be received from the reciprocal party in exchange.
The registry itself need have no knowledge of what these bit patterns represent, only that the trading parties have agreed to trade them. When the registry detects a match between, on the one hand, the symbol pattern expected to be received from the second party by the first party, and, on the other hand, the symbol pattern received from the second party, and vice versa, then the computer of the automated registry will overwrite the original asset descriptions encrypted with the public keys of the original owners with the new asset descriptions encrypted with public keys of the respective new owners, thus synchronizing the exchange.
When practicing the present invention, two parties may make electronic trades, over the Internet for example, of assets which are guaranteed by one or more originating institutions, without having to contact the originating institutions and without the need to involve a human broker to execute transaction papers in the traditional way, thus providing for greater speed and security in trade.
These and other objects, features and advantages of the present invention will be readily understood by those skilled in the art upon reading the following detailed description in conjunction with the drawings, wherein:
FIG. 1 illustrates a conventional electronic communication system;
FIG. 2 illustrates an electronic communication system according to an exemplary embodiment of the present invention;
FIG. 3 depicts an electronic communication system according to another exemplary embodiment of the present invention;
FIG. 4(a) illustrates a data flow according to exemplary security techniques of the present invention;
FIG. 4(b) illustrates another data flow according to exemplary security techniques of the present invention;
FIG. 5 is a flow chart illustrating a method for preventing fraud according to the present invention;
FIG. 6 illustrates non-linear CRC code generation according to an exemplary embodiment of the present invention;
FIG. 7 depicts another example of symmetrically secure electronic communications according to the present invention; and
FIG. 8 is an exemplary message format for a message between a party and a registry according to an exemplary embodiment of the present invention.
FIG. 1 shows a conventional system. Therein, a virtual bank 10 issues virtual coins 12 in various denominations which are "signed" by being encrypted with the bank's secret key. The coins consist of digital bit patterns that can be readily decrypted using the bank's published public key.
The virtual coins issued by the bank to a specific customer are stored in an electronic credit card or "smart card" 11. They may also be stored in any other form of memory device, e.g., that in a handheld wireless telephone. When the memory device is pocket-portable, such as a smart card or handheld cellular phone, the function of storing virtual cash is typically referred to as an "electronic wallet" function.
A smart card can be used to purchase merchandise at a store equipped to read the smart card electronically. A point-of-sale terminal 13, for example, can comprise an interface for smart cards which may be a connector or a wireless interface using radio, infra-red or optical frequencies. One such optical interface comprises an LCD display on the card used to display bar codes which are readable by a conventional laser scanner, already found in many retail stores.
The point-of-sale terminal 13 sends a message to the card 11 over the standard interface requesting payment of a specified amount, for example $13.00. The card responds by sending a message including the bit patterns of virtual coins, the denominations of which add to the requested amount—for example an $8 coin, a $4 coin and a $1 coin in the $13 example. The point-of-sale terminal 13 decrypts the bit patterns of the coins transferred using the public key of the issuing virtual bank 10. The coins will be decrypted into readable bit patterns, verifying their denominations, only if they are genuine, as only the bank, using its secret key, can construct bit patterns which can be decrypted using its public key, making forgery impossible. Cloning, however, is possible by simply copying the bit patterns of genuine virtual coins. Cloning cannot be prevented by this prior art system, but can at least be made detectable by giving each coin a serial number. Upon a merchant's eventual redemption at the bank of a virtual coin issued by the bank, the bank can check if that serial numbered coin had already been redeemed. Even with this detection scheme, however, it is not clear which copy is the clone, since first spent does not necessarily imply true copy. Thus, wherever virtual coins are stored, they are vulnerable to hackers obtaining access to the bit patterns and cloning them.
The present invention solves this problem by, for example, storing coins in a form encrypted with an encryption key which is not publicly known, e.g., the owner's secret key, or at least in an encrypted form that is only decipherable using the owner's secret key. For example, the coins could be encrypted using the public key of the owner and can then only be decrypted using the owner's secret key.
An enhancement to the conventional system of FIG. 1 according to the present invention therefore includes the steps of:
(a) The virtual bank also encrypts the coins using the public key of the smart card or electronic wallet to which they are being transferred.
(b) The card or wallet decrypts the coins using its secret key when paying to a point of sale terminal. The wallet furthermore encrypts the coins before outputting them using the public key of the point-of-sale terminal to which they are being paid.
Thus, since only the card or wallet can decrypt coins sent from the bank, they are not vulnerable to interception in transit, which may, for example, involve a wireless link. The coins are also not vulnerable to being stolen from the wallet, as they are no use without the secret key, and the secret key can be stored in a memory that cannot be accessed from the outside. For example, the card or wallet can include an integrated processor and memory chip having an external I/O interface through the processor. The processor can have a fixed program that reads information through its I/O interface, processes the information together with the secret key that only the processor can access, and outputs a result depending on the information read in and the secret key. The processor would have no program, however, that will respond to or even understand a request through the I/O interface to retrieve and output the secret key.
Furthermore, upon payment of a sum from the wallet to the point-of-sale terminal, the wallet can not only decrypt the coins using the wallet's secret key, but can re-encrypt them using the point-of-sale terminal's public key, so that coins in transit cannot be stolen as they can only be decrypted using the POS terminal's secret key. These coins are not vulnerable to being stolen from the POS terminal's memory, as they are stored in encrypted form. If the POS terminal is furthermore one of many in a large store, it may be connected to a central corporate computer housed in a secure area, with the corporate secret key stored in the central computer area. The POS terminal would send encrypted coins received from wallets to the corporate computer for verification, a procedure which would appear almost instantaneous to the cashier and customer.
The above described security-enhanced procedure according to the present invention is illustrated in FIG. 2. The virtual bank 20 issues virtual coins 21 to a customer's smart card 22, the coins being encrypted first using the bank's secret key and secondly using the customer's public key known to the bank. The encrypted coins are stored in the customer's smart card 22, together with the customer's secret decryption key as described above. A POS terminal 23 at a retail store requests payment of a certain sum, to be made in coins encrypted with the store's public key, which accompanies the electronic request. Sending the public key with the request is an alternative to storing keys for all possible retail outlets, although a limited subset could be stored therein. The smart card 21 decrypts the required coins using the customer's secret key and then re-encrypts them using the store's public key, both operations taking place inside the smart card's processor. The store-encrypted coins are then sent to the POS terminal 23 and optionally thence to the store's corporate computer 25 for verification. The corporate computer 25 decrypts the coins using the store's secret key, and then decrypts the coins again using the bank's public key. At this point the coins become readable and may be verified to have come from the virtual bank 20 and to have the expected denominations. The corporate computer 25 sends an "accept" message to the POS terminal 23 that the payment has been accepted, or alternatively a "reject" message. Procedures upon rejection are not detailed herein, but may, for example, include contacting the virtual bank 20 electronically with the name of the customer or ID of the smart card and the bit patterns of the offending coins to determine what action to take.
Neither the conventional system described above with the aid of FIG. 1, nor the enhancements described above according to the present invention with the aid of FIG. 2 are concerned with guaranteeing the merchandise to the buyer, but are rather concerned with guaranteeing payment to the seller. Merchandise bought at POS terminals is assumed to have been inspected, accepted and approved by the buyer before exiting the store. Other exemplary embodiments of the present invention are concerned with trading assets having a broader definition than just cash or virtual money, i.e., including all things of value that can be described with an encrypted description hereinafter referred to as an ICON. An ICON is a distinct bit pattern, which, when decrypted, reveals and guarantees the nature of the asset that it stands for. A method of creating ICONs that represent objects of value and trading them will now be described with the aid of FIG. 3.
At least one Trusted Registry 40 is equipped to communicate via a public telecommunications service such as the Internet, for example. Communications may be made secure by use of the registry's secret key/public key pair according to well known conventional techniques.
A trusted institution such as a bank 20 or other guaranteeing institution 30 can thus communicate with a registry located elsewhere, using communications links denoted by references L3,L4 and such institutions are the only entities from which the registry will accept DEPOSITs of ICONs as distinct from TRADEs of ICONS. The distinction between a DEPOSIT and a TRADE is that a deposit creates a new ICON in the registry without necessarily being matched by the deletion of a pre-existing ICON. How the registry distinguishes institutions 20, 30 from non-institutional customers 31, 32 will be described later.
Now suppose that a customer 31 wishes to represent a cash deposit or an object of value such as ownership of real estate by an ICON stored in a selected registry 40. The customer first identifies an institution that will agree to stand behind the value or nature of the ICON deposited, and create such an ICON. If the ICON represents cash for example, then the institution can require that the customer has deposited in escrow or other blocked account an amount of real money corresponding to the amount of virtual money the ICON represents. The escrow or blocked account, although originally created at the behest of a particular customer, becomes an anonymous account once the ICON has been placed in registry 40, as the ICON from that point on may undergo many changes of ownership, while remaining redeemable for the contents of the escrow account.
If the ICON is to represent real estate, as an alternative example, the guaranteeing institution may perform a search to verify the ownership of the real estate as well as a physical inspection, before creating the ICON. Moreover, the institution would most likely require that it hold the real estate deeds so long as the ICON was in circulation, as the ICON is eventually redeemable by the institution for the property it represents and described therein. At least some of the negotiation between the bank 20 and its potential customer 31 can take place electronically using secure Internet links denoted by L1, L2 for example, by telephone, or by traditional face-to-face means.
When the institution 20 or 30 agrees to create and guarantee an asset-representative ICON, it creates a plain text description of the asset and then enciphers that description (i.e., signs it) using the secret key of the institution. The institution then further encrypts the ICON using the public key of the customer 31 or 32 and then transmits the encrypted ICON to the registry 40 with a request to deposit the ICON in association with the ID of the customer, using communications links L3,L4.
The customer can be uniquely identified by his public key, as one alternative. The entire message from the institution 20 or 30 to the registry 40 can be encrypted using the secret key of the institution and the public key of the registry, which keys can be communication keys different than the secret/public key pairs used by institutions to sign ICONS. The registry 40 deciphers the message from the institution using first the institution's public key and then the registry's secret key, thus revealing a still-encrypted ICON, but the plain text ID of the customer. Furthermore, some check bits such as a Cyclic Redundancy Check Code (CRC) are added to the message before encryption by the sender, and are checked after decryption by the receiver. Thus the registry can use the CRC or check bits to verify that a decrypted message has decrypted correctly, even though the ICON is still encrypted and the ID of the customer does not alone lend itself to verification. Only a message created using the secret code of the institution will decrypt correctly using the public code of the institution to reveal the correct check bits, thus verifying to the registry that it can accept the ICON for deposit. The registry has no responsibility to verify that the identified customer actually exists or that the ICON represents anything in particular. What the ICON represents can thus remain a secret known only to the customer.
The transaction techniques described above use a public key encryption system based on a two part key, one part for encryption and one part for decryption. A conventional public key encryption algorithm suitable for use in the present invention is the RSA technique. This is based on the mathematical identity:
for every possible message X treated as a large number, and where z is the product of primes:
In the conventional RSA algorithm, n=2, i.e. only two primes are used to form z, and 'y', being non-prime, is factorized into two parts called the public key and the private or secret key, respectively.
The two key parts, when multiplied, equal the value 'y' in equation (3), which, when used in equation (1), transform any message X back into itself, thus rendering it readable. However, it is possible to extend the RSA algorithm by factorizing 'y' in equation (3) into three or more parts, and distributing the parts to different parties. Then it can be possible for certain messages only to be constructed by more than one party in collaboration, or alternatively to provide the capability for more than one party to collaborate in order to render a message decipherable.
In anticipation of future fraud attempts, the number of check bits used, and the length of signature and communications keys, should be substantial to render it unproductive for a person of criminal intent to attempt to create fraudulent ICONs, or to misrepresent his website as a respectable financial institution or trusted registry. In state-of-the-art systems for public key encryption, security depends on the enormous amount of computational effort required to factorize a given product of two large prime numbers to reveal the prime numbers. Even larger prime numbers are justified when it comes to financial security than may be justifiable for secure communications alone, as the security of billions of encrypted ICONs guaranteed by millions of institutions for billions of customers the world over could eventually be at stake. Prime numbers of the order of 1000-2000 bits in length, the product of two such being greater than 2000 bits in length, are thought at the present time to be secure for the foreseeable future, still observing certain restrictions on the choice of primes such that their product cannot be easily factorized by a reverse Miller test for factors.
Thus by the above method, ICONs representing cash or other assets are created in the "names" of different customers and stored in one or more registries 40. A "trusted" registry is one that will, according to the principles described above, only accept as new deposits ICONs received from a trusted institution, which is identified by the signing on communications with the registry using a secret key that is listed in a list of trusted institutions. Likewise, a customer 31 or 32 should verify that a registry he is dealing with is a trusted registry that will only accept such deposits, which the customer can do by similar means, i.e. by verifying that the communications key of the trusted registry is one of a list of keys belonging to trusted registries. Likewise, trusted institutions can verify that a registry into which it is depositing a newly-created ICON is a trusted registry by virtue of the communications key used to communicate with the registry existing in a list of approved registries.
To illustrate the effectiveness of communication techniques according to the present invention, consider the following example. Suppose that two customers 31 and 32, in communication via the Internet (for example) using links L14 and L13 arrive at an agreement to trade assets. One customer 31 may, for example, agree to pay a sum of money to the other 32 in return for a non-cash item or asset owned by the other.
In the simplest case, the first party 31 will possess an ICON stored in registry 40 exactly representing the agreed payment sum, and the other party 32 will possess a single ICON stored in the same registry 40 representing the non-cash item the first party has agreed to purchase, each ICON being guaranteed by an appropriate institution such as institution 20 or institution 30.
The second party 32 sends a request to the registry 40 to temporarily withdraw an ICON, using communications links L9 and L10. This transaction is secured using the communications keys of both the registry 40 and customer 32. Optionally, the ICON may be electronically identified in the registry as temporarily withdrawn by the owner, but the ICON is not at this time destroyed, it is merely locked and cannot be withdrawn or traded while the original trade is ongoing. This in itself is not a protection against an owner cloning a withdrawn ICON, but it will be explained later why such cloning is an unproductive method of attempting fraud.
Customer 32 decrypts the withdrawn ICON using his secret key. Customer 32 then re-encrypts the ICON using the public key of the first party 31 and transmits the result to customer 31, using secure communications links L13 and L14 which may be secured by different keys than those used to sign ICONS. Customer 31 receives the encrypted ICON and decrypts it first using his own secret key, and then using the public key of the indicated guaranteeing institution, institution 30 for example. At this point the description of the non-cash item he is purchasing is revealed to him together with the fact that its existence and nature, as described, is guaranteed by the trusted institution 30. Reciprocally, customer 31 temporarily withdraws the ICON representing the cash payment he has agreed to make to customer 32, and after decryption using his secret key and re-encryption using customer 32's public key, transmits it to customer 32. Customer 32 decrypts this ICON using his secret key and then the public key of guaranteeing institution 20, for example, to verify that it represents the agreed cash payment and that institution 20 is guaranteeing that it is eventually redeemable for real money, if ever required.
Once both parties have inspected their respective wares and agreed to the trade, they both communicate with the registry 40 using secure links L5 and L6 and L9 and L10, respectively, with instructions to make the trade. Customer 31 then transmits the bit pattern of the temporarily withdrawn ICON he has agreed to trade with customer 32, together with the re-encrypted ICON signed with customer 32's public key, and the bit pattern he expects to receive in return from customer 32. Customer 32 likewise transmits the bit pattern of his temporarily withdrawn ICON, the bit pattern of the ICON re-encrypted with customer 31's public key, and the bit pattern of the ICON he expects to receive in return from customer 31. The registry then matches the bit pattern customer 31 expects with the bit pattern provided by customer 32 and conversely the bit pattern customer 32 expects with the bit pattern received from customer 31. Upon detecting a match, the trade is executed by finding the bit patterns retained in blocked account for the temporarily withdrawn ICONS, deleting them, and replacing them in the database with the new ICONs signed in the names of the new owners.
In designing financial systems, security against fraud is of paramount concern. Consider now that customers 31 and 32 collaborate in fraud in the following manner. Each has deposited ICONs worth $1000 in registry 40 and ICONs worth $10000 in a second registry, not shown. They simultaneously transact to trade their $1000 ICONs in registry 40 and their $10000 ICONs in the second registry, by the process of temporary withdrawal described above. However, in informing registry 40 to trade the $1000 ICONS, they substitute for $1000 re-encrypted bit patterns the $10000 bit patterns withdrawn from the second registry, thus causing registry 40 to delete $1000 ICONs and store $10000 ICONS, while the second registry continues to store $10000 ICONS. They can both now continue to trade with other parties using the total of $20000 stored in both registries, and have succeeded in fraudulently cloning virtual money.
The above is only one example of many potential security vulnerabilities that should be considered in devising an essentially umnonitored system of automatic, electronic trading. The example above may be prevented according to the present invention by the following technique.
In addition to providing digital asset descriptions underwritten by secret key, the issuing institution provides a digital check pattern, such as a cyclic redundancy check code, that is a function of the plain text content of the asset description, but which is then enciphered using a symmetrical ciphering key—for example, by bitwise modulo-2 adding a code or transposing bits in a way known only to the institution. Alternatively, the check code can be enciphered using the institution's secret key. That guarantees that no other party can easily forge a check code that a forged message will pass.
According to one security aspect already described, only qualified institutions may create and insert new asset ICONs in the registry's database. As they do so, the encrypted check patterns are also provided and associated with each ICON. The encrypted check patterns are, however, not released to other individuals. These patterns may only be transmitted from the registry in secure communications with a qualified institution. Thus, although an individual inspecting the plain text content of an ICON can recompute the plain text CRC, he does not know the bit pattern of the corresponding institutionally encrypted CRC that is stored in the registry.
The encrypted check patterns depend on the plain text within the ICON which only an authorized institution can create using its secret key, and accompany the ICONs through changes of ownership in intra- or inter-registry operations. Thus, in the above example of a potential fraud, while the registry may, during a trade, unknowingly accept a fraudulent ICON to replace a valid ICON, the check code of the original ICON will remain appended to the new ICON on the assumption that the new ICON has the same underlying plain text and thus describes the same asset, only re-encrypted for different ownership. An individual attempting to tamper with an ICON would therefore at worst only succeed in invalidating it by creating a mismatch between the ICON and its check code, to which he is blind.
As described above, the second party to a trade will have collaborated in any fraud attempt, by instructing the registry to accept an ICON which he knows will not pass the CRC of the ICON it is replacing. Thus, no innocent party is harmed when an ICON is invalidated by a fraud attempt. On the other hand, invalid ICONs could be created in the database which it may then be attempted to palm off on to a third party.
A further security measure prevents the latter also; during a trade, the party inspecting an offered ICON to verify that it meets his expectations decrypts it to inspect the plain text and also recomputes the CRC over the plain text. The offered ICON passed to him from his trading counterpart is first subject to any link protocol deciphering necessary, and then deciphered using his secret key. Then, using the guaranteeing institution's public key, it is further deciphered to reveal plain text if and only if the ICON genuinely originated from that institution. The recipe for computing the unencrypted check code from the plain text is published, and either party with access to the plain text can thus compute the plain text check code. This is passed to the registry by the party accepting an ICON in a trade, so that the registry can verify that the CRC matches a stored CRC of an ICON which the offered ICON will eventually replace. The registry decrypts the CRC of the existing ICON using the guaranteeing institution's secret key and compares the plain text ICON with the recomputed ICON received from a trading party. If there is no match, the trading party supplying the recomputed ICON is warned and the registry will not execute the trade.
The registry has the option of requesting that the institution perform the comparison when the registry is unable to decrypt an encrypted check code, e.g., when a symmetric cipher is used to protect the check code. Each institution may select a particular ciphering method for the check code and registries may be designed to handle any type of check procedure, depending on whether the institution's policy permits an autonomous check procedure that does not involve the institution in every transaction.
FIGS. 4(a) and 4(b) illustrate the data flow in the above-described security operations. In FIG. 4(a), the financial institution 40 creates an ICON after negotiation with a customer that the ICON shall represent some real asset. During this negotiation, the ICON has been encrypted with the customer's public key so that only that customer can decipher it using his secret key. The institution has also computed a CRC check code, having a number of bits adequate to ensure negligible probability of guessing it by chance, such as 64 bits. The check code is a function of the plain text content of the ICON, and both the user-encrypted ICON and the CRC code are transmitted by the institution to the registry using an encrypted link. The user-specifically encrypted ICON and the attached CRC are then stored in the registry database together with an indication of the customer to which it belongs (not shown).
FIG. 4(b) illustrates the flow of data in one direction of a trade, the steps of which are specified in the flow chart of FIG. 5. Customers 31 and 32 have agreed to a transaction in which customer 31 shall deliver an ICON re-encrypted to be customer 32 specific. Customer 31 first requests the ICON from the registry 40 at step 100. In principle this is unnecessary if customer 31 has retained a copy. The registry sends customer 31's requested ICON over an encrypted link after encrypting same with the registry's secret key and customer 31's public key at step 101, but does not send the CRC. Customer 31 decrypts the received ICON using his secret key, the registry's public key and his secret key again at step 102. Customer 31 then re-encrypts the ICON using customer 32's public key, his own secret key and customer 32's public key again as shown in step 103 and transmits the result to customer 32 over a further-encrypted communications channel. Customer 32 receives the message and decrypts the communications layer protocol and then decrypts the encrypted ICON using his secret key and customer 31's public key to reveal plain text at step 104. Customer 32 may then inspect the nature of the asset that the ICON describes. Customer 32 computes (at step 105) the CRC from the plain text ICON using a recipe published by the guaranteeing institution. Customer 32 then transmits the encrypted version of the ICON together with the CRC to the registry using a secure communications channel as described at step 106.
The registry receives the customer 32 encrypted ICON from customer 32 and also from customer 31. Customer 31 is indicating to the registry that the customer 32 encrypted ICON will replace the original customer 31 encrypted ICON upon executing the trade. Customer 32 is indicating to the registry the bit pattern of the ICON he expects to receive from the trade. The ICON received by the registry from customer 32 is decrypted as shown in block 107. If the customer 32 encrypted ICONs received from both customer 31 and customer 32 match at the registry, one criteria for executing the trade is satisfied. The registry also decrypts the CRC of the ICON that customer 31 indicates he wishes to trade, using the guaranteeing institution's public key, and compares it with the CRC received from customer 32 at step 108. If they match, the customer 32 encrypted version of the ICON is confirmed as valid and customer 32 has not been deceived by customer 31 as to its nature. Otherwise, if no match is indicated, the registry warns customer 32 that the ICON customer 31 has offered is invalid and refuses to execute a trade as set forth in step 109. Reciprocally, customer 31 can be assured of the validity of the ICON he has been offered by customer 32, and if certain criteria are satisfied. Namely that (1) the ICON customer 32 expects to receive from customer 31 matches the customer 32 encrypted ICON supplied to the registry by A; (2) the ICON customer 31 expects to receive from customer 32 matches the customer 31 encrypted ICON supplied to the registry by customer 32; (3) the CRC supplied by customer 32 matches the stored CRC of the customer 31 encrypted ICON that will be overwritten by the customer 32 encrypted ICON expected to be received by customer 32 from customer 31; (4) the CRC supplied by customer 31 matches the stored CRC of the customer 32 encrypted ICON that will be overwritten by the customer 31 encrypted ICON expected to be received by customer 31 from customer 32; (5) the ICON customer 31 is offering to replace by one re-encrypted to customer 32 ownership exists in the registry; (6) the ICON customer 32 is offering to replace by one re-encrypted to customer 31 ownership exists in the registry; and (7) all communications from customers 31 and customer 32 to the registry are confirmed as bearing customer 31 and customer 32's respective digital signatures, then the registry will execute the trading of ICONS.
The above procedure thus prevents the fraudulent cloning of ICONS, in which multiple copies can be inserted in the registry registered to the same or different users, and also prevents an innocent customer from being deceived into accepting a worthless ICON by a fraudster. This procedure relies on the difficulty of creating a fraudulent ICON that produces the same CRC as a valid ICON.
While the latter is hindered by the above procedures, it is a further safeguard against fraud if a mechanism can be found to hinder modifying the plain text of an ICON such that it passes an existing CRC belonging to another ICON known to the forger. For example, ICONs are created during a negotiation between a customer and an institution, during which the customer may have some say in the exact wording of an asset description. For example, the customer may succeed in persuading the institution to unwittingly accept innocent-looking modifications to the asset description in order that, unbeknown to the institution, the plain text produces a certain CRC desired by the owner for the purposes of fraud.
Unfortunately, common cyclic redundancy check codes have a linearity property which makes it possible to generate modified bit patterns that produce any given CRC. Since the CRC of (bit pattern A).XOR.(bitpattern B) is equal to (CRC of A).XOR.(CRC of B), the following procedure may be used in a fraudulent effort to obtain a desired CRC value:
Construct a fraudulent bit pattern A having eight, 8-bit character spaces at the end of the plain text (or indeed anywhere) that are blank (assuming a 64-bit CRC is used).
Compute the CRC over the fraudulent bit pattern CRC(A).
XOR CRC(A) with CRC(B) to determine how it differs, obtaining the 64-bit SYNDROME.
Compute an 8�8-bit character pattern to fill the blank spaces that will annul the syndrome. This may be done as follows:
Construct an all zeros bit pattern except for a '1' in the first blank bit position and compute its CRC(=B1).
Repeat with the '1' in each of the blank spaces in turn, obtaining successively B2,B3 . . . B64, all 64-bit vectors.
Arrange the 64, 64-bit vectors B1 . . . B64 in a 64�64 bit Boolean matrix and invert the Boolean matrix by known techniques to obtain a new 64�64-bit inverse matrix.
Multiply the SYNDROME by the Inverse Matrix to obtain a suitable blank-filling pattern that will cause the fraudulent bit pattern to give the same CRC as the valid bit pattern.
This weakness can be overcome by using a non-linear check code computation as illustrated by FIG. 6. The plain text bit pattern 200 is first arranged as a sequence of bit-blocks 201, 202 . . . 206, and each bit block is applied to one input, for example the key input, of a block cipher 211 . . . 216 such as the DES algorithm. In the DES case, the bitblocks would thus each comprise 56 bits, being the DES key length, that is 7, 8-bit ASCII characters, using the ASCII parity bit according to an agreed convention, or else 8, 7-bit ASCII characters without parity bit.
The plain text bit pattern is also passed through a bit transposition routine 210, which reorders the bits according to a fixed schedule to produce an interleaved or transposed plain text bit pattern 220. The transposed bit pattern is also divided into bitblocks 241 . . . 246, with the number of bits per block matching the size of the Plain Text Input of block ciphers 211 . . . 216, i.e. 64 bits in the DES case, comprised for example of 8�8 bit ASCII characters including the ASCII parity bit.
Each transposed bit block except the first 241 is furthermore added to the Cipher Text (CT) output of the preceding block cipher prior to application to the Plain text (PT) input of the succeeding block cipher. The CT output of the last block cipher forms the required check code. The non-linear check code as described above can be computed by any non-linear block-combinatorial algorithm, such as those described in U.S. Pat. Nos. 5,148,480 or 5,091,942, which are hereby incorporated by reference herein.
Another method for creating a non-linear CRC is to compute the CRC over both the Plain Text ICON contents and the institutionally-enciphered version of the plain text which will eventually be stored in a registry. The fraudulent customer can not then predict the effect changes in the plain text will have on the CRC code, as he cannot predict what effect plain text changes will have on the institutionally enciphered pattern.
Using the non-linear check code, it is impossible, other than by impractical laborious trial and error, to work backwards from a desired check code to produce an asset description that will fulfill it, and which simultaneously makes sense. A given plain text message would have to be modified in many, scattered bit positions to make a given change to the CRC. The length of the check code can moreover be increased to whatever size is needed to make random attempts to generate it unproductive.
FIG. 7 illustrates in more detail an exemplary implementation of the symmetric security guarantees provided when practicing the invention.
An ICON 1000 is stored in the registry as belonging to customer 31 and is temporarily withdrawn by customer 31 on request. The registry sends the ICON over a secure link encrypted with a link cipher at 1004 and decrypted at block 2004. Customer 31 continues to decrypt ICON bit pattern 'x' using his secret key at block 2000 and then re-encrypts it using customer 32's public key at 2001 to obtain a bit pattern x′ that is modified to customer 32's ownership. The modified ICON x′ is transmitted to customer 32 using a secure link comprised of link cipher 2002 and corresponding decryption at customer 32 in block 3003. Customer 32, after decryption at block 3003 obtains x′ which he proceeds to decipher using his secret key at block 3005 in order to obtain the ICON now covered only by the guaranteeing institution's cipher. The ICON is further decrypted at 3007 using the public key of the guaranteeing institution to reveal the plain text, which is inspected and either approved and accepted by user customer 32 or not. If customer 32 is satisfied with the asset description, he continues by computing the CRC of the ICON using both the plain text and the institutionally enciphered bit pattern, for the reasons explained above. The CRC 'a' is then transmitted to the registry along with the bit pattern x′ from which it was derived.
Reciprocally, customer 32 temporarily withdraws ICON 1001 from the registry, which is sent to him enciphered by link protocol 1005 at the registry and then decrypted by him using link deciphering block 2004. Customer 32 then removes his secret cipher at block 3000 to reveal the ICON plain text, which he then encrypts using customer 31's public key at block 3001 in order to offer the asset to customer 31. The ICON thus re-encrypted for customer 31's ownership is transmitted to customer 31 using a secure link comprised of link encryption at block 3002 at customer 32 and link decryption at block 2003 at customer 31. This reveals to customer 31 the bit pattern y′ that customer 32 is offering to store in the registry. Customer 31 further deciphers bit pattern y′ using his secret key to reveal the ICON covered only by the secret cipher of the guaranteeing institution. The plain text is revealed to customer 31 by further decryption at block 2005 using the guaranteeing institution's public key. Upon inspecting, approving and accepting the plain text asset description, customer 31 proceeds to compute the CRC of the offered ICON over both the plain text and the corresponding institutionally enciphered bit pattern to generate CRC 'b'. CRC 'b' is then transmitted to the registry using link cipher 2010 together with the bit pattern y′ offered by customer 32, and also the bit pattern x of the asset customer 31 is trading and the re-enciphered bit pattern x′ of that same asset when transferred to customer 32's ownership. Likewise, customer 32 will have transmitted the bit pattern 'y' of ICON customer 32 as presently registered to him and the corresponding bit pattern y′, modified to customer 31's ownership. The registry decrypts at block 1010 the bit patterns x′ and y′ agreed to according to customer 31, and at block 1011 decrypts x′ and y′ according to customer 32. Comparator 1012 verifies that x′ as received from customer 31 agrees with x′ according to customer 32, and likewise verifies in comparator 1013 that the customer's respective views on bit pattern y′ agree. Comparator 1014 verifies that bit pattern x received from customer 31 agrees with that of ICON A registered to him, and comparator 1009 verifies that CRC 'a' received from customer 32 matches that of ICON 1002, which first has the guaranteeing institution's cipher removed in block 1007. Thus it is verified that the underlying plain text contained within bit patterns x and x′ is the same. Reciprocally, comparator 1015 verifies that bit pattern y received from customer 32 matches the bit pattern 1001 of the ICON registered to him, and comparator 1008 verifies that CRC 'b' received from customer 31 matches stored CRC 1003 of ICON customer 32 after being decrypted with the public key of the guaranteeing institution in block 1006. Only when all six comparators produce a match will the registry then execute the trade, which comprises overwriting the ICON's original bit pattern x with the new bit pattern x′ and, preferably, simultaneously overwriting the other ICON's original bit pattern y with the modified bit pattern y′.
The preference for simultaneous overwriting of ICONS implies that the contents of the registry's ICON storage memory are invalid at the halfway stage where only one ICON is overwritten and not the other. In a time-shared hardware implementation which can be handling many communications links and trades taking place more or less at the same time, it is important to prevent a new trade that might involve the same ICONs being interposed by a transaction scheduler at the half-complete stage of a previous transaction. This problem may, for example, be circumvented by disabling the registry processor's interrupt mechanism until all ICONs involved in a trade have been overwritten, after which interrupts are re-enabled.
Security according to the present invention depends in part on the concept of the "trusted registry" which can be programmed to selectively execute trades if the safeguards just described with the aid of FIG. 7 are fulfilled. The "trust" is assured by cryptological techniques combined with a proper authorization of registries and the physical security and integrity of their hardware. Thereafter transactions can take place automatically without human intervention. The security depends also partly on the fact that the total number of ICONs in a registry cannot be changed by transactions ordered by customers alone. However, when customer 31 and customer 32 hold their assets in different registries, the registries may, by automatic and encrypted communications links between each other collaborate to implement the above security protocols, effectively behaving as a single registry for the purpose of a particular transaction. Such a collaborative transaction may result in the safekeeping of an ICON being transferred from one registry to another, in which case the number of ICONs in one registry can decrease while the number in another may increase, the total however remaining the same through such a transaction.
Other transactions may involve a change in the number of stored ICONS. For example, when an ICON represents an amount of cash greater than that being traded, the need can arise to split it. Such a split can be arranged by the owner in communication with the issuing bank. The following is an exemplary procedure for organizing a split, many variations of which can be contemplated without departing from the principles and spirit of the invention.
Suppose that the owner temporarily withdraws the ICON to be split from the registry, and after decryption, computes the CRC. The unencrypted ICON is then transmitted to his bank and with the CRC, using a secure link, together with the details of the value of new ICONs he wishes to receive in return, which of course will total to the value of the ICON being replaced. The bank then communicates with the registry using a secure communications protocol to replace the old ICON with more than one new ICON. The increase in the number of ICONs is accepted in this case by the registry as it is ordered by a qualified financial institution. Likewise, two or more ICONs representing the same (or even different) type of asset can be consolidated or "bundled" into a single ICON by a similar transaction. In this way, more complicated trades can be organized using "bundles" of assets. For example, a first user can pay $10000 to a second user to receive a quantity of shares worth $9000 plus $1000 in change.
As an alternative to producing a special ICON to represent "bundled" assets, it is possible to structure the messages which trading parties send to, and receive from, the trusted registries such that more than two ICONs can be traded in the same transaction. FIG. 8 illustrates in tabular form the structure of an exemplary message from a trading party to a registry indicative of a multi-ICON trade.
At line (1), the ID of the first and second trading parties is given. This may include, but is not limited to, any of the following:
public key of respective trading parties;
social security no. or Organization no. of respective trading parties;
ID of party issued by the registry (possible valid only for this session); and
E-mail address or INTERNET port address.
The number of ICONs that the first party expects to transfer to the second party is given, in this example "3", and the number of ICONs expected to be received from the second party is given, "2" in this example.
Then the bit pattern of the first ICON agreed to be transferred is provided, as currently stored in the registry (line 2 a), i.e. encrypted with the first party's public key, together with a new version encrypted with the second party's public key (line 2 b). There follows the same information for the remaining two ICONs, e.g., at lines 3 a-4 b.
Then follows the bit pattern of the first of the two ICONs expected to be received from the second party, encrypted with the first party's public key at line 5 a. The ID of the guaranteeing institution revealed when inspecting the plain text of the ICON is also indicated.
Associated with each expected ICON bit pattern is a CRC code at line 5 a computed by the first party over the plain text content of the ICON which was revealed to him when sent by the second party for inspection, i.e. when the ICON was "offered" by the second party to the first party. Similar information for the second ICON expected to be received completes the message at lines 6 a and 6 b. The entire message is encrypted using the public key of the registry and the secret key of the sender, and transmitted preferably using an error-tolerant packet protocol which can add checks of its own, performing as many retransmissions of packets corrupted in transmission as necessary to guarantee eventual error-free delivery to the registry.
The second party meanwhile sends a reciprocal message to the registry. The registry matches up the two messages and checks that:
The IDs of the trading parties match in both messages;
The messages indeed were generated by the parties claiming the indicated IDs, as verified by successful decryption using their respective public keys;
The number of ICONs expected to be received by one party matches the number traded by the other party, and vice versa;
The bit pattern of each ICON, as expected to be received by one party matches that provided by the other;
The CRC of the ICON to be replaced, as stored in the registry, after decryption by the registry using the indicated guaranteeing institution's public key, matches the CRC provided in the message for that ICON.
If the registry detects any anomalies in matching data received from the trading parties, the trade is not executed and warning messages are sent to the trading parties indicating the problem. Repeated failed attempts to execute a transaction can optionally cause the registry to abort the trading session and close the connection, as a protection against random attempts to force through fraudulent transactions by trial and error.
Another type of transaction can involve the transfer of the guaranteeing of virtual money or other assets from one institution to another, while keeping the modified ICON in the same registry. Such a transaction may be ordered by the owner after digital negotiation with the respective institutions, and is then effected by the institutions, private, secure communications between themselves and the registry. Likewise, the user can effect the transfer of ICONs between registries without altering the underlying guaranteeing institution. All such transactions may be automated so that they are executed in a few seconds without human intervention, by applying the teachings herein to guarantee integrity and security.
Having described exemplary security techniques for electronic transactions according to the present invention, the following addresses how everyday financial transactions may be translated to cyberspace. For example, how a bank can pay interest on the value of an ICON, the present ownership of which is not known, and the real funds lie in anonymous escrow, is described. The problem concerns the fact that receipt of interest on deposits, and similarly dividends on shares, is likely to remain a taxable event—but taxable to whom?
One solution involves indicating in the description of an ICON the interest rate payable on the deposit it represents, and the date from which interest is calculated by a Simple Interest formula. The bank can either accumulate interest in the same escrow account, net of withholding tax if so regulated, or can make a provision for the accrued gross interest it is liable to pay on demand.
The current owner of the ICON can make a digital application to the bank to consolidate accrued interest, or to issue a separate ICON for the interest. In this way, the owner, if diligent in regularly requesting consolidation of interest, can ensure that interest is reinvested thus obtaining the benefit of Compound Interest. Moreover, a potential recipient of an ICON can, from inspecting the plain text description of a deposit, verify the amount of accrued interest that will transfer to him upon accepting the ICON in a trade and must allow for any potential tax due. Such calculations can be performed automatically by a suitable trading program running on his personal computer, in order to obviate the need for manual calculations during otherwise fast, automatic trading.
Where interest net of withholding tax is accrued, yet another form of ICON can be issued by the bank indicating the amount of withholding tax paid. Indeed ICONs can be created for any form of transferrable tax credit (such as withholding tax paid) or tax liability (such as unpaid real estate tax on a property).
Dividends on obligations and shareholdings, like interest, are preferably paid into escrow to avoid the need to know the identity of the current owner. Such payments may have to be made net of-withholding tax, or alternatively are received by the institution and a provision made by the institution for a corresponding amount.
The onus is on the current owner of the ICON deposited in a registry to send a digital message to the institution holding the real, underlying assets, requesting payment of any accrued interest or dividend to be made. The payment can optionally be received by the owner in the form of another electronically tradeable ICON, lodged by the paying institution in a registry specified by the payee in the secure manner described above.
When using the present invention, it is also possible to advertise assets for sale or exchange, on a bulletin board for example. Such a bulletin board displays brief descriptions of goods or assets for sale or wanted and the asking or offered price, thus constituting a cyberexchange. Persons wishing to inspect an asset further can contact an indicated E-mail address and correspond either with the person concerned, or, if the asking or offered price is being met by the asset offered in exchange, the trade can in principle be executed automatically by suitable software on a personal computer, which inspects assets offered and confirms their acceptability and the acceptability of the guaranteeing institution.
A trusted registry according to the invention is housed in a physically secure area, is guaranteed to perform operations only within the limits of its security procedures and furthermore should comprise sufficient hardware redundancy to operate with reliability and ability to recover from errors or failures, including perhaps the use of back-up power supplies. A trusted registry should also include a billing system for billing customers for storage of ICONs and for executing trades, which consumes processing resources.
These are exactly the characteristics that a modem digital telephone exchange, such as the Ericsson AXE switch, possess. These switches exist all over the world and are used for local exchanges, trunk exchanges and mobile phone switching centers. Such PSTN exchanges could be equipped with software upgrades that would implement the function of the secure, trusted registry envisaged in this invention.
Modern digital mobile phones conforming to the European GSM or U.S. PCS1900 standards, for example, use smart cards that hold secret subscriber communications keys which cannot be accessed outside of the phone. They also contain an amount of read/write memory for holding often-used telephone numbers and suchlike. These smart cards can be adapted to store and dispense enciphered virtual cash according to the invention. The smart cards are removable from the phones and may be installed in other phones or other devices, such as a PC equipped with a suitable interface. The same smart card may contain a subscriber's public/private key pair used for securing transactions performed either wirelessly over a cellular phone network, for example, or over the Internet. By removing a smart card, the subscriber renders the terminal "safe" in that no other person may then use it to masquerade as the subscriber. The smart card may thus receive wireless downloads of virtual cash via a digital cellular phone call, or may be downloaded when plugged into the home PC. The smart card, via the portable cellular phone, may also dispense virtual cash to a Point-of-Sale terminal, by for example blinking an LED at the POS laser scanner's wand, the light being modulated with bits or bar code at a rate matching that expected by the POS terminal. The cellular phone may also be equipped with a bar-code scanner to read newspaper discount coupons into memory, or may use its microphone to listen to TV ads where audio modem signal bursts can be broadcast to disseminate digital discount coupons, the phone's digital signal processing then decoding such modem signal bursts and storing the digital coupon in memory in the smart card for eventual use at a retail store in electronic communication with a POS terminal.
It has thus been disclosed and described above how a new type of electronic commerce can be accommodated in cyberspace, having the advantages of speed, reduced execution costs through lack of manual intervention, and inventive use of public key encryption techniques to secure trades in both directions, which is an advance over prior art methods which sought only to guarantee payment to the seller, i.e. one direction of trade only. The inventive reciprocal security guarantees provided by the invention allow the wares or assets being sold to be digitally inspected by the buyer prior to purchase to verify that an institution he trusts is standing behind the claimed value, as well as allowing the seller digitally to inspect the wherewithal being offered by the buyer in exchange.
Many variations and applications of the invention can be devised by persons skilled in the art of encryption and financial systems, which variations fall within the scope and spirit of the invention as described by the following claims.
Patent Citations
Non-Patent Citations
Referenced by
Legal Events
Original Image


text:
Chicken Lo Mein
|Whole chicken breasts
|2 Large, skinned and boned
|Soy sauce
|3 Tablespoon
|Dry sherry
|1 Tablespoon
|2 Teaspoon
|8 Ounce (1 Package)
|Salad oil
|1⁄4 Cup (4 tbs)
|1⁄2 Pound, sliced
|Chinese pea pods/1 package, 6 ounce, frozen chinese pea pods, thawed
|1⁄4 Pound
|Green onions
|2 Medium, cut into 2 inch pieces
|Red pepper
|1 Large, thinly sliced
|1⁄2 Cup (8 tbs)
|Chicken flavored instant bouillon
|1⁄2 Teaspoon
1. On cutting board, cut each chicken breast in half. Then with knife held in slanting position, almost parallel to the cutting surface, slice each half across width into 1/8 inch-thick slices. In medium-sized bowl, mix sliced chicken, soy sauce, sherry, and cornstarch; set chicken mixture aside.
2. Prepare linguine in saucepot as label directs; drain.
3. Meanwhile, in 12-inch skillet over medium-high heat, in hot salad oil, cook mushrooms, Chinese pea pods, green onions, and red pepper, stirring quickly and frequently, until vegetables are tender-crisp, about 3 to 5 minutes. With slotted spoon, remove vegetables to another bowl.
4. In drippings remaining in skillet, over high heat, cook chicken mixture, stirring quickly and frequently, until chicken is tender, about 2 to 3 minutes. Return vegetables to skillet; add water and bouillon; heat to boiling, stirring to loosen brown bits from bottom of skillet. Add linguine; heat mixture through, tossing gently to mix well.

subset: commoncrawl


text:
The Style Gallery is a great new way for you to view, love, and share outfit photos. It's meant to showcase
all the expressive, creative, and inspirational personalities of our community!
Moto City Jacket
Staten Island Sweetheart Coat
Sharp Scooter Jacket
Strand in Hand Jacket
6 left!
That's More Like It Jacket in Grey
Hop, Zip, and a Jump Raincoat
What Motors Most Jacket
Leipzig Hoodie
East Coast Tour Coat in Sand
Class a Wrap! Coat in Black
Sing of Spring Coat
Zoom For Two Jacket
Class a Wrap! Coat in Camel
Melodic Morning Coat in Dots
Melodic Morning Coat in Fruit
Metropolitan Miss Coat in Blush
Shop and Stare Coat
5 left!
Before, Enduring, and After Coat
Here I Amble Coat
If It Makes You Poppy Coat
Empowered Professional Coat
Enhance Your Chance Jacket
Fan You Believe It? Coat in Navy
2 left!
Fan You Believe It? Coat in Black
1 left!
Tweed the Fine Print Jacket
3 left!
Remarkable fashion & decor, inspired by our community, & delivered with uncommon care.
Copyright ©2002-2015 ModCloth.com. All Rights Reserved.
Site Map
CA Notice
Privacy & Security
Terms of Use


text:
|Blurbarian Since
|December 2012
|A.D. Wheeler
|My Web Site
|New York, USA
|My Occupation
|Photographer, Artist, Educator
|My Bio
|Born and raised in a small town in upstate New York, Andrew D. Wheeler has been taking photographs since he was old enough to hold a camera. He is self-taught and loves pushing the boundaries of both the camera and post processing. Andrew specializes in High Dynamic Range photography as he feels it allows him better control over the available light in a given scene. His process is dedicated to replicating not only the scene but conveying the mood of the shot to the viewer. While he does not consider himself an explorer he does love the adventure in finding beauty and art in generally unseen places, places off the beaten path, uncovering the hidden beauty that lies within.


text:
BreadcrumbsHome / Sports / Baseball
Spring Registration is now closed.
We will open fall registration July 1st. We hope to see you on the field in the fall!!
Online Registration
Ages 4 to 15 as of 4/30/15
Click HERE to register online
12 & Under Assessments
Rookie: 3/2 6:30pm
Minors: 3/3 6:30pm
Majors: 3/4 6:30pm
Also, there is an annual $100.00 membership fee which will be applied to your purchase.
The membership fee covers calendar year 1/1-12/31
Registration is on a first-come first-serve basis, so if you are planning on signing your child up in the baseball program, the earlier the better. Once teams meet capacity, you may go on a waiting list and might not be assigned to a team. SO HURRY!!!!
It is PRAA's desire to accomodate as many youth players as posssible. We realize in these difficult economic times it may be hard for some families to afford the opportunity for their children to participate in our sports programs. There are many ways you can help. We can design a volunteer program to help offset a portion of the activity fees. PRAA has a financial assistance application available for those families in need to help defer the cost of partcipation. We urge you to contact the sports commissioner for further details. The financial assistance form can be found by clicking HERE. The form is to be filled out and sent to the sports commssioner for consideration.
Skills Assessment/Draft Dates
NOTE: There are NO T-ball tryouts for recreational leagues.
TEAMS WILL BE DRAFTED IMMEDIATELY FOLLOWING THE ASSESSMENTS. Coaches will have their assigned teams and will be contacting families within a few days following the draft.
Babe Ruth Baseball, Inc changed its previously announced position regarding the use of full composite bats for the Cal Ripken Divisions (Rookie, Minors, and Majors). As a result, full composite bats are now allowed in League and All Star play. With that said, bats must continue to be no longer than 32 inches in length and have a barrel diameter of no more than 2.25 inches. They must also state clearly on the barrel that they are "Approved for play in Babe Ruth Baseball."
PRAA is excited to announce new opportunities in the Majors Baseball Select program
PRAA is proud to provide sports activities for youth. In doing this we also enjoy being a feeder program for middle school and high school sports programs. As our youth players enter into middle school and begin participating on school sports teams parents are often faced with the difficult choice of allowing their children to continue to play youth league sports at PRAA. PRAA encourages our youth to participate in school sports because this is a very exciting time in their lives. It is great fun for these kids to represent their school and communities while traveling to other areas to compete. PRAA is a strong supporter of all school sports activities.
To encourage this participation PRAA is excited to announce the following opportunities in the Majors baseball challenge program. This program is open for our 11 and 12 year old (Majors) baseball program.
To participate in the PRAA Majors Select Baseball Program youth players are now required to meet the following criteria:
Players must have registered and participated in the Spring baseball league at PRAA.
Players must be registered and participating in the Fall baseball league at PRAA.
And (must satisfy one of the following)
Players must be registered and participating on any Middle School sports team.
Players must be registered and participating in any Fall PRAA sports program.
Players must be registered and participating in any Fall sports program offered by any association or organization.


text:
Original recipe yields 6 servings
Amount per serving ({{servings}} total)
Based on a 2,000 calorie diet
Ready In
I am super stingy with 5 star ratings, so you know I think this is awesome. The worcestershire sauce takes it over the top, so I wouldn't call it an "optional" ingredient.
Yummy!! Didn't have goat cheese or mushrooms, but they still turned out awesome and everyone loved them!!!
OK. kinda bland. Could be a great base recipe but sure needs some jazzing up.


text:
February 29, 2012
February 27, 2012
February 22, 2012
February 19, 2012
Samantha was born in Arizona, but grew up in Cleveland. There she acquired the childhood nickname of Buh, after Al Bubba Baker (fortunately not due to any physical resemblance), the requisite chip on the shoulder that all Cleveland fans have, and permanent frostbite from attending Browns games in December. Her love of sports and tendency toward attachment to teams that choke began with the 1986 Browns.
After suffering through The Drive, watching Bill Belichick run her team into the ground while blaming it on Bernie Kosar, and even forcing herself to root for Vinny Testaverde, the Browns rewarded her for her loyalty by leaving town.
Unable to find a suitable replacement team to adopt, she switched her primary devotion to baseball. She fell in love with the Indians and the game itself, and before she knew it found herself reading scouting reports and uttering the phrase "sorry, I don't have time to date during baseball season."
Like her hero Crash Davis, she's got an "I believe" speech. Inspired by the effect of Crash's speech on Annie, she hopes to someday use the following to impress Scott Van Pelt:
She believes that either baseball or Miller Lite is her soul mate, that Omar Vizquel is the greatest defensive shortstop in the history of the game, and that Jose Mesa may be the embodiment of pure evil. She believes in respecting streaks, the power of a sell-out crowd, and that a 6-4-3 double play can be one of the most beautiful things in the world. She would rather steal home than hit a grand slam, thinks that the bench clearing brawl is an art form but that it is rarely executed to perfection, and that the 1919 Black Sox may have been the greatest team of all time. She believes that MLB should outlaw purple jerseys, the wave, and Joe Morgan. She believes that the home run is overrated and the triple is underrated, that Lou Pinella throws the world's best tantrums, and that Jamie Moyer is often the only thing that gets her out of bed in the morning.
She thought it best to provide a few additional details for a more complete description of herself in case she ever gets any fans, enemies, or stalkers: She has several useless talents which include shooting pool, crosswords and picking locks, but she is a terrible bowler, can't seem to stop stealing holiday decorations while out drinking, and has a problem with authority.
She blames Art Modell for her trust issues, her Cleveland Stadium Dog Pound training for the time she got kicked out of a Penn State game for throwing things, and 10-Cent Beer Night for the fact that she can no longer upgrade her seats at ball games through squatters rights.
Her fastball tops out at 55.
Samantha is a displaced Browns and Indians fan living in New York. She is the Senior Sports Editor at CineSport.
Find me on twitter at: https://twitter.com/samanthabunten
Find me on the radio at: http://www.blogtalkradio.com/fantasysidelineshowdotcom
Find me on facebook at: http://www.facebook.com/samantha.bunten and https://www.facebook.com/pages/Fantasy-Sideline-show-dot-com/100613029998988
Thanks for all your information, Website is very nice and informative content.
This article is really fantastic and thanks for sharing the valuable post.
Thanks for post this helpful post - Please visit for More information about -
Two full thumbs up for this magneficent article of yours. I've really enjoyed reading this article today and I think this might be one of the best article that I've read yet. Please, keep this work going on in the same quality.Ativan for sale
Hey Samantha, we've missed you! I hope everything is ok. I wish you'd come back to BR and write about our Browns!
Ummmm... are you on a very long vacation? Your articles and positive viewpoints on the Browns are sorely missed.
It would be interesting to know the types of analytics (e.g. linear programming) that are run by teams to help determine draft picks efficiently on draft day. For instance, teams identify their list of highly valued prospects before the draft but then their needs change each time a position is drafted either by that team or by another team (the former results in lower team demand for that position and the latter results in lower supply of talent at that position).
Riddle me this: Why are the Browns consistently worse than other teams in similar markets? I realize this question requires considerable time to answer adequately but I would appreciate your best efforts to elucidate what leads to successful (and unsuccessful) franchises.
Where were girls like you when I was 20 years younger? I love your articles. You really have talent. Can I get your autograph when you're famous?
Samantha, you are without a doubt the best.


text:
'Unsung She-roes' to be honored at DeSoto County African-American History Symposium
Twenty women recognized for contributions
Twenty women will be honored Saturday at the third annual DeSoto County African-American History Symposium and Celebration for their contributions to the community.
Among them will be 88-year-old Hernando native Gertrude Bridgeforth, who endured intimidation tactics while helping get black residents registered to vote during the civil rights era.
"We would meet in churches and go out in the neighborhoods and get people to register to vote," said Bridgeforth, a Southaven resident who made the trip to meet President Barack Obama at his first State of the Union address. "We were never arrested but we were intimidated.
"I've seen a lot of changes in my lifetime. I didn't think too much that I would see an African-American man become president."
But she did. Bridgeforth said meeting the President "was the experience of a lifetime."
The celebration, being held in conjunction with Black History Month, will begin at 6:30 p.m. Saturday at Whispering Woods Hotel & Conference Center in Olive Branch. Organizers expect at least 300 people, and tickets are still available for $40 a person or $380 for a table of 10.
Judge Bernice Donald, a DeSoto County native, will address the crowd for about 15 minutes. Nominated by President Obama, she is the first African-American woman to sit on the U.S. Court of Appeals for the Sixth Circuit.
The celebration also will include a sit-down dinner, a silent auction to benefit the Susan G. Komen Foundation and musical entertainment. Each of the 20 honorees will be called up to receive a plaque as their biographies are projected on a screen for everyone to see.
The honorees were selected from 28 nominees. Nominations were received from area churches, organizations and associations, said Michael Smith, founder of the symposium organization. A committee of seven looked for applicants who had made a difference in their communities.
The committee looked for "plain folk," people Smith called "Unsung She-roes." Some worked quietly in their communities without recognition, like one who crochets gifts for patients in ICUs that she visits.
The women come from all over DeSoto County. They are educators, entrepreneurs, coaches, ministers and retirees, but two things united them, Smith said.
"Their passion was really helping people," Smith said, "And in all 20 of them, one of the underlying tenants is their strong faith. They all have strong faith."
For more information or to purchase tickets, telephone Smith at (901) 481-3968.
Subscribe to The Commercial Appeal
Need Help? Call us at 1-888-789-0831.
Monday-Friday: 6am-5pm / Saturday: 6:30am-11:30am / Sunday: 6am-1pm


text:
My Checkpoint firewall is configured to allow users to open the GUI (Smart Dashboard) only if their IP is on the allowed list. Whenever I work from home (I use the CheckPoint SNX client on an Ubuntu laptop to connect to the office VPN) - I get different IP's and so I'm unable to log into the CheckPoint GUI. I would like to bind a specific IP to the MAC address of my Windows virtual machine where the GUI is installed and add it to the allowed IP list for the CheckPoint GUI. How can it be configured if it's even possible?
Take the 2-minute tour ×
Server Fault is a question and answer site for system and network administrators. It's 100% free, no registration required.


text:
Ever want to learn more about the weather that comes through our area?
A storm spotter training class happening Thursday night in Siloam Springs may be just what you're looking for.
After a tornado ripped through an area of Siloam Springs last spring, the need for more storm spotters on the ground became obvious.
"Storm spotters are definitely a value to our community to be able to provide that information back to us live and real time," Lt. Bryan Austin, with the Siloam Springs Police Department and Emergency Management said.
Even with high-tech radar systems, it takes more trained eyes on the skies to relay what's really happening.
"The bigger network we can have, the more coverage we can provide and that's something that I look for as we look at the radar systems that we have. I need people out in the field to be able to confirm what it is that I think I'm seeing on the radar," he said.
A storm spotter class in Siloam Springs will cover identifying severe weather systems, cloud formations and rotation and even hail cells.
Lt. Austin expects some taking the class are just looking to learn more about weather, while others are hoping to serve the community.
"They're going to want to be a part of this program, so that they can get educated on what it is that they can do to provide that information back to us."
Even after a severe storm has passed, Siloam Springs and other communities can then use the spotters to asses damages to get the area back up and running faster and more efficiently
"Let us know where the trees are down, the power lines are down, if there's any water or gas lines that are broken, anything of that nature so that we can then send our city resources where they need to go to," Lt. Austin said.
So whether you want to be a spotter by choice or by trade, this class can be your first step toward the front line.
The class takes place at the Siloam Springs High School Seminar Room, Thursday, Jan. 23rd at 7pm.
No sign up is needed and all ages are invited to attend. The class is expected to last about an hour and a half.


text:
Complete this conversation with your own ideas.
You are Sally.
Ben: What shall we do tomorrow, Sally?
Sally: Maybe _____________________.
Ben: Oh no! I don't want to do that!
Sally: Well, we _____________________.
Ben: Good idea. But the weather might be bad!
Sally: OK. Shall ___________________?
Ben: Yes, we could do. Where shall we meet?
Sally: Why don't we _______________________.
Ben: Great! See you there! Oh - what time shall we meet?
Sally: Let's ________________________.
Ben: OK! See you tomorrow!
Sally: ________________.
Home > Beginner Course > 5. What shall we do tomorrow? >