Secure computation system, device, method and program
The secure computing system performs group by operations on encrypted tables with flags by using encryption methods, addressing the challenge of ignored records in existing systems and ensuring accurate results without decoding.
Patent Information
- Application Number
- JP2023532978
- Authority / Receiving Office
- JP · JP
- Patent Type
- Patents
- Current Assignee / Owner
- Filing Date
- 2021-07-08
- Publication Date
- 2024-11-26
- Estimated Expiration
- 2041-07-08
AI Technical Summary
Existing secure computation systems fail to perform group by operations on tables with added flags, as the value of ignored records affects the final result, making it impossible to obtain the original result.
A secure computing system that includes multiple secure computing devices, capable of performing group by max or group by min operations on encrypted tables with flags, using encryption methods like secret sharing and homomorphic encryption to process vectors of keys, values, and flags without decoding, ensuring operations are performed on valid records only.
Enables group by max and group by min operations on encrypted tables with added flags, maintaining data secrecy and achieving accurate results without decoding the encrypted data.
Smart Images

Figure 0007589815000001 
Figure 0007589815000002 
Figure 0007589815000003
Abstract
Description
[Technical field]
[0001] The present invention relates to a technique for performing database operations while keeping data confidential. [Background technology]
[0002] In order to handle data safely, a technology called secure computation that analyzes encrypted data is being researched. Among these, encrypted database processing is being considered to efficiently extract data that meets certain conditions and calculate aggregate values while keeping the data encrypted.
[0003] The group by operation, a type of DB processing, is a grouping process that takes a table as input, groups it by the values of a specified column, and optionally calculates statistics for each group and outputs them in tabular format.
[0004] A method for performing a group by operation while keeping it encrypted has been proposed in Non-Patent Document 1. The input and output considered here is a normal table in which each element is encrypted.
[0005] On the other hand, when database processing is performed while the data is encrypted, the input and output may differ from normal tables in that a flag may be added to indicate whether a certain record is the original output or not.
[0006] k → Let be the vector of keys, and v → Let be the vector of values, and f → Let be a vector of flags and [·] be encrypted data. FIG. 15(a) shows an example of a normal unencrypted table, FIG. 15(b) shows an example of an encrypted table in Non-Patent Document 1, and FIG. 15(c) shows an example of a table with flags added.
[0007] In Fig. 15, "?" indicates that some value is entered. If the flag is 0, the value of that record is ignored, so the value of this "?" is arbitrary. [Prior art documents] [Non-patent literature]
[0008] [Non-Patent Document 1] Ryo Kikuchi, Hiroki Hamada, Dai Igarashi, Hajime Takahashi, Katsumi Takahashi, "Let's try cross-sectional movement analysis using secret computing," In SCIS,2020. Summary of the Invention [Problem to be solved by the invention]
[0009] The algorithm proposed in Non-Patent Document 1 does not work when a table with the flags added as shown in Fig. 7(c) is input. This is because, in addition to the input format being different, it was previously assumed that all records had meaningful values, so it was not possible to skip unused records for processing, and the value of "?", which should be ignored, would affect the final result, making it impossible to obtain the intended result.
[0010] An object of the present invention is to provide a secure computation system, device, method, and program for performing a group by max operation or a group by min operation on a table to which a flag has been added. [Means for solving the problem]
[0011] A secure computation system according to one aspect of the present invention includes a plurality of secure computation devices, where m is the number of records and is an integer equal to or greater than 1, and k → is the vector of keys k → =(k1,…,k m ), and v → is the vector of values v → =(v1,…,v m ), and f → is a vector of flags f → =(f1,…,f m), where α is an arbitrary value or an arbitrary vector, [α] is the ciphertext of α, and a predetermined operation can be performed using α as the ciphertext. → The ciphertext of [f → ], vector k → The ciphertext [k → ] and vector v → The ciphertext [v → ] to obtain the vector f → Negation of vector k → and vector v → Using the combined vector as a key, vector f → , vector k → and vector v → The vector f' is a sorted version of → , vector k' → and vector v' → The ciphertext [f' → ], ciphertext [k' → ] and the ciphertext [v' → ], and a plurality of first computation units for generating ciphertext [f' → ] and the ciphertext [k' → ], for i = 1, ..., m-1, f' i = 1 and k' i ≠k' i+1 or f' i =1 and f' i+1 When =0, e' i =0, otherwise e' i = 1, and f' m When =1, e' m =0, otherwise e' m e' such that =1 m The ciphertext [e' m ], e i Vector e' with elements (i=1,…,m) → The ciphertext [e' → ], and a plurality of second computation units for generating ciphertext [e' → ] and the ciphertext [v' → ], for i = 1, ..., m, the vector e' → Element e' of i If =0, the value is v' i and the vector e'→ Element e' of i = 1, then x has a value of 0 i The ciphertext of [x i ], x i Vector x with elements (i=1,…,m) → The ciphertext of [x → ], and a plurality of third computation units for generating ciphertext [e' → ] to obtain the vector e' → A vector e''' consisting of the values of each element of → The ciphertext of [e''' → and a plurality of fourth calculation units that calculate
[0012] A secure computation system according to one aspect of the present invention includes a plurality of secure computation devices, where m is the number of records and is an integer equal to or greater than 1, and k → is the vector of keys k → =(k1,…,k m ), and v → is the vector of values v → =(v1,…,v m ), and f → is a vector of flags f → =(f1,…,f m ), where α is an arbitrary value or an arbitrary vector, [α] is the ciphertext of α, and a predetermined operation can be performed using α as the ciphertext. → The ciphertext of [f → ], vector k → The ciphertext [k → ] and vector v → The ciphertext [v → ] to obtain the vector f → Negation of vector k → and vector v → Using the combined vector as a key, vector f → , vector k → and vector v → The vector f' is a sorted version of → , vector k' → and vector v' → The ciphertext [f' →], ciphertext [k' → ] and the ciphertext [v' → ], and a plurality of first computation units for generating ciphertext [f' → ] and the ciphertext [k' → ], for i = 1, ..., m-1, f' i = 1 and k' i ≠k' i+1 or f' i =1 and f' i+1 When g = 0 i = 0, otherwise g i = 1, and if f'1 = 0 then g1 = 1, otherwise g1 = 0. By generating the ciphertext [g1] of g1, g i Vector g with elements (i=1,…,m) → The ciphertext [g → ], and a plurality of second computation units for generating ciphertext [g → ] and the ciphertext [v' → ], for i = 1, ..., m, the vector g → Element g of i If =0, the value is v' i and the vector g → Element g of i = 1, then x has a value of 0 i The ciphertext of [x i ], x i Vector x with elements (i=1,…,m) → The ciphertext of [x → ], and a plurality of third computation units for generating ciphertext [g → ] to find the vector g → A vector g' consisting of the values obtained by subtracting each element of from 1. → The ciphertext [g' → and a plurality of fourth calculation units that calculate Effect of the Invention
[0013] A group by max operation or a group by min operation can be performed on a table to which the flag has been added. [Brief description of the drawings]
[0014] [Figure 1] FIG. 1 is a diagram illustrating an example of the functional configuration of a secure computation system. [Diagram 2] FIG. 2 is a diagram illustrating an example of the functional configuration of a secure computing device that performs a group by max calculation. [Diagram 3] FIG. 3 is a diagram showing an example of an algorithm. [Figure 4] FIG. 4 is a diagram showing an example of an algorithm. [Diagram 5] FIG. 5 is a diagram illustrating an example of an algorithm. [Figure 6] FIG. 6 is a diagram illustrating an example of an algorithm. [Figure 7] FIG. 4 is a diagram for explaining an example of an input and an example of an output. [Figure 8] FIG. 8 is a diagram showing an example of a processing procedure of a secure computation method. [Figure 9] FIG. 9 is a diagram illustrating an example of the functional configuration of a secure computing device that performs a group by min calculation. [Figure 10] FIG. 10 is a diagram showing an example of an algorithm. [Figure 11] FIG. 11 is a diagram illustrating an example of an algorithm. [Figure 12] FIG. 12 is a diagram illustrating an example of an algorithm. [Figure 13] FIG. 13 is a diagram illustrating an example of an algorithm. [Figure 14] FIG. 14 is a diagram showing an example of a processing procedure of a secure computation method. [Figure 15] FIG. 15 is a diagram for explaining the background art. [Figure 16] FIG. 16 is a diagram illustrating an example of a functional configuration of a computer. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS
[0015] Hereinafter, an embodiment of the present invention will be described in detail. In the drawings, components having the same functions are designated by the same reference numerals, and duplicated explanations will be omitted.
[0016] In addition, the symbol " → " should be written directly above the character immediately following it, but due to limitations in text notation, it is written immediately after the character in question.
[0017] Write the encrypted data as [x] and the vector x → =(x1,…,x n ) and write [x → ]=([x1],…,[x n ]. [x] is called the ciphertext of x.
[0018] Encryption is assumed to be performed using a method that allows the following operations to be performed while the data is encrypted, such as secret sharing (for example, Reference 1) or homomorphic encryption (for example, Reference 2). Different encryption methods may be used for the values to be stored, so when the · in the ciphertext [·] is a bit value, the ciphertext [·] is sometimes written as [[·]]. The notation <π> may also be used for substitution. · is an arbitrary value or vector. Different encryption methods may be used for the values to be stored. In other words, these encryption methods may or may not all be the same.
[0019] That is, for any value or vector of α, [α] is the ciphertext of α, and for any permutation of β, <β> is the ciphertext of β.
[0020] <Reference 1>Dai Ikarashi, Ryo Kikuchi, Koki Hamada, and Koji Chida. Actively private and correct MPC scheme in t < n / 2 from passively secure schemes with small overhead. IACR Cryptology ePrint Archive, Vol. 2014, p. 304, 2014. <Reference 2>Zvika Brakerski, Craig Gentry, and Vinod Vaikuntanathan. Fully homomorphic encryption without bootstrapping. Electronic Colloquium on Computational Complexity (ECCC), Vol. 18, p. 111, 2011. Assume that secret sharing and homomorphic encryption are supported for addition, subtraction, and constant multiplication. In other words, assume that the relationship c[a]±[b]±d=[ca±b±d] holds.
[0021] Multiplication can be calculated using the method described in Reference 1 in the case of secret sharing, or homomorphic arithmetic in the case of homomorphic encryption. Multiplication is written as [c]←Mult([a],[b]), where c=ab.
[0022] A stable sort is one where the input [x → ]=([x1],…,[x n ]) for i ∈ {1,…,n-1}, x i '≦x i+1 'such that [x' → ]=([x1'],…,[x n ']), where x i '=x i+1 ', the original x → The order of the above shall take precedence.
[0023] More specifically, stable sorting consists of two algorithms: GENPERM and SORT.
[0024] GENPERM is x → GENPERM is a function that outputs the encrypted version of the permutation π that rearranges x. → ]) is written.
[0025] SORT π x → and rearranged x' →is a function that calculates the encrypted value. For example, SORT calculates [x → ']←SORT(<π>,[x → ]) is written.
[0026] For simplicity of description, when sorting multiple vectors with the same permutation, SORT can be written as, for example, ([x' → ],[y' → ])←SORT(<π>,([x → ],[y → ])).
[0027] The obvious way to configure SORT is to use a sorting network. In addition, if secret sharing is used, SORT can be performed efficiently by the method described in Reference 3.
[0028] <Reference 3>Koji Chida, Koki Hamada, Dai Ikarashi, Ryo Kikuchi, Naoto Kiribuchi, and Benny Pinkas. An secure three-party sorting protocol with an honest majority. IACR Cryptology ePrint Archive, Vol. 2019, p. 695, 2019. The equality test EQ is a function that takes [x] and [y] as input and outputs the ciphertext [e] of e such that if x=y, it is 1, and if x≠y, it is 0. For example, EQ can be written as [e]←EQ([x],[y]). Here, e is 1 if x=y, and 0 if x≠y.
[0029] When testing for equality between multiple elements, EQ can be written as [e]←EQ(([a],[b]),([c],[d])), where e is 1 if a=c and b=d, and 0 otherwise.
[0030] Generally, if data is encrypted in bit representation, equality can be determined by performing a circuit calculation to see if each bit of [xy] is 0. The circuit calculation can be performed using addition, subtraction, and multiplication.
[0031] If the data is encrypted in integer representation, it is possible to perform equality check by converting the data into bit representation using bit decomposition (see, for example, Reference 4) and performing a similar circuit calculation.
[0032] <Reference 4>Ryo Kikuchi, Dai Ikarashi, Takahiro Matsuda, Koki Hamada, and Koji Chida. Efficient bitdecomposition and modulus-conversion protocols with an honest majority. In ACISP 2018, pp.64-82, 2018. If it is also encrypted on mod p, then [(xy) p-1 ] can also be calculated using multiplication to check for equality.
[0033] IFTHEN is a function that takes flag [f] (where f∈{0,1}) and [x], [y] as input, and outputs [x] if f=1, and [y] if f=0. IFTHEN is written, for example, as [e]←IFTHEN([f]:[x],[y]). Here, e is x if f=1, and y if f=0.
[0034] IFTHEN can be implemented, for example, as Mult([f],[x])+Mult([1-f],[y]).
[0035] MODCONV is a function that takes an encrypted bit value [[a]] as input and generates the same encrypted value [a] but with a different ciphertext form. In other words, MODCONV is a function that takes an encrypted bit value [[a]] as input and generates an encrypted value [a] that is the integer representation of a. MODCONV can be written, for example, as [a] ← MODCONV([[a]]).
[0036] BITDECOMP is a function that takes an encrypted integer value [a] as input and generates the same value [[a]], which is the bit representation of a, but with a different ciphertext shape. In other words, BITDECOMP is a function that takes an encrypted integer value [a] as input and generates a ciphertext [[a]], which is the bit representation of a. BITDECOMP is, for example, [[k → ]]←BITDECOMP([k → ]), where k → =(k1,k2,…,k L ), then k=Σ i=1 L 2 i-1 k i It is.
[0037] The number of records in the table that is the subject of processing in the secure computing system, device, method, and program is m. This table is stored in a key vector k → The ciphertext [k → ], a vector of values v → The ciphertext [v → ], a vector of flags f → The ciphertext of [f → ]. The ciphertext [f → Let the elements of ] be ciphertext of bits. If there are no bits, convert them to bits using the bit decomposition protocol.
[0038] FIG. 7(a) shows an example of a table that is the subject of processing in the secure computation system, device, method, and program.
[0039] By performing a group by max operation using the secure computation system, device, method, and program, the table shown in FIG. 7(b) can be obtained from the table shown in FIG. 7(a). → ] is the vector of keys k → A vector k''' with the elements of → [x' → ] is a vector x' consisting of the maximum values of values → This is the ciphertext of [e''' → ] is the vector k''' → A vector of flags e''' corresponding to → is the ciphertext.
[0040] In Figure 7(a), the ciphertext [k → ], the ciphertext [v → The maximum value of an element in [k → ], the ciphertext [v → ] has a maximum value of [1], and the ciphertext [k → ], the ciphertext [v → ]'s maximum element value is [5].
[0041] Therefore, in Fig. 7(b), the ciphertext [k'' → ], the ciphertext [x → ] has an element [3], and the ciphertext [k''' → ], the ciphertext [x' → ] has an element [1], and the ciphertext [k''' → ], the ciphertext [x' → ] has an element of [5].
[0042] Furthermore, by performing a group by min operation using the secure computation system, device, method, and program, the table shown in FIG. 7(c) can be obtained from the table shown in FIG. 7(a). → ] is the vector of keys k → A vector k'' with the elements of → This is the ciphertext of [x'' →] is a vector x'' consisting of the minimum values of values → [g'' → ] is the vector k'' → Vector of flags g'' corresponding to → is the ciphertext.
[0043] In Figure 7(a), the ciphertext [k → ], the ciphertext [v → ] has a minimum value of [3], and the ciphertext [k → ], the ciphertext [v → ] has a minimum value of [1], and the ciphertext [k → ], the ciphertext [v → ]'s minimum element value is [4].
[0044] Therefore, in Fig. 7(c), the ciphertext [k'' → ], the ciphertext [x' → ] has an element [1], and the ciphertext [k''' → ], the ciphertext [x' → ] has an element [1], and the ciphertext [k''' → ], the ciphertext [x' → ] has an element of [4].
[0045] An example of the configuration of a secure computation system and method will be described with reference to Fig. 1. This secure computation system and method performs a so-called group by operation (group by max operation or group by min operation) by secure computation.
[0046] The secure computation system is composed of N (≧2) secure computation devices 11, ..., 1 N In this embodiment, the secure computing devices 11, ..., 1 NEach of the secure computing devices 11, ..., 1 is connected to a communication network 2. The communication network 2 is a circuit-switched or packet-switched communication network configured so that the connected devices can communicate with each other, such as the Internet, a LAN (Local Area Network), or a WAN (Wide Area Network). Note that the devices do not necessarily need to be able to communicate online via the communication network 2. For example, the secure computing devices 11, ..., 1 N The information to be input to the secure computing device 11, ..., 1 is stored in a portable recording medium such as a magnetic tape or a USB memory, and the information is read from the portable recording medium to the secure computing device 11, ..., 1 N It may also be configured so that the data can be input offline.
[0047] Secret computing device 1 n Each component of (1≦n≦N) is another secure computing device 1 n' The secret combining method of the embodiment is realized by carrying out the processes of each step described below and exemplified in FIG. 8 or FIG. 14 in cooperation with each component (n′=1, . . . , N, where n≠n′).
[0048] The process of each step is performed by secure computation. n performs each step without recovering the ciphertext, in other words, without knowing the contents of the ciphertext.
[0049] Secret computing device 1 n The secure computing device 1 is a special device configured by loading a special program into a publicly known or dedicated computer having a central processing unit (CPU), a main memory (RAM), etc. n For example, the secure computing device 1 executes each process under the control of the central processing unit. n The data input to the secure computing device 1 and the data obtained in each process are stored in, for example, a main memory device, and the data stored in the main memory device is read out to the central processing unit as necessary and used for other processes. nAt least a part of each of the components may be configured by hardware such as an integrated circuit.
[0050] [group by max] First, the secure computing device 1 that performs the group by max operation n The processing of each component will be described.
[0051] Secure computation device 1 of a secure computation system that performs group by max operations n For example, as shown in FIG. n , second calculation section 12 n , Third calculation part 13 n , Fourth calculation part 14 n , output section 15 n It is equipped with:
[0052] <First calculation section 111,…,11 N > The first calculation units 2 include a vector f → The ciphertext of [f → ], vector k → The ciphertext [k → ] and vector v → The ciphertext [v → ] will be entered.
[0053] The first calculation units 2 calculate the vector f → The ciphertext [f → ], vector k → The ciphertext [k → ] and vector v → The ciphertext [v → ] to obtain the vector f → Negation of vector k → and vector v → Using the combined vector as a key, vector f → , vector k → and vector v → Vector f' obtained by sorting each of → , vector k' → and vector v' → The ciphertext [f' → ], ciphertext [k'→ ] and the ciphertext [v' → ] is generated (step S1).
[0054] The plurality of first calculation units 111, . . . , 11 N The processing described above is realized, for example, by the processing from "1:" to "4:" in FIG.
[0055] That is, a plurality of first calculation units 111, . . . , 11 N teeth, 1:([[k †→ ]],[[v †→ ]])←BITDECOMP([k → ],[v → ]) 2:[[f *→ ]]←1-[[f → ]] 3:<π>←GENPERM([[f *→ ]],[[k †→ ]],[[v †→ ]]) 4: ([[k' → ]],[k' → ],[v' → ],[[f' → ]])←SORT(<π>,([[k †→ ]],[k → ],[v → ],[[f → ]])) For example, the following process is performed.
[0056] In the example in Figure 3, the ciphertext [f' → ] as the ciphertext [[f' → In the example in Figure 3, the ciphertext [k' → ] as the ciphertext [[k' → ]] and ciphertext [k' → ] is generated.
[0057] In addition, GENPERM([[f *→ ]],[[k †→ ]],[[v †→ ]]) is the ciphertext [[f *→ ]], ciphertext [[k †→]] and the ciphertext [[v †→ Using ]], we get the vector f *→ , vector k †→ and vector v †→ This means the process of generating a ciphertext <π> of a permutation π by stably sorting the vector obtained by combining each element of
[0058] <Second calculation section 121,…,12 N > A plurality of second calculation units 121, ..., 12 N is entered in .
[0059] A plurality of second calculation units 121, ..., 12 N is the ciphertext [f' → ] and the ciphertext [k' → ], for i = 1, ..., m-1, f' i = 1 and k' i ≠k' i+1 or f' i =1 and f' i+1 When =0, e' i =0, otherwise e' i = 1, and f' m When =1, e' m =0, otherwise e' m e' such that =1 m The ciphertext [e' m ], e i Vector e' with elements (i=1,…,m) → The ciphertext [e' → ] is generated (step S2).
[0060] The plurality of second calculation units 121, . . . , 12 N The processing described above is realized, for example, by the processing from "5:" to "10:" in FIG.
[0061] That is, a plurality of second calculation units 121, . . . , 12 N teeth, 5:each 1≦i≦m-1 do 6: [[e i ]]←IFTHEN([[f' i EQ([[k'i ]],[[k' i+1 ]]),[[1]]) 7: [[e' i ]]←IFTHEN([[f' i ]]XOR[[f' i+1 ]]:[[0]],[[e i ]]) 8: [e' i ]←MODCONV([[e' i ]]) 9: [[e' m ]]=1-[[f' m ]] 10:[e' m ]←MODCONV([[e' m ]]) For example, the following process is performed.
[0062] <Third calculation section 131,…,13 N > A plurality of third calculation units 131, ..., 13 N is entered in .
[0063] A plurality of third calculation units 131, ..., 13 N is the ciphertext [e' → ] and the ciphertext [v' → ], for i = 1, ..., m, the vector e' → Element e' of i If =0, the value is v' i and the vector e' → Element e' of i = 1 if x has value 0 i The ciphertext of [x i ], x i Vector x with elements (i=1,…,m) → The ciphertext of [x → ] is generated (step S3).
[0064] The plurality of third calculation units 131, . . . , 13 N The processing described above is realized, for example, by the processing from "11:" to "12:" in FIG.
[0065] That is, a plurality of third calculation units 131, . . . , 13 N teeth, 11:each 1≦i≦m do 12: [x i ]←IFTHEN([e' i ]:[0],[v' i ]) For example, the following process is performed.
[0066] <Fourth calculation section 141,…,14 N > A plurality of fourth calculation units 141, ..., 14 N is entered in .
[0067] A plurality of fourth calculation units 141, ..., 14 N is the ciphertext [e' → ] to obtain the vector e' → A vector e''' consisting of the values of each element of → The ciphertext [e''' → ] is calculated (step S4).
[0068] The plurality of fourth calculation units 141, . . . , 14 N The process described above is realized, for example, by the process of "13:" in FIG.
[0069] That is, a plurality of fourth calculation units 141, . . . , 14 N teeth, 13:[[e''' → ]] =1-[[e' → ]] For example, the following process is performed.
[0070] <Output section 151, ..., 15 N > A plurality of output units 151, ..., 15 N contains the ciphertext [k' → ], ciphertext [x → ] and the ciphertext [e''' → ] will be entered.
[0071] A plurality of output units 151, ..., 15 N is the ciphertext [k'→ ], ciphertext [x → ] and the ciphertext [e''' → ] is output (step S5).
[0072] In addition, the secure computing device 11, …, 1 N The output sorting process may be performed by a plurality of fourth calculation units 141, . . . , 14 N This is realized, for example, by the processes from "13:" to "14:" in FIG.
[0073] That is, a plurality of fourth calculation units 141, . . . , 14 N teeth, 13:<π'>←GENPERM([[e' → ]]) 14: ([x' → ],[[e'' → ]],[k''])←SORT(<π'>,([x → ],[[e' → ]],[k' → ])) 15:[[e''' → ]] =1-[[e'' → ]] For example, the following process may be performed.
[0074] In this case, multiple output units 151, . . . , 15 N is the ciphertext [k' → ] is replaced with the ciphertext [k'' → ] and output the ciphertext [x → ] is replaced with the ciphertext [x' → ] is output.
[0075] In addition, the secure computing device 11, …, 1 N The third calculation units 131, . . . , 13 may perform so-called null processing. N This is realized, for example, by the process of "13:" in FIG.
[0076] That is, a plurality of third calculation units 131, . . . , 13 N teeth, 11:each 1≦i≦m do 12: [x i ]←IFTHEN([e' i ]:[0],[v' i ]) 13: [k'' i ]←IFTHEN([e' i ]:[null],[k' i ]) For example, the following process may be performed: The processes at "11:" and "12:" in FIG. 5 are the same as the processes at "11:" and "12:" in FIG.
[0077] In this case, multiple output units 151, . . . , 15 N is the ciphertext [k' → ] is replaced with the ciphertext [k'' → ] is output.
[0078] In addition, the secure computing device 11, …, 1 N may perform so-called output sorting and so-called null handling.
[0079] This null processing is performed by, for example, a plurality of third calculation units 131, . . . , 13 N This is realized, for example, by the process of "13:" in FIG.
[0080] That is, a plurality of third calculation units 131, . . . , 13 N teeth, 13: [k'' i ]←IFTHEN([e' i ]:[null],[k' i ]) The following process may be performed.
[0081] This output sorting process is performed by a plurality of fourth calculation units 141, . . . , 14 N This is realized, for example, by the processes from "14:" to "15:" in FIG.
[0082] That is, a plurality of fourth calculation units 141, . . . , 14 N teeth, 14:<π'>←GENPERM([[e' → ]]) 15: ([x' → ],[[e'' → ]],[k'''])←SORT(<π'>,([x → ],[[e' → ]],[k'' → ])) 16:[[e''' → ]] =1-[[e'' → ]] The following process may be performed.
[0083] In this case, multiple output units 151, . . . , 15 N is the ciphertext [k' → ] is replaced with the ciphertext [k'' → ] and output the ciphertext [x → ] is replaced with the ciphertext [x' → ] is output.
[0084] By these output sorting and null processing, for example, the ciphertext [k'' → ], ciphertext [x' → ] and the ciphertext [[e''' → ]] is obtained.
[0085] In addition, the plurality of output units 151, . . . , 15 N It is not necessary to output the ciphertext corresponding to the dummy record.
[0086] That is, a plurality of output units 151, . . . , 15 N is the ciphertext [k' → ] or ciphertext [k'' → ] or ciphertext [k''' → ], ciphertext [x → ] or ciphertext [x' → ] and the ciphertext [[e''' → ]] to obtain the ciphertext [k' → ] or ciphertext [k'' → ] or ciphertext [k''' → ] and the ciphertext [x → ] or ciphertext [x' →] to vector e''' → Element e of i It is also possible to output '''' with the elements corresponding to the elements indicating the dummy records deleted.
[0087] Ciphertext [k''' → ], ciphertext [x' → ] and the ciphertext [[e''' → 7(b), multiple output units 151, . . . , 15 N is the ciphertext [[e''' → ]], the ciphertext [k''' → ] and the ciphertext [x' → In this case, the multiple output units 151, ..., 15 N is the ciphertext [k''' → ] and the ciphertext [x' → ] may be output up to the third element.
[0088] In addition, in Fig. 7(b), the ciphertext [[e'' → ]] is [[0]], in other words, the ciphertext [k''' → Records with [null] are dummy records.
[0089] [group by min] Next, the secure computing device 1 that performs the group by min operation n The processing of each component will be described.
[0090] Secure computation device 1 of a secure computation system that performs group by max operations n For example, as shown in FIG. 9, the first calculation unit 11 n , second calculation section 12 n , Third calculation part 13 n , Fourth calculation part 14 n , output section 15 n It is equipped with:
[0091] <First calculation section 111,…,11 N > A plurality of first calculation units 111, ..., 11 N In the vector f → The ciphertext [f → ], vector k → The ciphertext [k → ] and vector v → The ciphertext [v → ] will be entered.
[0092] A plurality of first calculation units 111, ..., 11 N is the vector f → The ciphertext [f → ], vector k → The ciphertext [k → ] and vector v → The ciphertext [v → ] to obtain the vector f → Negation of vector k → and vector v → Using the combined vector as a key, vector f → , vector k → and vector v → Vector f' obtained by sorting each of → , vector k' → and vector v' → The ciphertext [f' → ], ciphertext [k' → ] and the ciphertext [v' → ] is generated (step S1).
[0093] The plurality of first calculation units 111, . . . , 11 N The process is realized, for example, by the processes from "1:" to "4:" in FIG.
[0094] That is, a plurality of first calculation units 111, . . . , 11 N teeth, 1:([[k †→ ]],[[v †→ ]])←BITDECOMP([k → ],[v → ]) 2:[[f *→ ]]←1-[[f → ]] 3:<π>←GENPERM([[f*→ ]],[[k †→ ]],[[v †→ ]]) 4: ([[k' → ]],[k' → ],[v' → ],[[f' → ]])←SORT(<π>,([[k †→ ]],[k → ],[v → ],[[f → ]])) For example, the following process is performed.
[0095] In the example in Figure 10, the ciphertext [f' → ] as the ciphertext [[f' → In the example in Figure 3, the ciphertext [k' → ] as the ciphertext [[k' → ]] and ciphertext [k' → ] is generated.
[0096] In addition, GENPERM([[f *→ ]],[[k †→ ]],[[v †→ ]]) is the ciphertext [[f *→ ]], ciphertext [[k †→ ]] and the ciphertext [[v †→ Using ]], we get the vector f *→ , vector k †→ and vector v †→ This means the process of generating a ciphertext <π> of a permutation π by stably sorting the vector obtained by combining each element of
[0097] <Second calculation section 121,…,12 N > A plurality of second calculation units 121, ..., 12 N is entered in .
[0098] A plurality of second calculation units 121, ..., 12 N is the ciphertext [f' → ] and the ciphertext [k' → ], for i = 1, ..., m-1, f' i = 1 and k'i ≠k' i+1 or f' i =1 and f' i+1 When g = 0 i = 0, otherwise g i = 1, and if f'1 = 0 then g1 = 1, otherwise g1 = 0. By generating the ciphertext [g1] of g1, g i Vector g with elements (i=1,…,m) → The ciphertext [g → ] is generated (step S2).
[0099] The plurality of second calculation units 121, . . . , 12 N The process is realized, for example, by the processes from "5:" to "11:" in FIG.
[0100] That is, a plurality of second calculation units 121, . . . , 12 N teeth, 5:each 1≦i≦m-1 do 6: [[e i ]]←IFTHEN([[f' i EQ([[k' i ]],[[k' i+1 ]]),[[1]]) 7: [[e' i ]]←IFTHEN([[f' i ]]XOR[[f' i+1 ]]:[[0]],[[e i ]]) 8: [[e'0]]=1-[[f'1]] 9:each 1≦i≦m do 10: [[g i ]]←IFTHEN([[f' i ]]:[[e' i-1 ]],[[1]]) 11: [g i ]←MODCONV([[g i ]]) For example, the following process is performed.
[0101] <Multiple third calculation units 131, ..., 13 N > A plurality of third calculation units 131, ..., 13 N is entered in .
[0102] A plurality of third calculation units 131, ..., 13 N is the ciphertext [g → ] and the ciphertext [v' → ], for i = 1, ..., m, the vector g → Element g of i If =0, the value is v' i and the vector g → Element g of i = 1, then x has a value of 0 i The ciphertext of [x i ], x i Vector x with elements (i=1,…,m) → The ciphertext of [x → ] is generated (step S3).
[0103] The plurality of third calculation units 131, . . . , 13 N The process described above is realized, for example, by the process of "12:" in FIG.
[0104] That is, a plurality of third calculation units 131, . . . , 13 N teeth, (9:each 1≦i≦m do) 12: [x i ]←IFTHEN([g i ]:[0],[v' i ]) For example, the following process is performed.
[0105] The process of "12:" in FIG. 10 is included in the repeated process starting from "9:" in FIG. 10, so the process of "9:" in FIG. 10 (in parentheses) is also shown above.
[0106] <Multiple fourth calculation units 141, ..., 14 N > A plurality of fourth calculation units 141, ..., 14 N is entered in .
[0107] A plurality of fourth calculation units 141, ..., 14 N is the ciphertext [g → ] to find the vector g → A vector g' consisting of the values obtained by subtracting each element of from 1. → The ciphertext [g' → ] is calculated (step S4).
[0108] The plurality of fourth calculation units 141, . . . , 14 N The process is realized, for example, by the process of "13:" in FIG.
[0109] That is, a plurality of fourth calculation units 141, . . . , 14 N teeth, 13: [[g' → ]]←1-[[g → ]] For example, the following process is performed.
[0110] In the example of Figure 10, the ciphertext [g' → ] as the ciphertext [[g' → ]] is generated.
[0111] <Output section 151, ..., 15 N > A plurality of output units 151, ..., 15 N contains the ciphertext [k' → ], ciphertext [x → ] and the ciphertext [g' → ] will be entered.
[0112] A plurality of output units 151, ..., 15 N is the ciphertext [k' → ], ciphertext [x → ] and the ciphertext [g' → ] is output (step S5).
[0113] In addition, the secure computing device 11, …, 1 N The output sorting process may be performed by a plurality of fourth calculation units 141, . . . , 14 NThis is realized, for example, by the processes from "13:" to "15:" in FIG.
[0114] That is, a plurality of fourth calculation units 141, . . . , 14 N teeth, 13:<π'>←GENPERM([[g → ]]) 14: ([x' → ],[[g' → ]],[k'' → ])←SORT(<π'>,([x → ],[[g → ]],[k' → ])) 15:[[g'' → ]]←1-[[g' → ]] For example, the following process may be performed.
[0115] In this case, multiple output units 151, . . . , 15 N is the ciphertext [k' → ] is replaced with the ciphertext [k'' → ] and output the ciphertext [x → ] is replaced with the ciphertext [x' → ] and output the ciphertext [g' → ] is replaced with the ciphertext [g'' → ] is output.
[0116] In addition, the secure computing device 11, …, 1 N The third calculation units 131, . . . , 13 may perform so-called null processing. N This is realized, for example, by the process of "13:" in FIG.
[0117] That is, a plurality of third calculation units 131, . . . , 13 N teeth, (9:each 1≦i≦m do) 13: [k'' i ]←IFTHEN([g' i ]:[null],[k' i ]) For example, the following process may be performed.
[0118] The process of "13:" in FIG. 12 is included in the repeated process starting from "9:" in FIG. 10, so the process of "9:" in FIG. 12 (in parentheses) is also shown above.
[0119] In this case, multiple output units 151, . . . , 15 N is the ciphertext [k' → ] is replaced with the ciphertext [k'' → ] is output.
[0120] In addition, the secure computing device 11, …, 1 N may perform so-called output sorting and so-called null handling.
[0121] This null processing is performed by, for example, a plurality of third calculation units 131, . . . , 13 N This is realized, for example, by the process of "13:" in FIG.
[0122] That is, a plurality of third calculation units 131, . . . , 13 N teeth, (9:each 1≦i≦m do) 13: [k'' i ]←IFTHEN([g' i ]:[null],[k' i ]) The following process may be performed.
[0123] The process of "13:" in FIG. 13 is included in the repeated process starting from "9:" in FIG. 13, so the process of "9:" in FIG. 13 (in parentheses) is also shown above.
[0124] This output sorting process is performed by a plurality of fourth calculation units 141, . . . , 14 N This is realized, for example, by the processes from "14:" to "15:" in FIG.
[0125] That is, a plurality of fourth calculation units 141, . . . , 14 N teeth, 14:<π'>←GENPERM([[g→ ]]) 15: ([x' → ],[[g' → ]],[k''' → ])←SORT(<π'>,([x → ],[[g → ]],[k'' → ])) 16: [[g'' → ]]←1-[[g' → ]] The following process may be performed.
[0126] In this case, multiple output units 151, . . . , 15 N is the ciphertext [k' → ] is replaced with the ciphertext [k''' → ] and output the ciphertext [x → ] is replaced with the ciphertext [x' → ] and output the ciphertext [g' → ] is replaced with the ciphertext [g'' → ] is output.
[0127] By these output sorting and null processing, for example, the ciphertext [k''' shown in Figure 7(c) is obtained. → ], ciphertext [x' → ] and the ciphertext [[g'' → ]] is obtained.
[0128] In addition, the plurality of output units 151, . . . , 15 N It is not necessary to output the ciphertext corresponding to the dummy record.
[0129] Ciphertext [k''' → ], ciphertext [x' → ] and the ciphertext [[g'' → 7(c), multiple output units 151, . . . , 15 N is the ciphertext [[g'' → ]], the ciphertext [k''' → ] and the ciphertext [x' → In this case, the multiple output units 151, ..., 15 Nis the ciphertext [k''' → ] and the ciphertext [x' → ] may be output up to the third element.
[0130] In this way, by sorting by placing the negation of the dummy flag in the most significant bit, the dummy record is made the lowest record, and for the group boundary determination bit, an if statement is added so that if the flag is 0, it is not a boundary, and in the min processing, a similar if statement is added when using the flag of the previous record, making it possible to achieve group by max / min without decoding.
[0131] [Variations] Although the embodiments of the present invention have been described above, the specific configurations are not limited to these embodiments, and it goes without saying that the present invention includes appropriate design changes and the like as long as they do not deviate from the spirit of the present invention.
[0132] The various processes described in the embodiments may not only be executed in chronological order according to the order described, but may also be executed in parallel or individually depending on the processing capabilities of the devices executing the processes or as necessary.
[0133] For example, data exchange between components of the secure computing device may be performed directly, or may be performed via a storage unit (not shown).
[0134] [Programs, recording media] The processing of each unit of each of the above-mentioned devices may be realized by a computer, in which case the processing contents of the functions that each device should have are described by a program. Then, by loading this program into the storage unit 1020 of the computer 1000 shown in Fig. 16 and operating the arithmetic processing unit 1010, the input unit 1030, the output unit 1040, etc., various processing functions of each of the above-mentioned devices are realized on the computer.
[0135] The program describing the processing contents can be recorded on a computer-readable recording medium. The computer-readable recording medium is, for example, a non-transitory recording medium, specifically, a magnetic recording device, an optical disk, etc.
[0136] The program may be distributed, for example, by selling, transferring, lending, etc. portable recording media such as DVDs and CD-ROMs on which the program is recorded. Furthermore, the program may be distributed by storing the program in a storage device of a server computer and transferring the program from the server computer to other computers via a network.
[0137] A computer that executes such a program, for example, first stores a program recorded on a portable recording medium or a program transferred from a server computer in the auxiliary recording unit 1050, which is a non-transient storage device of the computer. Then, when executing a process, the computer reads the program stored in the auxiliary recording unit 1050, which is a non-transient storage device of the computer, into the storage unit 1020, and executes a process according to the read program. As another execution form of the program, the computer may directly read the program from the portable recording medium into the storage unit 1020 and execute a process according to the program, or may execute a process according to the received program each time a program is transferred from the server computer to the computer. Alternatively, the server computer may not transfer the program to the computer, but may execute the above-mentioned process by a so-called ASP (Application Service Provider) type service that realizes a processing function only by issuing an execution instruction and obtaining a result. Note that the program in this embodiment includes information used for processing by an electronic computer and equivalent to a program (data that is not a direct instruction to a computer but has a nature that specifies the processing of the computer, etc.).
[0138] In addition, in this embodiment, the present device is configured by executing a specific program on a computer, but at least a part of the processing contents may be realized by hardware.
[0139] Needless to say, other modifications can be made without departing from the spirit of the present invention.
Claims
1. A secure computing system including a plurality of secure computing devices, m is the number of records and is an integer equal to or greater than 1, and k → is the vector of keys k → =(k 1 ,…,k m ), and v → is the vector of values v → =(v 1 ,…,v m ), and f → is a vector of flags f → =(f 1 ,…,f m ) where α is an arbitrary value or vector, [α] is the ciphertext of α, and a predetermined operation can be performed using α as the ciphertext. The plurality of secure computing devices The vector f → The ciphertext [f → ], the vector k → The ciphertext [k → ] and the vector v → The ciphertext [v → ] to obtain the vector f → Negation of the vector k → and the vector v → The vector f → , the vector k → and the vector v → The vector f' is a sorted version of → , vector k' → and vector v' → The ciphertext [f' → ], ciphertext [k' → ] and the ciphertext [v' → [0036] A plurality of first calculation units for generating The ciphertext [f' → ] and the ciphertext [k' → ], for i = 1, ..., m-1, f' i = 1 and k' i ≠k' i+1 or f' i =1 and f' i+1 When =0, e' i =0, otherwise e' i = 1, and f' m When =1, e' m =0, otherwise e' m e' such that =1 m The ciphertext [e' m ], e i Vector e' with elements (i=1,…,m) → The ciphertext [e' → [0036] and The ciphertext [e' → ] and the ciphertext [v' → ], where i = 1, ..., m, the vector e' → Element e' of i If =0, the value is v' i and the vector e' → Element e' of i = 1 if x has value 0 i The ciphertext of [x i ], x i Vector x with elements (i=1,…,m) → The ciphertext of [x → ], and The ciphertext [e' → ] to obtain the vector e' → A vector e''' consisting of the values of each element of → The ciphertext of [e''' → [0036] and a plurality of fourth calculation units for calculating A secure computing system including:
2. The secure computing system of claim 1, The plurality of fourth calculation units calculates the ciphertext [e' → ], the ciphertext [x → ] and the ciphertext [k' → ] to obtain the vector e' → With the key, the vector x → , the vector k' → and the vector e' → The vector x' is a sorted version of → , the vector k'' → and the vector e'' → The ciphertext [x' → ],ciphertext[k'' → ] and the ciphertext [e'' → ] and generate the ciphertext [e'' → ] to obtain the vector e'' → A vector e''' consisting of the values of each element of → The ciphertext of [e''' → Calculate Secret calculation system.
3. The secure computing system according to claim 1 or 2, The plurality of secure computing devices → ] or the ciphertext [k'' → ], the ciphertext [x → ] and the ciphertext [e''' → ], Secret calculation system.
4. The secure computing system of claim 3, The output units do not output ciphertexts corresponding to dummy records. Secret calculation system.
5. A secure computing system including a plurality of secure computing devices, m is the number of records and is an integer equal to or greater than 1, and k → is the vector of keys k → =(k 1 ,…,k m ), and v → is the vector of values v → =(v 1 ,…,v m ), and f → is a vector of flags f → =(f 1 ,…,f m ) where α is an arbitrary value or vector, [α] is the ciphertext of α, and a predetermined operation can be performed using α as the ciphertext. The plurality of secure computing devices The vector f → The ciphertext [f → ], the vector k → The ciphertext [k → ] and the vector v → The ciphertext [v → ] to obtain the vector f → Negation of the vector k → and the vector v → The vector f → , the vector k → and the vector v → The vector f' is a sorted version of → , vector k' → and vector v' → The ciphertext [f' → ], ciphertext [k' → ] and the ciphertext [v' → [0036] A plurality of first calculation units for generating The ciphertext [f' → ] and the ciphertext [k' → ], for i = 1, ..., m-1, f' i = 1 and k' i ≠k' i+1 or f' i =1 and f' i+1 When g = 0 i = 0, otherwise g i = 1, and f' 1 When g = 0 1 = 1, otherwise g 1 = 0 such that g 1 The ciphertext [g 1 ], g i Vector g with elements (i=1,…,m) → The ciphertext [g → [0036] and The ciphertext [g → ] and the ciphertext [v' → ], where i = 1, ..., m, the vector g → Element g of i If =0, the value is v' iand the vector g → Element g of i = 1 if x has value 0 i The ciphertext of [x i ], x i Vector x with elements (i=1,…,m) → The ciphertext of [x → ]; and The ciphertext [g → ] to obtain the vector g → A vector g' consisting of the values obtained by subtracting each element of from 1. → The ciphertext [g' → A secure computation system comprising: a plurality of fourth computation units that compute .
6. The secure computing system of claim 5, The plurality of fourth calculation units calculate the ciphertext [g → ], the ciphertext [x → ] and the ciphertext [k' → ] to obtain the vector g → With the key, the vector x → , the vector k' → and the vector g → The vector x' is a sorted version of → , the vector k'' → and the vector g' → The ciphertext [x' → ],ciphertext[k'' → ] and the ciphertext [g' → ] and generate the ciphertext [g' → ] to obtain the vector g' → A vector g'' consisting of the values obtained by subtracting each element of → The ciphertext [g'' → Calculate Secret calculation system.
7. The secure computing system according to claim 5 or 6, The plurality of secure computing devices → ] or the ciphertext [k'' → ], the ciphertext [x → ], and the ciphertext [g' → ] or the ciphertext [g'' → ], Secret calculation system.
8. The secure computing system of claim 7, The output units do not output ciphertexts corresponding to dummy records. Secret calculation system.
9. A secure computing device of the secure computing system according to any one of claims 1 to 8.
10. m is the number of records and is an integer equal to or greater than 1, and k → is the vector of keys k → =(k 1 ,…,k m ), and v → is the vector of values v → =(v 1 ,…,v m ), and f → is a vector of flags f → =(f 1 ,…,f m ) where α is an arbitrary value or vector, [α] is the ciphertext of α, and a predetermined operation can be performed using α as the ciphertext. A plurality of first calculation units calculate the vector f → The ciphertext of [f → ], the vector k → The ciphertext [k → ] and the vector v → The ciphertext [v → ] to obtain the vector f → Negation of the vector k → and the vector v → The vector f → , the vector k → and the vector v → The vector f' is a sorted version of → , vector k' → and vector v' → The ciphertext [f' → ], ciphertext [k' → ] and the ciphertext [v' → a first computational step generating A plurality of second calculation units calculate the ciphertext [f' → ] and the ciphertext [k' → ], for i = 1, ..., m-1, f' i = 1 and k' i ≠k' i+1 or f' i =1 and f' i+1 When =0, e' i =0, otherwise e' i = 1, and f' m When =1, e' m =0, otherwise e' m e' such that =1 m The ciphertext [e' m ], e i Vector e' with elements (i=1,…,m) → The ciphertext [e' → [0046]; and A plurality of third calculation units calculate the ciphertext [e' → ] and the ciphertext [v' → ], where i = 1, ..., m, the vector e' → Element e' of i If =0, the value is v' i and the vector e' → Element e' of i = 1 if x has value 0 i The ciphertext of [x i ], x i Vector x with elements (i=1,…,m) → The ciphertext of [x → and a third computational step of generating A plurality of fourth calculation units calculate the ciphertext [e' → ] to obtain the vector e' → A vector e''' consisting of the values of each element of → The ciphertext [e''' → a fourth computational step of computing A secret computation method including:
11. m is the number of records and is an integer equal to or greater than 1, and k → is the vector of keys k → =(k 1 ,…,k m ), and v → is the vector of values v → =(v 1 ,…,v m ), and f → is a vector of flags f → =(f 1 ,…,f m ) where α is an arbitrary value or vector, [α] is the ciphertext of α, and a predetermined operation can be performed using α as the ciphertext. A plurality of first calculation units calculate the vector f → The ciphertext [f → ], the vector k → The ciphertext [k → ] and the vector v → The ciphertext [v → ] to obtain the vector f → Negation of the vector k → and the vector v → The vector f → , the vector k → and the vector v → The vector f' is a sorted version of → , vector k' → and vector v' → The ciphertext [f' → ], ciphertext [k' → ] and the ciphertext [v' → a first computational step generating A plurality of second calculation units calculate the ciphertext [f' → ] and the ciphertext [k' → ], for i = 1, ..., m-1, f' i = 1 and k' i ≠k' i+1 or f' i =1 and f' i+1 When g = 0 i = 0, otherwise g i = 1, and f' 1 When g = 0 1 = 1, otherwise g 1 = 0 such that g 1 The ciphertext [g 1 ], g i Vector g with elements (i=1,…,m) → The ciphertext [g → [0046]; and A plurality of third calculation units calculate the ciphertext [g → ] and the ciphertext [v' → ], where i = 1, ..., m, the vector g → Element g of i If =0, the value is v' i and the vector g → Element g of i = 1 if x has value 0 i The ciphertext of [x i ], x i Vector x with elements (i=1,…,m) → The ciphertext of [x → and a third computational step of generating A plurality of fourth calculation units calculate the ciphertext [g → ] to obtain the vector g → A vector g' consisting of the values obtained by subtracting each element of from 1. → The ciphertext [g' → a fourth computational step of computing A secret computation method including:
12. A program for causing a computer to function as each step of the secure computation method according to claim 10 or 11.
Citation Information
Patent Citations
Secret set calculation device and method
JP2014164145A
Data aggregation / analysis system and method therefor
WO2016120975A1
