摘要:
A database system comprises a determining part 13 determining whether or not to conceal information to be registered in a database, a terminal device 1 that, if the determining part 13 determines that the information is to be concealed, generates N information fragments by secret-sharing the information and sends the N information fragments to a system management device 2, where N is a predetermined positive integer, the system management device 2 sending the N information fragments received from the terminal device 1 to N different database devices 3, and N database devices 3 each storing one of N information fragments received from the system management device 2.
摘要:
A vector which includes duplicate elements and a matrix which is a coupling object are respectively converted into a vector which includes no duplication and a matrix corresponding to the vector. A matrix and key generation device includes a vector generation unit, a set generation unit, a matrix generation unit, and a key generation unit. The vector generation unit generates a vector x n so that X n [i]≠x n [j] if k n [i]=k n [j] at i≠j. The set generation unit generates a set B n,j so that individual elements correspond to combinations of the N-1 pieces of elements, which are individually selected from sets M 0 , ..., M N-1 other than a set M n , and x n [j] and the elements for all of the combinations are included. The matrix generation unit generates a matrix T n ' so that the matrix T n ' includes rows identical to T n [j] in the number equal to the number of elements of the set B n,j . The key generation unit generates a vector k n ' so that elements of the matrix T n ' which correspond to a row identical to T n [j] correspond to combinations of k n [j] and elements of the set B n,j and further, the elements of the set B n,j are different from each other when there are a plurality of rows identical to T n [j].
摘要:
Determination as to whether a nondecreasing sequence exists or not is efficiently made. A sorting part 10 sorts elements of a set P i in ascending order to generate vectors t i,i+1 and b i,i+1 . A merging part 20 generates vectors t 0,m and b 0,m by repeating the process of merging vectors (t i,j , b i,j ) and (t j,k , b j,k ) to generate (t i,k , b i,k ). A stable-sorting part 21 generates a vector e by coupling and stably sorting vectors b i,j and t j,k . A searching part 22 searches for sets of (λ, x, y) in which e[λ] is b i,j [x] and e[λ + 1] is t j,k [y] and generates a set X including all x and a set Y including all y. An extracting part 23 sorts t i,j [x] (x ∈ X) in ascending order to generate a vector t i,k and sorts b j,k [y] (y ∈ Y) in ascending order to generate a vector b j,k . If the length of a vector t 0,m is 0, a determining part 30 outputs a result of determination that indicates the absence of a nondecreasing sequence.
摘要:
The positions in a text in which partial character strings in a pattern appear are efficiently detected. A partial-character-string position detecting device 1 takes inputs of a secret text [t] of a text t, a secrete text of a pattern p, a secret text of a vector c, and a secret text of a matrix E and outputs a secret text of a matrix H. A first matrix generating part 20 generates a secret text of a matrix F, in which F[i][j] = E[i][j + i mod n + 1] (where it is assumed that E[i][n] = ¬c[i]). A second matrix generating part 30 generates a secret text of a matrix F', in which F[i][j] = 1 is set if c[i] = 0 or if c[i] = 1 and F[k][j] = 1 for every k that is successively c[k] = 1, otherwise F[i][j] = 0 is set, where k = i, ..., n - 1. A third matrix generating part 40 computes = ∧ ∧ ¬c[i - 1]> to generate the secrete text .
摘要:
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 11 n , a first permutation calculation unit 12 n , a first vector generation unit 13 n , a second vector joining unit 14 n , a first permutation application unit 15 n , a second vector generation unit 16 n , a first inverse permutation application unit 17 n , a first vector extraction unit 18 n , a second permutation application unit 19 n , a third vector extraction unit 110 n , a second inverse permutation application unit 111 n , a second vector extraction unit 112 n , a modified second table generation unit 113 n , a third permutation application unit 114 n , a fourth vector generation unit 115 n , a shifting unit 116 n , a third inverse permutation application unit 117 n , a bit inversion unit 118 n , a third vector extraction unit 119 n , a modified first table generation unit 120 n , a first table joining unit 121 n , and a first table formatting unit 122 n .
摘要:
A relay device 12 is provided which transfers a plurality of original data fragments corresponding to a plurality of secret sharing values of original data to a plurality of secure computation devices, transfers, to each of the secure computation devices, a request to send a result fragment based on a secure computation result corresponding to any one of the original data fragments, and transfers the result fragment. The relay device 12 controls timing with which the original data fragments are transferred and timing with which the request to send is transferred.