A network system using a threshold secret sharing method

BACKGROUND OF THE INVENTION

The present invention relates to a security technology on a computer network.

In an operation to keep secret information such as a secret key used in a public key cryptosystem, there exit a fear of losing and/or destroying the secret information as well as a fear that the secret information is stolen. Such loss and destruction of the secret information can be coped with by producing several copies of the information. However, when many copies are produced, the fear of stealing of the information is increased.

To solve these problems, there have been introduced secret sharing methods including a (k,n) threshold secret sharing method. In relation thereto, Shamir's will be described.

Assume that a polynomial f(x) of degree of k-1 has secret information s as a constant term thereof<maths id="math0001" num=""><math display="block"><mrow><msub><mrow><mtext>f(x) = s + a</mtext></mrow><mrow><mtext>l</mtext></mrow></msub><msub><mrow><mtext>x + a</mtext></mrow><mrow><mtext>2</mtext></mrow></msub><msup><mrow><mtext>x</mtext></mrow><mrow><mtext>2</mtext></mrow></msup><msub><mrow><mtext> + .... + a</mtext></mrow><mrow><mtext>k-1</mtext></mrow></msub><msup><mrow><mtext>x</mtext></mrow><mrow><mtext>k-1</mtext></mrow></msup><mtext> (mod r)</mtext></mrow></math><img file="EP0936776A2_D0001.tif" /></maths> where, r is a prime number.

Under this condition, a distributor delivers shared information <maths id="math0002" num=""><math display="inline"><mrow><mtext>wi = f(i)</mtext></mrow></math><img file="EP0936776A2_D0002.tif" /></maths> to each secret sharing bearer i(i = 1, 2, ..., n). For details, reference is to be made to "How to Share a Secret" written by A. Shamir in pages 612 to 613 of Commun. of ACM, Vol. 22, No. 11, 1979.

On the other hand, the public key cryptosystems includes elliptic curve cryptosystems. Details about elliptic curve cryptosystems and operation on elliptic curves have been described in Chapter 6 of "Algebraic Aspects of Cryptography" written by Neal Koblitz in ACM, Vol. 3, 1998 and published from Springer.

However, when conducting encryption and decryption of information by use of the Shamir's (k,n) threshold secret sharing method of the prior art, there arise two problems as follows. <ul id="ul0001" list-style="none" compact="compact"><li>(1) The secret information is known to the distributor.</li><li>(2) There is required a distributor organization to produce secret sharing information.</li></ul>

SUMMARY OF THE INVENTION

It is therefore an object of the present invention to provide a highly reliable and safe secret sharing method, a data management system using the same, constituent apparatuses to implement the system, and a program to be executed therein.

In accordance with the present invention, there is provided a data encryption/decryption method comprising an encryption step and a decryption step. The encryption step includes the following steps of preparing n pairs of secret keys and public keys in a public-key cryptographic scheme, where n is a positive integer, generating a new key in accordance with at least one of the public keys, encrypting data in a common-key cryptographic scheme by use of the new key, preparing a (k,n) threshold logic (k is an positive integer equal to or less than n) having terms associated with the new key and the n public keys, conducting a calculation of the threshold logic by use of the new key and the n public keys, and storing encrypted data and a result of the calculation of the threshold logic. The decryption step includes the following steps of restoring the new key from k secret keys selected from the n secret keys and the stored result of the threshold logic calculation in accordance with a threshold reverse logic corresponding to the threshold logic and decrypting by the restored key the encrypted and stored data in the common-key cryptographic scheme.

Thanks to this method, after the information is encrypted, it is not necessary to again distribute secret information to the bearers and hence the distributor organization becomes unnecessary. Moreover, the absence of the distributor accordingly removes the fear that the secret information is known to the distributor.

Additionally, by adopting an elliptic curve cryptosystem as the public key cryptosystem, the processing speed can be increased.

BRIEF DESCRIPTION OF THE DRAWINGS

The objects and features of the present invention will become more apparent from the consideration of the following detailed description taken in conjunction with the accompanying drawings in which: <ul id="ul0002" list-style="none" compact="compact"><li>Fig. 1 is diagram showing an example of a network system in accordance with the present invention;</li><li>Fig. 2 is a flowchart showing an example of operation to encrypt a file with a threshold logic;</li><li>Fig. 3 is a flowchart showing operation in which manager A decrypts a file with a secret key d1 on a network;</li><li>Fig. 4 is a flowchart showing operation in which secretary C decrypts a file with a secret key d2 and a secret key d4 on a network; and</li><li>Fig. 5 is a flowchart showing another example of operation to encrypt a file in accordance with a threshold logic.</li></ul>

DESCRIPTION OF THE PREFERRED EMBODIMENTS

(1) System configuration

Description will be given of an embodiment in accordance with the present invention by referring to the drawings.

Fig. 1 is a schematic configuration diagram of a data management system constructed in accordance with the present invention. In the system, a file server 102 to manage a file 111, a computer (PC) 103 of manager A in which a secret key d1 107 is memorized, and a computer 104 of sub-manager B in which a secret key d2 108 is memorized are connected to each other via a network 101. Moreover, it is assumed that sub-manager B has an IC card B 105 in which a secret key d3 109 is memorized and secretary C has an IC card C 106 in which a secret key d4 110 is memorized.

In the configuration, the network is a general network, e.g., a local area network (LAN).

The file server 102 and the computers 103 and 104 are computers including a personal computer and a work-station and each thereof includes a memory, a central processing unit (CPU), and a communication interface.

Each of the IC cards 105 and 106 includes a memory, a CPU, and an interface to input and to output data to and from the memory.

Between the file server 102 and the computers 105 and 106 as well as between the computers 105 and 106, data is transferred in accordance with a protocol, e.g., TCP/IP adopted by the network 101.

This system achieves integer-operation for data having a long bit length, e.g., 160-bit data, which will be described later. Therefore, each of the computers and IC cards may include a processor dedicated for the integer operation or may include a logic of software and/or firm-ware which subdivides an integer having a long bit length into data having an ordinary bit length, e.g., 32-bit data for the operation.

In this example, an elliptic curve cryptosystem is adopted as the public-key cryptosystem. The system manager determines an elliptic curve for each system, and software to generate a pair of a secret key and a public key is distributed to each member (each computer and each IC card in this example) of the system. Each member generates keys to keep the secret key (d1 to d4) in its own memory and to open to public the public key (Q1 to Q4).

Moreover, each member of the system has software for a hashing function, file encryption and decryption, and a calculating formula of a threshold logic to conduct processing which will be described later.

Although the example of Fig. 1 includes a file server, two computers, and two IC cards, the numbers of the constituent apparatuses are not restricted by this example. The IC card need not be necessarily used.

(2) File encryption: Example 1

Description will be given of an example in which a computer having an original file encrypts a file and then sends the encrypted file via a network to the file server 102. The file serve 102 stores the received file 111 in a storage.

In this example, it is assumed that the computer 103 of the manager A encrypts the file.

First, a method of encrypting the file will be described. Fig. 2 is a flowchart showing details of the method. <ul id="ul0003" list-style="none" compact="compact"><li>Step 201: Start.</li><li>Step 202: Random number k is generated by the computer 103 of the manager A. The random number k is an positive integer and is less than an order of a base point of the elliptic curve used in the system; moreover, the number k has a bit length equal to that of the secret key, e.g., 160 bits. </li><li>Step 203: Using a public key Q1 corresponding to the secret key d1 107 and the random number k, an operation is achieved on an elliptic curve, specifically, a scalar multiplication is conducted to resultantly attain (x1,y1).</li><li>Step 204: Using a public key Q2 corresponding to the secret key d2 108 and the random number k, an operation is achieved on an elliptic curve to attain (x2,y2) as a result.</li><li>Step 205: Using a public key Q3 corresponding to the secret key d3 109 and the random number k, an operation is achieved on an elliptic curve to resultantly attain (x3,y3).</li><li>Step 206: Using a public key Q4 corresponding to the secret key d4 110 and the random number k, an operation is achieved on an elliptic curve to attain (x4,y4) as a result. As described above, the public keys Q1 to Q4 are opened to public and hence available for any user. The public key Q1 is expressed in the format of x and y coordinates, and the values of x and Y are respectively integers which are equal to or more than 0 and which are less than the order of the field in which the elliptic curve is defined. The software for the operation on the elliptic curve may be distributed to the members together with the key generating logic or may be opened to public together with the public key. A result of the operation on the elliptic curve is represented in the same format as for the public key. </li><li>Step 207: The value of x1 resultant from the operation in step 203 is inputted in a hashing function h to obtain a hash value h(x1).</li><li>Step 208: The value of x2 resultant from the operation in step 204 is inputted in a hashing function h to obtain a hash value h(x2).</li><li>Step 209: The value of x3 resultant from the operation in step 205 is inputted in a hashing function h to obtain a hash value h(x3).</li><li>Step 210: The value of x4 resultant from the operation in step 206 is inputted in a hashing function h to obtain a hash value h(x4).</li><li>Step 211: Setting the hash value h(x1) obtained in step 207 to an encryption/decryption key, the original file, namely, data M is encrypted to obtain encrypted data C as a result. In the encryption in step 211, there is adopted a common-key cryptosystem in which the encryption and the decryption utilize the same key. Although there is representatively utilized Data Encryption Standard (DES), another method may be used. The hashing function in steps 207 to 210 may be any function which generates a hash value having the bit length equal to or more than the key length used in the common-key cryptosystem. Representatively, there is adopted SHA-1. The common-key cryptosystem and the hashing function have desirably higher safety. In steps 207 to 210, there may be used the same hashing function or a plurality of different hashing functions. When the length of the hash value is greater than the key length, the hash value is partially utilized. The hash value length of SHA-1 is 160 bits and the key length of DES is 56 bits. In this case, the 56 leading, the 56 trailing bits, or the like of the hash value are extracted to be used as a key. </li><li>Step 212: Computation is conducted in accordance with a threshold logic. Assume as an example of the logic that the decryption can be achieved only with the secret key d1. Moreover, the decryption can carried out only when there are available two keys selected from the secret keys d2, d3, and d4. Assume that the input values to the threshold logic include the hash values h(x1), h(x2), h(x3), and h(x4) calculated in steps 207 to 210 and the x coordinate value of the public key Q1. In this situation, the system computes the following simultaneous system of equations with four unknowns to obtain outputs f1 and f2.<maths id="math0003" num=""><math display="block"><mrow><mtable><mtr><mtd><mrow><mtable><mtr><mtd><mrow><mtext>f1 = alh(x1) + a2h(x2) + a3h(x3) + a4h(x4)</mtext></mrow></mtd></mtr><mtr><mtd><mrow><mtext>f2 = b1h(x1) + b2h(x2) + b3h(x3) + b4h(x4)</mtext></mrow></mtd></mtr></mtable></mrow></mtd></mtr></mtable></mrow></math><img file="EP0936776A2_D0003.tif" /></maths> Where, ai and bi (i = 1, 2, 3, 4) are constants obtained through computations with the x coordinate value of Q1 and are, for example, a coefficient matrix called Vandermonde matrix commonly used in a secret information sharing method. </li><li>Step 213: In accordance with a base point P on the elliptic curve and the random number k, an operation is conducted on the elliptic curve to attain R(x,y) as a result of operation. The base point P and the result of operation R are expressed with x and y coordinates in the same format as for the public key, namely, each thereof has an integer which has long bit length and which is equal to or more than 0. The base point P may be distributed to each member together with the key generating software for the elliptic curve cryptosystem or may be opened together with the public key. </li><li>Step 214: An output processing is carried out to output an encrypted sentence, i.e., data C attained through the operation in step 211, R calculated in step 213, and f1 and f2 calculated in step 212.</li><li>Step 215: End.</li></ul>

In the processing above, the computer 103 sends the generated data C to the file server 102 to store the data C in the file 111. The data items R, f1, and f2 attained in step 214 are also stored with a correspondence established between the data items and the data C. The data R, f1, and f2 may be kept in the file 111 together with the encrypted data C or may be stored via a network in a location with other public data, the location being accessible from any user.

The hashing function, the relationship between the public key and the hashing function, the correspondence between the hash values and encrypted keys, the public-key cryptosystem, and the coefficient matrix of the threshold logic may be uniquely determined in the system or may be determined for each data to be encrypted. In the former case, these items may be incorporated in the program shown in Fig. 2. In the latter case, like the data R, f1, and f2, these items are kept in the format linked with the encrypted data C in a location which can be accessed by any user.

In Fig. 2, steps 203 to 210 are described in a parallel fashion only to clarify the relationship between the threshold logic and the public key Q. If the computer to encrypt the file includes only one processor, these processing steps are serially achieved.

The steps above utilizes public keys and random numbers generated by a computer which executes the steps of Fig. 2. That is, these steps can be executed by another computer.

(3) File decryption: Example 1

Next, description will be given of a method of decrypting the file (data) encrypted in example 1 described above. In the preceding example, a value of h(x1) related only to the secret key d1 is adopted as the encryption key. Therefore, the person, manager A in this case, who knows the secret key d1 can decrypt the file. When the secret key d1 is unknown, the decryption is possible only if a plurality of secret key bearers, two persons in this case, agree to the decryption in accordance with the threshold logic. Both of the decryption methods will next be described.

(A) File decryption by manager A

Description will be given of a method of decrypting a file with a secret key d1 of manager A by referring to Fig. 3. <ul id="ul0004" list-style="none" compact="compact"><li>Step 301: Start.</li><li>Step 302: The computer 103 operates a communicating function thereof and accesses via the network the file 111 stored in the file serve 102 or in a location accessible from any user so as to obtain data R therefrom.</li><li>Step 303: Using data R obtained in step 302 and the secret key d1 stored in a storage of the computer 103 of manager A, an operation of <maths id="math0004" num=""><math display="inline"><mrow><mtext>(x,y) = d1R</mtext></mrow></math><img file="EP0936776A2_D0004.tif" /></maths> is executed on an elliptic curve as follows. Values attained from the operation are regarded as (x1,y1) in accordance with the following relationship.<maths id="math0005" num=""><math display="block"><mrow><mtext>(x,y) = d1R = d1(kP) = k(d1P) = kQ1 = (x1,y1)</mtext></mrow></math><img file="EP0936776A2_D0005.tif" /></maths></li><li>Step 304: Operation result x1 is inputted in the hashing function h to restore the encryption/decryption key h(x1) used for the file encryption.</li><li>Step 305: With the key h(x1) restored in step 304, the encrypted data C read from the file 111 is decrypted to resultantly obtain data M.</li><li>Step 306: End.</li></ul>

The hashing function h for x1 and the relationship between h(x1) and the encryption/decryption key are required to be equal to those of the encryption shown in Fig. 2. Moreover, the decryption in Step 305 must be accomplished in a decryption method corresponding to the encryption method adopted in step 211 of Fig. 2.

The steps above is implemented when a CPU of the computer 103 of manager A executes a program stored in a storage of the computer 103.

(B) File decryption through threshold control

Description will be given of a decryption method in which the decryption is conducted in accordance with a reverse logic of the threshold logic used in the file encryption when two keys selected from the secret keys d2, d3, and d4 are available.

In the description of the decryption method, it is assumed that while sub-manager B possessing the IC card B 105 is being absent from the office, the secretary C having received a request for decryption of a file decrypts the file from the computer 104 of sub-manager B by use of the own IC card C 106.

The decryption method will now be described by reference to Fig. 4. <ul id="ul0005" list-style="none" compact="compact"><li>Step 401: Start.</li><li>Step 402: The file 111 of the file serve 102 or a location accessible from any user is accessed via the network 101 so that the data R, f1, and f2 is read therefrom.</li><li>Step 403: Using data R attained in step 402 and the secret key d2 of the computer 104 of sub-manager B, an operation of <maths id="math0006" num=""><math display="inline"><mrow><mtext>(x,y) = d2R</mtext></mrow></math><img file="EP0936776A2_D0006.tif" /></maths> is conducted on an elliptic curve. Values resultant from the operation are (x2,y2) in accordance with a relationship similar to that of step 303 of Fig. 3.</li><li>Step 404: The operation result x2 is inputted in the hashing function h to attain the hash value h(x2).</li><li>Step 405: Using data R obtained in step 402 and the secret key d4 stored in the IC card 106 of the secretary C, an operation of (<maths id="math0007" num=""><math display="inline"><mrow><mtext>x,y) = d4R</mtext></mrow></math><img file="EP0936776A2_D0007.tif" /></maths> is accomplished on an elliptic curve. Values obtained through the operation become (x4,y4) in accordance with a relationship similar to that of step 303.</li><li>Step 406: The operation result x4 is inputted in the hashing function h to attain the hash value h(x4). However, the operation of steps 405 and 406 is implemented when a processor in the IC card 106 receives data R from the computer 104 and executes a program stored in the IC card 106 in accordance with the secret key d4 stored in the card 106, which will be described later.</li><li>Step 407: Using f1 and f2 obtained in step 402, h(x2) attained in step 404, h(x4) resultant from execution of the step 406, and the public key Q1 which is public information, the key h(x1) used to encrypt the file is restored in accordance with a threshold reverse logic. In the steps above, any secret key is desired to be kept remained in the computer and the IC card associated therewith, namely, the key should not be transmitted in its original form to any other external device. When the secret key is sent as data through the network, the fear of stealing thereof is increased. Consequently, steps 403 and 404 and steps 405 and 406 are respectively executed in a computer or an IC card in which the secret key is kept. In a case in which the computer or the IC card (IC card 106 in this example) to execute these steps is different from the computer (computer 104 in this case) to achieve the file decryption, there are additionally executed steps as follows. </li><li>Step 410: The computer 104 sends a hash processing request to the IC card 106 together with data R.</li><li>Step 411: The computer 104 receives a hash value of h(x4) from the IC card 106.</li></ul>

While the IC card 106 is executing steps 405 and 406, the computer 104 is in a wait state of executes another processing (in the same way as for the ordinary distributed processing).

The data R and the hash value are transmitted via a network and/or a computer-IC card interface. In step 410, the hashing function to be used in step 406 may be transmitted together with the data R.

The hashing function adopted in steps 404 and 406 is the same as that used for the encryption in Fig. 2.

Description will now be given further of the threshold reverse logic.

Expressions employed in the threshold logic become a simultaneous system of equations with four unknowns h(x1), h(x2), h(x3), and h(x4) as follows when f1, f2, and public key Q1 (or a coefficient matrix of ai and bi) are given.<maths id="math0008" num=""><math display="block"><mrow><mtable><mtr><mtd><mrow><mtable><mtr><mtd><mrow><mtext>f1 = a1h(x1) + a2h(x2) + a3h(x3) + a4h(x4)</mtext></mrow></mtd></mtr><mtr><mtd><mrow><mtext>f2 = b1h(x1) + b2h(x2) + b3h(x3) + b4h(x4)</mtext></mrow></mtd></mtr></mtable></mrow></mtd></mtr></mtable></mrow></math><img file="EP0936776A2_D0008.tif" /></maths>

When h(x2) and h(x4) are obtained, there remain two unknowns h(x1) and h(x3) and hence h(x1) can be derived from a simultaneous system of equations with two unknowns. <ul id="ul0006" list-style="none" compact="compact"><li>Step 408: The encrypted data C is read from the file server 102 such that the encrypted data C is decrypted to attain data M in accordance with the encryption/decryption key h(x1) restored in step 407.</li><li>Step 409: End.</li></ul>

In Fig. 4, steps 403 to 406, 410, and 411 are processed in a parallel fashion. This is only to clarify the relationship between the hash value and the threshold reverse logic.

Incidentally, for example, when the secret key d2 108 cannot be read due to a failure of the personal computer (PC) 104 of sub-manager B, this embodiment is also applicable by replacing the secret key d2 with the secret key d3 in the IC card 105 so as to carry out the file decryption.

The decryption is executed by the computer 104 in the description above. However, the present invention is not restricted by the embodiment, namely, when necessary data is received, the operation can be achieved by another computer, e.g., the file serve 102.

(4) File encryption: Example 2

In the file encryption/decryption processing described in conjunction with example 1, the decryption can be conducted, only with the secret key d1, and the decryption can be achieved when two of three keys d2, d3, and d4 are available and the decryption is impossible when only one thereof is available. However, various kinds of threshold control are possible by changing the threshold logic.

For example, although the encryption key used in the file encryption is a hash value h(x1) derived from the public key Q1, it may also be possible to use as the encryption key a hash value h(x1∥x2∥x3∥x4) which is a total of partial information of the value derived from four public keys such that the value is subjected to the secret sharing in accordance with the threshold logic.

Symbol ∥ represents an operator for "concatenation", namely, x1∥x2∥x3∥x4 simply indicates a long joined bit sequence of x1 to x4.

For example, a (2,4) threshold secret sharing logic is as follows.<maths id="math0009" num=""><math display="block"><mrow><mtable><mtr><mtd><mrow><mtable><mtr><mtd><mrow><mtext>g1 = s1h(x1∥x2∥x3∥x4) + s2h(x1) + s3h(x2) + s4h(x3) + s5h(x4)</mtext></mrow></mtd></mtr><mtr><mtd><mrow><mtext>g2 = t1h(x1∥x2∥x3∥x4) + t2h(x1) + t3h(x2) + t4h(x3) + t5h(x4)</mtext></mrow></mtd></mtr><mtr><mtd><mrow><mtext>g3 = u1h(x1∥x2∥x3∥x4) + u2h(x1) + u3h(x2) + u4h(x3) + u5h(x4)</mtext></mrow></mtd></mtr></mtable></mrow></mtd></mtr></mtable></mrow></math><img file="EP0936776A2_D0009.tif" /></maths>

When si, ti, and ui (i = 1, 2, 3, 4, 5) of the expressions above are assumed to be constants which can be calculated in association with the public key Qj (j = 1, 2, 3, 4), there are obtained a simultaneous system of equations with five unknowns h(x1∥x2∥x3∥x4), h(x1), h(x2), h(x3), and h(x4). In this case, when at least two of the secret keys are obtained, the number of unknowns become three and hence there are obtained a simultaneous system including three equations. By solving the simultaneous equation system, there is attained an encryption key, i.e., h(x1∥x2∥x3∥x4). In this method, there can be configured a system in the network system above in which the encryption/decryption key cannot be obtained with, for example, only the secret key of the manager.

Fig. 5 shows a process of the encryption. Most steps are the same as those of the process of Fig. 2. However, Fig. 5 differs from Fig. 2 in that the key h(x1∥x2∥x3∥x4) associated with the values x1 to x4 resultant from steps 203 to 206 are used in step 211a.

(5) File decryption: Example 2

The sentence C encrypted through the process 5 is decrypted in a method similar to that described in section (3)(B) by referring to Fig. 4. However, in step 407, h(x1∥x2∥x3∥x4) is restored in accordance with a threshold reverse logic; moreover, h(x1∥x2∥x3∥x4) is used as a key for the decryption in step 408.

In general, it is possible to construct a threshold logic in which a file can be encrypted when k secret keys are obtained from n secret keys (k is equal to or less than n) and the file encryption/decryption is impossible with (k - 1) secret keys or less. This ensures reliability and safety of the system.

(6) Update of key

Description will be next given of a method of coping with the key loss and destruction by referring to the case of the embodiment above.

In conjunction with the embodiment, description has been given of a control operation with a threshold logic employing four keys. However, even when two particular keys thereof are lost or destroyed, the file decryption is possible. Consequently, when even one of the keys is lost or destroyed, the file is immediately and temporarily decrypted with either two of three remaining keys.

Thereafter, a new public key and a new secret key are generated in place of the lost or destroyed keys. In this situation, all keys, i.e., four keys may be again generated. Using the set of these new keys, the file is again encrypted.

Thanks to this method, even when (n - k) keys are lost and/or destroyed in a system employing a (k,n) threshold logic, it is possible to decrypt the encrypted sentence in any case.

(7) Modifications

In the example above, each of four persons has a secret key. However, the present invention can also be applied to a case in which a secret key is assigned to each two or more persons.

The example above adopts an elliptic curve cryptosystem which uses a group generated by a rational point on the elliptic curve. However, in place of an elliptic curve cryptosystem, there may be utilizes a cryptosystem using one of other group structures, specifically, the Jacobian group of a hyperelliptic curve or a C_AB curve, a subgroup of the Jacobian group, and a subgroup of an integral ring.

While the present invention has been described with reference to the particular illustrative embodiments, it is not to be restricted by those embodiments but only by the appended claims. It is to be appreciated that those skilled in the art can change or modify the embodiments without departing from the scope and spirit of the present invention.