Abstract: Provided is a technology for performing secure computation of a k-means method with high accuracy while keeping data secure. The technology includes: centroid table initialization means that sets a table including a set of a share of a cluster ID j and a share of a centroid of a cluster ID j as a j-th record as an initial value of a centroid table; distance table computation means that computes a distance table including a set of a share of a data ID i, the share of the cluster ID j, a share of a distance dij between data of the data ID i and the centroid of the cluster ID j as an M(j?1)+i-th record; cluster ID table computation means that computes a cluster ID table including a set of the share of the data ID i and a share of a cluster ID k(i) of the cluster to which the data of the data ID i belongs as an i-th record; and centroid table computation means that computes the centroid table.

Abstract: A secure computation device 1n of the secure computation system includes a first calculation unit 11n, a second calculation unit 12n, a third calculation unit 13n, a fourth calculation unit 14n, and an output unit 15n. By calculation being performed in cooperation of these, a group by max operation or a group by min operation can be performed on a table to which a flag is added.

Abstract: A multilayer wiring board has a first signal layer and ground layers, and includes a first differential wiring provided in the first signal layer and including first and second wirings, a first another signal line provided on the first signal layer, a signal via extending along the stacking direction and electrically connected to the first another signal line, and a ground via extending along a stacking direction and electrically connected to the ground layers. The first differential wiring includes a first portion, a second portion continuous with the first portion, and a third portion continuous with the second portion, the first wiring being disposed between the ground via and the signal via adjacent to the ground via, the second wiring being disposed on an opposite side of the first wiring across the ground via, and the ground via being sandwiched between the first and second wirings.

Abstract: Provided is a clustering apparatus capable of securely performing hierarchical clustering while concealing all of a calculation process and values in the middle.

Abstract: A secure sigmoid function calculation system is a system in which map? is assumed to be secure batch mapping defined by parameters (a0, . . . , ak-1) representing the domain of definition of a sigmoid function ?(x) and parameters (?(a0), . . . , ?(ak-1)) representing the range of the sigmoid function ?(x) (a0, . . . , ak-1 are real numbers that satisfy a0< . . . <ak-1) and which is configured with three or more secure sigmoid function calculation apparatuses and calculates, from a share [[x?]] of an input vector x?, a share [[y?]] of a value y? of a sigmoid function for the input vector x?, the system including a secure batch mapping calculating means that calculates the share [[y?]] by [[y?]]=map?([[x?]])=([[?(af(0))]], . . . , [[?(af(m-1)]]) (where f(i) (0?i?m?1) is j that makes aj?xi<aj+1 hold).

Abstract: A secure maximum value computation apparatus, assuming that a set X={[[x1]], [[x2]], . . . , [[xn]]}, includes an output unit 1 that outputs [[x1]] and [[1]] as a maximum secret value [[y]] and a flag [[z(x1)]], respectively, when n=1 holds, a comparison unit 2 that computes a comparison result of which is larger with respect to a predetermined order for each pair {[[xi]], [[xj]]}?X of elements of the X, a flag computation unit 3 that computes whether all comparison results related to each of the [[xi]]s are “large” for each of the [[xi]]s to set a computed value as a flag [[z(xi)]], and a maximum value computation unit 4 that uses the [[z(xi)]] to computes a maximum value [[y]].

Abstract: A secure computation device includes a dummy record separating/sorting unit that sorts a table, a boundary flag generation unit that generates a boundary flag, an addition value generation unit that generates an addition value, a boundary sorting unit that stably sorts a table, a difference value generation unit that generates a difference value, and an operation result output unit that outputs a table.

Abstract: A secure computation device 1n of a secure computation system according to an aspect of this invention includes a first calculation unit 11n, a second calculation unit 12n, a third calculation unit 13n, a fourth calculation unit 14n, a fifth calculation unit 15n, a sixth calculation unit 16n, a seventh calculation unit 17n, and an output unit 18n. By calculation being performed in cooperation of these, a group by count operation can be performed on a table to which a flag is added.

Abstract: A server determines an array [[addr]] indicating a storage destination of each piece of data, generates an array of concealed values, and connects the generated array to the array [[addr]] to determine an array [[addr?]]. The server generates a sort permutation [[?1]] for the array, applies the sort permutation [[?1]] to the array [[addr?]], and converts the array [[addr?]] into an array with a sequence composed of first Z elements set to [[i]] followed by ?i elements set to [[B]]. The server generates a sort permutation [[?2]] for the converted array [[addr?]], generates dummy data, imparts the generated dummy data to the concealed data sequence, applies the sort permutations [[?1]] and [[?2]] to the data array imparted with the dummy data, and generates, as a secret hash table, a data sequence obtained by deleting the last N pieces of data from the sorted data array.

Abstract: A secure computation device 1n of a secure computation system according to an aspect of this invention includes a first calculation unit 11n, a second calculation unit 12n, a third calculation unit 13n, a fourth calculation unit 14n, a fifth calculation unit 15n, a sixth calculation unit 16n, a seventh calculation unit 17n, and an output unit 18n. By calculation being performed in cooperation of these, a group by count operation can be performed on a table to which a flag is added.

Abstract: Provided is a technology for performing secure computation of a random number generation method using weighted probability distribution with high accuracy while keeping data secure. The technology includes: first vector computation means that computes a share ([[p?1]], . . . , [[p?L]]) from a share ([[p1]], . . . , [[pL]]) by using prefix sum; uniform random number generation means that generates a share ([[q1]], . . . , [[qS]]) of a vector (q1, . . . , qS) (where qi (i=1, . . . , S) is a uniform random number, and satisfies 0?qi?1) having a uniform random number as an element; and random number computation means that computes a share ([[r1]], . . . , [[rS]]) of a vector (r1, . . . , rS) having an output value as an element from the share ([[p?1]], . . . , [[p?L]]), a share ([[x1]], . . . , [[xL]]), and the share ([[q1]], . . . , [[qS]]) by using secure collective mapping.

Abstract: Provided is a technology for performing secure computation of a k-means method with high accuracy while keeping data secure. The technology includes: centroid table initialization means that sets a table including a set of a share of a cluster ID j and a share of a centroid of a cluster ID j as a j-th record as an initial value of a centroid table; distance table computation means that computes a distance table including a set of a share of a data ID i, the share of the cluster ID j, a share of a distance dij, between data of the data ID i and the centroid of the cluster ID j as an M(j?1)+i-th record; cluster ID table computation means that computes a cluster ID table including a set of the share of the data ID i and a share of a cluster ID k(i) of the cluster to which the data of the data ID i belongs as an i-th record; and centroid table computation means that computes the centroid table.

Abstract: Provided is a clustering apparatus capable of securely performing hierarchical clustering while concealing all of a calculation process and values in the middle.

Abstract: The encrypted data analysis device includes a sorting unit that sorts by [Time Information] and then sorts by [User ID] an encrypted data set group including a plurality of encrypted data sets, each of the plurality of encrypted data sets including a [Location ID], the [User ID], and the [Time Information], an encoding unit that generates a [Flow], and encoding the [Location ID] extracted, and an equal sign determination unit that determines whether a [User ID] and another [User ID] adjacent to each other are equal, and when not equal, replaces a corresponding [Flow] with a [predetermined value that represents invalid].

Abstract: The present invention provides techniques to calculate the number of surviving and the number of deaths while still concealing survival time data. The present invention includes: a group data position calculation means configured to calculate a share [[gA]] of a sequence gA and a share [[gB]] of a sequence gB represented by predetermined equations from a share [[g]] of a sequence g of values of group of survival time data included in a survival time data set D; a group data number calculation means configured to calculate a share [[sA]] and a share [[sB]] from a share [[t]] of a sequence t of values of time of survival time data included in the survival time data set D, the share [[gA]], and the share [[gB]], by [[sA]]=GroupSum ([[gA]], [[t]]), [[sB]]=GroupSum ([[gB]], [[t]]); and a survival number calculation means.

Abstract: In a temperature control apparatus for controlling the temperature of a load by supplying high-temperature circulating liquid to the load, a device in which a helical channel portion of a first heat exchange channel through which circulating liquid flows is housed in a second heat exchange channel formed of a channel space in a hollow shell through which coolant flows is used as a heat exchanger for cooling the circulating liquid, cylindrical members are individually fitted on an inflow channel portion and an outflow channel portion connected to opposite ends of the helical channel portion of the first heat exchange channel, and the cylindrical members are each fixed to the shell of the heat exchanger with a weld.

Abstract: A technique for performing secure computation of a sigmoid function with high speed and precision is provided. A secret sigmoid function calculation system is a system, in which g(x) is assumed to be a secure computable function, which calculates, from a share [[x]] of an input value x, a share [[??(x)]] of a value of a sigmoid function for the input value x, and includes: a first comparing means that generates a first comparison result [[c]]=less_than([[x]], t1); a second comparing means that generates a second comparison result [[d]]=greater_than([[x]], t0); a first logical computation means that generates a first logical computation result [[e]]=not([[c]]); a second logical computation means that generates a second logical computation result [[k]]=and([[c]], [[d]]) or [[k]]=mul([[c]], [[d]]); and a function value calculating means that calculates the share [[??(x)]]=mul([[k]], [[g(x)]])+[[e]].

Abstract: A secure computation device 1n of the secure computation system includes a first calculation unit 11n, a second calculation unit 12n, a third calculation unit 13n, a fourth calculation unit 14n, and an output unit 15n. By calculation being performed in cooperation of these, a group by max operation or a group by min operation can be performed on a table to which a flag is added.

Abstract: In a voting system including a vote broadcasting server and a plurality of client terminals, the vote broadcasting server generates a plurality of pieces of vote information that is data in which secret information is shared and transmits the vote information to each client terminal, each client terminal generates voting information by encrypting vote information such that the vote information can be decrypted when predetermined conditions are satisfied and transmits the voting information to the vote broadcasting server, the vote broadcasting server transmits a voting information group composed of voting information received from respective client terminals to the respective client terminals, and each client terminal ascertains a vote result according to the number of pieces of vote information decrypted from the voting information group and executes processing based on the vote result.

Abstract: A secure joining system is a secure joining system including a plurality of secure computing apparatuses. The plurality of secure computing apparatuses include a first vector joining unit, a first permutation calculation unit, a first vector generation unit, a second vector joining unit, a first permutation application unit, a second vector generation unit, a first inverse permutation application unit, a first vector extraction unit, a second permutation application unit, a third vector generation unit, a second inverse permutation application unit, a second vector extraction unit, a modified second table generation unit, a third permutation application unit, a fourth vector generation unit, a shifting unit, a third inverse permutation application unit, a bit inversion unit, a third vector extraction unit, a modified first table generation unit, a first table joining unit, and a first table formatting unit.