-
公开(公告)号:US12189807B2
公开(公告)日:2025-01-07
申请号:US17791833
申请日:2020-01-14
Applicant: NIPPON TELEGRAPH AND TELEPHONE CORPORATION
Inventor: Ryo Kikuchi , Gen Takahashi , Koki Hamada
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].
-
公开(公告)号:US12081655B2
公开(公告)日:2024-09-03
申请号:US17281245
申请日:2019-09-25
Applicant: NIPPON TELEGRAPH AND TELEPHONE CORPORATION
Inventor: Ibuki Mishina , Dai Ikarashi , Koki Hamada , Ryo Kikuchi
CPC classification number: H04L9/085 , G06F7/556 , H04L2209/46
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]].
-
3.
公开(公告)号:US12010220B2
公开(公告)日:2024-06-11
申请号:US17615106
申请日:2019-06-10
Applicant: NIPPON TELEGRAPH AND TELEPHONE CORPORATION
Inventor: Koki Hamada
Abstract: Division is realized with a small number of processing stages. A secure computation apparatus (1) obtains a secret value representing a result of divided N by D using a secret value [N] of a real number N and a secret value [D] of a natural number D. An initialization unit (12) sets a secret value [PL1] of a partial remainder PL1 to 0. A parallel comparison unit (13) computes secret values [E1], . . . , [ER−1] of comparison results E1, . . . , ER−1 of comparing a secret value [n] of a partial divisor n=Pj+1R+Nj with [D]×g for each integer g not less than 1 and less than R in parallel. An update unit (14) computes a secret value [Qj] of a quotient Qj and a secret value [Pj] of a partial remainder Pj that satisfy n=DQj+Pj using the secret values [E1], . . . , [ER−1] of the comparison results E1, . . . , ER−1. An iterative control unit (15) executes the parallel comparison unit (13) and the update unit (14) for each integer j from L1−1 to −L0.
-
公开(公告)号:US11888973B2
公开(公告)日:2024-01-30
申请号:US17267837
申请日:2019-08-08
Applicant: NIPPON TELEGRAPH AND TELEPHONE CORPORATION
Inventor: Dai Ikarashi , Koki Hamada , Ryo Kikuchi , Naoto Kiribuchi
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.
-
5.
公开(公告)号:US11880489B2
公开(公告)日:2024-01-23
申请号:US17274187
申请日:2019-08-28
Applicant: NIPPON TELEGRAPH AND TELEPHONE CORPORATION
Inventor: Satoshi Tanaka , Asami Miyajima , Gen Takahashi , Dai Ikarashi , Koki Hamada , Ryo Kikuchi , Hitoshi Fuji
CPC classification number: G06F21/6245 , G06N7/01 , G09C1/00
Abstract: Provided is a technique for performing statistical processing such as processing for obtaining parameters of logistic regression analysis faster than before. A secure statistical processing system includes a cross tabulation table computing device 2 that performs secure computation on a cross tabulation table in which frequencies are in plain texts while keeping each record concealed; and a statistical processing device 3 that performs predetermined statistical processing using the cross tabulation table in which frequencies are in plain texts. The cross tabulation table computing device 2 may include a plurality of secure computation devices 221, . . . , 22N that perform secure computation on a cross tabulation table in which frequencies are fragments subjected to secret sharing while keeping each record concealed, and a management device 21 that restores the fragments to compute the cross tabulation table in which frequencies are in plain texts.
-
6.
公开(公告)号:US11081024B2
公开(公告)日:2021-08-03
申请号:US16313243
申请日:2017-06-30
Inventor: Koki Hamada , Koji Chida , Satoshi Hasegawa , Masao Nagasaki , Kazuharu Misawa
Abstract: Fisher's exact test is efficiently computed through secure computation. It is assumed that a, b, c and d are frequencies of a 2×2 contingency table, [a], [b], [c] and [d] are secure texts of the respective frequencies a, b, c and d, and N is an upper bound satisfying a+b+c+dN. A reference frequency computation part computes a secure text ([a0], [b0], [c0], [d0]) of a combination of reference frequencies (a0, b0, c0, d0) which are integers satisfying a0+b0=a+b, c0+d0=c+d, a0+c0=a+c, and b0+d0=b+d. A number-of-patterns determination part determines integers h0 and h1 satisfying h0≤h1. A pattern computation part computes [ai]=[a0]+i, [bi]=[b0]−i, [ci]=[c0]−i and [di]=[d0]+i for i=h0, . . . , h1, and obtains a set S={([ai], [bi], [ci], [di])}i of secure texts of combinations of frequencies (ai, bi, ci, di).
-
公开(公告)号:US10679522B2
公开(公告)日:2020-06-09
申请号:US15737915
申请日:2016-06-13
Applicant: NIPPON TELEGRAPH AND TELEPHONE CORPORATION
Inventor: Dai Ikarashi , Koji Chida , Koki Hamada , Ryo Kikuchi
IPC: G09C1/00
Abstract: A secret sharing value of a value represented by a “first target bit string” is used to obtain a secret sharing value of a value represented by a “first check bit string” obtained by setting a value of the most significant bit of the “first target bit string” to a value of a “first check bit” that is lower than the most significant bit. Here, the “first target bit string” corresponds to a null value when the most significant bit is 1 and corresponds to a real number when the most significant bit is 0. Next, the secret sharing value of the value represented by the “first check bit string” is used to obtain secret sharing values of bit values of the least significant bit to “first check bit” of the “first check bit string”.
-
公开(公告)号:US10665137B2
公开(公告)日:2020-05-26
申请号:US15541410
申请日:2016-02-01
Applicant: NIPPON TELEGRAPH AND TELEPHONE CORPORATION
Inventor: Dai Ikarashi , Ryo Kikuchi , Koki Hamada , Koji Chida
Abstract: An inconsistency in shares is detected with a small volume of communications traffic. n inconsistency detecting devices generate random numbers si and make the random numbers si public. The n inconsistency detecting devices generate a common random number s which is the sum total of the random numbers s0, . . . , sn−1. The n inconsistency detecting devices calculate shares [c]i. The n inconsistency detecting devices generate shares [r]i, each of which would become a random number r by reconstruction. The n inconsistency detecting devices calculate shares [d]i, each of which would become a judgment value d by reconstruction. One inconsistency detecting device receives shares [d]1, . . . , [d]n−1 from n−1 inconsistency detecting devices. The one inconsistency detecting device restores n−k shares [d]′k, . . . , [d]′n−1 from k shares [d]0, . . . , [d]k−1. The one inconsistency detecting device judges, for j=k, . . . , n−1, whether or not a share [d]j and a share [d]′j coincide with each other.
-
公开(公告)号:US10083314B2
公开(公告)日:2018-09-25
申请号:US15025486
申请日:2014-10-03
Applicant: NIPPON TELEGRAPH AND TELEPHONE CORPORATION
Inventor: Dai Ikarashi , Ryo Kikuchi , Koki Hamada , Koji Chida
CPC classification number: G06F21/6218 , G06F21/64 , G09C1/00 , H04L9/085 , H04L2209/08 , H04L2209/46
Abstract: A secret parallel processing device reducing communication amount includes: a randomization unit that obtains a non-randomized input sequence and outputs a randomized sequence obtained by joining the non-randomized sequence and a dummy record sequence formed of a disclosed value and subjecting the joined sequences to random replacement processing and concealed random replacement data obtained by concealing used random replacement data; a calculation unit that obtains the non-randomized sequence, the randomized sequence, and the dummy record sequence, applies a predetermined function to the sequences, and generates an output checksum for each sequence by using calculation procedure data used in the processing of applying the function; and a correctness verification unit that obtains the output checksum for each sequence and the concealed random replacement data, assesses the output checksum for each sequence, and outputs a final test result determining whether the predetermined function has been correctly applied on the non-randomized sequence.
-
公开(公告)号:US12141322B2
公开(公告)日:2024-11-12
申请号:US17413578
申请日:2019-12-19
Applicant: NIPPON TELEGRAPH AND TELEPHONE CORPORATION
Inventor: Atsunori Ichikawa , Koki Hamada
IPC: G06F21/62 , G06F16/2452
Abstract: An analysis query response system comprises a user terminal 1 that generates and transmits an analysis query, and a database apparatus 2 including an analysis query verification apparatus 22 that includes a verification execution part 222 that performs a first verification of whether the analysis query satisfies a predetermined privacy preservation indicator, and an analysis query execution apparatus 21 that includes a personal data storage part 211 that stores personal data and an analysis query execution and preservation part 214 that, in a case where the first verification is successful, performs an analysis corresponding to the analysis query on the personal data read from the personal data storage part to acquire an analysis result, and applies a predetermined privacy-preserving mechanism to the acquired analysis result.
-
-
-
-
-
-
-
-
-