Share generating device, share converting device, secure computation system, share generation method, share conversion method, program, and recording medium

Abstract

A share generating device obtains N seeds s0, . . . , sN−1, obtains a function value y=g(x, e)∈Fm of plaintext x∈Fm and a function value e, and obtains information containing a member yi and N−1 seeds sd, where d∈{0, . . . , N−1} and d≠i, as a share SSi of the plaintext x in secret sharing and outputs the share SSi. It is to be noted that the function value y is expressed by members y0∈Fm(0), . . . , yN−1∈Fm(N−1), which satisfy m=m(0)+ . . . +m(N−1).

Description

TECHNICAL FIELD

The present invention relates to cryptographic technologies and, in particular, relates to a secure computation technique.

BACKGROUND ART

One of secret sharing schemes is Shamir's secret sharing scheme (see, for example, Non-patent Literature 1 and so forth).

PRIOR ART LITERATURE

Non-Patent Literature

Non-patent Literature 1: A. Shamir, “How to Share a Secret”, Communications of the ACM, November 1979, Volume 22, Number 11, pp. 612-613.

SUMMARY OF THE INVENTION

Problems to be Solved by the Invention

Secure computation devices can perform secure computation using shares obtained in accordance with Shamir's secret sharing scheme without changing them. However, when these shares are distributed among N secure computation devices in accordance with the secret sharing scheme, the total amount of data of the shares is N orders of magnitude larger than the amount of data of plaintext. Thus, if these shares are transmitted to the N secure computation devices without being changed, the total amount of communication data is also N orders of magnitude larger than the amount of data of the plaintext.

An object of the present invention is to provide a technique for generating shares whose total amount of communication data is smaller than that of shares in accordance with Shamir's secret sharing scheme and which can be converted into shares in accordance with Shamir's secret sharing scheme or a technique for converting shares, whose total amount of communication data is smaller than that of shares in accordance with Shamir's secret sharing scheme, into shares in accordance with Shamir's secret sharing scheme.

Means to Solve the Problems

A share generating device obtains N seeds s₀, . . . , s_N−1, obtains a function value y=g(x, e)∈F^m of plaintext x∈F^m and a function value e, and obtains information containing a member y_i∈F^m(i) and N−1 seeds s_d, where d∈{0, . . . , N−1} and d≠i, as a share SS_i of the plaintext x in secret sharing and outputs the share SS_i. It is to be noted that N is an integer greater than or equal to 2, m is an integer greater than or equal to 1, m(i) is an integer greater than or equal to 0, i=0, . . . , N−1 holds, P is a function, the range of the function P belongs to a set F^m whose members are sequences of in elements of field F, P(s₀), . . . , P(s_N−1)∈F^m are function values of the seeds s₀, . . . , s_N−1, e=f(P(s₀), P(s_N−1))∈F^m is a function value of the function values P(s₀), . . . , P(s_N−1)∈F^m, and the function value y is expressed by members y₀∈F^m(0), . . . , y_N−1∈F^m(N−1) which satisfy m=m(0)+ . . . +m(N−1).

Each share converting device A_i included in N share converting devices A₀, . . . , A_N−1 accepts a share SS_i, possesses an arbitrary value t_i∈F^m(i) jointly with another share converting device A_{i−1 mod N}, obtains a share [y_i]_u∈F^m(i) of each share converting device A_u by secret-sharing a member y_i in accordance with Shamir's secret sharing scheme on the assumption that the arbitrary value t_i is a share [y_i]_{i−1 mod N} of the share converting device A_{i−1 mod N} and outputs the share [y_i]_u, accepts shares [y_d]_i, obtains function values P(s_d)∈F^m of seeds s_d, converts a set SET_i of the function values P(s_d), where d∈{0, . . . , N−1} and d≠i, which is a share of a function value e=f(P(s₀), . . . , P(s_N−1))∈F^m with respect to function values P(s₀), . . . , P(s_N−1) of N seeds s₀, . . . , s_N−1, into a share [e]_i of the function value e in accordance with Shamir's secret sharing scheme, and obtains a share [x]_i of x=g⁻¹(y, e) in accordance with Shamir's secret sharing scheme by secure computation using a share [y]_i, which is expressed by shares [y₀]_i, . . . , [y_N−1]_i, and the share [e]_i. It is to be noted that u=0, . . . , N−1 holds and the share [y]_i is a share of a function value y=g(x, e)∈F^m with respect to plaintext x and the function value e.

Effects of the Invention

A share generating device can generate shares whose total amount of communication data is smaller than that of shares in accordance with Shamir's secret sharing scheme and which can be converted into shares in accordance with Shamir's secret sharing scheme. A share converting device can convert shares, whose total amount of communication data is smaller than that of shares in accordance with Shamir's secret sharing scheme, into shares in accordance with Shamir's secret sharing scheme.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a block diagram illustrating the configuration of a secure computation system of an embodiment.

FIG. 2 is a block diagram illustrating the functional configuration of a share generating device of the embodiment.

FIG. 3 is a block diagram illustrating the functional configuration of a share converting device of the embodiment.

FIG. 4 is a flow diagram for explaining a share generation method of the embodiment.

FIG. 5 is a flow diagram for explaining a share conversion method of the embodiment.

DETAILED DESCRIPTION OF THE EMBODIMENTS

Hereinafter, embodiments of the present invention will be described with reference to the drawings.

First Embodiment

First, a first embodiment will be described.

<Configuration>

As illustrated in FIG. 1, a secure computation system 1 of the present embodiment includes a share generating device 11 and N share converting devices 12-A₀, . . . , 12-A_N−1, and these devices can communicate with one another through a network such as the Internet. It is to be noted that N is an integer greater than or equal to 2. For example, N is an integer greater than or equal to 3. One example of N is N=3. Although FIG. 1 illustrates one share generating device 11, the secure computation system 1 may include a plurality of share generating devices.

As illustrated in FIG. 2, the share generating device 11 of the present embodiment includes a seed generation unit 111, an arithmetic unit 112, a division unit 113, a share generation unit 116, a communication unit 117, a storage 118, and a control unit 119 and executes each processing under control of the control unit 119. Information output from each processing unit (a part that performs processing) of the share generating device 11 is stored in the storage 118 and is read therefrom when necessary and input to another processing unit.

As illustrated in FIG. 3, each share converting device 12-A_i (i=0, . . . , N−1) includes a communication unit 1201-A_i, a joint possession unit 1202-A_i, a secret sharing unit 1203-A_i, a secure computation unit 1206-A_i, an arithmetic unit 1207-A_i, a Shamir conversion unit 1208-A_i, a share generation unit 1209-A_i, a storage 1210-A_i, and a control unit 1211-A_i and executes each processing under control of the control unit 1211-A_i. Information output from each processing unit of the share converting device 12-A_i is stored in the storage 1210-A_i and is read therefrom when necessary and input to another processing unit.

<Share Generation Method>

A share generation method which is performed by the share generating device 11 of the present embodiment will be described using FIG. 4. It is to be noted that a “share” means a fragment in secret sharing.

First, the seed generation unit 111 (FIG. 2) obtains N seeds s₀, . . . , s_N−1 and outputs the N seeds s₀, . . . , s_N−1. There is no limitation on the data format of the seeds s₀, . . . , s_N−1, and any values can be used as the seeds s₀, . . . , s_N−1. One example of the seeds s₀, . . . , s_N−1 is elements of a set F^w whose members are sequences of w elements of field F (s₀, . . . , s_N−1∈F^w). It is to be noted that α∈β means that α is a member of β. w is an integer greater than or equal to 1. If w=1, F^w is a field F. An example of the field F is a set of remainders modulo a prime number p (α mod p, where α is any number), and the operation result in the field F in this case is obtained as a remainder modulo a prime number p. p≥3 holds and, for instance, p=2⁶¹−1 holds. A seed s_i (i=0, . . . , N−1) may be an arbitrary value or an output value obtained by other processing. The “arbitrary value” may be a random number (a pseudo random number or a true random number), a value selected from a plurality of preset values, or a value obtained by other processing. For example, the seed generation unit 111 generates N random numbers and outputs them as the seeds s₀, . . . , s_N−1 (Step S111).

Plaintext x∈F^m to be secret-shared and the seeds s₀, . . . , s_N−1 output from the seed generation unit 111 are input to the arithmetic unit 112. It is to be noted that in is an integer greater than or equal to 1. For instance, in is an integer greater than or equal to 2 or an integer greater than or equal to 3. The arithmetic unit 112 obtains a function value y=g(x, e)∈F^m of the plaintext x∈F^m and a function value e=f(P(s₀), . . . , P(s_N−1)) ∈ F^m and outputs the function value y. It is to be noted that P is a function. The range of the function P belongs to a set F^m whose members are sequences of m elements of field F. One example of the set F^m is a set of in-dimensional vectors, whose members are in elements of field F. The domain of definition of the function P may be any domain of definition; for example, the domain of definition of the function P belongs to the set F^w. For instance, w<m holds. An example of the function P is a pseudo random number generating function. P(s₀), . . . , P(s_N−1)∈F^m are function values (for example, pseudo random numbers) of the seeds s₀, . . . , s_N−1. g:F^m×2→F^m is a linear function (a function with linearity) that maps elements of two sets F^m to elements of one set F^m. For example, y=x−e∈F^m holds. However, this does not limit the present invention. For instance, a value which is obtained by an operation expressed by a formula obtained by multiplying part or all of the terms of x−e by a constant may be used as y, a value which is obtained by an operation expressed by a formula obtained by replacing part or all of the terms of x−e with an inverse element may be used as y, a value which is obtained by an operation expressed by a formula obtained by replacing part or all of the terms of x−e with an inverse element and then multiplying part or all of the terms by a constant may be used as y, or a value which is obtained by an operation expressed by a formula obtained by adding a constant term to x−e may be used as y. The function value e=f(P(s₀), . . . , P(s_N−1)) is a function value of function values P(s₀), . . . , P(s_N−1)∈F^m. f:F^m×n→F^m is a linear function that maps elements of n sets F^m to elements of one set F^m. For instance, e=f(P(s₀), . . . , P(s_N−1))=Σ_0≤i<NP(s_i)=P(s₀)+ . . . +P(s_N−1)∈F^m holds. However, this does not limit the present invention. For example, a value which is obtained by an operation expressed by a formula obtained by multiplying part or all of the terms of P(s₀)+ . . . +P(s_N−1) by a constant may be used as e, a value which is obtained by an operation expressed by a formula obtained by replacing part or all of the terms of P(s₀)+ . . . +P(s_N−1) with an inverse element may be used as e, a value which is obtained by an operation expressed by a formula obtained by replacing part or all of the terms of P(s₀)+ . . . +P(s_N−1) with an inverse element and then multiplying part or all of the terms by a constant may be used as e, or a value which is obtained by an operation expressed by a formula obtained by adding a constant term to P(s₀)+ . . . +P(s_N−1) may be used as e (Step S112).

The function value y∈F^m is input to the division unit 113. The division unit 113 divides the function value y into N members y₀, . . . , y_N−1 and outputs the members y₀, . . . , y_N−1. It is to be noted that, for i=0, . . . , N−1, y_i∈F^m(i) holds, m(i) is an integer greater than or equal to 0 (for example, m(i) is an integer greater than or equal to 1), m≥N holds, and m=m(0)+ . . . +m(N−1) is satisfied. For instance, it is also possible to make m(0)= . . . =m(N−1)=m/N hold if m is a multiple of N. However, irrespective of whether or not in is a multiple of N, all of m(0), . . . , m(N−1) may not be identical with one another. For example, at least part of m(0), . . . , m(N−1) may be 0. It is to be noted that γ ∈F⁰ represents a null value. If m(i)=0, y_i∈F^m(i) is a null value. The function value y is expressed by members y₀ ∈ F^m(0), . . . , y_N−1∈F^m(N−1) (for example, a sequence of y₀, . . . , y_N−1). For instance, the function value y is expressed as a sequence y₀| . . . |y_N−1 obtained by arranging y₀∈F^m(0), . . . , y_N−1∈F^m(N−1). If m=1, only one of m(0), . . . , m(N−1) is 1 and the others are 0. In this case, the division unit 113 does not have to divide the function value y, and outputs any one of the members y₀, . . . , y_N−1 as the function value y and all of the other members as null values (Step S113).

The members y₀, . . . , y_N−1 output from the division unit 113 and the seeds s₀, . . . , s_N−1 output from the seed generation unit 111 are input to the share generation unit 116. The share generation unit 116 assigns a member y_i and N−1 seeds s_d, where d ∈{0, . . . , N−1} and d≠i, to each share converting device 12-A_i (i=0, . . . , N−1), and obtains information containing the member y_i and the N−1 seeds s_d, where d ∈{0, . . . , N−1} and d≠i, as a share SS_i of the plaintext x in secret sharing and outputs the share SS_i. It is to be noted that, if i≠0 and i≠N−1, the N−1 seeds s_d, where d ∈{0, . . . , N−1} and d≠i, are seeds s₀, . . . , s_i−1, s_i+1, . . . , s_N−1. If i=0, the N−1 seeds s_d, where d ∈{0, . . . , N−1} and d≠i, are seeds s₁, . . . , s_N−1. If i=N−1, the N−1 seeds s_d, where d ∈{0, . . . , N−1} and d≠i, are seeds s₀, . . . , s_N−2. Each share SS_i is a share of each share converting device 12-A_i (i=0, . . . , N−1). Each share SS_i may contain other information, but does not contain a member y_d, where d ∈{0, . . . , N−1} and d≠i, and a seed s_i. It is to be noted that information containing the member y_i∈F⁰, which is a null value, and the N−1 seeds s_d means information indicating that the member y_i is a null value and containing the N−1 seeds s_d. The information containing the member y_i∈F⁰, which is a null value, and the N−1 seeds s_d contains the N−1 seeds s_d, but does not actually contain the member y_i. The size of the seeds s₁, . . . , s_N−1 and N do not depend on m. In (2, N)-Shamir's secret sharing, the order of magnitude of the total share size that relates to the data size in of the plaintext x is O(Nm); in the present embodiment, the order of magnitude of the total share size that relates to the data size in of the plaintext x is just O(m). The size of each share is O(m/N). For example, the total amount of data of shares SS₀, . . . , SS_N−1 is less than N times the amount of data of the plaintext x. For instance, the amount of data of each share SS_i is smaller than the amount of data of the plaintext x (Step S116).

Each share SS_i output from the share generation unit 116 is input to the communication unit 117. The communication unit 117 outputs each share SS_i to each share converting device 12-A, (i=0, . . . , N−1). Each output share SS_i is transmitted to each share converting device 12-A, through the network. That is, the share SS₀ is transmitted to the share converting device 12-A₀, the share SS₁ is transmitted to the share converting device 12-A₁, . . . , and the share SS_N−1 is transmitted to the share converting device 12-A_N−1 (Step S117).

<Share Conversion Method>

A share conversion method which is performed by each share converting device 12-A_i of the present embodiment will be described using FIG. 5.

The share SS_i output from the share generating device 11 and containing the member y_i and the N−1 seeds s_d, where d ∈{0, . . . , N−1} and d≠i, is received (accepted) by the communication unit 1201-A₁ (a first input unit) of the share converting device 12-A_i (FIG. 3). The received share SS_i is stored in the storage 1210-A_i (Step S1201-A_i).

The joint possession unit 1202-A_i possesses an arbitrary value t_i∈ F^m(i) jointly with a joint possession unit 1202-A_{1−1 mod N} of another share converting device 12-A_{i−1 mod N}. That is, the joint possession unit 1202-A_i and the joint possession unit 1202-A_{i−1 mod N} obtain the same arbitrary value t_i. The joint possession unit 1202-A_i and the joint possession unit 1202-A_{i−1 mod N} may jointly possess the arbitrary value t_i by transmitting the arbitrary value t_i or information for identification of the arbitrary value t_i to the joint possession unit 1202-A_{i−1 mod N} from the joint possession unit 1202-A_i, the joint possession unit 1202-A_i and the joint possession unit 1202-A_{i−1 mod N} may jointly possess the arbitrary value t_i by transmitting the arbitrary value t₁ or information for identification of the arbitrary value t_i to the joint possession unit 1202-A_i from the joint possession unit 1202-A_{i−1 mod N}, or joint possession of the arbitrary value t_i may be achieved as a result of the joint possession unit 1202-A_i and the joint possession unit 1202-A_{i−1 mod N} jointly possessing a common seed value and executing the same processing using the common seed value. The arbitrary value t_i may be a random number (a pseudo random number or a true random number), a value obtained by other processing, or a value selected from a plurality of predetermined values. Joint possession of the arbitrary value t_i∈F^m(i) may be performed when Step S1201-A_i is executed, in response to a request from the other joint possession unit 1202-A_{i−1 mod N}, or in response to other events, or may be performed in advance. The joint possession unit 1202-A_i outputs the obtained arbitrary value t_i. If the member y_i is a null value, the arbitrary value t_i is also set at a null value (Step S1202-A_i).

The member y_i contained in the share SS_i and the arbitrary value t_i output from the joint possession unit 1202-A_i are input to the secret sharing unit 1203-A_i. The secret sharing unit 1203-A_i obtains a share [y_i]_u∈F^m(i) (a Shamir share) of each share converting device 12-A_u (u=0, . . . , N−1) by secret-sharing the member y_i in accordance with Shamir's secret sharing scheme and outputs the share [y_i]_u. It is to be noted that the arbitrary value t_i is assumed to be a share [y_i]_{i−1 mod N} of the share converting device 12-A_{i−1 mod N}. Shamir's secret sharing scheme of the embodiment is a 2-out-of-N threshold sharing scheme, in which, given any two different shares, plaintext can be reconstructed; however, given any one piece of share information, information on the plaintext cannot be obtained at all. In the 2-out-of-N threshold sharing scheme, if the secret-shared member y_i and one share [y_i]_{i−1 mod N}=t_i are determined, another share can be obtained. For instance, on the assumption that the arbitrary value t_i is the share [y_i]_{i−1 mod N} of the share converting device 12-A_{i−1 mod N}, the secret sharing unit 1203-A_i identifies an equation (for example, identifies a coefficient of each term of the equation) which holds between the member y_i, the share [y_i]_{i−1 mod N}=t_i, and another share [y_i]_u′∈F^m(i) (u′ ∈{0, . . . , N−1} and u′≠i−1 mod N) using Lagrange's interpolation formula and generates the other share [y_i]_u′ ∈F^m(i) by solving the equation. The communication unit 1201-A_i (a first output unit) outputs (transmits) shares [y_i]_d obtained in the secret sharing unit 1203-A_i to the other N−1 share converting devices 12-A_d (d ∈ {0, . . . , N−1} and d≠i). Since the share converting device 12-A_i and the share converting device 12-A_{i−1 mod N} already jointly possess the share [y_i]_{i−1 mod N}=t_i (Step S1202-A_i), further transmission of the share [y_i]_{i−1 mod N}=t_i to the share converting device 12-A_{i−1 mod N} may be omitted. If the member y_i is a null value, the share [y_i]_u is also set at a null value. The communication unit 1201-A_i (a second input unit) receives (accepts) shares [y_d]_i output (transmitted) from the other share converting devices 12-A_d in a similar manner (Step S1203-A_i).

The share [y_i]_i of the share converting device 12-A_i, which has been output from the secret sharing unit 1203-A_i, and the shares [y_d]_i transmitted from the other share converting devices 12-A_d (d ∈{0, . . . , N−1} and d≠i) are input to the secure computation unit 1206-A_i (a first secure computation unit). The secure computation unit 1206-A_i obtains a share [y]_i∈F^m by joining (concatenating) shares [y₀]_i, . . . , [y_N−1]_i to one another by publicly known secure computation and outputs the share [y]_i. The share [y]_i is a share of the function value y in accordance with Shamir's secret sharing scheme. The function value y is what is obtained by joining the N members y₀, . . . , y_N−1. For example, a sequence y₀| . . . |y_N−1 obtained by arranging y₀∈F^m(0), . . . , y_N−1∈F^m(N−1) is y. To obtain the share [y]_i∈F^m by joining the shares [y₀]_i, . . . , [y_N−1]_i in accordance with Shamir's secret sharing scheme by secure computation, it is only necessary to use, for instance, a sequence of the shares [y₀]_i, . . . , [y_N−1]_i as a share [y]. That is, the share [y] is expressed by shares [y₀]_i∈F^m(0), . . . , [y_N−1]_i∈F^m(N−1). For example, a sequence [y₀]_i| . . . |[y_N−1]_i obtained by arranging the shares [y₀]_i, . . . , is the share [y] (Step S1206-A_i).

The N−1 seeds s_d contained in the share SS_i are input to the arithmetic unit 1207-A_i. The arithmetic unit 1207-A_i obtains N−1 function values P(s_d) ∈F^m (for example, pseudo random numbers) of the N−1 seeds s_d and outputs the N−1 function values P(s_d) (d ∈{0, . . . , N−1} and d≠i). The function P which is used for this operation is the same as the function P for obtaining the function value y in the arithmetic unit 112 of the share generating device 11. A set SET_i of the N−1 function values P(s_d), where d ∈{0, . . . , N−1} and d≠i (that is, the set SET_i has the N−1 function values P(s_d), where d ∈{0, . . . , N−1} and d≠i, as members thereof), is a share of the function value e=f(P(s₀), . . . , P(s_N−1)) ∈F^m with respect to function values P(s₀), . . . , P(s_N−1) of the N seeds s₀, . . . , s_N−1. That is, if there are at least two different sets, sets SET_i′ and SET_i″ (i′, i″ ∈{0, . . . , N−1} and i′≠i″), the function value e=f(P(s₀), . . . , P(s_N−1)) can be reconstructed. In other words, the set SET_i is a (2, N)-replication secret sharing share of the function value e (Step S1207-A_i).

The set SET_i of the N−1 function values P(s_d), where d ∈{0, . . . , N−1} and d≠i, is input to the Shamir conversion unit 1208-A_i. The Shamir conversion unit 1208-A_i converts the set SET which is the (2, N)-replication secret sharing share of the function value e, into a share [e]_i of the function value e in accordance with Shamir's secret sharing scheme by a publicly known Shamir conversion method and outputs the share [e]_i. Examples of a method of converting a (2, N)-replication secret sharing share into a share in accordance with Shamir's secret sharing scheme include a method described in “Ronald Cramer, Ivan Damgard, Yuval Ishai: Share Conversion, Pseudorandom Secret-Sharing and Applications to Secure Computation. TCC 2005: 342-362” (Reference Literature 1) (Step S1208-A_i).

The share [y]_i output from the secure computation unit 1206-A_i and the share [e]_i output from the Shamir conversion unit 1208-A_i are input to the share generation unit 1209-A_i (a first share generation unit). As described earlier, the share [y]_i is a share of the function value y=g(x, e) ∈ F^m with respect to the plaintext x and the function value e in accordance with Shamir's secret sharing scheme. Here, a function that satisfies x=g⁻¹(y, e) ∈F^m with respect to y=g(x, e) is defined as g⁻¹:F^m×2→F^m. For example, if y=x−e, x=y+e holds. The share generation unit 1209-A_i obtains a share [x]_i∈F^m of x=g⁻¹(y, e) in accordance with Shamir's secret sharing scheme by secure computation using the share [y]_i and the share [e]_i and outputs the share [x]_i. For instance, if x=y+e, the share generation unit 1209-A_i obtains a share [y+e]_i by secure computation using the share [y]_i and the share [e]_i and outputs the share [y+e]_i. Secure computation using shares in accordance with Shamir's secret sharing scheme is described in, for example, “Michael Ben-Or, Shafi Goldwasser, Avi Wigderson: Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation (Extended Abstract). STOC 1988: 1-10” (Reference Literature 2) (Step S1209-A_i).

Features of the Present Embodiment

The share generating device 11 outputs information containing the member y_i∈F^m(i) and the N−1 seeds s_d, where d ∈{0, . . . , N−1} and d≠i, to each share converting device 12-A_i as the share SS_i. This makes it possible to make the total amount of communication data smaller than that of shares in accordance with Shamir's secret sharing scheme. Each share converting device 12-A_i can convert the share SS_i into the share [x]_i in accordance with Shamir's secret sharing scheme. This makes it possible to perform secure computation.

Second Embodiment

A second embodiment is a modification of the first embodiment. In the present embodiment, a checksum corresponding to a share is generated at the time of generation of a share and the share is verified using the checksum at the time of share conversion. In the following description, an explanation of a matter that has already been described in the first embodiment is sometimes simplified, using the same reference character as that of the first embodiment.

<Configuration>

As illustrated in FIG. 1, a secure computation system 2 of the present embodiment includes a share generating device 21 and N share converting devices 22-A₀, . . . , 22-A_N−1, and these devices can communicate with one another through a network such as the Internet. Although FIG. 1 illustrates one share generating device 21, the secure computation system 2 may include a plurality of share generating devices.

As illustrated in FIG. 2, the share generating device 21 of the present embodiment includes a seed generation unit 111, an arithmetic unit 112, a division unit 113, an arbitrary value generation unit 214, a checksum generation unit 215, a share generation unit 216, a communication unit 117, a storage 118, and a control unit 119 and executes each processing under control of the control unit 119. Information output from each processing unit is stored in the storage 118 and is read therefrom when necessary and input to another processing unit.

As illustrated in FIG. 3, each share converting device 22-A_i (i=0, . . . , N−1) includes a communication unit 1201-A_i, a joint possession unit 1202-A_i, a secret sharing unit 1203-A_i, a share generation unit 2204-A_i, a verification unit 2205-A_i, a secure computation unit 1206-A_i, an arithmetic unit 1207-A_i, a Shamir conversion unit 1208-A_i, a share generation unit 1209-A_i, a storage 1210-A_i, and a control unit 1211-A_i and executes each processing under control of the control unit 1211-A_i. Information output from each processing unit is stored in the storage 1210-A_i and is read therefrom when necessary and input to another processing unit.

<Share Generation Method>

A share generation method which is performed by the share generating device 21 will be described using FIG. 4. First, in place of the share generating device 11, the share generating device 21 executes the processing from Steps S111 to S113 described in the first embodiment.

Next, the arbitrary value generation unit 214 obtains N arbitrary values r₀, . . . , r_N−1∈F^v belonging to a set F^v and outputs the arbitrary values r₀, . . . , r_N−1. It is to be noted that v is an integer greater than or equal to 1. A greater data amount reduction effect can be achieved if v is less than or equal to m (for instance, v is less than m). For example, v=1 holds. One example of the set F^v is an extension field whose basic field is a field F and whose degree of a field extension is v. The “arbitrary value” may be a random number (a pseudo random number or a true random number) or a value selected from a plurality of preset values. For instance, the arbitrary value generation unit 214 generates N random numbers and outputs them as the arbitrary values r₀, . . . , r_N−1 (Step S214).

The members y₀, . . . , y_N−1 output from the division unit 113 and the arbitrary values r₀, . . . , r_N−1 output from the arbitrary value generation unit 214 are input to the checksum generation unit 215. Here, each member y_i ∈F^m(i) can be divided into m(i) sub-members (y_i)₀, . . . , (y_i)_m(i)−1∈F. For example, each member y_i is expressed as a sequence (y_i)₀| . . . |(y_i)_m(i)−1 obtained by arranging the sub-members (y_i)₀, . . . , (y_i)_m(i)−1. Moreover, m′(i) is ceil(m(i)/v) and (y′_i)_j is ((y_i)_vj, (y_i)_vj+1, . . . , (y_i)_v(j+1)−1) ∈F^v belonging to the set F^v. It is to be noted that ceil is a ceiling function and m′(i) is ceil(m(i)/v) (that is, m′(i) is the smallest integer which is greater than or equal to m(i)/v). Furthermore, for j=m′(i)−1, if the number of (y′_i)_{v(m′(i)−1)}, (y_i)_{v(m′(i)−1)+1}, . . . , (y_i)_vm′(i)−1 is less than v, it is assumed that (y′_i)_m′(i)−1=((y_i)_{v(m′(i)−1)}, (y_i)_{v(m′(i)−1)+1}, . . . , (y_i)_m(i)−1, 0, . . . , 0) ∈F^v holds. The checksum generation unit 215 obtains a checksum c_i=Σ_{0≤j<m′(i)−1}{(y′_i)_jr_i^j+1}+(y′_i)_m′(i)−1r_i^m′(i)+1 ∈F^v corresponding to each share SS_i using the members y₀, . . . , y_N−1 and the arbitrary values r₀, . . . , r_N−1 and outputs the checksum c_i (Step S215).

The members y₀, . . . , y_N−1 output from the division unit 113, the seeds s₀, . . . , s_N−1 output from the seed generation unit 111, the arbitrary values r₀, . . . , r_N−1 output from the arbitrary value generation unit 214, and the checksums c₀, . . . , c_N−1 output from the checksum generation unit 215 are input to the share generation unit 216. The share generation unit 216 assigns a member y_i, N−1 seeds s_d, where d ∈{0, . . . , N−1} and d≠i, N−1 arbitrary values r_d, where d ∈{0, . . . , N−1} and d≠i, and a checksum c_{i−1 mod N} to each share converting device 22-A_i (i=0, . . . , N−1), and obtains information containing the member y_i, the N−1 seeds s_d, where d ∈{0, . . . , N−1} and d≠i, the N−1 arbitrary values r_d, where d ∈{0, . . . , N−1} and d≠i, and the checksum c_{i−1 mod N} as a share SS_i of the plaintext x in secret sharing and outputs the share SS_i. Each share SS_i is a share of each share converting device 22-A_i (i=0, . . . , N−1). Each share SS_i may contain other information, but does not contain a member y_d, where d ∈{0, . . . , N−1} and d≠i, a seed s_i, an arbitrary value r_i, and checksums of c₀, . . . , c_N−1 other than c_{i−1 mod N}. The size of the seeds s₁, . . . , s_N−1, N, and v do not depend on m. In (2, N)-Shamir's secret sharing, the order of magnitude of the total share size that relates to the data size m of the plaintext x is O(Nm); in the present embodiment, the order of magnitude of the total share size that relates to the data size in of the plaintext x is just O(m). The size of each share is O(m/N). For example, the total amount of data of shares SS₀, . . . , SS_N−1 is less than N times the amount of data of the plaintext x. For instance, the amount of data of each share SS_i is smaller than the amount of data of the plaintext x (Step S216).

Each share SS_i obtained in the share generation unit 216 is input to the communication unit 117. The communication unit 117 outputs each share SS_i to each share converting device 22-A_i (i=0, . . . , N−1). Each output share SS_i is transmitted to each share converting device 22-A_i through the network. That is, the share SS₀ is transmitted to the share converting device 22-A₀, the share SS_i is transmitted to the share converting device 22-A₁, . . . , and the share SS_N−1 is transmitted to the share converting device 22-A_N−1 (Step S217).

<Share Conversion Method>

A share generation method which is performed by each share converting device 22-A_i of the present embodiment will be described using FIG. 5.

The share SS_i output from the share generating device 21 and containing the member y_i, the N−1 seeds s_d, where d ∈{0, . . . , N−1} and d≠i, the N−1 arbitrary values r_d, where d ∈{0, . . . , N−1} and d≠i, and the checksum c_{i−1 mod N} is received (accepted) by the communication unit 1201-A_i (the first input unit) of the share converting device 22-A_i (FIG. 3). The received share SS_i is stored in the storage 1210-A_i (Step S2201-A_i).

Next, in place of each share converting device 12-A_i, each share converting device 22-A_i executes the processing in Steps S1202-A_i and S1203-A_i described in the first embodiment.

The arbitrary values r_d contained in the share SS_i and the shares [y_d]_i (d ∈{0, . . . , N−1} and d≠i) received by the communication unit 1201-A_i (Step S1203-A_i) are input to the share generation unit 2204-A_i (a second share generation unit). The share generation unit 2204-A_i obtains a share [c_d]_i of a checksum c_d=Σ_{0≤j<m′(d)−1} {(y′_d)_jr_d^j+1}+(y′_d)_m′(d)−1r_d^m′(d)+1∈F^v in accordance with Shamir's secret sharing scheme by secure computation (public value multiplication and addition by secure computation) using the arbitrary values r_d and the shares [y_d]_i and outputs the share [c_d]_i. As described earlier, the member y_d can be divided into m(d) sub-members (y_d)₀, . . . , (y_i)_m(d)−1. (y′_d)_j is ((y_d)_vj, (y_d)_vj+1, . . . , (y_d)_v(j+1)−1)∈F^v belonging to the set F^v, and m′(d) is ceil(m(d)/v). Moreover, for j=m′(i)−1, if the number of (y_d)_{v(m′(d)−1)}, (y_d)_{v(m′(d)−1)+1}, . . . , (y_d)_vm′(d)−1 is less than v, it is assumed that (y′_d)_m′(d)−1=((y_d)_{v(m′(d)−1}), (y_d)_{v(m′(d)−1)+1}, . . . , (y_d)_m(d)−1, 0, . . . , 0) ∈ F^v. A method of performing public value multiplication and addition by secure computation using shares in accordance with Shamir's secret sharing scheme is described in, for example, Reference Literature 2 (Lemma on page 3) (Step S2204-A_i).

The share [c_d]_i is input to the communication unit 1201-A_i. The communication unit 1201-A_i (a second output unit) outputs the share [c_d]_i (d ∈{0, . . . , N−1} and d≠i) to another share converting device 22-A_{d+1 mod N}. The output share [c_d]_i is transmitted to the share converting device 22-A_{d+1 mod N} via the network, received by a communication unit 1201-A_{d+1 mod N} of the share converting device 22-A_{d+1 mod N}, and stored in a storage 1210-A_{d+1 mod N}. The share [c_d]_i, a share [c_d]_{d+1 mod N} generated by a share generation unit 2204-A_{d+1 mod N}, and the checksum c_d contained in a share SS_{d+1 mod N} are input to a verification unit 2205-A_{d+1 mod N}. The verification unit 2205-A_{d+1 mod N} verifies whether the checksum c_d and the share [c_d]_i have a right relationship. The verification unit 2205-A_{d+1 mod N} of the present embodiment verifies whether the checksum c_d and N shares [c_d]₀, . . . , [c_d]_N−1 have a right relationship. For instance, the verification unit 2205-A_{d+1 mod N} verifies whether or not there is consistency among the input N shares [c_d]₀, . . . , [c_d]_N−1 (Verification 1: consistency verification) and verifies whether a value reconstructed from any two shares [c_d]_i′ and [c_d]_i″ (i′, i″ ∈ {0, . . . , N−1} and i′≠i″) of the input N shares [c_d]₀, . . . , [c_d]_N−1 (Shamir's secret sharing scheme of the embodiment is a 2-out-of-N threshold sharing scheme) and the checksum c_d are identical with each other (Verification 2: identicalness verification). Consistency verification is, for example, calculating another share [c_d]_i′″ (i′″ ∈{0, . . . , N−1}, i′″≠i″, and i′″≠i′) from any two shares [c_d]_i′ and [c_d]_i″ using Lagrange's interpolation formula and, by using the result of calculation as [b_d]_i′″, verifying whether [b_d]_i′″ and [c_d]_i′″ in the N shares [c_d]₀, . . . , [c_d]_N−1 input to the verification unit 2205-A_{d+1 mod N} are identical with each other. Consistency is verified by consistency verification if [b_d]_i′″=[c_d]_i′″ holds for all i′″, otherwise consistency is not verified by consistency verification. Moreover, in identicalness verification, identicalness is verified by identicalness verification if the value reconstructed from the two shares [c_d]_i′ and [c_d]_i″ and the checksum c_d are identical with each other, otherwise identicalness is not verified by identicalness verification. A right relationship is verified if consistency is verified by consistency verification and identicalness is verified by identicalness verification, otherwise a right relationship is not verified.

Likewise, a share [c_{i−1 mod N}]_d output from another share converting device 22-A_d is received (accepted) by the communication unit 1201-A_i (the second input unit) and stored in the storage 1210-A_i. The share [c_{i−1 mod N}]_d output from the other share converting device 22-A_d, a share [c_{i−1 mod N}]_i generated by the share generation unit 2204-A_i, and the checksum c_{i−1 mod N} contained in the share SS_i are input to the verification unit 2205-A_i. The verification unit 2205-A_i verifies whether the checksum c_{i−1 mod N} and the share [c_{i−1 mod N}]_d have a right relationship. The verification unit 2205-A_i of the present embodiment verifies whether the input checksum c_{i−1 mod N}, share [c_{i−1 mod N}]_d, and share [c_{i−1 mod N}]_i have a right relationship. For example, the verification unit 2205-A_i verifies whether or not there is consistency among the input N shares [c_{i−1 mod N}]₀, . . . , [c_{i−1 mod N}]_N−1 (Verification 1: consistency verification) and verifies whether a value reconstructed from any two shares [c_{i−1 mod N}]_i′ and [c_{i−1 mod N}]_i″ (i′, i″ ∈{0, . . . , N−1} and i′≠i″) of the input N shares [c_{i−1 mod N}]₀, . . . , [c_{i−1 mod N}]_N−1 is identical with the checksum c_{i−1 mod N} (Verification 2: identicalness verification). Consistency verification is, for example, calculating another share [c_{i−1 mod N}]_i′″ (i′″ ∈{0, . . . , N−1}, i′″≠i″, and i′″≠i′) from any two shares [c_{i−1 mod N}]_i′ and [c_{i−1 mod N}]_i″ using Lagrange's interpolation formula and, by using the result of calculation as [b_{i−1 mod N}]_i′″, verifying whether [b_{i−1 mod N}]_i′″ and [c_{i−1 mod N}]_i′″ in the N shares [c_{i−1 mod N}]₀, . . . , [c_{i−1 mod N}]_N−1 input to the verification unit 2205-A_i are identical with each other. Consistency is verified by consistency verification if [b_{i−1 mod N}]_i′″=[c_{i−1 mod N}]_i′″ holds for all i′″, otherwise consistency is not verified by consistency verification. Moreover, in identicalness verification, identicalness is verified by identicalness verification if the value reconstructed from the two shares [c_{i−1 mod N}]_i′ and [c_{i−1 mod N}]_i″ and the checksum c_{i−1 mod N} are identical with each other, otherwise identicalness is not verified by identicalness verification. A right relationship is verified if consistency is verified by consistency verification and identicalness is verified by identicalness verification, otherwise a right relationship is not verified (Step S2205-A_i).

If the verification unit 2205-A_i determines that a right relationship is verified, in place of each share converting device 12-A_i, each share converting device 22-A_i executes the processing from Steps S1206-A_i to S1209-A_i described in the first embodiment and ends the processing. On the other hand, if the verification unit 2205-A_i determines that a right relationship is not verified, the control unit 1211-A_i makes the processing terminate with an error message (Step S2206-A_i).

Features of the Present Embodiment

Also in the present embodiment, it is possible to make the total amount of communication data smaller than that of shares in accordance with Shamir's secret sharing scheme. Moreover, each share converting device 22-A_i can convert the share SS_i into the share [x]_i in accordance with Shamir's secret sharing scheme. Furthermore, in the present embodiment, since the share SS_i contains a checksum and verification processing is performed at the time of share conversion, it is possible to detect unauthorized processing performed in the share generating device 21 and/or the share converting device 22-A_i.

It is to be noted that the present invention is not limited to the foregoing embodiments. For example, the above-described various kinds of processing may be executed, in addition to being executed in chronological order in accordance with the descriptions, in parallel or individually depending on the processing power of a device that executes the processing or when necessary. In addition, it goes without saying that changes may be made as appropriate without departing from the spirit of the present invention. Moreover, the share generating device and/or the share converting device may be part of a secure computation device that performs secure computation or may be a device that is different from the secure computation device.

The above-described each device is embodied by execution of a predetermined program by a general- or special-purpose computer having a processor (hardware processor) such as a central processing unit (CPU), memories such as random-access memory (RAM) and read-only memory (ROM), and the like, for example. The computer may have one processor and one memory or have multiple processors and memories. The program may be installed on the computer or pre-recorded on the ROM and the like. Also, some or all of the processing units may be embodied using an electronic circuit that implements processing functions without using programs, rather than an electronic circuit (circuitry) that implements functional components by loading of programs like a CPU. An electronic circuit constituting a single device may include multiple CPUs.

When the above-described configurations are implemented by a computer, the processing details of the functions supposed to be provided in each device are described by a program. As a result of this program being executed by the computer, the above-described processing functions are implemented on the computer. The program describing the processing details can be recorded on a computer-readable recording medium. An example of the computer-readable recording medium is a non-transitory recording medium. Examples of such a recording medium include a magnetic recording device, an optical disk, a magneto-optical recording medium, and semiconductor memory.

The distribution of this program is performed by, for example, selling, transferring, or lending a portable recording medium such as a DVD or a CD-ROM on which the program is recorded. Furthermore, a configuration may be adopted in which this program is distributed by storing the program in a storage device of a server computer and transferring the program to other computers from the server computer via a network.

The computer that executes such a program first, for example, temporarily stores the program recorded on the portable recording medium or the program transferred from the server computer in a storage device thereof. At the time of execution of processing, the computer reads the program stored in the storage device thereof and executes the processing in accordance with the read program. As another mode of execution of this program, the computer may read the program directly from the portable recording medium and execute the processing in accordance with the program and, furthermore, every time the program is transferred to the computer from the server computer, the computer may sequentially execute the processing in accordance with the received program. A configuration may be adopted in which the transfer of a program to the computer from the server computer is not performed and the above-described processing is executed by so-called application service provider (ASP)-type service by which the processing functions are implemented only by an instruction for execution thereof and result acquisition.

Instead of executing a predetermined program on the computer to implement the processing functions of the present devices, at least some of the processing functions may be implemented by hardware.

The inventions of the “share generation method” and the “share conversion method” fall under the category of “the invention of a process for producing a product” under Article 2, paragraph (3), item (iii) of the Patent Act. Moreover, shares which are obtained by the “share generation method” and the “share conversion method” fall under the category of a “computer program, etc.” under Article 2, paragraph (4) of the Patent Act. For example, a header, an extension, or the like is added to such shares for subsequent processing, and a computer that processes these shares executes processing using each share while referring to the header, the extension, or the like added to the share.

DESCRIPTION OF REFERENCE NUMERALS

• • 1, 2 secure computation system
  • 11, 21 share generating device
  • 12-A_i, 22-A_i share converting device

Claims

1. A share generating device for a secure computation, wherein N is an integer greater than or equal to 2, m is an integer greater than or equal to 1, m(i) is an integer greater than or equal to 0, i=0, . . . , N−1 holds, P is a function, and a range of the function P belongs to a set Fm whose members are sequences of m elements of field, the share generating device comprising: processing circuitry that: obtains N seeds s0, . . . , sN−1,obtains a function value y=g(x, e)∈Fm of plaintext x∈Fm and a function value e, where P(s0), . . . , P(sN−1)∈Fm are function values of the seeds s0, . . . , sN−1 and e=f(P(s0), . . . , P(sN−1))∈Fm is a function value of the function values P(s0), . . . , P(sN−1)∈Fm, andobtains information containing a member yi∈Fm(i) and N−1 seeds sd, where d∈{0, . . . , N−1} and d≠i, as a share SSi of the plaintext x in secret sharing and outputs, over a network, the share SSi to a respective share converting device among a plurality of share converting devices Ai (i=0, . . . , N−1), where the function value y is expressed by members y0∈Fm(0), . . . , yN−1∈Fm(N−1) which satisfy m=m(0)+ . . . +m(N−1), whereinv is an integer greater than or equal to 1, ceil is a ceiling function, the member yi can be divided into m(i) sub-members (yi)0, . . . , (yi)m(i)−1∈F, m′(i) is ceil(m(i)/v), and (y′i)j is ((yi)vj, (yi)vj|1, . . . , (yi)v(j|1)−1∈Fv belonging to a set Fv,the processing circuitry furtherobtains N arbitrary values r0, . . . , rN−1∈Fv belonging to the set Fv, andobtains a checksum ci=Σ0≤j<m′(i)−1{(y′i)jrij|1}+(y′i)m′(i)−1rim′(i)+1∈Fv, andthe share SSi, which is generated by the processing circuitry, further contains N−1 arbitrary values rd, where d∈{0, . . . , N−1} and d≠i, and a checksum ci−1 mod N,wherein each share SSi is a share that is transmitted respectively to each of the plurality of share converting devices Ai, and each share converting device Ai converts each respective share SSi, whose total amount of communication data is smaller than that of shares in accordance with Shamir's secret sharing scheme, into a respective share [x]i in accordance with Shamir's secret sharing scheme.

2. A share generating device for a secure computation, wherein N is an integer greater than or equal to 2, m is an integer greater than or equal to 1, m(i) is an integer greater than or equal to 0, i=0, . . . , N−1 holds, P is a function, and a range of the function P belongs to a set Fm whose members are sequences of m elements of field, the share generating device comprising: processing circuitry that: obtains N seeds s0, . . . , sN−1,obtains a function value y=g(x, e)∈Fm of plaintext x∈Fm and a function value e, where P(s0), . . . , P(sN−1)∈Fm are function values of the seeds s0, . . . , sN−1 and e=f(P(s0), . . . , P(sN−1))∈Fm is a function value of the function values P(s0), . . . , P(sN−1)∈Fm, andobtains information containing a member yi∈Fm(i) and N−1 seeds sd, where d∈{0, . . . , N−1} and d≠i, as a share SSi of the plaintext x in secret sharing and outputs, over a network, the share SSi to a respective share converting device among a plurality of share converting devices Ai (i=0, . . . , N−1), where the function value y is expressed by members y0∈Fm(0), . . . , yN−1 ∈Fm(N−1) which satisfy m=m(0)+ . . . +m(N−1), whereineach share SSi is a share that is transmitted respectively to each of the plurality of share converting devices Ai, and each share converting device Ai converts each respective share SSi, into a respective share [x]i in accordance with Shamir's secret sharing scheme, and a total amount of data of shares SS0, . . . , SSN−1 is less than N times an amount of data of the plaintext x.

3. A share generating device for a secure computation, wherein N is an integer greater than or equal to 2, m is an integer greater than or equal to 1, m(i) is an integer greater than or equal to 0, i=0, . . . , N−1 holds, P is a function, and a range of the function P belongs to a set Fm whose members are sequences of m elements of field, the share generating device comprising: processing circuitry that: obtains N seeds s0, . . . , sN−1,obtains a function value y=g(x, e)∈Fm of plaintext x∈Fm and a function value e, where P(s0), . . . , P(sN−1)∈Fm are function values of the seeds s0, . . . , sN−1 and e=f(P(s0), . . . , P(sN−1))∈Fm is a function value of the function values P(s0), . . . , P(sN−1)∈Fm, andobtains information containing a member yi∈Fm(i) and N−1 seeds sd, where d∈{0, . . . , N−1} and d≠i, as a share SSi of the plaintext x in secret sharing and outputs, over a network, the share SSi to a respective share converting device among a plurality of share converting devices Ai (i=0, . . . , N−1), where the function value y is expressed by members y0∈Fm(0), . . . , yN−1∈Fm(N−1) which satisfy m=m(0)+ . . . +m(N−1), whereinthe function value e is e=Σ0≤i<NP(si)∈Fm and the function value y is y=x−e∈Fm, andeach share SSi is a share that is transmitted respectively to each of the plurality of share converting devices Ai, and each share converting device Ai converts each respective share SSi, whose total amount of communication data is smaller than that of shares in accordance with Shamir's secret sharing scheme, into a respective share [x]i in accordance with Shamir's secret sharing scheme.

4. A computer-readable recording medium that stores a program for making a computer function as the share generating device according to any one of claims 1 to 3.

5. A share generation method performed by processing circuitry of a share generating device for a secure computation, wherein N is an integer greater than or equal to 2, m is an integer greater than or equal to 1, m(i) is an integer greater than or equal to 0, i=0, . . . , N−1 holds, P is a function, and a range of the function P belongs to a set Fm whose members are sequences of m elements of field F, the share generation method comprising a seed generation step in which the processing circuitry obtains N seeds s0, . . . , sN−1,an arithmetic step in which P(s0), . . . , P(sN−1)∈Fm are function values of the seeds s0, . . . , sN−1, e=f(P(s0), . . . , P(sN−1))∈Fm is a function value of the function values P(s0), . . . , P(sN−1)∈Fm, and the processing circuitry obtains a function value y=g(x, e)∈Fm of plaintext x∈Fm and the function value e, anda share generation step in which the function value y is expressed by members y0∈Fm(0), . . . , yN−1∈Fm(N−1) which satisfy m=m(0)+ . . . +m(N−1), and the processing circuitry obtains information containing a member yi∈Fm(i) and N−1 seeds sd, where d∈{0, . . . , N−1} and d≠i, as a share SSi of the plaintext x in secret sharing and outputs, over a network, the share SSi to a respective share converting device among a plurality of share converting devices Ai (i=0, . . . , N−1), whereinv is an integer greater than or equal to 1, ceil is a ceiling function, the member yi can be divided into m(i) sub-members (yi)0, . . . , (yi)m(i)−1∈F, m′(i) is ceil(m(i)/v), and (y′i)j is ((yi)vj, (yi)vj+1, . . . , (yi)v(j+1)−1)∈Fv belonging to a set Fv,the share generating method includesan arbitrary value generation step in which the processing circuitry obtains N arbitrary values r0, . . . , rN−1∈Fv belonging to the set Fv, anda checksum generation step in which the processing circuitry obtains a checksum ci=Σ0≤j<m′(i)−1{(y′i)jrij+1}+(y′i)m′(i)−1rim′(i)+1∈Fv, andthe share SSi, which is generated by the share generation step, further contains N−1 arbitrary values rd, where d∈{0, . . . , N−1} and d≠i, and a checksum ci−1 mod N,wherein each share SSi is a share that is transmitted respectively to each of the plurality of share converting devices Ai, and each share converting device Ai converts each respective share SSi, whose total amount of communication data is smaller than that of shares in accordance with Shamir's secret sharing scheme, into a respective share [x]i in accordance with Shamir's secret sharing scheme.

6. A share generation method performed by a share generating device for a secure computation, wherein N is an integer greater than or equal to 2, m is an integer greater than or equal to 1, m(i) is an integer greater than or equal to 0, i=0, . . . , N−1 holds, P is a function, and a range of the function P belongs to a set Fm whose members are sequences of m elements of field F, and the share generation method includes a seed generation step in which a seed generation unit obtains N seeds s0, . . . , sN−1,an arithmetic step in which P(s0), . . . , P(sN−1)∈Fm are function values of the seeds s0, . . . , sN−1, e=f(P(s0), . . . , P(sN−1))∈Fm is a function value of the function values P(s0), . . . , P(sN−1)∈Fm, and an arithmetic unit obtains a function value y=g(x, e)∈Fm of plaintext x∈Fm and the function value e, anda share generation step in which the function value y is expressed by members y0∈Fm(0), . . . , yN−1∈Fm(N−1) which satisfy m=m(0)+ . . . +m(N−1), and a share generation unit obtains information containing a member yi∈Fm(i) and N−1 seeds sd, where d∈{0, . . . , N−1} and d≠i, as a share SSi of the plaintext x in secret sharing and outputs, over a network, the share SSi to a respective share converting device among a plurality of share converting devices Ai (i=0, . . . , N−1), whereineach share SSi is a share that is transmitted respectively to each of the plurality of share converting devices Ai, and each share converting device Ai converts each respective share SSi, into a respective share [x]i in accordance with Shamir's secret sharing scheme, and a total amount of data of shares SS0, . . . , SSN−1 is less than N times an amount of data of the plaintext x.

7. A share generation method performed by a share generating device for a secure computation, wherein N is an integer greater than or equal to 2, m is an integer greater than or equal to 1, m(i) is an integer greater than or equal to 0, i=0, . . . , N−1 holds, P is a function, and a range of the function P belongs to a set Fm whose members are sequences of m elements of field F, and the share generation method includes a seed generation step in which a seed generation unit obtains N seeds s0, . . . , sN−1,an arithmetic step in which P(s0), . . . , P(sN−1)∈Fm are function values of the seeds s0, . . . , sN−1, e=f(P(s0), . . . , P(sN−1))∈Fm is a function value of the function values P(s0), . . . , P(sN−1)∈Fm, and an arithmetic unit obtains a function value y=g(x, e)∈Fm of plaintext x∈Fm and the function value e, anda share generation step in which the function value y is expressed by members y0∈Fm(0), . . . , yN−1∈Fm(N−1) which satisfy m=m(0)+ . . . +m(N−1), and a share generation unit obtains information containing a member yi∈Fm(i) and N−1 seeds sd, where d∈{0, . . . , N−1} and d≠i, as a share SSi of the plaintext x in secret sharing and outputs, over a network, the share SSi to a respective share converting device among a plurality of share converting devices Ai (i=0, . . . , N−1), whereinthe function value e is e=Σ0≤i<NP(si)∈Fm and the function value y is y=x−e∈Fm,wherein each share SSi is a share that is transmitted respectively to each of the plurality of share converting devices Ai, and each share converting device Ai converts each respective share SSi, whose total amount of communication data is smaller than that of shares in accordance with Shamir's secret sharing scheme, into a respective share [x]i in accordance with Shamir's secret sharing scheme.