Method and apparatus for implementing traceable electronic cash

Abstract: In a method for implementing traceable electronic cash, a user US sends a bank BK a product N of prime numbers P and Q, a prime number L and his real name ID U , and the bank BK generates a pseudonym I corresponding to the real name ID U and keeps the correspondence between the real name ID U and the pseudonym I secret. The bank BK uses a signature function Ω = D eB (N,L,I) to attach a signature to information composed of the above-mentioned N, L and I and sends the user US the signed information Ω as information containing a license. The user US authentication information X from the N and a random number R and sends the bank BK information Z obtained by performing blind signature preprocessing for information (X,B) with a function F eC and has the information Z signed by the bank BK with a signature function D eC (Z) to obtain electronic cash C. When the user US abuses the electronic cash C, the bank BK follows a court order to reveal the correspondence between the real name ID U and pseudo name of the user US and trace the electronic cash spent.

Description: The present invention relates to a method and apparatus for implementing electronic cash through utilization of an electrical communication system. Electronic cash will probably come into wide use with a smart card as an electronic wallet. It is desirable, in such an instance, that electronic cash be stored as information in the electronic wallet without depending on any physical medium. One possible approach to realizing electronic cash is to provide system security by physical means. The security protection of prepaid cards such as telephone cards is guaranteed mainly by difficulty in physically copying their magnetic records to other cards. However, recent scientific and technological advances have come to diminish or endanger the card security based on such a premise. Another disadvantage with this system is that electronic cash cannot be transferred as information over a communication line because it is always offered as a physical medium (magnetic card or the like). Another approach is a scheme that customers use electronic ID cards such as credit cards (electronic credit cards or electronic checks) and settle accounts later on. With the electronic credit cards, the introduction of a digital signature as a substitute for a handwritten one enables their processing to be entirely electronized (computerized), permitting the transfer of settlement information over a communication line. With this system, however, it is impossible to ensure user privacy; the same goes for current credit cards and checks). That is to say, financial institutions that issue credit cards and settle accounts can freely get purchase histories of users and shops can also learn their credit card numbers and signatures. The above-mentioned problems such as computerization of electronic cash, system security and user privacy could be solved by the combined use of a blind signature scheme (described in detail later) and an on-line check at the time of payment (a check that a shop makes an on-line inquiry at the management center as to double/unauthorized spending of the electronic cash information presented by the user). This solution is, however, impractical taking into account that the access to the management center from the shop for each user's purchase involves such issues as the processing time (the user's waiting time), communication costs and on-line processing costs and data base maintenance and management costs at the management center. Hence, off-line processing is desirable for the processing at the time of cash payment. There have been proposed electronic cash systems that permit off-line processing from the viewpoint of privacy protection, for example, in D. Chaum, A. Fiat and M. Naor, "Untraceable Electronic Cash," Advances in Cryptology-Crypt '88, Lecture Notes in Computer Science 403, pp. 319-327, Springer-verlag, Berlin (1988), T. Okamoto et al, "Disposable Zero-Knowledge Authentications and Their Applications to Untraceable Electronic Cash," Advances in Cryptology-Crypt '89, Lecture Notes in Computer Science 435, pp.481-496, Springer-Verlag, Berlin (1989) and Japanese Pat. Appln. No. 88838/90 entitled "Method and Apparatus for Implementing Electronic Cash." Now, a description will be given first of the blind signature scheme that is a basic technique for ensuring user privacy. The blind signature scheme has a signature attached by a signer to a document while keeping its contents secret. An RSA blind signature scheme is disclosed in US Patent No. 4,759,063 and D, Chaum, "Security without Identification: Transaction Systems to Make Big Brother Obsolete," Comm. Of the ACM, 28, 10, pp.1030-1044, and a blind signature scheme based on a zero knowledge interactive proof is described in T. Okamoto et al, "Divertible Zero-Knowledge Interactive Proofs and Commutative Random Self-Reducible," The Proc. Of Eurocrypt '89 (1989). The blind signature demandant (user) creates a blind message x by randomizing the document m with a random number r through blind signature preprocessing. The signer calculates a provisional signature y corresponding to the blind message x through the use of a private key. At this time, the document m has been randomized by the blind message x, and hence is kept secret from the signer. The user excludes the influence of the random number r from the provisional signature y through blind signature postprocessing to obtain a true signature y' to the document m and sends a pair of document m and signature y' to a verifier, who uses a signer's public key to make a check to see if y' is the signature to the document m. The verifier cannot learn the correspondence between the provisional and true signatures y and y'. Procedure for Blind Signature Let A represent a signer, U a signature demandant and e A public information of the signer A. Let F represent a function indicating a blind signature preprocessing algorithm, D a function indicating a multiple blind signature algorithm and G a function indicating a blind signature postprocessing algorithm. The signer A uses the signature function D eA to generate a provisional signature Ω = De A (F eA (m 1 ), ..., F eA (m k )) from information created by the user US through the use of the preprocessing function functions F eA , then the user US performs blind signature postprocessing G eA on the provisional signature Ω, thereby computing a true signature B = D eA (m 1 , ..., m k ) of the signer A for k messages m 1 , ..., m k . This procedure is executed by the signer A and the user US to create the multiple blind signature as described below. Step 1: The user US generates k blind messages x i ={F eA (m i )|i=1,2,...,k} from k messages {m i |i=1,2,...k} by the blind signature preprocessing F eA and sends the k blind messages to the signer A. In this instance, the respective blind messages x i =F eA (m i ) are calculated independently and the function F eA uses a random number to keep m i secret. Step 2: The signer A generates the provisional signature Ω = D eA (F eA (m 1 ), ..., F eA (m k )) from the k blind messages F eA (m 1 ), ..., F eA (m k ) and sends it to the user US. Step 3: The user US computes the true digital signature B = D eA (m 1 , ..., m k ) of the signer A corresponding to the messages m 1 , ..., m k by blind signature postprocessing using the function G eA . In the application of the RSA scheme to the blind signature, letting r i represent a random number and setting the blind message (blind signature preprocessing) x i , the provisional signature y and the blind signature postprocessing G eA as follows: x i = F eA (m i ) = r eA × m i mod n, Y = Ω = D eA (x 1 , ..., x k ) = Π 1≤i≤k (xi) dA mod n, G eA (y) = Ω/ (r 1 ×···×r k ) mod n, the signature y becomes as follows: Y = B = Π 1≤I≤k (m i ) dA mod n In this case, the verification V eA (m 1 , ..., m k , B) of the signature B for the messages m 1 , ..., m k is conducted depending on whether it satisfies the following equation: If the equation is satisfied, then an output OK is provided. In the above, (e A ,n) is a public key of the RSA scheme that the signer A uses, and letting P and Q represent large prime numbers, it satisfies the following equations: n = P × Q e A × d A ≡ 1 (mod L) where: L = LCM {(P-1), (Q-1)} Where L=LCM{a,b} represents the least common multiple of a and b and a≡b(mod n) indicates that (a-b) is a multiple of n. When P and Q are very large prime numbers, it is very difficult, in general, to obtain P and Q by factoring n. Accordingly, even if n is made public, P and Q can be kept secret. In the following description, d A will sometimes be expressed as 1/e A . The Chaum-Fiat-Naor scheme will be described below on the assumption that k > 1, and embodiments of the present invention on the assumption that k = 1. An example of the configuration of the RSA cryptography is described in Rivest, R.L. Et al, "A Method for Obtaining Digital Signatures and Public-Key Cryptosystems," Communications of the ACM, Vol. 21, No. 2, pp.120-126, (1978). Methods for constructing the blind signature scheme are disclosed in, for example, Chaum, D., "Blind Signature systems," US Patent No. 4,759,063 and Ohta, K. Et al, "Authentication system and Apparatus Therefor," US Patent No. 4,969,189. The user privacy can be guaranteed by the use of the blind signature solely on the user's own responsibility. That is, since the user adds and remove the random number r to and from the blind signature, no one can learn the correspondence between y=Ω and y'=B as long as the random number r is kept secret. However, t is pointed out in S. Von Solms and D. Naccache, "On Blind Signature and Perfect Crimes," Computers and Security, 11, pp.581-583 (1992) that there is a fear of the scheme being abused for perfect crimes of money laundering and kidnapping because the scheme can make the flow of money completely untraceable. Next, a description will be given of electronic cash issue processing between a bank and a customer, payment with electronic cash by the customer at a shop and settlement processing between the shop and the bank in the Chaum•Fiat•Na or scheme that is a typical electronic cash scheme. Processing for Issuing Electronic Cash A procedure will be described which the user US follows to have a bank BK issue electronic cash C. Now, let ID represent identification information of the user US and eA a public key for a digital signature of the bank BK corresponding to the amount of money (ten thousand yen, for instance) of electronic cash specified that the user US specifies. The user US gets the bank BK to issue electronic cash as described below. Step 1: The user US creates a predetermined random number a i (where i=1, ..., K) and then calculates x i and y i using a one-way function g made public as follows: x i = g(a i ) y i = g(a i (+)ID) where (+) indicates an exclusive-OR. Step 2: The user US calculates W i using a one-way function f made public and a blind signature preprocessing function F eA and present it to the bank BK. W i = F eA (f(x i ,y i ) Step 3: The bank BK selects K/2 subsets H+={i j } (where j=1,...,K/2 and 1≤i j ≤K) randomly among 1 to K and sends them as a disclosure request to the user US. For the brevity of description, let it be assumed that H={K/2+1,K/2+2,...,K} is designated as the disclosure request. A procedure for requesting the disclosure of K/2 subsets randomly selected from K subsets is called a cut-and-choose method. Step 4: Upon receiving the disclosure request from the bank BK, the user US discloses to the bank BK the requested K/2 random numbers a i and the random number a i used in the function F eA to calculate W i . Step 5: The bank BK verifies the validity of all of the disclosed K/2 groups and, if any one of the verifications fails, halts the subsequent processing. When all the verifications succeed, the bank BK performs the following procedure for i (where i=1,2,...K/2) which are not the object of disclosure. Step 6: The bank BK calculates and sends Ω to the user US. Ω = D eA (W 1 , ...,W K/2 ) Step 7: The user US calculates the electronic cash C from the data Ω received from the bank BK as follows: C = G eA (Ω) = D eA (f(x 1 , y 1 ), ..., f(x K/2 , y K/2 )) Payment with Electronic Cash Next, a description will be given of how the user US makes a payment to a shop SH with the electronic cash C issued from the bank BK. The following processing is carried out for each i (where i=1,2,...,K/2). Step 1: The user sends the electronic cash C to the shop SH. Step 2: The shop SH creates a random bit e i and sends it to the user US. Step 3: The user supplies the shop SH with a i and y i when e i =1 and x i and a i (+)ID when e i =0. Step 4: The shop SH uses the public key e A of the bank BK to check if the electronic cash C bears a correct signature for the messages f(x 1 ,y 1 ), ...., f(x K/2, y K/2 ). Settlement Finally, a description will be given of the settlement of an account between the shop SH and the bank BK. The shop SH presents to the bank BK a history H of communications conducted with the user US when he used the electronic cash C. The bank BK verifies the validity of the communication history H and, if it passes the verification, stores the history H and pays the money into the shop's account. Alternatively, the bank BK pays the money by some other means. When finding an unauthorized use of electronic cash, the bank BK searches the stored communication history for the data ai and a i (+)ID corresponding to the electronic cash and decides the identification information ID of the malicious adversary. According to the Chaum-Fiat-Naor scheme, the user US supplies the shop SH with the data ai or a i (+) ID depending on whether the random bit e i generated at the time of payment with the electronic cash is "1" or "0"; hence, when the user US uses the electronic cash C twice without proper authorization and i-th random bits e i sent to the shop SH first and second times differ, the data a i and a i (+)ID are passed to the bank BK, which can detect the user's identification information by calculating a i (+)(a i (+)ID)=ID from the data supplied thereto. Since the bank BK makes an inquiry about K/2 bits, the probability of failure in the detection of double spending of the cash C is 2 -K/1 . Usually, it is recommended that K=20 or so. Since the electronic cash system employing the afore-mentioned blind signature scheme can make the flow of electronic cash untraceable unconditionally, the privacy of the electronic cash user is guaranteed solely on his own responsibility. That is, since the user himself adds to and removes from the blind signature the random number r for randomization, there is no possibility that any one can learn the correspondence between the provisional and true signatures y and y' as long as the random number r is kept secret. As pointed out in the afore-mentioned literature by S. Von Solms and D. Naccahe, however, there is a fear that this scheme having such an unconditional anonymity feature could be abused for perfect crimes of money laundering and kidnapping because this system can make the flow of cash completely untraceable. The same goes for the electronic cash system described in the afore-mentioned US Patent No. 4,977,595. SUMMARY OF THE INVENTION It is therefore an object of the present invention to provide a method and apparatus for implementing electronic cash which, when there is a fear of money laundering or similar crime, makes the flow of information traceable under the supervision of an authoritative third party (a court, for instance) but, in ordinary cases, makes the flow of information untraceable as before to ensure privacy protection of users. This object is achieved by a method as claimed in claim 1 and an apparatus as claimed in claim 12, respectively. Preferred embodiments of the invention are subject-matter of the dependent claims. Further objects and attainments achieved by the present invention will be more readily understood from the following description of embodiments with reference to the drawings. BRIEF DESCRIPTION OF THE DRAWINGS Fig. 1 is a block diagram illustrating the basic configuration of the present invention; Fig. 2 is a block diagram showing license issue processing between a user and a bank; Fig. 3 is a block diagram showing electronic cash issue processing between the user and the bank; Fig. 4 is a block diagram showing processing for the payment with electronic cash between the user and a shop; Fig. 5 is a block diagram showing settlement processing between the shop and the bank; Fig. 6 is a block diagram showing another example of the license issue processing between the user and the bank; Fig. 7 is a block diagram illustrating the basic configuration of a third embodiment of the present invention; Fig. 8A shows a hirarchical structure table of usable monetary values defining the divisional use of electronic cash; Fig. 8B is a diagram for explaining an example of use of a node in Fig. 8A; Fig. 9 is a block diagram showing license issue processing between the user and the bank in Fig. 7; Fig. 10 is a block diagram showing electronic cash issue processing between the user and the bank in Fig. 7; Fig. 11 is a block diagram showing processing by the user for his payment to the shop with electronic cash in Fig. 7; Fig. 12 is a block diagram showing processing by the shop for the payment thereto between the user and the shop in Fig. 7; Fig. 13 is a block diagram showing settlement processing between the user and the bank in Fig. 7; Fig. 14 is a block diagram showing the processing by the user in a modification of the processing for the payment with electronic cash between the user and the shop in Figs. 11 and 12; Fig. 15 is a block diagram showing the processing by the shop in the modification of the processing for the payment with electronic cash between the user and the shop in Figs. 11 and 12; Fig. 16 is a block diagram showing the processing between the shop and the bank for the settlement of the payment with electronic cash in Figs. 14 and 15; Fig. 17 is a block diagram showing an example in which a trustee issues the license; Fig. 18 is a block diagram showing an example in which a plurality of departments of the trustee in Fig. 17 hold the correspondence of identification information ID with information N and pseudonym; and Fig. 19 is a block diagram illustrating an example of the trustee in which a plurality of departments are set up as independent trustees in Fig. 18. DESCRIPTION OF THE PREFERRED EMBODIMENTS An embodiment of the present invention will hereinafter be described. In Fig. 1 there is illustrated the basic configuration of the present invention, wherein the bank BK, the user US and the shop SH are interconnected via communication lines, for example, but they may also be interconnected via a smart card or the like on which information can be recorded. First Embodiment At the time of constructing the electronic cash system, the bank BK first generates a public key, for example, e B and a secret key, for example, d B and makes the key e B public. The public key e B is used by individual users to generate and verify a license when they join the electronic cash system. The user has the license B for the use of electronic cash issued by a trustee. In this embodiment, the bank BK serves also as a trustee that issues the license. Next, the bank BK generates a public key, for instance, e c and a secret key, for instance, d c for the generation and verification of electronic cash. The pair of keys (e c , d c ) differs with monetary values of coins, e.g. 100 yen, 500 yen, 1000 yen and 10000 yen. The bank BK holds signature generating algorithms D B and D C and makes public the public keys e B and e c corresponding to these signature algorithms. As the signature scheme, the conventional RSA digital signature scheme or some other blind signature schemes can be used. The public key e B is used to check the validity of the license that the bank BK issues and the public key e c is used to check the validity of electronic cash that the bank BK issues. The user US uses identification ID U such as the number of his bank account. License Issue Processing To begin with, the user has the license B issued by the bank BK when he opens an account at the bank BK, for instance. To be precise, the license is expressed by {B, (I,N,L)}, but for brevity, it will hereinafter be identified by B. The procedure for the user UR to have the license issued by the bank BK is such as described below (See Fig. 2). This procedure is one that each user US carries out only once when he opens an account at the bank BK. Step 1: The user US generates two large prime numbers P and Q by a prime generator 210 and calculates a composite number N (where N = P × Q) by a multiplier 211. Further, the user US selects a prime number L by the prime generator 210 and fixes it. Then the user US stores these numbers P, Q, N and L in a memory 20M. Step 2: The user US send the bank BK the identification information ID U together with the numbers N and L. Step 3: The bank BK checks the identity of the user US corresponding to the identification information ID U by some means. When the identity is verified, the bank BK generates the pseudonym I by a pseudonym generator 110 and manages the correspondence between the identification information (real name) ID U and the pseudonym I in secrecy through the use of a correspondence table 11T. Step 4: The bank BK generates the following signature information Ψ by a D eB calculator 112 which executes a signature generation algorithm represented by the function D eB and sends the signature information Ψ and the pseudonym I to the user US. Ψ = D eB (N,L,I) = g(N∥L∥I) dB mod n B where the symbol ∥ represents a concatenation. Step 5: The user US stores the received signature information Ψ intact in the memory 20M as the license B in this example, together with the pseudonym I. Step 6: The user US reads out data (I,P,Q,L) from the memory 20M and provides it to a radical root calculator 212 to calculate the secret information S given below and stores it in the memory 20M. S = I 1/L mod N With this, the procedure for issuing the license ends. In this example, the prime L may be assigned a unique value that is generated by the user US, or a value that is common throughout the electronic cash system. In the latter case, the prime L needs only to be held in a ROM not shown and is not stored in the memory 20M. When the data exchange for the issuance of the license is carried out over a communication line, encryption processing may preferably be used in combination. It is better to generate the pseudonym I by inputting information such as a request time, an expiration date and a consecutive number into the pseudonym generator 110 as a one-way function. Since the secret to use information S in step 6 is information that is needed to use electronic cash, it need not be calculated here but may also be calculated in the electronic cash payment procedure described later on. Electronic Cash Issue Processing Next, a description will be given of the procedure which the user US follows to have the electronic cash C issued by the bank BK. Here, as referred to previously, e c is the public key for a digital signature of the bank BK that corresponds to the monetary value (10,000 yen, for instance) which the user US specifies. To be precise, the electronic is expressed by (C, X), but for brevity, it will hereinafter be identified by C. The procedure for the user US to have the bank BK issue the electronic cash C is such as described below (see Fig. 3). In this instance, the user US generates verification information X based on a random number R and gets the bank BK to issue electronic cash by attaching its signature to information that combines the information X with the license B; the signature is implemented by the afore-mentioned blind signature scheme. Step 1: The user US generates the random number R by a random generator 220, then stores it in the memory 20M and uses the random number and the component (N, L) of the license B to calculate by a modular exponential calculator 221 the verification information X given by the following equation: X = R L mod N Further, the user US calculates Z = F eC (X, B) by an F eC calculator 222 from the license B and the verification information X read out of the memory 20M, that is, the user US performs blind signature preprocessing, and sends the bank BK the information Z together with the identification information ID U (only when needed) and a desired monetary value information (10,000 yen, for instance) of the electronic cash. Step 2: The bank BK uses the secret key d C corresponding to the monetary value of the electronic cash to calculate by a D eC calculator 120 Θ = D eC (Z) that is, the bank BK adds a provisional signature to the received information Z and sends it to the user US. At the same time, the bank BK withdraws the requested amount of money from the user's account or receives the amount due from the user US by some means. Incidentally, this embodiment does not involves the conventional cut-and-choose test before the bank BK attaches the provisional signature to the information Z. Step 3: The user US calculates the electronic cash C of his specified monetary value by a G eC calculator 223, that is, the suer US performs blind signature postprocessing to obtain the electronic cash C. C= G eC (Θ) While the bank BK that issues the license in Fig. 2 has been described to issue the electronic cash as well in Fig. 3, the user's privacy protection and the security of electronic cash could be enhanced by issuing the electronic cash in Fig. 3 from another bank or trustee. Payment by Electronic Cash The user US executes the following steps when he makes a payment to the shop SH by the electronic cash C issued from the bank BK (see Fig. 4). Step 1: The user US sends data (N,L,I,B,X,C) to the shop SH. Step 2: The shop SH checks the validity of the license B for data (N,L,I) by a V eB calculator to see if the license B satisfies V eB ((N,L,I), B) = OK, or B eB mod N = (N∥L∥I) that is, to see if the license B serves as a signature for each pieces of data N, L and I. Besides, the shop SH checks the validity of the electronic cash C for data (X, B) by a V eC calculator 311 to see if the electronic cash C satisfies V eC ((X, B) C) = OK, or C eC mod N = (X∥B) that is, to see if the electronic cash C is usable under the license B. When the license B and the electronic cash C are both valid, the shop SH generates a inquiry E∈Z L = {0,1,...,L-1} by a inquiry generator 312 and sends it to the user US. If the license B and the electronic cash C are not valid, the shop SH halts this protocol. Step 3: The user US responds to the inquiry from the shop SH to read out the secret information S and (N, R) from the memory 20M, then provides them to a modular exponential calculator 231 and calculates therein a response Y and sends it to the shop SH. Y = R·S E mod N Step 4: The shop SH calculates X·I E (mod N) by a modular exponential calculator 313 and Y L mod N by another modular exponential calculator 314 and compares the calculated results by a comparator 315. In other words, the shop SH makes a check to see whether they satisfy the following relationship. YL = X·I E (mod N) The secret information S in the response Y expressed by Eq. (9) is given by Eq. (2), so if the relationship of Eq. (10) is satisfied, the shop SH accepts the electronic cash C at a value of 10,000 yen on the assumption that the electronic cash C is correct. In the above electronic cash payment protocol, steps 2 and 3 may be adapted to exclude a possibility that the user US and the shop SH conspire with each other to make the bank BK deposit an undue amount of money. That is, in step 2, the shop SH generates a random number d and sends the user US its identification information ID S time t and the random number d in place of E, while at the same time the shop SH calculates E by E=f(ID S ,t,d). Where f is a one-way function. In step 3, the user US also calculates E by E=f(ID S ,t,d). Settlement Finally, a description will be given of the settlement between the shop SH and the bank BK (see Fig. 5). The shop SH presents to the bank BK the entire history H of communications (i,e. interactions) made with the user US when the latter used the electronic cash, that is, (N,L,I,B,X,C), E and Y. The bank Bk checks the validity of the communication history H, that is, checks it to see if Eqs. (7) and (8) both hold, and if the history H is valid, the bank BK will store it and pay the amount due in the account of the shop SH (or pays the amount due to the shop SH by some means). When detecting an unauthorized used of electronic cash, the bank BK will find the identification information ID of the malicious adversary on the basis of the correspondence between the pseudonym I and the identification information ID. The above procedure from the issuance of electronic cash to the settlement, except the issuance of the license, is substantially the same as in the case of processing user information V i as the afore-mentioned pseudonym I in the scheme described in the second embodiment in US Patent No. 4,977,595 referred to previously. Hence, the scheme for providing increased reliability, disclosed in the above-said US patent is also applicable to the present invention. Second Embodiment A description will be given of an embodiment in which a plurality of electronic cash processing functions of the bank BK are carried out by different departments. In this embodiment, the bank BK is divided into a department 101 for recognizing the user's identity and a department 102 for issuing the license as shown in Fig. 6. Association or correlation information α is newly introduced between the departments 101 and 102. The department 101 manages the correspondence between the user's identification information (hereinafter referred to also as the real name) ID and the association information α, whereas the department 102 manages the correspondence between the association information α and the pseudonym I. Only when the two departments 101 and 102 cooperate with each other, the association information α can be used as the key to obtain the correspondence between the pseudonym I and the real name ID. No description will be given of the case of dividing the bank BK into three or more departments, because it could be accomplished simply by newly adding association information (α, β, γ, ...). Since this embodiment differs from Embodiment 1 in the license issuing procedure alone, this embodiment will be described only in connection with the procedure concerning the license issuance. It is assumed in this case that the parameter L is unique in the system. The department 102 of the bank BK holds a signature generating algorithm D B . The bank BK makes public the public key e B corresponding to the signature scheme. The public key e B is used to check the validity of the license issued by the bank BK. The suer US uses the number of the account at the bank or the like as his identification information ID U . The association information α is used between the departments 101 and 102. License Issue Processing In the first place, the user US has the license B issued from the bank BK when the former opens his account at the latter, for instance. To be precise, the license is expressed by (B,{I,N}) but for brevity, the license will hereinafter be identified by B. The procedure that the user US follows to have the license B issued from the bank BK is such as described below (see Fig. 6). This procedure is one that each user US executes only once when he opens his account at the bank BK. Step 1: The suer US generates the two large prime numbers P and Q by the prime generator 210, then calculates the composite number N (where N=P×Q) by the multiplier 211 and stores the numbers P, Q and N in the memory 20M. Step 2: The user US calculates N'=F eB (N) by an F eB calculator 213 and sends ID U and N' to the department 102 of the bank BK. Step 3: The department 101 of the bank BK confirms the identity of the user US by some means and, if it is valid, generates the association information α by an association information generator 113 and manages the correspondence between the real name ID U and the association information α in secrecy on a correspondence table 11T 1 and supplies the department 1-2 with the information α and N'. Step 4: The department 102 generates pseudonym information I by the pseudonym generator 110 and manages the correspondence between the association information α and the pseudonym I in secrecy on a correspondence table 11T 2 . Step 5: The department 102 calculates the following data Ψ by the DeB calculator 112 and sends the user US the data Ψ and the pseudonym I. Ψ = D eB (N' × I) Step 6: The user, US hands the data Ψ received from the bank BK over to a G eB calculator 214 to calculate the license B with B=G eB (Ψ) and stores it in the memory 20M together with the pseudonym I. Step 7: The user US hands data (I, P, Q) read out of the memory 20M over to the radical root calculator 212 to calculate the secret information S that satisfies the following equation and stores it in the memory 20M. S = I 1/L mod N It must be noted here that the signature B satisfies V eB (N×I, B)=OK. When the above data exchange is carried out over a communication line, it may preferably be combined with encryption. It is better to generate the pseudonym I by inputting information such as a request time, an expiration date and a consecutive number into the pseudonym generator 110 as a one-way function. Although the first and second embodiments have been described to hold the identification information ID U and the pseudonym I of the user US on the correspondence table 11T in correspondence with each other, the principle of the present invention is to exclude the user's identification information ID U from the object for the signature of the bank BK by the D eB calculator 112 and hold the correspondence between the object for signature and the identification information ID U on the correspondence table 11T. Accordingly, the information that is held on the correspondence table 11T may be the correspondence between the identification information ID U and the composite number N in place of the correspondence between the identification information. ID U and the pseudonym I. Third Embodiment Turning now to Fig. 7, the present invention will be described as being applied to a divisible electronic cash scheme disclosed in US Patent No. 5,224,162. This embodiment also use the same principle as does the first embodiment. The bank BK complies with the request of the user US to generate the pseudonym I corresponding to the identification information ID U and holds their correspondence in secrecy on the correspondence table and uses the pseudonym I to issue the license. Thereafter, the bank BK issues electronic cash of a certain monetary value to the user US in response to his request. The user US is allowed to repeatedly use the electronic cash for payment to third parties, e.g. shops SH until its face value is reached. Finally, each shop settles its account at the bank BK for each payment by the user US. Also in this embodiment, the correspondence between the identification information ID U and the composite number N may be held on the correspondence table in place of the correspondence between the identification information ID U and the pseudonym I. The bank BK holds signature generating algorithms D B and D C . As shown in Fig. 7, the bank BK makes public two public keys e B and e C that are used in the signature procedure which is executed for the issuance of the license and for the issuance of electronic cash. This embodiment will be described to employ the conventional RAS digital signature scheme. The public key e B is used to verify the validity of the license that is issued by the bank BK, and the public key e C is used to check the validity of the electronic cash that is issued by the bank BK. The user US uses his identification information ID U such as the number of his account at the bank BK. For example, in the case of using the RSA digital signature as information corresponding to the license, the bank BK prepares a pair of secret and public keys (d A , n A ) and (e A , n A ) and, for the verification of the validity of the license, keeps the key (e A , n A ) public as the above-mentioned public key eB and holds the secret key (d A , n A ) as the above-mentioned secret key d B . Further, when the bank BK uses the RSA digital signal as information corresponding to the monetary value of the electronic cash, the bank BK prepares a pair of secret and public keys (d' A , n' A ) and (e' A , n' A ) and, for the verification of the electronic cash, keeps the key (e' A , n' A ) public as the above-mentioned public key e C together with the monetary value assigned to the electronic cash. In the following embodiments, the signature generating algorithm DB for the license is set as follows: D B (x) = x dA mod n A The signature generating algorithm D C for electronic cash is set as follows: D C (x) = x d'A mod n' A The blind signature preprocessing function F e is set as follows: x = F e (m) = r eA × m mod n where r is a random number for randomization. The blind signature postprocessing function G e is set as follows: G e (Ψ) = Ψ/r mod n In this embodiment, a tree-structured table, called a hierarchical structure table used in the afore-mentioned US patent No. 5,224,162, is introduced for efficiently realization of divisibility (that electronic cash once issued can be repeatedly used until the monetary value assigned thereto is reached). The bank BK determines a one-way function g and three random functions f Γ , f Λ and f Ω and makes them public. These three functions are used to determine the value of each node of the hierarchical structure table (Γ table and Λ table). The hierarchical structure table is determined corresponding to the monetary value of electronic cash and the minimum divisible unit value (e.g. 1 yen). In Figs. 8A and 8B there are shown hierarchical structure tables for using electronic cash worth 100 yen in units of 25 yen. For example, in the case of spending 75 yen, the nodes concerned are a node "00" (worth 50 yen) and a node "010" (worth 25 yen). The nodes concerned are determined under the rules mentioned below. (a) The monetary value or denomination of each node is the sum total of monetary values assigned to its immediate descendant nodes. (b) when a node is used, all of its ancestor and descendant nodes cannot be used. (c) No node can be used more than once. Under these rules, it is only a mode "011" (worth 25 yen) that can be used after the nodes "00" and "010" are used. That is, under the above-said rules, the total amount of money that can be spent is 200 yen at face value and the electronic cash can be spent as desired in units of 25 yen. The hierarchical structure table increases its level with an increase in the face value of the electronic cash and with a decrease in the minimum divisible unit value. For example, in the case of electronic cash that has a face value of 1 million yen and can be used in units of 1 yen, the number of levels is around 20 (log 2 1,000,000≒20). Now, let it be assumed that the Γ table has t or more levels and that the node corresponding to the amount of money paid by the user US at the shop SH is Γ j1...jt (and Λ ji...jt ), where j 1 , ..., j t ∈{0,1}. While two or more nodes usually corresponds to the amount of money paid for each transaction (two nodes correspond to the payment of 75 yen in the above example), the following description will be made of the payment processing for a single node, because the payment processing for plural nodes is a mere parallel execution of the payment processing for the single node. The following is a list of definitions that are used in the procedures described hereinafter. such that y 2 t = x mod N, where y is a quadratic residue (1≤t). such that y' 2 t = x mod N, (y'/N) = 1 and 0<y'<N/2 (1≤t). such that y" 2 t = x mod N, (y"/N) = -1 and 0<y"<N/2 (1≤t). 〈z〉 QR = dz mod N such that d ∈{±1, ±2} where dz mod N is a quadratic residue. 〈z〉 1 = d'z mod N such that d'∈{1,2} and (d'z/N) = 1. 〈z〉 -1 = d"z mod N such that d" ∈ {1,2} and (d"z/N) = -1. In the above, (a/b) represents a Jacobi symbol. A method for calculating the Jacobi's symbol is described in, for example, Fujisaki, Morita and Yamamoto, "Take-Off for Number Theory (Special issue for seminar in mathematics)," Nippon Hyohron-sha. License Issue Processing To begin with, the user US has the license B issued by the bank BK. The procedure for this is basically identical with the procedure in the first embodiment shown in Fig. 2, but in this example, the prime number L is not used. Hence, the license is expressed by {B,(I,N)}, but for brevity, it will hereinafter be identified by B. Further, this embodiment does not use the user's secret information S used in the first embodiment during the use of electronic cash. The procedure for the user UR to have the license issued by the bank BK is such as described below (See Fig. 9). This procedure is one that each user US carries out only once when he opens an account at the bank BK. Step 1: The user US generates, by the prime generator 210, two large prime numbers P and Q that satisfy conditions P ≡ 3(mod 8) and Q ≡ 7(mod 8) and calculates a composite number N (where N=P×Q) of these prime numbers by the multiplier 211. Then the user US stores these numbers P, Q, and N in the memory 20M. Step 2: The user US sends the bank BK his identification information ID U and the composite number N. Step 3: The bank BK checks the identity of the user US by some means. When the identity is verified, the bank BK generates the pseudonym I by the pseudonym generator 110 and stores the correspondence between the identification information (real name) ID U and the pseudonym I (or N) on the correspondence table 11T and holds it secret. Step 4: The bank BK generates the following signature Ψ by the D eB calculator 112 and sends the signature Ψ and the pseudonym I to the user US. Ψ = D eB (N,I) = g(N∥I) dB mod n B Step 5: The user US stores the received data Ψ in the memory 20M as the license B, together with the pseudonym I. When the data exchange between the user US and the bank BK is carried out over a communication line, encryption processing may preferably be used in combination. It is better to generate the pseudonym I by inputting information such as a request time, an expiration date and a consecutive number into the pseudonym generator 110 as a one-way function. Electronic Cash Issue Processing Next, a description will be given of the procedure which the user US follows to have the electronic cash C issued by the bank BK. Here, e c is the public key for the digital signature of the bank BK that corresponds to the monetary value (10,000 yen, for instance) which the user US specifies. To be precise, the electronic cash is expressed by (C,b, B), but for brevity, it will hereinafter be the identified by C. The procedure for the user US to have the bank BK issue the electronic cash C is such as described below (see Fig. 10). Step 1: The user US generates random numbers b and r by the random generator 220, then stores the random number b in the memory 20M, while at the same time he calculates g(B∥b) by a one-way function g calculator 221 from the random number b and the license B read out of the memory 20M. Further, the user US calculates Z = F eC (g(B∥b)) = r eC g(B∥b)mod n C by the F eC calculator 222 and sends the bank BK the information Z together with the identification information ID U (only when needed) and monetary value information A (10,000 yen, for instance) of the electronic cash. Step 2: The bank BK uses the secret key d c corresponding to the monetary value A of the electronic cash to calculate by the D eC calculator 120 Θ = D eC (Z) = Z eC mod n C and sends it to the user US. At the same time, the bank BK withdraws the requested amount of money A from the user's account or receives the amount due from the user US by some means. Step 3: The user US calculates the electronic cash C of his specified monetary value A by the G eC calculator 223. C= G eC (Θ) = Θ/r mod n C Payment by Electronic Cash As described below, the user make a payment to the shop SH by the electronic cash C issued from the bank BK (see Figs. 11 and 12). Step 1: In the first place, the user US calculates the following equation by a Γ calculator 236 from the pieces of data C, N, P and Q read out of the memory 20M, that is, calculates f Γ (C∥O∥N), and uses the prime numbers P and Q to make a ±1 or ±2 correction of this value, thereby obtaining a quadratic residue Γ O to modules N. Γ O = 〈f Γ (C∥O∥N)〉 QR Next, the user US inputs the electronic cash C and the nodes j 1 ···j q corresponding to the amount of money spent, into an Ω calculator 237 to generate Ω j1···jq (where q=1, ···, t). Further, the user US calculates the j q+1 -th power of Ω j1 ... jq (where q=1, ..., t) by a power calculator 232, then conducts a modular multiplication of the above power and the quadratic residue Γ 0 to modules N by a modular multiplier 233 and uses the prime numbers P and Q to calculate, by a radical root calculator 234, a 1/2 t -th root of the multiplied result to modules N, that is, the radical root X of the node value j 1 ...j t corresponding to the amount of money spent A. Step 2: The user US sends the shop SH the pieces of data I, N, X, B, b, C read out of the memory 20M and the node value j 1 ,...j t . Step 3: The shop SH checks the validity of the signature B for the data (I,N) by a V eB calculator 310 to see if the signature B satisfies V eB ((N,I), B) = OK, i.e. BeB mod N = (N∥I) that is, to see if the signature B serves as a signature for the data (N,I). Besides, the shop SH checks the validity of the signature B for data (B,b) by the V eC calculator 311 to see if the electronic cash C satisfies V eC (g(B∥b), C) = OK, or C eC mod N= (B∥b) that is, to see if the electronic cash C is usable under the license B. If the license B and the electronic cash C are not valid, the shop SH halts this protocol. Step 4: The shop SH uses a Jacobi symbol calculator 333 and a comparator 334 to check to see if X satisfies the following relationship. If not, the shop SH halts this procedure. (X/N) = -1 Next, the shop SH calculates f Γ (C∥O∥N) by a Γ calculator 322 from C and N. Further, the shop SH calculates Ω j1...jq (where q=1, ...,t) by an Ω calculator 316 from C, j 1 ...j q and N. The calculated result is raised by a power calculator 318 to a power to obtain Ω 2j ji...jq . Further, a modular multiplication of the output f Γ (C∥O∥N) from the Γ calculator 322 and the output from the power calculator 318 is carried out by a modular multiplier 319. On the other hand, a 2 t -th power of the root X is obtained by a power calculator 317, then the output therefrom is applied to a modular divider 320, wherein it is divided by the output from the modular multiplier 319, and the divided output is compared with ±1 and ±2 in a comparator 321, thereby checking to see if X satisfies the following relation. If not, the shop SH halts this procedure. X 2 t ≡ dΩ 2 t-1 j t j 1 ···j t-1 Ω 2 t-2 j t-1 j 1 ···j t-2 ···Ω 2j 2 j 1 f Γ (C∥O∥N)(mod N) where d represents either ±1 or ±2. Step 5: When the verification succeeds, the shop SH chooses a inquiry value Ei∈{0,1} (where i=1, ..., K') by an inquiry generator 312 and sends it to the user US. Step 6: The user US calculates Λ i (where i=1,...,K') from C,i.j 1 ···j t ,N,P,Q by the following equation through the use of a Λ calculator 235. That is, the user US uses the prime numbers P and Q to make either the ±1 or ±2 correction to f Λ (), thereby obtain a quadratic residue Λ i on the composite number N. Λ i = 〈f Λ (C∥j t ∥···∥i∥N)〉 QR Where: i=1,...,K' Next, the user US uses the prime numbers P and Q to conduct the following calculation by a root calculator 231 and sends its result Y i to the shop SH. Y i = [Λ i 1/2 mod N] (-1) Ei Step 7: The shop SH uses a Jacobi symbol calculator 323 and a comparator 324 to make a check to see if Y i satisfies the following relation. If this verification fails, the shop SH halts this procedure. (Y i /N) = (-1) Ei The shop SH inputs information C,i,j 1 ...j t ,N into a Λ calculator 325, raises Y i by a power calculator 326 to Y i 2 , conducts a modular division of Y i 2 by the output from the Λ calculator 325 in a modular divider 327 and compares the divided output d' with ± 1 and ± 2 in a comparator 328, thereby checking whether the following relation is satisfied. where: 1=1,...,K'. In the above, d' represents the value of either one of ± 1 and ± 2. when this verification succeeds, the shop SH accepts the payment of the amount corresponding to the nodes j 1 ...j t by the user US on the assumption that the payment is valid. In the above electronic cash payment protocol, the inquiry E i from the shop SH to the user US via the inquiry generator 312 may be fortified as mentioned below so as to exclude a possibility of a conspiracy between the user US and the shop SH to abuse the electronic cash system. That is, the shop SH generates a random number E i ' and sends it as a substitute for E i to the user US together with the identification information ID S of the shop SH and temporal information T. The shop SH and the user US both calculate E i =h(ID S ∥T∥E i '), where h is a one-way function. Settlement Finally, a description will be given of the settlement between the shop SH and the bank BK (see Fig. 13). The shop SH presents to the bank BK the entire history of communications H = {I,N,X,B,b,C,j 1 ...j t ,E i ,Y i (where i= 1,...,K')} held with the user US when the latter used the electronic cash. The bank Bk checks the validity of the communication history H, and if the history H is valid, the bank BK will store it and pay the amount due in the account of the shop SH (or pays the amount due to the shop SH by some means). When detecting an unauthorized use of electronic cash, the bank BK obtains the pseudonym I (or composite number N) from the communication history H and is allowed to learn the correspondence between the pseudonym I (or composite number N) by permission of a third party (a court, for instance), by which it is possible to identify the malicious adversary. In the above, the user US cannot use twice any nodes of the hierarchical structure table for the reason given below. The information E i is selected randomly from {0,1} (where i=1,...,K'), so if the user US commits double spending of any one of the nodes, the bank BK is capable of factoring N on the basis of H with a probability 1-(1/2) K' , by which it is possible for the bank BK to obtain the secret information P,Q of the user. The bank BK uses the prime factors P and Q of the composite number N as proof of the unauthorized use. It must be noted here that only the user US knows the secret information P,Q. Thus, the secret information can be used as proof of double spending to impose a penalty on the user US. Once the user US uses a certain node of the hierarchical structure table, he can no longer use any ancestor and descendant nodes. This will be described with reference to the hierarchical structure table of Fig. 8B for the sake of brevity. When the user US uses a node "00," he sends the shop SH (ultimately the bank BK) the following information X 00 . X 00 = [Γ 1/2 00 mod N] -1 Γ 1/2 00 If the user US uses a descendant node "000" afterward, he is required to send the shop SH the following information X 000 . X 000 = [Γ 1/2 000 mod N] -1 At this time, since [Γ 1/2 00 mod N] -1 = X 2 000 mod N, the bank BK can use the pieces of information X 00 and X 000 to factor N, by which it is possible to calculate the secret information P,Q of the user US. Similarly, if the use of the node "00" is followed by the use of its ancestor node "0" or descendant node "001," the bank BK can get the secret information P,Q of the user US. Incidentally, in the above embodiment,t the correspondence between the real name and pseudonym of the user US is detected by the bank BK, but as described previously with respect to Fig. 6, the bank BK may also be divided into two or more departments so that the correspondence between the real name and the pseudonym could be detected only when the departments cooperate. While in the above the signature Ψ has been described to be used intact as the license B, it may also be subjected to some processing for use as the license B. Fourth Embodiment In Figs. 14 and 15 there are illustrated the configurations of the user US and the bank BK improved to reduce the amount of information that is transferred between them shown in Figs. 11 and 12 when the user US spends the electronic cash in the third embodiment depicted in Figs. 7 to 13. The procedure for the payment by the electronic cash is also illustrated. Step 1: The user US first calculates f Γ (C∥O∥N) by the Γ calculator 236 on the basis of the information C, N, P, Q read out of the memory 20M, then uses the prime numbers P and Q to make a ±1 or ±2 correction of the calculated value and calculates a quadratic residue Γ 0 to modules N by Eq. (16) mentioned previously. Next, the user US inputs the electronic cash C, the node j 1 ...j q corresponding to the amount of money spent and the composite number N into the Ω calculator 237 to generate Ω j 1 ···j q (where q=1, ..., t) by the afore-mentioned Eq. (17). Further, the user US calculates the j q+1 -th power of Ω j1 ... jq (where q=1,...,t) by the power calculator 232, then conducts a modular multiplication of the above power and the quadratic residue Γ 0 to modules N by the modular multiplier 233 and uses the prime numbers P and Q to calculate, in a radical root calculator 234 by the afore-mentioned Eq. (18), a 1/2 t -th root of the multiplied result to modules N, that is, the radical root X of the node value j 1 ...j t corresponding to the amount of money spent A. Step 2: The user US sends the shop SH the information I,N X,B b,C read out of the memory 20M and the node value j 1 ,... jt corresponding to the amount of money A. Step 3: The shop SH checks the validity of the signature B to the information (I,N) by the V eB calculator 310 to see if the signature B satisfies the afore-mentioned Eq. (19), that is, to see if the signature B serves as a signature to the data (N,I). Besides, the shop SH checks the validity of the signature B to the information (B,b) by the g calculator 331 and the V eC calculator 332 to see if the electronic cash C satisfies the afore-mentioned Eq. (20), that is, to see if the electronic cash C is usable under the license B. If the license B and the electronic cash C are not valid, the shop SH halts this procedure. Step 4: The shop SH uses the Jacobi symbol calculator 333 and the comparator 334 to make a check to see if X satisfies the relationship (X/N)=-1. If not, the shop SH halts this procedure. Next, the shop SH calculates f Γ (C∥O∥N) by the Γ calculator 322 from C and N. Further, the shop SH calculates Ω j1...jq (where q=1, ..., t) from C, j 1 ...j q and N by the afore-mentioned Eq. (21) in the Ω calculator 316. The shop SH inputs the calculated result into the power calculator 318 to obtain Ω 2j ji...jq . Further, the shop SH carries out a modular multiplication of the output f Γ (C∥O∥N) from the Γ calculator 322 and the output from the power calculator 318 by the multiplier 319. On the other hand, the shop SH calculates the 2 t -th power of X by the power calculator 317, then applies the output therefrom to the modular divider 320 for division by the output from the modular multiplier 319, and compares the divided output with ± 1 and ± 2 in the comparator 321, thereby checking to see if X satisfies the relation of the afore-mentioned Eq. (22). If not, the shop SH halts this procedure. The steps 1 to 4 so far are exactly the same as those 1 to 4 described previously with respect to Figs. 11 and 12. In the modified embodiment of Figs. 14 and 15, the subsequent steps 5 to 7 are improved to reduce the amount of information to be transferred between the user US and the shop S but their basic procedures are the same as in steps 5 to 7 described with respect to Figs. 11 and 12. Step 5: When the validity of the signature of the bank BK to the license B and the usability of the electronic cash C pass the verification in step 4, the shop SH randomly chooses an inquiry value E∈Z u ={0, 1, 2, ..., u-1} (where u is a security parameter) by the inquiry generator 312 and sends it to the user US. Step 6: The user US uses the information {C,j 1 ...j t ,N, P,Q} read out of the memory 20M to calculate Λ j1...jt by the Λ calculator 235. That is, the user US uses the prime numbers P and Q to make either the ±1 or ±2 correction to f Λ (), thereby obtaining a quadratic residue Λ j1...jt on the composite number N. Next, the user US calculates, by the modular multiplier 238 and the root calculator 231, a response Y j1...jt from the information N, P, Q, Λ j1...jt and the inquiry E from the shop SH and sends it to the shop SH. Step 7: The shop SH makes a check to see if the response Y j1...jt satisfies the following relation by the Yacobi calculator 323 and the comparator 324. If this verification fails, the shop SH halts this procedure. (Y j1...jt /N) = 1 The shop SH inputs information C,i,j 1 ...j t ,N into the Λ calculator 325, provides the output therefrom and information E, N to the modular multiplier 327, inputs the response Y j1...jt and the information N into the power calculator 326, divides the outputs from the power calculator 326 by the output from the modular multiplier 327 in the modular divider 328 and compares the divided output with ± 1 and ± 2 by the comparator 329, thereby checking to see if the following relation is satisfied. In the above, d' represents the value of either one of ± 1 and ± 2. When this verification succeeds, the shop SH accepts the payment of the amount corresponding to the nodes j 1 ...j t by the user US on the assumption that the payment is valid. In the above electronic cash payment procedure, as is the case with Figs. 11 and 12, the inquiry E from the shop SH to the user US via the inquiry generator 312 may be fortified as mentioned below so as to exclude a possibility that the user US conspires with the shop SH to abuse the electronic cash system. That is, the shop SH generates a random number E' and sends it as a substitute for E to the user US together with the identification information ID S of the shop SH and temporal information T. The shop SH and the user US both calculate E=h(ID S ∥T∥E'), where h is a one-way function. The settlement between the shop SH and the bank BK shown in Fig. 16 is also basically identical with the settlement depicted in Fig. 13. The shop SH presents to the bank BK the history of communication H={I,N,X,B,b,C,j 1 ...j t ,E,Y} held with the user US when he used the electronic cash C. The bank BK checks the validity of the history H and, if it passes the verification, stores it and deposits the amount due in the account of the shop SH (or pays the amount due to the shop SH by some other means). In the event that the bank BK detects an authorized use of electronic cash, the bank BK calculates the pseudonym I (or composite number N) from the communication history H and is allowed to learn the identification information ID corresponding to the pseudonym I (or N) with the permission of a third party (a court, for instance), and hence can identify the malicious adversary. Also in the embodiment illustrated in Figs. 14, 15 and 16, the user US are not allowed to use twice any nodes of the hierarchical structure table for the reasons given below. The information E is selected randomly from Z u ={0, 1,...,u-1}, so if the user US commits double spending of any one of the nodes, the bank BK is capable of factoring N on the basis of H with a probability (1-1/u), by which it is possible for the bank BK to obtain the secret information P,Q of the user US. The bank BK uses the prime numbers P and Q of the composite number N as proof of the unauthorized use (only the user US knows the secret information P and Q. Thus, the secret information can be used as proof of double spending to impose a penalty on the user US. As described previously, in the embodiment of Figs. 11 and 12, it is necessary for the user US to generate K' responses Y i in response to the K' inquires E' from the shop SH and sends them to the shop SH. In contrast to this, in the modified embodiment of Figs. 14 and 15, the shop SH randomly selects one inquiry E and sends it to the user US, who needs only to generate and sends one response Y j1 ... jt to the shop SH in response to the inquiry E from the latter--this permits reduction of the amount of information to be exchanged between them. Further, the amount of information of the communication history H that is sent to the bank BK is also reduced, and hence the storage capacity for storing the communication history H by the bank BK is also decreased accordingly. For example, according to the Chaum·Fiat·Naor scheme, the shop is supposed to the bank BK the following K/2=10 sets of signature data as part of the communication history H that the bank BK needs to store for the detection of double spending. (A i ,y i ) or (a i (+)ID,x i ) where i=1,...,K/2. The signature data has a size of 1280 bits. In contrast to this, the embodiment of Figs. 14 and 15 requires only one piece of signature data Y j1...jt be transferred from the shop SH to the bank BK. The amount of information of the communication history H to be stored by the bank BK is only 512 bits, less than 1/2 the amount of information in the Chaum-Fiat-Naor scheme. Although in the first to fourth embodiments the bank BK has been described to issue the electronic cash C as well as the license to the user US, it is also possible to employ a system configuration in which, for example, a trustee different from the bank BK issues the license B and the bank BK issues electronic cash and makes the settlement of payment by the electronic cash. For example, in the first embodiment the bank BK issues the license B as information Ψ as shown in Fig. 2, but a trustee 40T issues it as shown in Fig. 17. The processing facilities and configurations of the user US and the trustee 40T are exactly the same as the configurations of the user US and the bank BK depicted in Fig. 2, and hence they are not shown in Fig. 17 except for the correspondence table 41T. Similarly, the third and fourth embodiments may be modified so that a trustee issues the license B. By issuing the license B from an institution different from the bank BK, it is possible to prevent that the correspondence between the real name (identification information ID U of the user US and the public information N or I is leaked by a malicious play in the bank BK and abused or stolen by a hacker. Besides, as is the case with the second embodiment of Fig. 6, it is also possible to divide the internal configuration of the trustee 40T shown in Fig. 17 into a plurality of departments 401 and 402 and maintain the correspondence between the identification information ID U and association information α and the correspondence between the association information α and the information N or I in the correspondence tables 41T 1 and 41T 2 , respectively, as depicted in Fig. 18. It is apparent that the departments 401 and 402 of the trustee 40T may be independent trustees as shown in Fig. 19. In the Fig. 19 embodiment, the license B is issued via three trustees 40T 1 , 40T 2 and 40T 3 , which store the correspondence between the identification information ID U and the association information α 1 , between α 1 and α 2 and between α 2 and N' or I in their correspondence tables 41T 1 , 41T 2 and 41T 3 , respectively. That is, the correspondence between the identification information ID U and the public information N or I is held by the three trustees as a whole. This correspondence is clarified only when all the trustees 40T 1 , 40T 2 and 40T 3 responds to a court order to reveal their stored correspondence in cooperation with one another. Effects of the Invention The present invention possesses such advantages as listed below. (a) Against Crimes To comply with a request of a authoritative or trustworthy third party (e.g. A court), the bank BK reveals the correspondence between the identification information ID and the public information (I,N), in which case transactions based on the information (I,N) are discontinued. Alternatively, the criminal concerned could be arrested by tracing the transactions based on the information (I,N). (b) Privacy Protection Credit cards cannot guarantee the user's privacy since the user's identification information ID is directly available to the shop. With the present invention, however, only the pseudonym I is given to the shop--this provides increased security. The Chaum·Fiat·Naor scheme uses the blind signature, and hence enables the user to protect his privacy only on his responsibility. (Attention should be paid to the argument that the use of the blind signature scheme leads to a hotbed of crimes.) In the first embodiment, the bank could violate user's privacy, but in the second embodiment, it is hard to violate privacy unless a plurality of departments conspire with each other. (c) Amount of Communication and Amount of Information Stored In the Chaum·Fiat·Naor scheme, since the user himself embeds his identification information ID in the electronic cash, the "cut-and-choose scheme (which responds to a request for the presentation of K pieces of information and the revelation of K/2 pieces of information) so as to make a check to see if the user operates as predetermined; hence, the amount of communication for issuance of the license inevitably increases. Additionally, the detection of double spending also poses the problem of an increase in the amount of information of the communication history H to be stored by the bank BK. In the prior art it is recommended that K is around 20, whereas in the present invention (first to fourth embodiments) K=1 can be implemented; accordingly, the amount of communication and the amount of information to be stored can be reduced down to 1/20 and the above-mentioned problems can be solved. (d) Double Spending When the user US spends the electronic cash C twice or more, the bank BK can detects the double spending by using the information C as a key to retrieve the communication history file. Since the communication history information contains the pseudonym I together with the information C, the bank BK is allowed to learn the identification information ID corresponding to the pseudonym I with the permission of a third party (e.g. a court), and hence can detect the malicious adversary. (e) Divisibility In the third and fourth embodiments, if the user US spends a node against the node rule for the divisional use of the electronic cash C, the bank BK can detect it by using the radical root of the node as a key to retrieve the communication history file. Since the communication history file contains the information I (or N) together with the information C, the bank BK is allowed to learn the identification information ID corresponding to the information I (or N) with a permission of a third part (e.g. A court), and hence can detect the malicious adversary. (f) Others The present invention is compatible with prior art systems employing the license, such as disclosed in T. Okamoto et al, "Universal Electronic Cash," Advances in Cryptology-Crypto '91, Lecture Notes in Computer Science 576, pp.324-337, Springer-Verlag, Berlin (1991) and in US Patent No. 5,224,161, and the invention permits the implementation of a transferring function and a divisibility function which are impossible with the Chaum·Fiat·Naor scheme. Moreover, the present invention is compatible with conventional systems employing the license, such as disclosed in T. Okamoto et al, "Disposable Zero-Knowledge Authentications and Their Applications to Untraceable Electronic Cash," Advances in Cryptology-Crypto '89, Lecture Notes in Computer Science 435, pp.481-496, Springer-Verlag, Berlin (1989) and US Patent No. 4,977,595 entitled "Electronic Cash Implementing Method and Apparatus Therefor" and the invention permits the implementation of the transferability and coupon-like use of electronic cash which are impossible with the Chaum·Fiat·Naor scheme. In the third and fourth embodiments, since it is necessary that K'=10, the amount of information of the communication history H to be stored by the bank BK for double spending is equal to K/2=10 in the Chaum·Fiat·Naor scheme.

Claims: A method for implementing traceable electronic cash, comprising the steps: (1) wherein a user (US) sends to a first institution (BK, 40T) his real name ID U and public information N, the latter corresponding to his real name ID U and secret information; (2) wherein said first institution recognizes the identity of said user and attaches a signature to information including said public information N and sends said signature to said user; (3) wherein said user obtains a license B from said signature sent from said first institution and stores it; (4) wherein said user sends to a second institution (BK) information containing at least a random number, said license B and an amount of money A to request said second institution to issue electronic cash; (5) wherein said second institution attaches a signature to said information containing said license B from said user and sends the signed information to said user as information containing electronic cash C; (6) wherein said user checks said signed information from said second institution to see if said license B bears a signature to said public information N and if said electronic cash C is usable under said license B, thereafter making a payment to a third party (SH) through the use of said random number and information corresponding to said secret information; and (7) wherein said third party sends to said second institution all information of communication with said user so as to seek a settlement concerning said electronic cash C; characterized in that : in said step (2), said first institution generates a pseudonym I of said user and keeps secret the correspondence between said real name ID U on the one hand and said pseudonym I and/or said public information N on the other hand, and attaches said signature to said public information N and said pseudonym I and sends said signature and said pseudonym I to said user; in said step (3), said user stores said license together with said pseudonym I; in said step (6), said user checks said signed information from said second institution to see if said license B bears a signature to said public information N and said pseudonym I; and said method further includes a step: (8) wherein, when there is a likelihood of an attack, the correspondence between said real name ID U on the one hand and said pseudonym I and/or said public information N on the other hand that is kept secret by said first institution is retrieved and said pseudonym I and said public information N are revealed to preclude the possibility of said attack. The method of claim 1, further comprising the step: (9) wherein said user (US) uses said secret information as first secret information to calculate second secret information S corresponding to said pseudonym I and said public information N and holds said second secret information S; and step (6) comprises making said payment to said third party (SH) through the use of said random number and said second secret information S as said information corresponding to said secret information. The method of claim 2, wherein said first secret information is composed of prime numbers P and Q that bear a relationship N = P×Q; wherein in said step (9) said second secret information S is calculated by the following equation with L as a prime number: S = I 1/L mod N; wherein in said step (4) said user (US): (4-1) generates said random number denoted by R and calculates authentication information X from said public information N, said prime number L and said random number R by the following equation X = R L mod N; and (4-2) performs blind signature preprocessing Z=F eC (X,B), represented by a function F eC , for said authentication information X and said license B and sends to said second institution (BK) the resulting information Z as information containing said license B, together with the amount A of said electronic cash C; wherein in said step (5) said second institution attaches a blind signature Θ = D eC (Z ), represented by a function D eC , to said information Z by using a secret key corresponding to said amount A of said electronic cash C, and sends to said user the resulting information Θ as information containing said electronic cash C; and wherein in said step (6): said user performs blind signature postprocessing C = G eC (Θ), represented by a function G eC , for said signature Θ to obtain said electronic cash C; said third party (SH) checks the validity of said license B for information (N, I) and the validity of said electronic cash C for information (X, B) and, if they are proved valid, said third party sends to said user a inquiry E∈Z L = {0, 1, ..., L-1}; said user calculates a response Y from said second secret information S, said public information N, said random number R and said inquiry E by the following equation: Y = R·S E mod N, and sends said response Y to said third party; and said third party calculates Y L and X·I E (mod N) and makes a verification to see if the following equation is satisfied: Y L ≡ X·I E (mod N), and, if said verification succeeds, said third party accepts said electronic cash C as cash of said amount A. The method of claim 1, wherein said secret information is composed of prime numbers P and Q that bear a relationship N = P × Q; wherein in said step (4) said user (US) calculates a one-way function g(B∥b) from said random number denoted by b and said license B, then performs blind signature preprocessing Z = F eC (g(B∥b)) for said one-way function g(B∥b) and sends to said second institution (BK) the resulting information Z as information containing said electronic cash C, together with said amount A; wherein in said step (5) said second institution uses a secret key corresponding to said amount A of said electronic cash C to calculate a signature Θ = D eC (Z) and sends it to said user; wherein in said step (6) said user performs blind signature postprocessing C = G eC (Θ) for said received signature Θ to obtain said electronic cash of said amount A; and wherein the procedure for the payment to said third party comprises the steps: (6-1) wherein said user calculates Γ 0 = <f Γ (C)∥O∥N)> QR from said C, N, P and Q where f Γ represents a predetermined random function and generates Ω j 1 ···j q = 〈f Ω (C∥j 1 ∥···∥j q ∥N)〉 1 from said public information N, said electronic cash C, and a node j 1 ...j q corresponding to an amount to be spent in a hierarchical structure table, where q = 1, ..., t and f Ω represents a predetermined random function, and calculates from said Γ 0 , Ω j 1 ···j q (where q=1, ..., t), N, P and Q, a radical root of a node value corresponding to the amount spent (6-2) wherein said user sends I, N, X j1...jt , B, b, C and j 1 , ..., j t to said third party; (6-3) wherein said third party verifies the validity of said license B for information (I, N) by checking said license B to see if it satisfies V eB ((N, I), B) = OK and verifies the validity of said electronic cash C for information (B, b) by checking said electronic cash to see if it satisfies V eC (g(B∥b), C) = OK and, when said license B and said electronic cash C are valid, letting (a/b) represent a Jacobi symbol, said third party makes a check to see if (X/N) = -1 is satisfied, after which said third party calculates from said C and N f Γ (C∥O∥N), and calculates from said C, j 1 ...j q and N Ω j 1 ···j q = 〈f Ω (C∥j 1 ∥···∥j q ∥N)〉 1 , where q = 1, ..., t, and, further, uses said f Γ (C∥O∥N), Ω j1...jq (q = 1,...t) and N to make a check to see if said X satisfies the following relation X 2 t = dΩ 2 t-1 j t j 1 ···j t-1 Ω 2 t-2 j t-1 j 1 ···j t-2 ···Ω 2j 2 i,j 1 f Γ (C∥0∥N(mod N), where d represents the value of either one of ±1 and ±2; (6-4) wherein when all of said verifications succeed, said third party generates an inquiry E i ∈{ 0, 1}, where i =1, ...K', K' being a predetermined positive integer, and sends it to said user; (6-5) wherein said user uses said electronic cash C, said node value (i, j 1 ...j t ) corresponding to the amount of money spent, said information N and said secret information P and Q to calculate Λ i = <f Λ (C∥j 1 ∥···∥i∥N) > QR and uses said N, P, Q, Λ i and E i to calculate and sends it to said third party; and (6-6) where said third party makes a check to see if said information Y i satisfies (Y i /N) = (-1) Ei and verifies said C, i, j 1 ...j t , N and Y i to see whether they satisfy Y 2 i ≡ d'f Λ (C∥j 1 ∥···∥j t ∥i∥N)(mod N) where d' = ±1 or ±2; and, when said verification succeeds, said third party accepts said I, N, X, B, b, C, j 1 ...j t , E i and Y i as the amount of money corresponding to said node value (i, j 1 ...j t ); where symbols in the above are defined as follows: <Z> QR = dz mod N such that d ∈{±1, ±2}, where dz mod N are quadratic residues, z being a positive integer 0<z<N; [x 1/2 t mod N] 1 = y' such that y' 2 t = x mod N, (y'/N) = 1 and 0 < y' < N/2, where 1≤t, and [x 1/2 t mod N] -1 = y" such that y" 2 t = x mod N, (y"/N) = -1 and 0 <y" < N/2, where 1≤t. The method of claim 1, wherein said secret information is composed of prime numbers P and Q that bear a relationship N = P × Q; wherein in said step (4) said user (US) calculates a one-way function g(B∥b) from said random number denoted by b and said license B, then performs blind signature preprocessing Z = F eC (g(B∥b)) for said one-way function g(B∥b) and sends to said second institution (BK) the resulting information Z as information containing said electronic cash C, together with said amount A of said electronic cash C; wherein in said step (5) said second constitution uses a secret key corresponding to said amount A of said electronic cash C to calculate a signature Θ = D eC (Z) and sends it to said user; wherein in said step (6) said user performs blind signature postprocessing C = G eC (Θ) for said received signature Θ to obtain said electronic cash of said amount A; and wherein the procedure for the payment to said third party comprises the steps: (6-1) wherein said user calculates Γ o = < f Γ (C∥O∥N) > QR from said C, N, P and Q where f Γ represents a predetermined random function, and generates Ω j t ···j q = 〈f Ω (C∥j 1 ∥···∥j q ∥N)〉 1 , from said public information N, said electronic cash C and a node j 1 ...j t in a hierarchical structure tree corresponding to an amount to be spent, where f Ω represents a predetermined random function, and calculates from said Γ 0 , Ω j1...jq , N, P and Q, a radical root of a node value corresponding to the amount spent where q = 1,..., t; (6-2) wherein said user (US) sends said I, N, X j1...jt , B, b, C and j 1 ,...,j t to said third party; (6-3) wherein said third party verifies the validity of said license B for information 〈I, N) by checking said license B to see if it satisfies V eB ((N, I), B) = OK and verifies the validity of said electronic cash C for information (B, b) by checking said electronic cash to see if it satisfies V eC (g(B∥b), C) = OK and, when said license B and said electronic cash C are valid, letting (a/b) represent a Jacobi symbol, said third party makes a check to see if (X/N) = -1 is satisfied, after which said third party calculates from said C and N f Γ (C∥0∥N), and calculates from said C, j 1 ...j q and N Ω j 1 ···j q = 〈f Ω (C∥j 1 ∥···∥j q ∥N)〉 1 , where q = 1, ..., t and f Ω represents a predetermined random function, and, further, uses f Γ (C∥0∥N), Ω j1...jq (q = 1,...,t) and N to make a check to see if said X satisfies the following relation X 2 t ≡ dΩ 2 t-1 j t j 1 ···j t-1 Ω 2 t-2 j t-1 j 1 ···j t-2 ···Ω 2j 2 i,j 1 f Γ (C∥0∥ N)(mod N), where d represents the value of either one of ±1 and ±2; (6-4) wherein when all of said verifications succeed, said third party generates an inquiry E∈Z u ={0,1, ..., u-1}, u being a predetermined positive integer, and sends it to said user (US); (6-5) wherein said user uses said electronic cash C, said node value (1, j 1 ...j t ) corresponding to the amount of money spent, said information N and said secret information P and Q to calculate Λ j 1 ···j t = 〈f Λ (C∥j 1 ∥···∥j t ∥N)〉 QR and uses said N, P, Q, Λ i and E to calculate and sends it to said third party; (6-6) where said third party makes a check to see if said information Y j1...jt satisfies and verifies said C, i, j 1 ...j t , N and Y j1...jt to see whether they satisfy Y 2 u j 1 ···j t ≡ d'f Λ (C∥j 1 ∥···∥j t ∥N)(mod N) where d' = ±1 or ±2; and, when said verification succeeds, said third party accepts said I, N, X, B, b, C, j 1 ...j t ,E i and Y j1...jt as the amount of money corresponding to said node j 1 ,...,j t ; where symbols in the above are defined as follows: < Z > QR = dz mod N such that d∈{±1, ±2}, where dz mod N are quadratic residues, z being a positive integer 0<z<N; such that y' 2 t = x mod N, (y'/N) = 1 and 0 < y' < N/2, where 1 ≤ t, and such that y" 2 t = x mod N, (y"/N) = -1 and 0 < y" < N/2, where 1≤t. The method of claim 4 or 5, wherein letting (e B , n B ) represent a public key of an RSA scheme used by said first institution (BK, 40T) and setting n B = P B × Q B , e B × d B ≡ 1 (mod L) and L = LCM{(P B -1), (Q B -1)}, said signature attached by said first institution to said information (N, I) in said step (2) is carried out by the following calculation D eB (N, I) = (N, I) d B mod n B and said verification of the validity of said license B for said information (N, I) in said step (6-3) succeeds when the following equation is satisfied: (N, I) ≡ B e B (mod n B ). The method of claim 4 or 5, wherein letting (e C , n C ) represent a public key of an RSA scheme used by said second institution (BK, 40T), setting n C = P C × Q C , e C × d C ≡ 1 (mod L) and L = LCM{(P C -1), (Q C -1)}, Letting r represent a random number und setting the function of said blind signature preprocessing F eC by said user (US) in said step (4) as follows: Z = F eC (m) = r e C × m mod n C , setting the function of said signature D eC by said second institution (BK) in said step (5) as follows: Θ = D eC (Z) = Z dC mod n C and setting the function of said blind signature postprocessing G eC by said user in said step (6) as follows: C = G eC (Θ) = Θ/r mod n C , said verification of the validity of said electronic cash C for said information (B,b) by said third party (SH) in said step (6-3) succeeds when the following equation is satisfied: (B, b) ≡ C e C (mod n C ). The method of any one of claims 1 to 7, wherein said first and send institutions each form part of the same bank (BK). The method of any one of claims 1 to 7, wherein said first institution is a trustee (40T) and said second institution (BK) is a bank (BK) different from said trustee. The method of any one of claim 1 to 7, wherein a plurality of departments (101, 102) of said first institution use different pairs of sequential corresponding pieces of association information α to manage the correspondence between said real name ID U of said user (US) on the one hand and said pseudonym I and/or said public information N on the other hand so that the correspondence between said pseudonym I and/or said public information N on the one hand and said real name on the other hand is made available through said association information α only when said plurality of departments cooperate. The method of claim 10, wherein said plurality of departments of said first institution is a plurality of trustees and said second institution is a bank (BK) different from said plurality of trustees. An institution apparatus for issuing a license and electronic cash in accordance with a method for implementing traceable electronic cash, said apparatus comprising: license signing means (112) adapted to use a secret key for a license to sign, with a first signing function D eB , information containing public information N, and to and send to said user (US) the signed information as information containing a license B; and electronic cash signing means (120) adapted to sign, with a second signing function D eC , said information received from said user and containing said license B, and to send to said user said signed information as electronic cash information; characterized in that said license signing means (112) is adapted to sign said information containing said public information N and said pseudonym I, the apparatus further comprising: pseudonym generating means (110) adapted to receive from a user public information N and information containing the user's real name ID U and to generate a pseudonym I corresponding to said real name ID U ; and correspondence storage means (11T) adapted to hold said real name ID U on the one hand and said pseudonym I and/or said public information N on the other hand. The apparatus of claim 12, further comprising first and second institutions, said first institution (BK, 40T) including said pseudonym generating means (110), said correspondence storage means (11T) and said license signing means (112), and said second institution (BK) including said electronic cash signing means. The apparatus of claim 13, wherein said first institution includes a plurality of departments (101, 102), said plurality of departments respectively have association memories for storing the correspondence between said real name ID U of said user (US) on the one hand and said pseudonym I and/or said public information N on the other hand by the use of sequentially corresponding pieces of association information α so that the said correspondence becomes available through said pieces of association information α only when said plurality of departments cooperate with each other. The apparatus of claim 13 or 14, wherein said first and second institutions each form part of the same bank (BK). The apparatus of claim 13 or 14, wherein said first institution is a trustee (40T) and said second institution is a bank (BK) different from said trustee. The apparatus of claim 14, wherein said plurality of departments of said first institution are a plurality of trustees and said second institution is a bank (BK) different from said plurality of trustees.

Inventors: ABE MASAYUKI, FUJIOKA ATSUSHI, FUJISAKI EIICHIRO, OHTA KAZUO, ABE, MASAYUKI, FUJIOKA, ATSUSHI, FUJISAKI, EIICHIRO, OHTA, KAZUO
Applicants: NIPPON TELEGRAPH & TELEPHONE, NIPPON TELEGRAPH AND TELEPHONE CORPORATION
Application year: 1996
Main classification: H04L9
IPC codes: H04L9, G06Q20