Secret survival data processing system, secret survival data processing apparatus, secret survival data processing method, and program

Patent metadata

Field	Value
Publication number	US-12095906-B2
Application number	US-201917760765-A
Country	US
Kind code	B2
Filing date	Oct 2, 2019
Priority date	Oct 2, 2019
Publication date	Sep 17, 2024
Grant date	Sep 17, 2024

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 [[g A ]] of a sequence g A and a share [[g B ]] of a sequence g B 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 [[s A ]] and a share [[s B ]] 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 [[g A ]], and the share [[g B ]], by [[s A ]]=GroupSum ([[g A ]], [[t]]), [[s B ]]=GroupSum ([[g B ]], [[t]]); and a survival number calculation means.

First claim

The invention claimed is:

1. A secure survival time data processing system comprising
at least three secure survival time data processing apparatuses that are connected to a network and are capable of communicating with each other, each of the at least three secure survival time data processing apparatuses including processing circuitry,
wherein the at least three secure survival time data processing apparatuses are configured to cooperatively:
calculate a share ((n A )) of a number of surviving n A per time of group A and a share ((n B )) of a number of surviving n B per time of group B, from a share ((D)) of a survival time data set D, where data including values of three attributes of time, state, and group is referred to as survival time data, D refers to a set of N pieces (where N is an integer greater than or equal to 1) of survival time data (herein referred to as a survival time data set), a set of survival time data in which a value of group is A is referred to as group A, and a set of survival time data in which a value of group is B is referred to as group B, including
calculating a share ((g A )) of a sequence g A and a share ((g B )) of a sequence g B represented by following equations from a share ((g)), where ((g)) is a share of a sequence g of a plurality of values of group of survival time data included in the survival time data set D;

g
i
A

=

{

1

(

g
i

=
A

)

0

(

g
i

≠
A

)

⁢

g
i
B

=

{

1

(

g
i

=
B

)

0

(

g
i

≠
B

)

(where, g i , g i A , and g i B (1≤i≤N) represent an i-th element in the sequence g A , and an i-th element in the sequence g A , and an i-th element in the sequence g B , respectively)
calculating a share ((s A )) and a share ((s B )) from a share ((t)), the share ((g A )), and the share ((g B ), by ((s A ))=GroupSum (((g A )), ((t))), ((s B ))=GroupSum (((g B )), ((t))), where ((t)) is a share of a sequence t of a plurality of values of time of survival time data included in the survival time data set D; and
calculating the share ((n A )) and the share ((n B )) from the share ((s A )) and the share ((s B )),
wherein the calculated share ((n A )) and the calculated share ((n B )) are maintained in a distributed state among the at least three secure computing apparatuses.

2. A secure survival time data processing apparatus provided in a secure survival time data processing system, the secure survival time data processing system comprising
at least three secure survival time data processing apparatuses that are connected to a network and are capable of communicating with each other, each of the at least three secure survival time data processing apparatuses including processing circuitry,
wherein the at least three secure survival time data processing apparatuses are configured to cooperatively:
calculate a share ((n A )) of a number of surviving n A per time of group A and a share ((n B )) of a number of surviving n B per time of group B, from a share ((D)) of a survival time data set D, where data including values of three attributes of time, state, and group is referred to as survival time data, D refers to a set of N pieces (where N is an integer greater than or equal to 1) of survival time data (herein referred to as a survival time data set), a set of survival time data in which a value of group is A is referred to as group A, and a set of survival time data in which a value of group is B is referred to as group B, including

calculating a share ((g A )) of a sequence g A and a share ((g B )) of a sequence g B represented by following equations from a share ((g)), where ((g)) is a share of a sequence g of a plurality of values of group of survival time data included in the survival time data set D;

g
i
A

=

{

1

Assignees

• Nippon Telegraph & Telephone

Inventors

• Ichikawa Atsunori
• Ikarashi Dai
• Hamada Koki
• Kikuchi Ryo
• Sudo Hiroki
• Mishina Ibuki

Classifications

• H04L2209/46

  Secure multiparty computation, e.g. millionaire problem · CPC title

• G06F21/32

  using biometric data, e.g. fingerprints, iris scans or voiceprints · CPC title

• G09C1/00

  Apparatus or methods whereby a given sequence of signs, e.g. an intelligible text, is transformed into an unintelligible sequence of signs by transposing the signs or groups of signs or by replacing them by others according to a predetermined system (cryptographic typewriters G09C3/00) · CPC title

• H04L9/085 Primary

  Secret sharing or secret splitting, e.g. threshold schemes · CPC title