Secure computing device, confidentiality ranking update method, and program

The secure computing device addresses the inefficiency in updating ranking data by using secret comparison operations to update record rankings based on insertion order, reducing processing load and improving performance in secure computing systems.

WO2024241459A1PCT designated stage expired Publication Date: 2024-11-28NT T INC
View PDF 2 Cites 0 Cited by

Patent Information

Application Number
PCT/JP2023/019039
Authority / Receiving Office
WO · WO
Patent Type
Applications
Current Assignee / Owner
Filing Date
2023-05-23
Publication Date
2024-11-28

AI Technical Summary

Technical Problem

In secure computing systems, updating ranking data after adding or deleting records requires heavy processing, as existing methods necessitate re-sorting all data, which is inefficient, especially when only one item is added or a category ID is updated.

Method used

A secure computing device that specifies the insertion order of additional records using a secret comparison operation and updates ranking data based on insertion order, and includes a unit for updating ranking data of deleted records, allowing for light processing updates without requiring heavy secure sorting.

Benefits of technology

Enables efficient updating of rank data with relatively light processing, reducing the need for heavy secure sorting, thus improving performance by minimizing processing load during data additions and deletions.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure JP2023019039_28112024_PF_FP_ABST
    Figure JP2023019039_28112024_PF_FP_ABST
Patent Text Reader

Abstract

When adding a record to or removing a record from a table in a form of the secret sharing, it is desirable to update ranking data without using confidentiality sorting once more. For this purpose, a secure computing device according to a first aspect of the technology of the present disclosure includes a ranking data update unit that identifies an insertion ranking of the record to be added by means of confidentiality comparison calculation and updates the ranking data relating to the records on the basis of the insertion ranking. Moreover, the secure computing device according to a second aspect of the technology of the present disclosure includes the ranking data update unit that updates the ranking of records on the basis of ranking data relating to the record to be removed.
Need to check novelty before this filing date? Find Prior Art

Description

Secure computing device, confidentiality ranking update method, and program

[0001] The disclosed technology relates to a method for handling data indicating rankings in a secure computation system that stores secretly shared data and performs secure computation.

[0002] In general cryptography, even if data to be kept secret is encrypted and stored on a server, the value must first be decrypted before calculations can be performed. In contrast, there is secure computation technology that allows calculations to be performed on data while it remains encrypted (Reference 1). Reference 1 discloses a multi-party protocol in which a single numerical value is converted into multiple encrypted shares, and N secure computing devices each have their own shares, which can perform addition, multiplication, logical operations, etc. without disclosing their own share information.

[0003] Reference 1: Koji Senda et al., "Rethinking Lightweight Verifiable Three-Party Secure Function Computation," CSS 2010.

[0004] In a secure computation system, data size has a strong effect on performance, so when handling category data, performance can be improved by converting redundant category data (category IDs and category names) into category values ​​with fewer bits and managing them. Secure computation targeting category values ​​includes conditional judgment, creating a quantity table using category values ​​as key values, and sorting. Sorting using secure computation is disclosed in, for example, Non-Patent Document 1.

[0005] In statistical calculations, there is also ordered categorical data called factor types. For this, categorical data is assigned a category value that maintains a magnitude relationship. When sorting, information about the ranking of the data is also stored internally. This ranking data can be used as a categorical value.

[0006] Dai Igarashi et al., "Design and Implementation of Ultra-High-Speed ​​Secure Computation Sorting: The Day Secure Computation Stands on Top of Scripting Languages," Proceedings of the Computer Security Symposium 2017, pp. 600-607.

[0007] When factor type category values ​​or sort ranking data are encrypted and stored in a database, updates to this information may occur later. Specific examples include the following: (1) Ranking data was obtained by secretly sorting data, but data was added / deleted from the original data, so the ranking was updated again. (2) Ordered category data (mapping of category IDs and category values) was calculated by secretly sorting category IDs, and the correspondence between category IDs and category values ​​was managed in a category management table, but category IDs were added / deleted, so the category management table was updated.

[0008] In the existing method, in the case of (1), after adding / deleting data, all data items are secretly sorted again and the ranking data is updated. However, secret sorting is a heavy process, and the amount of processing is proportional to the number of data items. Therefore, adding only one data item requires heavy processing. Similarly, in the case of (2), after adding a category ID, all category IDs must be secretly sorted again and the category value must be updated.

[0009] In order to solve the above problem, a secure computing device according to a first aspect of the disclosed technique includes a ranking data update unit that identifies an insertion order of an added record by a secure comparison operation and updates the ranking data of the record based on the insertion order.

[0010] The secure computing device according to the second aspect of the disclosed technique includes a ranking data update unit that updates the ranking of records based on the ranking data of deleted records.

[0011] According to the disclosed technology, updated ranking data can be obtained by a secure comparison operation, which is a relatively light process, and addition, without using a secure sort, which is a heavy process.

[0012] A diagram showing an example of the configuration of a secure computation system. A functional block diagram showing an example of the configuration of a secure computation device that constitutes the secure computation system. A diagram explaining a specific example of a rank update procedure (a problem to be solved). A diagram explaining a specific example of a rank update procedure (a solution method). A diagram explaining a specific example of a rank update procedure (a method for adding multiple records). A flowchart explaining the operation of a rank data update unit (record addition). A diagram explaining a specific example of a rank update procedure (a method for deleting multiple records). A flowchart explaining the operation of a rank data update unit (record deletion). A flowchart explaining the operation of a rank data update unit in the case of a descending order table. A diagram showing an example of the functional configuration of a computer.

[0013] Hereinafter, embodiments of the disclosed technology will be described in detail. Note that components having the same functions are assigned the same numbers, and duplicated descriptions will be omitted.

[0014] [Notation] The notation used in the disclosed technology will be described.

[0015] (1) A column in table T is denoted as X. (2) The value of column X in record j of table T is X. j (3) N (N≧3) secure computing devices S 0 , S 1 , . . . , S N-1 In this case, the value a∈Z is n The encrypted value (secret sharing value) is [a] i ∈Z n Let's say Z n is a finite ring consisting of the set of integers from 0 to n (n is an integer greater than or equal to 1). However, each S i Since the algorithm is common in [a], the notation of the algorithm is [a] without considering i. i (4) The encrypted table T is denoted as [T]. (5) The column X in the encrypted table T is denoted as [X]. (6) The value X of column X in record j of the encrypted table T j [X j ]. (7) The secret addition [c] = add([a], [b]) of secret sharing values ​​[a] and [b] is written as [c] = [a] + [b]. (8) The secret sharing value sequence [a k ], the confidential sum [b]=sum([a k]) is expressed as in equation (1). (9) A function that compares two secret sharing values ​​[a] and [b] and outputs secret sharing values ​​[0] and [1] indicating the result, and outputs a secret sharing value [f] that is 1 if a>b and 0 otherwise, is expressed as formula (2).

[0016] 1 is a diagram showing an example of the configuration of a secure computing system 1 according to the disclosed technique. The secure computing system 1 includes N (N≧3) secure computing devices S 0 ,..,S i ,..,S N-1 are connected via a network 102. Each secure computing device 101 stores a table T 0 ,T 1 ,..,T x-1 is encrypted (secret sharing) [T 0 ],[T 1 ],..,[T x-1 ], and a secret sharing system is constructed in which the original value can be restored using k secret sharing values.

[0017] 2 is a functional block diagram showing an example of the configuration of one secure computing device 101. The secure computing device 101 includes a ranking data registration unit 201, a ranking data update unit 202, a communication unit 203, and a secret sharing value storage unit 204. The secure computing device 101 cooperates with other secure computing devices via the communication unit 203 to perform secret multiplication, secret logical operations, etc. Hereinafter, it is assumed that an encryption table including ranking data obtained by the ranking data registration unit 201 is stored in advance in the secret sharing value storage unit 204.

[0018] <Specific Example 1 of Rank Update Procedure> The rank update procedure for adding one record will be specifically described using Figures 3 and 4. Figure 3 shows the "example to be solved." Reference numeral 301 denotes a table already stored in the secret sharing value storage unit 204, with digitized data held in the key column and a value indicating the ranking of the key held in the seq column. Reference numeral 302 denotes a record to be added to table 301, with a key value of 50. We wish to add record 302 to table 301 and update the ranking of the seq column as shown in table 303. Note that the values ​​of the key and seq columns are technically secret shared values, and the secure computation defined in [Notation] above is used for the computation, but for the sake of explanation, plaintext values ​​are shown. The same applies to the following Figures 4, 5, and 7.

[0019] Proceed to Figure 4. As shown in the dotted box 401, the function lt(5) is calculated. Here, all key values ​​including the added record are compared with the key value of the added record (=50), and if key>50, the result is "1", and if key≦50, the result is "0". The "function lt(5)" will be explained later.

[0020] As shown in the dotted line box 402, the ranking of the existing record is moved up by one if lt(5)=1 (greater than the added record), and remains unchanged if lt(5)=0 (equal to or less than the added record).

[0021] The ranking of the added records is determined by subtracting the number of records with key>50 (3) from the total number of records (6), as shown in the dotted line box 403.

[0022] <Specific Example 2 of Rank Update Procedure> Using Figure 5, the rank update procedure when adding two records will be specifically described. This time, suppose you want to add two records with keys 50 and 40 to table 301. The function lt(5) is calculated as shown in the dotted line box 501. Here, all key values ​​including those of the added record are compared with the key value of the added record (= 50), and the result is "1" if key > 50, and "0" if key ≤ 50. Similarly, the function lt(6) is calculated as shown in the dotted line box 502. Here, all key values ​​including those of the added record are compared with the key value of the added record (= 40), and the result is "1" if key > 40, and "0" if key ≤ 40.

[0023] The ranking of the existing record is moved up by the amount (lt(5)+lt(6)) that is greater than the added record, as shown in the dotted line box 503.

[0024] The ranking of the added record with key=50 can be determined by subtracting the number of records with key>50 (3) from the total number of records (7), as shown in dotted box 504. The ranking of the added record with key=40 can be determined by subtracting the number of records with key>40 (4) from the total number of records (7), as shown in dotted box 505.

[0025] <Procedure for Adding Records> A generalized procedure is shown in Fig. 6. mn records are added to n existing records to generate a table consisting of m records.

[0026] First, let j (=n,n+1,...,m-1) be the index that identifies the additional record. Then, let l (=0,1,...,m-1) be the index that identifies the m records in total, including the existing records and the additional records. The key and seq values ​​specified by index k are respectively called key k , seq k Let's say.

[0027] [key j ] and [key l The value obtained by performing a secret comparison operation on [] is defined as follows: In other words, key l >key j If lt(j) l = 1, otherwise lt(j) l = 0. Note that for the purposes of the disclosed technique, a known private comparison operation can be used. The ranking data update unit 202 calculates equation (3) for all j and l (step S601).

[0028] The ranking data update unit 202 calculates (secret addition) equation (4) for l=0, 1, . . . , n-1 to update the seq value of the existing record (step S602).

[0029] The ranking data update unit 202 calculates (secretive addition) the equation (5) for j=n, . . . , m-1 to calculate the seq value of the added record (step S603).

[0030] This concludes the explanation of the procedure for adding a record to a table.

[0031] <Specific Example 3 of Rank Update Procedure> A specific example of the rank update procedure when deleting two records will be described using Figure 7. Suppose we want to delete two records from table 701, with keys 55 (seq = 5) and 40 (seq = 2). As shown in the dotted box 702, the function lt(0) is calculated. Here, the seq value of the record to be kept is compared with the seq value (= 5) of the record to be deleted, and if seq > 5, the result is "1", and if seq ≤ 5, the result is "0". Similarly, as shown in the dotted box 703, the function lt(1) is calculated. Here, the seq value of the record to be kept is compared with the seq value (= 2) of the record to be deleted, and the result is "1" if seq > 2, and "0" if seq ≤ 2.

[0032] The order of the record to be kept may be moved up by the amount (lt(0)+lt(1)) that is larger than the deleted record's seq value, as shown in the dotted line box 704 .

[0033] <Record Deletion Procedure> A generalized procedure of the above is shown in Figure 8. m records are deleted from n existing records to generate a table consisting of nm records.

[0034] First, let j be the index identifying the record to be deleted, and let l be the index identifying the record to be kept.

[0035] [seq j ] and [seq l The value obtained by performing a secret comparison operation on [] is defined as follows: That is, seq l >seq j If lt(j) l = 1, otherwise lt(j) l = 0. The ranking data update unit 202 calculates the formula (6) for all j and l (step S801).

[0036] The ranking data update unit 202 calculates (secretly adds) equation (7) for the nm number of l records and updates the seq values ​​of the records to be left (step S602). where k is the total index that identifies the deleted record.

[0037] This concludes the explanation of the procedure for deleting records from a table.

[0038] Second Embodiment In the first embodiment, a case where records are added to or deleted from a table in which key data is ranked in ascending order (ascending order table) is described. In the second embodiment, a case where records are added to or deleted from a table in which key data is ranked in descending order (descending order table) is described.

[0039] <Procedure for Adding Records to a Descending Order Table> The procedure is shown in Fig. 9. mn records are added to n existing records to generate a table consisting of m records.

[0040] First, let j (=n,n+1,...,m-1) be the index that identifies the additional record. Then, let l (=0,1,...,m-1) be the index that identifies the m records in total, including the existing records and the additional records. The key and seq values ​​specified by index k are respectively called key k , seq k Let's say.

[0041] [key j ] and [key l The value obtained by performing a secret comparison operation on [] is defined as follows: In other words, key j >key l In the case of Lt(j), l = 1 otherwise Lt(j) l =0.

[0042] The secure computing apparatus 101 calculates equation (8) for all j and l (step S901).

[0043] The secure computing apparatus 101 calculates (secure addition) equation (9) for l=0, 1, . . . , n-1, and updates the seq value of the existing record (step S902).

[0044] The secure computing apparatus 101 calculates (secure addition) equation (10) for j=n, . . . , m-1 to calculate the seq value of the added record (step S903).

[0045] The above is the description of the procedure for adding a record to the descending order table. The procedure for deleting a record from the descending order table is the same as the procedure for deleting a record from the ascending order table (first embodiment).

[0046] [Supplementary Information] The above embodiment is capable of assigning appropriate ranking data when there are no duplicate values ​​among the multiple keys to be added. If there are duplicate values ​​among the multiple keys to be added, appropriate ranking data can be assigned by dividing them into units with no duplicates and executing this protocol multiple times.

[0047] [Program, Recording Medium] The various processes described above can be implemented by loading a program that executes each step of the above method into the recording unit 2020 of the computer 2000 shown in FIG. 10 and operating the control unit 2010, input unit 2030, output unit 2040, display unit 2050, etc.

[0048] The program describing the processing contents can be recorded on a computer-readable recording medium, which may be, for example, a magnetic recording device, an optical disk, a magneto-optical recording medium, a semiconductor memory, or any other suitable recording medium.

[0049] The program may be distributed by, for example, selling, transferring, lending, etc. portable recording media such as DVDs and CD-ROMs on which the program is recorded. Furthermore, the program may be stored in a storage device of a server computer, and then transferred from the server computer to other computers via a network, thereby distributing the program.

[0050] A computer that executes such a program may first temporarily store the program recorded on a portable recording medium or transferred from a server computer in its own storage device. Then, when executing a process, the computer reads the program stored on its own recording medium and executes the process in accordance with the read program. Alternatively, the computer may read the program directly from a portable recording medium and execute the process in accordance with the program. Furthermore, the computer may execute the process in accordance with each program transferred from the server computer. Alternatively, the server computer may not transfer the program to the computer, but may instead execute the process through a so-called ASP (Application Service Provider) service, which realizes the processing function by issuing an execution instruction and obtaining the results. In this embodiment, the program includes information used for processing by a computer that is equivalent to a program (e.g., data that is not a direct instruction to the computer but has properties that define computer processing).

[0051] Furthermore, in this embodiment, the device is configured by executing a predetermined program on a computer, but at least a part of the processing contents may be realized by hardware.

[0052] REFERENCE SIGNS LIST 101 Secure computing device 102 Network 201 Ranking data registration unit 202 Ranking data update unit 203 Communication unit 204 Secret sharing value storage unit 2000 Computer 2010 Control unit 2020 Recording unit 2030 Input unit 2040 Output unit 2050 Display unit

Claims

1. A method for updating ranking data of an entire table by adding a record including secretly shared key data to a table storing secretly shared key data and secretly shared ranking data indicating its ranking, the method comprising: an insertion rank determination step in which a ranking data update unit determines the insertion rank of the added record by a secret comparison operation; and a rank update step in which the ranking data update unit updates the rank of the record based on the insertion rank.

2. A method for updating a confidentiality rank according to claim 1, characterized in that the rank is in ascending order, the insertion rank determination step counts the number of records having key data larger than the key data of the inserted record, and the rank update step increases the rank data of the existing records by the number of additional records inserted higher than the existing records.

3. A method for updating a confidentiality rank as claimed in claim 1, characterized in that the rank is in descending order, the insertion rank determination step counts the number of records having key data smaller than the key data of the inserted record, and the rank update step increases the rank data of the existing records by the number of additional records inserted higher than the existing records.

4. A method for deleting records from a table storing secretly shared key data and secretly shared ranking data indicating the ranking of the key data, and updating the ranking data of the entire table, the method including: a ranking update step in which a ranking data update unit updates the ranking of the records based on the ranking data of the deleted records.

5. A method for updating confidentiality ranks according to claim 4, characterized in that said rank updating step reduces the rank data of the remaining records by the number of deleted records higher than the remaining records.

6. A secure computing device that adds a record including secretly shared key data to a table storing secretly shared key data and secretly shared ranking data indicating its ranking, thereby updating the ranking data of the entire table, the secure computing device including: a ranking update unit that identifies the insertion rank of the added record by a secret comparison operation, and updates the ranking data of the record based on the insertion rank.

7. A secure computing device that deletes records from a table storing secretly shared key data and secretly shared ranking data indicating its ranking, and updates the ranking data of the entire table, the secure computing device including a ranking data updating unit that updates the ranking of the records based on the ranking data of the deleted records.

8. A program for causing a computer to execute each step of the method for updating the confidentiality rank according to any one of claims 1 to 5.

Citation Information

Patent Citations

  • Confidential sort system, confidential sort apparatus, confidential sort method and confidential sort program

    JP2012154990A

  • Medical information management system and medical information management method

    JP2019109622A