摘要:
A second set including a plurality of elements a 5 (1), ..., a 5 (N) or a concealed text of the second set is obtained, where the second set is obtained by setting a replication source element a(f(h)) included in a first set to an element a(f(h))-a(f(h-1)) and setting elements other than the replication source in the first set to zero with respect to h=2, ..., M. An additive inverse of a replication source element a(f(h-1)) of which the order is before the replication source element a(f(h)) and is the closest to the replication source element a(f(h)) is -a(f(h-1)). The second set or the concealed text of the second set is used to obtain a third set or a concealed text of the third set. The third set is a set including a first element b(1)=a 5 (1) and i=2, ..., Nth element b(i)=b(i-1)+a 5 (i).
摘要:
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 .
摘要:
Secret calculation including secret random permutation is performed at high speed. In unit permutation step 12, random permutation devices p 0 , ..., p k-1 perform permutation of additive secret sharing values «a» Ái of a plain text a with sub shares À Ái of permutation data À. In resharing step S 14, the random permutation device p 0 generates additive secret sharing values «a» Ái+1 pk by using random numbers r 1 , ..., r k-1 which are respectively shared with random permutation devices p j (j=1,...,k-1) so as to transmit the additive secret sharing values «a» Ái+1 pk to the random permutation device p k and each of the random permutation devices p j generates additive secret sharing values «a» Ái+1 pj by using random numbers r j .
摘要:
To provide a secret quotient transfer device that can reduce the communication cost. On the assumption that u denotes a natural number and represents a boundary value, m denotes an integer that satisfies a relation m ‰¤ 2 u , i denotes an integer from 0 to m-1, a plain text a is an integer that is equal to or greater than 0 and smaller than an arbitrary modulo p, the integers a and 0 are congruent modulo 2 u , and the plain text a is expressed as a sum of m sub-shares x 0 , ..., x m-1 , the secret quotient transfer device computes a quotient q of the division of a total sum a Z of the sub-shares by p according to q = E(i
摘要:
Secret calculation including secret sorting is performed at high speed. Permutation data generation step S10 generates permutation data and so as to generate permutation data . Random ID column generation step S12 generates a random ID column [r †’ i ] so as to generate a random ID column [r †’ L ]. Secret random permutation step S14 performs secret random permutation of a set composed of a random ID column [r †’ i-1 ], a key column [k †’ i ], and the random ID column [r †’ i ] with the permutation data . Flag creation step S16 sets a flag [f j,h ] by using a key [k j ]=([k j,0 ],...,[k j,L-1 ]). Order table creation step S18 creates an order table [s †’ ] by using the flag [f j,h ]. Sort permutation generation step S20 generates sort permutation ÃÀ -1 L by using the random ID column [r †’ i ], the order table [s †’ ], a post-permutation key column [À i k †’ i ], and a post-permutation random ID column [À i r †’ i ].
摘要:
A secret parallel processing device reducing the communication amount in secret parallel processing is provided. The device includes: a randomization unit that obtains a non-randomized sequence being an 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.
摘要:
To perform secret computation under a lower probability of success in falsification than before. Each of at least three arithmetic units 2 1 ,...,2 N comprises: a random number generating part determining a shared value [r] obtained by performing secret sharing of a random number r; a randomization part using a shared value [a 0 ],...,[a M-1 ] obtained by performing secret sharing of a value a 0 ,...,a M-1 and a shared value [r] to generate a randomized shared value ,..., with the shared value [a 0 ],...,[a M-1 ] and a shared value [a 0 r],...,[a M-1 r] as a pair; a secret computation part determining a concealed function value [F([a 0 ],...,[a M-1 ])] by executing a function F including at least one secret operation while including a randomized shared value which is an operation target and an operation result depending on the contents of secret operation into the checksum C:= ,..., ; and a correctness proving part verifying correctness of the function value [F([a 0 ],...,[a M-1 ])] on the basis of a shared value [Ø] obtained by multiplying a sum total of shared values [f i ] included in the checksum C by the shared value [r] and a shared value [È] which is a sum total of shared values [f i r] included in the checksum C.
摘要:
A secret sharing system transforms shares in computational secret sharing to shares in homomorphic secret sharing. On a data distribution apparatus, a key selecting part selects K'-1 keys s j . A pseudorandom number generation part generates pseudorandom numbers r j from the keys s j . An encryption part generates a ciphertext c from information a by using the pseudorandom numbers r j . A key division part divides each of the keys s j into N shares f g (n) by using an arbitrary sharing scheme S1. A ciphertext division part divides the ciphertext c into N shares f c (n) by using an arbitrary sharing scheme S0. On each of distributed data transform apparatuses, when K shares f sj (i) are input into the distributed data transform apparatuses, the reconstruction part generates a reconstructed value U j by reconstruction of shares f sj (i) by using the secret sharing scheme S1 and, when K shares f c (i) are input into the distributed data transform apparatuses, the reconstruction part generates the reconstructed value U j by reconstruction of shares f c (i) by using the sharing scheme S0. A redivision part divides the reconstructed value U j into N shares f Uj (n) by using a homomorphic secret sharing scheme S2. A transform part generates a share g a (i) of the information a from K' shares f Uj .