JP2015079228A - Detection device, detection method, computer, and program - Google Patents

Abstract

PROBLEM TO BE SOLVED: To solve the problem that indeterminative finite automaton could not be used directly.SOLUTION: A detection device according to the present invention detects whether or not a predetermined pattern to be detected is included in an input data string, the detection device comprising: an inspection array storage unit for storing an inspection array indicating, in correspondence to each data position of the pattern to be detected, whether or not a pattern part up to the data position in the pattern to be detected is being detected; a data correspondence pattern generation unit for generating, for each type of data, a data correspondence pattern indicating whether or not each data position of the pattern to be detected is the relevant type of data; an update unit for updating the inspection array on the basis of the data correspondence pattern corresponding to next input data; and a determination unit for determining, on the basis of an element of the inspection array corresponding to a tail end data position of the pattern to be detected, whether or not the pattern to be detected is included in the input data string.

Description

  The present invention relates to a detection device, a detection method, a computer, and a program.

Due to the recent increase in the need for personal information protection, the importance of secret pattern matching that detects whether a specific detection target pattern is included in the input data string without disclosing data that needs to be protected has increased. (Non-Patent Documents 1 to 3).
[Non-Patent Document 1] JR Troncoso-Pastoriza, S. Katzenbeisser, and M. Celik. Privacy preserving error resilient dna searching through oblivious automata. In Proc. Comput. Commun. Security (CCS'07), pages 519 {528. ACM , 2007.
[Non-Patent Document 2] KB Frikken. Practical private dna string searching and matching through efficient oblivious automata evaluation. In Data and Applications Security XXIII, pages 81-94. Springer, 2009.
[Non-Patent Document 3] Yuji Watanabe and Takaaki Tateishi. Lost Automata Calculation with Reduced Communication Frequency. In Cryptography and Information Security Symposium (SCIS2012) Proceedings, 2012.

  In the non-patent documents 1 to 3, any definite finite automaton (DFA) is assumed, and the non-deterministic finite automaton (NFA) cannot be used directly. .

  According to a first aspect of the present invention, there is provided a detection device for detecting whether or not a predetermined detection target pattern is included in an input data string, and corresponding to each data position of the detection target pattern, In the input data sequence, a test array storage unit that stores a test array indicating whether or not a pattern portion up to the data position in the detection target pattern is being detected, and each data position of the detection target pattern for each type of data A data-corresponding pattern generation unit that generates a data-corresponding pattern indicating whether or not the data is of the type, an update unit that updates the test array based on the data-corresponding pattern corresponding to the next input data, and the detection target Whether or not the detection target pattern is included in the input data string based on the element of the inspection array corresponding to the data position at the end of the pattern A determining unit, for providing a detection device comprising a.

  According to a second aspect of the present invention, there is provided a detection method for detecting whether or not a predetermined detection target pattern is included in an input data string, wherein each of the data positions of the detection target pattern corresponds to the data position described above. A test sequence storage stage for storing a test sequence indicating whether or not a pattern portion up to the data position in the detection target pattern in the input data sequence is being detected, and each data position of the detection target pattern for each type of data. A data correspondence pattern generation stage for generating a data correspondence pattern indicating whether or not the data is of the type, an update stage for updating the inspection array based on the data correspondence pattern corresponding to the next input data, and the detection target Based on the element of the inspection array corresponding to the data position at the end of the pattern, the detection target pattern is included in the input data string To provide a detection method and a determination step determining whether.

  In the third aspect of the present invention, there is provided a program that causes a computer to function as a detection device that detects whether or not a predetermined detection target pattern is included in an input data string, and each data position of the detection target pattern Corresponding to the test sequence storage unit for storing a test sequence indicating whether or not a pattern portion up to the data position in the detection target pattern in the input data sequence is being detected, and for each type of data, the detection target A data-corresponding pattern generation unit that generates a data-corresponding pattern indicating whether each data position of the pattern is the type of data, and an update that updates the inspection array based on the data-corresponding pattern corresponding to the next input data And the input data string based on the elements of the inspection array corresponding to the last data position of the detection target pattern Wherein a determination section for determining whether or not the detection target pattern included to provide a program to function in the.

  The summary of the invention does not enumerate all the features of the present invention. In addition, a sub-combination of these feature groups can also be an invention.

1 is an overall configuration diagram of a detection device 10. FIG. It is a flowchart explaining the whole flow of a detection method. It is a figure explaining the data corresponding _| compatible pattern _MTi produced _| generated with the detection method shown in FIG. It is a flowchart of updating of the state array _{S i} step Ss208. Diagrams and tables describing the state array S _i to be updated by the updating process. It is a flowchart of the determination process of the collation result of steps Sp110 and Ss210. It is a flowchart of the determination process of the collation result of steps Sp110 and Ss210. It is a whole block diagram of the detection apparatus 10 which changed the update process of the state arrangement | sequence. It is a figure explaining the output of a self loop. It is a flowchart of the update process of the changed state arrangement | sequence. It is a table | surface explaining the effect of embodiment mentioned above. 2 shows an exemplary hardware configuration of a computer 1900 according to the present embodiment.

  Hereinafter, the present invention will be described through embodiments of the invention, but the following embodiments do not limit the invention according to the claims. In addition, not all the combinations of features described in the embodiments are essential for the solving means of the invention.

  FIG. 1 is an overall configuration diagram of the detection apparatus 10. The detection device 10 detects whether or not a predetermined detection target pattern P is included in the input data string T. In the present embodiment, the detection apparatus 10 includes a first information processing unit 12 (also referred to as “SH: String Holder”) that acquires, holds, and manages the input data string T, and a second that holds and manages the detection target pattern P. The information processing unit 14 (also referred to as “Pattern Holder”) is provided, and the input data string T and the inspection target pattern P are concealed from each other between the first information processing unit 12 and the second information processing unit 14, and the input data Secret pattern matching for detecting the detection target pattern P in the column T is realized. Here, the first information processing unit 12 and the second information processing unit 14 may be a computer or an information processing apparatus that can execute a program as an example, and are connected to each other via a wired or wireless network.

  In the following, the secret pattern matching for concealing the input data string T and the detection target pattern P between the first information processing unit 12 and the second information processing unit 14 will be mainly described. (2) Pattern matching that does not have a secret between the information processing units 14 can be realized by excluding the following cryptographic processing.

  The first information processing unit 12 manages a character string T including a plurality of characters Ti as an example of an input data string T including a plurality of data. Here, the first information processing unit 12 may acquire the entire character string T offline and use it for pattern matching, or may sequentially acquire each character of the character string T online and use it for sequential pattern matching. . In the following, an online process in which the first information processing unit 12 sequentially inputs the characters T1 to Tn from the first character to the n characters as the character string T will be mainly described. The first information processing unit 12 includes a test array storage unit 20, an update unit 22, and a first determination unit 24.

The inspection array storage unit 20 indicates, in correspondence with each data position (character position) of the detection target pattern P, an inspection array indicating whether or not a pattern portion up to the data position in the detection target pattern P in the character string T is being detected. Is stored as a state array. Here, in the present embodiment, the pattern length of the detection target pattern P is m. The inspection array storage unit 20 is arranged at each data position j (0 ≦ j ≦ m) of the detection target pattern P in a state where the collation up to the ( _i−1 ) th character T _i-1 (1 ≦ i ≦ n) is completed. Correspondingly, an array element S _i-1 [j] that has a value of 0 indicating that it is being detected when the pattern portion up to the data position j (that is, the portion of P [1] to P [j]) is being detected. _Is stored. That is, the array element S _i-1 [j] of the state array S _i-1 is the j _-th element of the detection target pattern P in the state where the character T _i-1 of the character string T is read up to the _i- 1th character. A transition state indicating whether a match up to a pattern element is detected is shown. In this embodiment, if S _i−1 [j] = 0, it is active (that is, a match up to the jth pattern element is detected), and if S _i−1 [j] ≠ 0, it is inactive (that is, a match up to the jth pattern element is not detected).

The check array storage unit 20 encrypts the state array S _i with the second public key pk ^PH of the second information processing unit 14 and stores it as an encrypted state array S _Ei in order to realize secret pattern matching.

Updater 22, the data corresponding pattern generating portion 32 of the second information processing unit 14 to be described later is generated based on the data corresponding pattern M _Ti corresponding to the next character T _i of the string T, the state sequence S _{i- 1} is updated to the updated state array S _i . For example, the update unit 22 determines the value of the array element S _i−1 [j−1], which is an example of the element corresponding to each data position j−1 of the state array S _i−1 , and the next character of the character string T. An array element corresponding to the next data position j of the state array S _i based on the pattern element M _Ti [j] which is an example of an element corresponding to the next data position j in the data corresponding pattern M _Ti corresponding to _Ti S _i [j] is calculated. Thereby, the update part 22 has detected the coincidence to the j-1st pattern part of the detection target pattern P in a state where the (i-1) th character T _{i-1 is} input (S _i-1 [ j-1] is a value indicating that detection is in progress), and the j-th element M _Ti [j] of the data corresponding pattern M _Ti corresponding to the i-th character T _i is the j-th pattern of the inspection target pattern P. to indicate that it contains the letter T _i in the element, it is possible to update the state sequence Si [j] to a value indicating that detects a match to the j-th pattern portion. Note that the update unit 22 according to the present embodiment performs the update process on the encrypted state array S _Ei that is an encrypted state array, which will be described later.

The first determination unit 24 cooperates with the second determination unit 34 of the second information processing unit 14 based on the state array S _i [m] corresponding to the last data position m of the detection target pattern P. It is determined whether or not the inspection target pattern P is included in the column T. The first determination unit 24 according to the present embodiment performs determination based on the encrypted state array S _Ei [m] obtained by encrypting the state array S _i [m]. An example of m is the number of characters of the detection target pattern P.

  The second information processing unit 14 manages the detection target pattern P. The second information processing unit 14 includes a data correspondence pattern generation unit 32 and a second determination unit 34.

For each type of character Ti, which is an example of the type of data, the data corresponding pattern generation unit 32 generates a data corresponding pattern _MTi indicating whether or not each data position j of the detection target pattern P is that type of data. Here, the type of the character Ti is an element of the character set Σ constituting the character string T, and may be, for example, alphabets such as a and b, numbers, Japanese characters, and values of data elements. For example, for each type of data character Ti, the data corresponding pattern generation unit 32 includes a character in the corresponding pattern element of the detection target pattern P when each data position j of the detection target pattern P is a character of that type. A data corresponding pattern M _Ti having an element M _Ti [j] with a value 0 indicating that the data is to be generated is generated.

Data corresponding pattern generating unit 32, the data corresponding pattern _{M Ti} of each type of character Ti, encrypted by the second public key ^{pk PH} of the second information processing unit 14, the first information encrypted data corresponding pattern _{M ETi} Transmit to the processing unit 12.

The second determination unit 34 cooperates with the first determination unit 24 of the first information processing unit 12 to arrange the array element S _i [m] of the state array S _i corresponding to the last data position m of the detection target pattern P. Based on the above, it is determined whether or not the detection target pattern P is included in the character string T. The second determination unit 34 according to the present embodiment performs determination based on the encrypted state array S _Ei [m] obtained by encrypting the state array S _i [m].

  Next, the inspection method will be described.

Encryption in each inspection method is based on additive homomorphic public key cryptography. An example of an additive homomorphic public key cipher is the Paillier cipher. The Paillier cipher is described in "P. Paillier. Public-key cryptosystems based on composite degree residuosity classes. In Advances in cryptology EUROCRYPT '99, pages 223-238. Springer, 1999." In additive homomorphic public key cryptography, the product of ciphertexts encrypted with the same public key becomes the ciphertext of the sum of the corresponding plaintexts, and satisfies the relationship of equation (1). For encryption, Enc is used. Therefore, for example, when plaintext t is encrypted to be encrypted c, it is expressed as c = Enc (t). A white circle ○ is an operator of products of ciphers. t1 and t2 are plaintext. r1 and r2 are random numbers. It is preferable to change r1 and r2 for each encryption in order to maintain encryption security. For simplicity of explanation, the random numbers r1 and r2 are omitted. In addition, Dec is used for decoding. Therefore, for example, when decrypting the cipher c into plaintext t, it is expressed as t = Dec (c).

Further, re-encryption for generating different ciphertexts having the same plaintext can be performed by the following equation (2).

FIG. 2 is a flowchart for explaining the entire flow of the detection method. The detection method illustrated in FIG. 2 is executed by the first information processing unit 12 and the second information processing unit 14 reading a program. The inspection method shown in FIG. 2 executes collation by constructing a nondeterministic finite automaton that accepts the inputted inspection target pattern P and imitating the transition on the character string T. In the present embodiment, furthermore, only the array and the addition are used so that the bit parallel pattern matching method can be executed for the secret calculation on the homomorphic encryption. Note that an algorithm for executing the Shift-OR method on an array is referred to as an array Shift-OR method. FIG. 3 is a diagram for explaining the data correspondence pattern _MTi generated by the detection method shown in FIG. In the present embodiment, the character string T is input to the first information processing unit 12. Further, the detection target pattern P is input to the second information processing unit 14. In the embodiment, the detection target pattern P = ababb is assumed to be a character string T = abababb.

In the inspection method illustrated in FIG. 2, in the second information processing unit 14, the data correspondence pattern generation unit 32 uses the second secret key sk ^PH and the second public key pk ^PH as the public key and secret key of the second information processing unit 14. Is generated (Sp102). Next, the data corresponding pattern generation unit 32 transmits the public key pk ^PH to the first information processing unit 12 (Sp104). Data corresponding pattern generating unit 32, by the equation (3), generates data corresponding pattern _{M Ti.} When the data correspondence pattern generation unit 32 generates the data correspondence pattern Ma for the character type “a” of the detection target pattern P = ababbb, the first and third detection target patterns P are a based on the equation (3). Therefore, Ma [1] = Ma [3] = 0. On the other hand, since the second, fourth and fifth of the detection target pattern P are b, Ma [2] = Ma [4] = Ma [5] = 1. Thus, the data corresponding pattern generating unit 32, by the equation (3), generates data corresponding pattern _{M Ti} of the detected object pattern P = ababb shown in FIG.

The data corresponding pattern generation unit 32 encrypts each pattern element M _ETi [j] of the data corresponding pattern M _Ti for each type of character Ti, and generates an encrypted pattern element M _ETi [j] (Sp106). For example, data corresponding pattern generating unit 32, of the second public key ^{pk PH} and the second public key ^{sk PH} generated, the data corresponding pattern _{M Ti} by additive homomorphism encryption by using the second public key ^{pk PH} It may be encrypted. The data correspondence pattern generation unit 32 transmits the encrypted data correspondence pattern M _ETi including the encryption pattern element M _ETi [j] to the first information processing unit 12 (Sp108).

In the first information processing unit 12, the inspection sequence storage unit 20, the public key ^{pk PH} transmitted from the second information processing unit 14, and receives the encrypted data corresponding pattern _{M Ti} (Ss202, Ss204).

In the first information processing unit 12, the updating unit 22 generates an encrypted state array S _{E0 in} which the initial value S ₀ of the state array S _i is encrypted by the equation (4), and stores the encrypted state array S _E0 in the check array storage unit 20. Store (Ss206).

Next, the update unit 22 generates each array element S _Ei [j] of the encrypted state array S _Ei in which the state array S _i is encrypted by an update process of the encrypted state array S _Ei described later. Sequentially, the encryption state array S _Ei is updated (Ss208). The first determination unit 24 performs a verification result determination process described later (Ss210). Thereafter, the update unit 22 and the first determination unit 24 repeat Steps Ss208 and Ss210, respectively, n times. An example of n is the number of characters in the character string T.

In the second information processing unit 14, the second determination unit 34 repeats a collation result determination process (Sp110) described later n times in conjunction with the collation result determination process of the first determination unit 24. When the second determination unit 34 determines whether or not the inspection target pattern P includes the character string T, the verification result Γ ^PH is output n times and the determination is executed.

FIG. 4 is a flowchart of the update process of the state array S _i in step Ss208. Prior to the flowchart of the update process, a character string T, an encrypted data correspondence pattern M _ETi , and an encrypted state array S _Ei-1 are input to the first information processing unit 12. Figure 5 is a diagram and table illustrating a state sequence S _i to be updated by the updating process. The upper diagram of FIG. 5 is a diagram of state transition by a nondeterministic finite automaton that has received the detection target pattern P = ababb. The number in each circle in the upper diagram of FIG. 5 indicates the data position j. In the lower diagram of FIG. 5, the uppermost row indicates the data position j. Each row shows a state array S _i generated when the i-th character of the character string T is read. Each element of the state array S ₀ which is an initial value of the state array S _i is S ₀ [0] = 0 and S ₀ [j] = 1, j∈ {1, 2,..., M} , S _i [0] = 0. Each cell indicates an array element S _i [j]. The array element S _i [j] is active when the value is 0, and inactive when the value is not 0. In the present embodiment, the state array S _Ei in which the updated state array S _i is encrypted is generated.

As shown in FIG. 4, in the update process of the state array S _Ei , the update unit 22 uses the second public key pk ^PH as 0 that is predetermined as the value of the array element S _i [0] where j = 0. Then, the encrypted array element S _Ei [0] of the encrypted state array S _Ei is generated by encryption using additive homomorphic encryption (Ss220). In other words, the update unit 22 sets the value of the array element S _i [0] of j = 0 to 0 regardless of the value of i, and matches from the beginning of the data correspondence pattern M every time the character Ti is input. To start.

Next, the update unit 22 updates the encrypted array element S _Ei [j] (Ss222). Here, the update unit 22 calculates the array element S _i [j] according to the equation (5) when shown in an unencrypted state. Specifically, the update unit 22 determines the value of the array element S _i-1 [j-1] corresponding to each data position j-1 of the state array S _i-1 and the next character Ti of the character string T. The array corresponding to the next data position j of the state array S _i in response to the values of the pattern elements M _Ti [j] corresponding to the next data position j in the data corresponding pattern M _Ti corresponding to The element S _i [j] is set to 0. For example, the update unit 22 uses the value of the array element S _i-1 [j-1] corresponding to each data position j-1 of the state array S _{i-1 and} the data corresponding to the next character Ti of the character string T. by adding the value of the corresponding pattern M pattern elements corresponding to the next data position j in _Ti M _{Ti [j],} the array element S _i corresponding to the next data position j of the state array S _{i [j]} .

For example, the value of the array element S ₆ [1] with i = 6 and j = 1 is 0, and the value of the array element S ₅ [0] is 0, and M _T6 [1] = Mb [ Since the value of 1] is 1, each is added to be 1. The value of the array element S ₇ [5] with i = 7 and j = 5 is 0 because the value of the array element S ₆ [4] is 0 and the value of M _T6 [5] = Mb [5] is 0. Add each to zero.

In the present embodiment, the update unit 22 receives the encrypted encrypted pattern element M _ETi [j] from the second information processing unit 14 instead of the pattern element M _Ti [j]. Therefore, the update unit 22 uses the following equation (6), which is obvious from the nature of the additive homomorphism, based on the encrypted data correspondence pattern M _ETi corresponding to the next character string T, to store the encrypted state array S _Ei . The array element S _Ei [j] is calculated and updated. Specifically, the update unit 22 determines the value of the array element S _Ei−1 [j−1] corresponding to each data position j−1 of the previous encryption state array S _Ei−1 , and Encryption based on the product of the value of the encryption pattern element M _ETi [j] corresponding to the next data position j in the encrypted data corresponding pattern M _ETi corresponding to the character string T, that is, the addition in the additive homomorphic encryption The state array S _Ei is calculated and updated.

The updating unit 22 continues step Ss222 until it is repeated m times. Here, m is the number of characters included in the detection target pattern P = ababb, and is 5 in this embodiment. As shown in FIG. 2 described above, the update unit 22 repeats step Ss208 of the update process n times. Thereby, the update unit 22 generates an encrypted state array S _Ei obtained by encrypting the n state arrays S _i shown in FIG. As a result, the state array update processing ends.

FIG. 6 is a flowchart of the collation result determination process in steps Sp110 and Ss210. Prior to the verification result determination processing flowchart, the second public key pk ^PH is input to the first information processing unit 12, and the second secret key sk ^PH is input to the second information processing unit 14. 6 is a case where the second information processing unit 14 determines the collation result. In the case where the data corresponding pattern M _Ti is encrypted, the second determination unit 34, the coding sequence element of the encrypted state sequence S _Ei corresponding to the end of the data position m of the encrypted detected pattern P _E S Based on _Ei [m], it is determined whether or not the detection target pattern P is included in the character string T. Hereinafter, the determination process will be described in detail.

As shown in FIG. 6, in the verification result determination process, the first determination unit 24 of the first information processing unit 12 generates a first random number V [i] and a third random number W [i] (Ss230). A random number is generated for each i, that is, for each character of the character string T. The first determination unit 24 uses the expression (7) to encrypt the encrypted array element S _Ei [m] raised to the power of the first random number V [i] with the public key pk ^PH , and the third random number W [i]. The randomized inspection data Z _E [i] is calculated by (Ss232). The encrypted array element S _Ei [m] is an element of the encrypted state array S _E corresponding to the last data position m of the detection target pattern P.

The first determination unit 24 transmits the inspection data Z _E [i] to the second information processing unit 14 (Ss234).

In the second information processing unit 14, the second determination unit 34 receives the inspection data Z _E [i] (Sp120). The second determination unit 34 decrypts the received inspection data Z _E [i] with the public key pk ^PH , and generates inspection data Z [i] (Sp122).

  The first determination unit 24 transmits the third random number W [i] to the second information processing unit 14. (Ss236).

The second determination unit 34 receives the third random number W [i] (Sp124). The second determination unit 34 decrypts the inspection data Z _E [i] with the second secret key sk ^PH that is the secret key of the second information processing unit 14. Based on the equation (8), the second determination unit 34 calculates the state array S _i of the last data position m based on the sum of the decrypted test data Z [i] and the received third random number W [i]. Is calculated as a collation result Γ ^PH [i], which is a value obtained by raising the array element S _i [m] to the power of the first random number V [i] (Sp126). Note that the third random number W [i] may be omitted.

The second determination unit 34 determines whether or not the detection target pattern P is detected in the character string T based on whether or not the value of the matching result Γ ^PH [i] is 0. (Sp128). In other words, the second determination unit 34 determines the character string T based on the encrypted array element S _Ei [m] of the encrypted state array S _Ei corresponding to the last data position m of the encryption detection target pattern P _E. It is determined whether or not the detection target pattern P is included therein. Specifically, the second determination unit 34 determines that the detection target pattern P is included in the character string T when the matching result Γ ^PH [i] is “0”, and otherwise the detection target pattern. It is determined that P is not included in the character string T. For example, in the example of FIG. 5, the second determination unit 34 detects Si [5] = 0 (active) at i = 7, and the seventh character of the character string T is the matching inspection target pattern P. It is determined that it is the end. As a result, the verification result determination process ends. In addition, the 1st information processing part 12 which has the 1st determination part 24 does not obtain any result. In other words, the second information processing unit 14 can detect whether or not the detection target pattern P is included in the character string T without giving any information to the first information processing unit 12.

FIG. 7 is a flowchart of the collation result determination process in steps Sp110 and Ss210. Prior to the verification result determination processing flowchart, the second public key pk ^PH is input to the first information processing unit 12, and the second secret key sk ^PH is input to the second information processing unit 14. The collation result determination process shown in FIG. 7 is a case where the first determination unit 24 of the first information processing unit 12 determines the collation result. In the process of FIG. 7, the steps surrounded by a dotted line are different from those in FIG. The same processing as that in FIG. 6 is assigned the same step number and description thereof is omitted.

In the present embodiment, the second determination unit 34 detects the detection target pattern in the character string T based on the array element S _i [m] of the state array S _i corresponding to the last data position m of the detection target pattern P. It is determined whether or not P is included.

The first determination unit 24 of the first information processing unit 12 uses the array element S _Ei [m] of the encryption state array S _Ei corresponding to the data position m at the end of the detection target pattern P] as the first random number V [i]. The test data Z _E [i] based on the value raised to the power of is transmitted to the second information processing unit 14.

For example, the first determination unit 24 calculates a value obtained by raising the array element S _Ei [m] of the encryption state array S _Ei corresponding to the data position m at the end of the detection target pattern P to the power of the first random number V [i]. The test data Z [i] obtained by adding the value obtained by encrypting the three random numbers W [i] with the second public key pk ^PH to the additive homomorphic encryption and the third random number W [i] are first disclosed. The random number exchange data RD encrypted with the key pk ^SH may be transmitted to the second information processing unit 14.

The first determination unit 24 detects a character string T based on whether or not the value of data obtained by decoding the inspection response data Z ′ _E [i] returned from the second information processing unit 14 described later is 0. It is determined whether or not the pattern P is detected.

The second determination unit 34 of the second information processing unit 14 sets a value based on data obtained by decrypting the inspection data Z _E [i] with the second secret key sk ^PH that is the secret key of the second information processing unit 14. 1 Obtain a value obtained by raising the data encrypted by the first public key pk ^SH, which is the public key of the information processing unit 12, to the power of the second random number W ′ [i], and obtain the first as response data for inspection Z ′ _E [i]. A reply is sent to the information processing unit 12. For example, the first determination unit 24 decrypts the inspection data Z [i] with the second secret key sk ^{PH and} encrypts the data with the first public key pk ^SH and adds the random number exchange data RD to the second random number. The test response data Z ′ _E [i] is returned as a power by W ′ [i].

As shown in FIG. 7, in the first information processing unit 12, the first determination unit 24 generates a secret key sk ^SH and a public key pk ^SH (Ss240). Next, the first determination unit 24 calculates a third random number W _E [i] obtained by encrypting the third random number W [i] using Equation (9) (Ss242).

The first determination unit 24 transmits the first public key pk ^SH and the third random number W _E [i] to the second information processing unit 14 (Ss244).

In the second information processing unit 14, the second determination unit 34 receives the first public key pk ^SH and the third random number W _E [i] (Sp130). The second determination unit 34 newly generates a second random number W ′ _E [i] (Sp132). The second determination unit 34 calculates the inspection response data Z ′ _E [i] obtained by randomizing the encrypted inspection data Z _E [i] in order to keep the collation result secret while using the formula (10). (Sp134).

The second determination unit 34 transmits the second random number W ′ _E [i] and the inspection response data Z ′ _E [i] to the first information processing unit 12 (Sp136).

The first determination unit 24 receives the second random number W ′ _E [i] and the inspection response data Z ′ _E [i] transmitted by the second determination unit 34 (Ss246). Next, the first determination unit 24 calculates the collation result Γ ^SH [i] using Equation (11) (Ss248).

The first determination unit 24 determines whether or not the pattern P is included in the character string T based on the result of the matching result Γ ^SH [i]. Specifically, the first determination unit 24 determines that the detection target pattern P is included in the character string T when the collation result Γ ^SH [i] is “0”, and otherwise the detection target pattern. It is determined that P is not included in the character string T. As a result, the verification result determination process ends. In addition, the 2nd information processing part 14 which has the 2nd determination part 34 does not obtain any result. In other words, the first information processing unit 12 can detect whether or not the detection target pattern P is included in the character string T without giving any information to the second information processing unit 14.

  Next, the form which changed the update process of the state arrangement | sequence of embodiment mentioned above is demonstrated. FIG. 8 is an overall configuration diagram of the detection apparatus 10 in which the state array update process is changed. FIG. 9 is a diagram for explaining self-loop output. This embodiment is effective when including a self-loop transition process.

The test array storage unit 20 illustrated in FIG. 8 has an element that corresponds to each data position of the detection target pattern P and has an element that becomes 0 when the pattern portion up to the data position in the detection target pattern P is being detected. An encrypted state array S _Ei obtained by encrypting the array S _i is stored.

In the case of a detection target pattern P that allows a self-loop that repeats a value at a predetermined data position L a plurality of times, for example, the update unit 22 includes an array element S _i corresponding to each data position j of the state array S _{i−1. −1} [j], the array element S _i [j] corresponding to the next data position j of the state array S _i−1 , and the next data position j + 1 in the data corresponding pattern M _Ti corresponding to the next character string T The array element S _i [j + 1] corresponding to the next data position j + 1 of the state array S _i is calculated based on the pattern element M _Ti [j] corresponding to. The self loop is a transition to the current state. The self-loop realizes an infinite gap in a nondeterministic finite automaton generated from a pattern.

In the transition by the self-loop, the state array S _i is updated based on the relationship shown in FIG. The output of FIG. 9 is obtained by the processing of the following equation (12) after the character transition is executed by the above equation (5). In equation (12), the self-loop transition is realized by taking the product of the state with the loop and the state before the character transition, and nothing is executed for the state without the loop.

The updating unit 22 performs pattern pattern matching based on the encrypted data corresponding pattern M _Ei-1 and the encrypted state array S _Ei-1 corresponding to the character input next to the formula (5) and the character string T. from each data position j-1 to generate an encrypted transmission sequence S _Ei for propagating to the next data position j, 'the _Ei elements S' first sequence S based on the encryption propagation sequence S _{Ei Ei [j} ] And the element S ′ _Ei−1 [j] of the second array S ′ _Ei−1 based on the encryption state array S _Ei−1 are transmitted to the second information processing unit 14.

The second information processing unit 14 further includes an update assisting unit 36. Based on the first array S ′ _Ei and the second array S ′ _Ei−1 , the update assisting unit 36 corresponds to the encrypted propagation array S _{Ei at} a data position other than the predetermined self-loop data position L. The element S _Ei [j] is acquired by the update unit 22, and at a predetermined data position L, the product of the element S _Ei [j] corresponding to the encrypted state array S _Ei-1 and the encrypted propagation array S _Ei is calculated. A reply array S ^* _Ei to be acquired by the update unit 22 is generated and returned to the first information processing unit 12.

The update unit 22 updates the state array S _Ei based on the reply array S ^* _Ei .

The updating unit 22 of the first information processing unit adds the values obtained by encrypting each data of the encrypted propagation array S _Ei and the fourth random number R _i [j] with the second public key pk ^PH, and adding the homomorphic encryption The first array S ′ _Ei having each element S ′ _Ei [j] added by the above and each data of the encrypted state array S _Ei and the fifth random number Q _i [j] are encrypted by the second public key pk ^PH . The second array S ′ _Ei−1 having each element S ′ _Ei−1 [j] obtained by adding values to each other by the addition of additive homomorphic encryption, and each data of the encrypted state array S _Ei are used as the fourth random number R _i. [J] is a value obtained by encrypting the product of the fourth random number R _i [j] and the fifth random number Q _i [j] with the second public key pk ^PH, and the encrypted propagation array S _Ei A value raised to the power of the product of the 5 random numbers Q _i [j] and the sixth random number K _i [j], and the seventh random number A value obtained by encrypting the number U _i [j] with the second public key pk ^PH and the third array _ΔEi having elements added by addition of the additive homomorphic encryption are transmitted to the second information processing unit 14. To do.

Updating the auxiliary unit of the second information processing unit 36, in the data position L to a predetermined, 'element _Ei S' first sequence S _Ei value decoding the [j] and the second sequence S _'Ei-1 The element obtained by encrypting the product of the values obtained by decrypting the element S ′ _Ei−1 [j] with the second public key pk ^PH is used as the element, and the third array Δ at the data position other than the predetermined data position L and reply sequence ^S _{* Ei} to a value re encryption elements by _Ei elements delta _Ei [j] a second public key ^{pk PH,} in the predetermined data position L by the second public key ^{pk PH} 0 The element of the encrypted value of E is encrypted zero E _Ei [j], and the value obtained by encrypting 1 with the second public key pk ^PH except the predetermined data position L is defined as element E _Ei [j]. The fourth array E _Ei is returned to the first information processing unit 12. .

The updating unit 22 uses each element S ^* _Ei [j] of the reply array S ^* _Ei, a value obtained by raising the encryption state array S _Ei to the power of the negative value of the fourth random number R _i [j], and the fourth random number R The inverse element of the value obtained by encrypting _i [j] and the fifth random number Q _i [j] with the second public key pk ^PH, and the encrypted propagation array S _Ei to the power by the negative value of the fifth random number Q _i [j] The state array S _i is updated with each element obtained by adding the obtained value and the value obtained by raising the fourth array E _Ei to the power of the minus value of the seventh random number U _i [j] by the additive homomorphic encryption.

FIG. 10 is a flowchart of the update process of the changed state array. In the flowchart of the state array update process, a character string T, an encrypted data correspondence pattern M _ETi , an encrypted state array S _i-1 , and a second public key pk ^PH are input to the first information processing unit 12. Yes. The second information processing unit 14 receives the data position L of the self-loop, the second secret key sk ^PH , and the second public key pk ^PH . This flowchart is an extended array Shift-OR method in which an extension to a pattern including an infinite length gap is performed. The process shown in FIG. 10 is continuously executed after the process shown in FIG. L is a predetermined process number for performing the self-loop and is L⊂ {1,..., M}.

Steps Ss220 to Ss222 shown in FIG. 4 are executed. Next, the update unit 22 generates random numbers K _i [j], R [j], Q _i [j], and U _i [j] (Ss260). For example, the updating unit 22 extracts random numbers K _i [j], R [j], Q _i [j], and U _i [j] from integers from 1 to N. The updating unit 22 _calculates the element S ′ _Ei [j] of the first array S ′ _Ei , the element S ′ _Ei−1 [j] of the second array S ′ _Ei−1 from the equation (13) and the generated random number, and Then, the element Δ _Ei [j] of the third array Δ _Ei is calculated (Ss262).

Updater 22, the first sequence S _'Ei, second sequence S' calculated _Ei-1, and transmits a third sequence delta _Ei to the second information processing unit 14 (Ss264). The updating unit 22 repeats steps Ss260 to S264 m times.

In the second information processing unit 14, the update assisting unit 36 receives the first array S ′ _Ei , the second array S ′ _Ei , and the third array Δ _Ei transmitted from the first information processing unit 12 (Sp140). ).

Next, the update assistant unit 36 determines whether or not the data position j to be processed this time is included in the data position L of the self-loop (Sp144). When determining that the data position j is included in the data position L (Sp144: Yes), the update assisting unit 36 calculates each element S ^* _Ei [j] of the reply array S ^* _Ei according to the equation (14). Then, the encryption zero E _Ei [j] is calculated by the equation (15) (Sp146).

On the other hand, when the update assisting unit 36 determines that the data position j is not included in the data position L (Sp144: No), each element S ^* _Ei [j] of the reply array S ^* _Ei is determined by Expression (16). At the same time, encryption zero E _Ei [j] is calculated according to equation (17) (Sp148). Here, in the present embodiment, by using the seventh random number U, even if S _i [j] = 0, the relationship between Expression (16) and the seventh expression is as shown in Expression (18). Since the random number U _i [j] remains, the second information processing unit 14 does not know that S _i [j] = 0.

The update assisting unit 36 transmits each element S ^* _Ei [j] of the calculated reply array S ^* _Ei and the encrypted zero E _Ei [j] to the first information processing unit 12 (Sp150). The update assistant unit 36 repeats steps Sp144 to Sp150 m times.

The update unit 22 receives the reply array S ^* _Ei [j] and the encrypted zero E _Ei [j] transmitted from the second information processing unit 14 (Ss266). The updating unit 22 calculates and updates each element S _Ei [j] of the state array S _Ei according to Expression (18) (Ss268).

  FIG. 11 is a table for explaining the effects of the above-described embodiment. The column of SPM1 in the table shows the performance of the embodiment shown in FIG. The column of SPM2 in the table shows the performance of the embodiment shown in FIG.

  The above-mentioned non-patent literature depends on the number n of characters in the character string in the pre-processing, and depends on the number Σ of character types (so-called alphabets) that can be included in the character string in the update processing. Thereby, each nonpatent literature increases the amount of calculation in each processing. On the other hand, as shown in FIG. 11, the present embodiment does not depend on the number n of characters in the character string in the pre-processing, and does not depend on the number Σ of character types that can be included in the character string in the update processing. Can be reduced. In particular, according to the present embodiment, an increase in the amount of calculation can be further suppressed as compared with each non-patent document in Japanese text and purchase logs in which the number of characters n and the number of character types Σ are large.

  Next, an example in which the above-described embodiment is specifically applied will be described.

  For example, the above-described embodiment may be applied to purchase history detection. In this case, the detection device 10 is input with a history data string including at least one of the advertisement history data of the product and the purchase history data of the product as the input data string. The detection device 10 preferably further includes an output unit. The output unit outputs trigger information indicating that an advertisement should be issued in response to detection of the detection target pattern P in the history data string.

  Further, for example, the above-described embodiment may be applied to detection of a gene sequence. In this case, the detection apparatus 10 receives a gene sequence as an input data string. The detection device 10 preferably further includes an output unit. The output unit outputs whether or not the detection target pattern is detected in the gene sequence.

  As described above, when the non-deterministic finite automaton is directly converted into the deterministic finite automaton by directly evaluating the non-deterministic finite automaton, the detection apparatus 10 accompanies an increase in the number of characters in the character string T and the number of characters in the detection target pattern. The increase in the number of states can be reduced to reduce the amount of communication and the amount of calculation. Furthermore, the detection device 10 encrypts the character string T and the inspection target pattern P with a cipher that satisfies the additive homomorphism, so that the above-described effects can be obtained without the character string T and the inspection target pattern P being known to the other party. Can be realized.

  The above-described embodiment is an example, and the configuration, value, data type, and the like in each embodiment may be changed as appropriate. Moreover, you may combine each embodiment appropriately.

For example, when the h-th element P [h] of the detection target pattern P is a character type A that is a set including a plurality of characters, the mask array Mσ [h] is expressed by Expression (19) for each character σ∈Σ. May be generated.

  In the above embodiment, the input data string is a character string, but the input data string may be a data string other than the character string.

  As mentioned above, although this invention was demonstrated using embodiment, the technical scope of this invention is not limited to the range as described in the said embodiment. It will be apparent to those skilled in the art that various modifications or improvements can be added to the above-described embodiment. It is apparent from the scope of the claims that the embodiments added with such changes or improvements can be included in the technical scope of the present invention.

  The order of execution of each process such as operations, procedures, steps, and stages in the apparatus, system, program, and method shown in the claims, the description, and the drawings is particularly “before” or “prior to”. It should be noted that the output can be realized in any order unless the output of the previous process is used in the subsequent process. Regarding the operation flow in the claims, the description, and the drawings, even if it is described using “first”, “next”, etc. for convenience, it means that it is essential to carry out in this order. It is not a thing.

  FIG. 12 shows an example of a hardware configuration of a computer 1900 according to this embodiment. A computer 1900 according to the present embodiment is an example of the first information processing unit 12 and the second information processing unit 14. The computer 1900 includes a CPU peripheral unit having a CPU 2000, a RAM 2020, a graphic controller 2075, and a display unit 2080 that are connected to each other by a host controller 2082, and a communication interface 2030 that is connected to the host controller 2082 by an input / output controller 2084. And an input / output unit having a hard disk drive 2040 and a legacy input / output unit having a ROM 2010, a memory drive 2050 and an input / output chip 2070 connected to the input / output controller 2084.

  The host controller 2082 connects the RAM 2020 to the CPU 2000 and the graphic controller 2075 that access the RAM 2020 at a high transfer rate. The CPU 2000 operates based on programs stored in the ROM 2010 and the RAM 2020 and controls each unit. The graphic controller 2075 acquires image data generated by the CPU 2000 or the like on a frame buffer provided in the RAM 2020 and displays it on the display unit 2080. Instead of this, the graphic controller 2075 may include a frame buffer for storing image data generated by the CPU 2000 or the like.

  The input / output controller 2084 connects the host controller 2082 to the communication interface 2030 and the hard disk drive 2040 that are relatively high-speed input / output devices. The communication interface 2030 communicates with other devices via a network. The hard disk drive 2040 stores programs and data such as a display program used by the CPU 2000 in the computer 1900.

  The input / output controller 2084 is connected to the ROM 2010, the memory drive 2050, and the relatively low-speed input / output device of the input / output chip 2070. The ROM 2010 stores a boot program that the computer 1900 executes at startup and / or a program that depends on the hardware of the computer 1900. The memory drive 2050 reads a program or data such as a display program from the memory card 2090 and provides it to the hard disk drive 2040 via the RAM 2020. The input / output chip 2070 connects the memory drive 2050 to the input / output controller 2084, and also connects various input / output devices to the input / output controller 2084 via, for example, a parallel port, a serial port, a keyboard port, a mouse port, and the like. Connect to.

  A program provided to the hard disk drive 2040 via the RAM 2020 is stored in a recording medium such as a memory card 2090 or an IC card and provided by a user. A program such as a display program is read from a recording medium, installed in the hard disk drive 2040 in the computer 1900 via the RAM 2020, and executed by the CPU 2000.

  A program that is installed in the computer 1900 and causes the computer 1900 to function as the detection apparatus 10 includes a test array storage module, a data correspondence pattern generation module, an update module, and a determination module. These programs or modules work with the CPU 2000 or the like to cause the computer 1900 to function as a test array storage module, a data correspondence pattern generation module, an update module, and a determination module, respectively.

  The information processing described in these programs is read into the computer 1900, whereby a test arrangement storage module, a data correspondence pattern generation module, which is a specific means in which the software and the various hardware resources described above cooperate, It functions as an update module and a determination module. And the specific detection apparatus 10 according to the intended use is constructed | assembled by implement | achieving the calculation or processing of the information according to the intended use of the computer 1900 in this embodiment by these specific means.

  As an example, when communication is performed between the computer 1900 and an external device or the like, the CPU 2000 executes a communication program loaded on the RAM 2020 and executes a communication interface based on the processing content described in the communication program. A communication process is instructed to 2030. Under the control of the CPU 2000, the communication interface 2030 reads transmission data stored in a transmission buffer area or the like provided on a storage device such as the RAM 2020, the hard disk drive 2040, or the memory card 2090, and transmits it to the network. The reception data received from the network is written into a reception buffer area or the like provided on the storage device. As described above, the communication interface 2030 may transfer transmission / reception data to / from the storage device by a DMA (direct memory access) method. Instead, the CPU 2000 transfers the storage device or the communication interface 2030 as a transfer source. The transmission / reception data may be transferred by reading the data from the data and writing the data to the communication interface 2030 or the storage device of the transfer destination.

  Further, the CPU 2000 causes the RAM 2020 to read all or necessary portions from the files or databases stored in the external storage device such as the hard disk drive 2040 and the memory drive 2050 (memory card 2090) into the RAM 2020 by DMA transfer or the like. Various processes are performed on the data on the RAM 2020. Then, CPU 2000 writes the processed data back to the external storage device by DMA transfer or the like. In such processing, since the RAM 2020 can be regarded as temporarily holding the contents of the external storage device, in the present embodiment, the RAM 2020 and the external storage device are collectively referred to as a memory, a storage unit, or a storage device. Various types of information such as various programs, data, tables, and databases in the present embodiment are stored on such a storage device and are subjected to information processing. Note that the CPU 2000 can also store a part of the RAM 2020 in the cache memory and perform reading and writing on the cache memory. Even in such a form, the cache memory bears a part of the function of the RAM 2020. Therefore, in the present embodiment, the cache memory is also included in the RAM 2020, the memory, and / or the storage device unless otherwise indicated. To do.

  In addition, the CPU 2000 performs various operations, such as various operations, information processing, condition determination, information search / replacement, etc., described in the present embodiment, specified for the data read from the RAM 2020 by the instruction sequence of the program. Is written back to the RAM 2020. For example, when performing the condition determination, the CPU 2000 determines whether the various variables shown in the present embodiment satisfy the conditions such as large, small, above, below, equal, etc., compared to other variables or constants. When the condition is satisfied (or not satisfied), the program branches to a different instruction sequence or calls a subroutine. Further, the CPU 2000 can search for information stored in a file or database in the storage device.

  The program or module shown above may be stored in an external recording medium. As the recording medium, in addition to the memory card 2090, an optical recording medium such as DVD or CD, a magneto-optical recording medium such as MO, a tape medium, a semiconductor memory such as an IC card, or the like can be used. Further, a storage device such as a hard disk or RAM provided in a server system connected to a dedicated communication network or the Internet may be used as a recording medium, and the program may be provided to the computer 1900 via the network.

DESCRIPTION OF SYMBOLS 10 Detection apparatus 12 1st information processing part 14 2nd information processing part 20 Test arrangement | sequence memory | storage part 22 Update part 24 1st determination part 32 Data corresponding | compatible pattern generation part 34 2nd determination part 36 Update assistance part 1900 Computer 2000 CPU
2010 ROM
2020 RAM
2030 Communication interface 2040 Hard disk drive 2050 Memory drive 2070 Input / output chip 2075 Graphic controller 2080 Display unit 2082 Host controller 2084 Input / output controller 2090 Memory card

Claims (19)

A detection device for detecting whether or not a predetermined detection target pattern is included in an input data string,
Corresponding to each data position of the detection target pattern, a test sequence storage unit that stores a test sequence indicating whether or not a pattern portion up to the data position in the detection target pattern is being detected in the input data sequence;
A data-corresponding pattern generation unit that generates a data-corresponding pattern indicating whether or not each data position of the detection target pattern is data of the kind for each data type;
An update unit that updates the inspection array based on the data correspondence pattern corresponding to the next input data;
A determination unit that determines whether or not the detection target pattern is included in the input data sequence based on an element of the inspection array corresponding to a data position at the end of the detection target pattern;
A detection device comprising:   The update unit, based on the value of the element corresponding to each data position of the inspection array and the value of the element corresponding to the next data position in the data corresponding pattern corresponding to the next input data The detection device according to claim 1, wherein a value of an element corresponding to the next data position is calculated. The inspection array storage unit stores the inspection array having an element that is 0 when a pattern portion up to the data position is being detected, corresponding to each data position of the detection target pattern,
The data correspondence pattern generation unit generates, for each type of data, the data correspondence pattern having an element that becomes 0 when each data position of the detection target pattern is data of the type,
The update unit responds to the fact that both the value of the element corresponding to each data position of the inspection array and the value of the element corresponding to the next data position in the data corresponding pattern corresponding to the next input data are 0. The detection apparatus according to claim 2, wherein an element corresponding to a next data position of the inspection array is set to zero.   The update unit adds the value of the element corresponding to each data position of the inspection array and the value of the element corresponding to the next data position in the data corresponding pattern corresponding to the next input data, and The detection device according to claim 3, wherein a value of an element corresponding to the next data position is set.   For the detection target pattern that allows a value at a predetermined data position to be repeated a plurality of times, the update unit includes a value of an element corresponding to each data position of the test array, and a next data position of the test array The value of the element corresponding to the next data position of the inspection array is calculated based on the value of the element corresponding to, and the value of the element corresponding to the next data position in the data corresponding pattern corresponding to the next input data The detection device according to any one of claims 2 to 4. A first information processing unit that includes the test array storage unit and the update unit and manages the input data string;
A second information processing unit having the data corresponding pattern generation unit and managing the detection target pattern;
With
The data correspondence pattern generation unit transmits an encrypted data correspondence pattern obtained by encrypting a data correspondence pattern for each type of data to the second information processing unit,
The test sequence storage unit stores an encrypted test sequence obtained by encrypting the test sequence,
The update unit updates the encryption check array based on the encrypted data correspondence pattern corresponding to the next input data,
The determination unit determines whether or not the detection target pattern is included in the input data string based on an element of the encryption check array corresponding to the last data position of the encrypted detection target pattern The detection device according to any one of claims 1 to 5. The data correspondence pattern generation unit encrypts the data correspondence pattern by additive homomorphic encryption using a second public key that is a public key of the second information processing unit,
The update unit encrypts the check array by additive homomorphic encryption using the second public key, and sets the element value corresponding to each data position of the encrypted check array and the next input data. The detection device according to claim 6, wherein the check array encrypted based on the addition in the additive homomorphic encryption of the value of the element corresponding to the next data position in the corresponding encrypted data correspondence pattern is updated. The second information processing unit further includes the determination unit,
The first information processing unit transmits inspection data based on a value obtained by raising the element of the encrypted inspection array corresponding to the last data position of the detection target pattern by a first random number to the second information processing unit. And
The determination unit of the second information processing unit obtains a value obtained by decrypting the inspection data with a second secret key that is a secret key of the second information processing unit, and powering the elements of the inspection array with a random number, The detection device according to claim 7, wherein it is determined whether or not the detection target pattern is detected in the input data string based on whether or not the value is 0. The first information processing unit further includes the determination unit,
The first information processing unit transmits inspection data based on a value obtained by raising the element of the encrypted inspection array corresponding to the last data position of the detection target pattern by a first random number to the second information processing unit. And
The second information processing unit uses a value based on data obtained by decrypting the inspection data with a second secret key that is a secret key of the second information processing unit as a public key of the first information processing unit. A value obtained by raising the power encrypted by the second random number to the data encrypted by the public key is returned to the first information processing unit as test response data;
The determination unit of the first information processing unit determines whether or not the detection target pattern is detected in the input data sequence based on whether or not a value of data obtained by decoding the inspection response data is 0. Item 8. The detection device according to Item 7. The first information processing unit encrypts a value obtained by raising a power of the element of the encryption check array corresponding to the last data position of the detection target pattern by the first random number and a third random number using the second public key. Transmitting the test data obtained by adding the value by addition in additive homomorphic encryption and the random number exchange data obtained by encrypting the third random number with the first public key to the second information processing unit,
The second information processing unit powers the data obtained by decrypting the inspection data with the second secret key and adding the random number exchange data to the value encrypted with the first public key, using the second random number. The detection device according to claim 9, which returns a response as inspection response data. The inspection array storage unit encrypts the inspection array having an element that corresponds to each data position of the detection target pattern and has an element that is 0 when a pattern portion up to the data position in the detection target pattern is being detected. Storing the encrypted verification check sequence,
The detection target pattern allows a value at a predetermined data position to be repeated a plurality of times,
The update unit is configured to transmit an encryption propagation for propagating a pattern part match from each data position to the next data position based on the encrypted data corresponding pattern corresponding to the next input data and the encryption check array. Generating an array, and transmitting the first array based on the encrypted propagation array and the second array based on the encryption check array to the second information processing unit,
The second information processing unit causes the updating unit to acquire a corresponding element of the encrypted propagation array at a data position other than the predetermined data position based on the first array and the second array. , Generating a reply array for causing the update unit to acquire a product of corresponding elements of the encryption check array and the encryption propagation array at the predetermined data position, and to the first information processing unit And an update assistant unit that replies
The detection device according to any one of claims 7 to 10, wherein the update unit updates the inspection array based on the reply array. The updating unit of the first information processing unit is
The first array having elements obtained by adding each data of the encrypted propagation array and a value obtained by encrypting a fourth random number with the second public key by an additive homomorphic encryption;
The second array having each element obtained by adding each data of the encryption check array and a value obtained by encrypting a fifth random number with the second public key by an additive homomorphic encryption;
A value obtained by raising each data of the encryption check array by the fourth random number, a value obtained by encrypting a product of the fourth random number and the fifth random number by the second public key, and the encrypted propagation array A third array having elements obtained by adding a value raised to the power of the product of the fifth random number and the sixth random number and a value obtained by encrypting the seventh random number with the second public key by addition of additive homomorphic encryption; ,
To the second information processing unit,
The update assisting unit of the second information processing unit is
At the predetermined data position, an element is a value obtained by encrypting a product of a value obtained by decrypting an element of the first array and a value obtained by decrypting an element of the second array using the second public key, The reply array having a value obtained by re-encrypting the element of the third array with the second public key at a data position other than the predetermined data position;
A value obtained by encrypting 0 with the second public key is an element at the predetermined data position, and a value obtained by encrypting 1 with the second public key is an element other than the predetermined data position. A fourth arrangement to:
The detection apparatus according to claim 11, which is returned to the first information processing unit. The update unit encrypts each element of the reply array, a value obtained by raising the encryption check array by a negative value of the fourth random number, and the fourth random number and the fifth random number with the second public key. An inverse element of the digitized value, a value obtained by raising the encrypted propagation array by a negative value of the fifth random number, and a value obtained by raising the fourth array by a negative value of the seventh random number. The detection apparatus according to claim 12, wherein the inspection array is updated with each element added by cryptographic addition. The detection device inputs a history data string including at least one of product advertisement history data and product purchase history data as the input data string,
The output part which outputs the trigger information which shows that an advertisement should be issued according to the said detection target pattern being detected in the said log | history data row | line | column is further provided. Detection device. The detection apparatus inputs a gene sequence as the input data string,
The detection apparatus according to any one of claims 1 to 13, further comprising an output unit that outputs whether or not the detection target pattern is detected in the gene sequence. A detection method for detecting whether or not a predetermined detection target pattern is included in an input data string,
Corresponding to each data position of the detection target pattern, a test sequence storage step for storing a test sequence indicating whether or not a pattern portion up to the data position in the detection target pattern is being detected in the input data sequence;
For each data type, a data corresponding pattern generation stage for generating a data corresponding pattern indicating whether or not each data position of the detection target pattern is the type of data;
An update stage for updating the test array based on the data correspondence pattern corresponding to the next input data;
A determination step of determining whether or not the detection target pattern is included in the input data sequence based on an element of the inspection array corresponding to a data position at the end of the detection target pattern;
A detection method comprising: A program that causes a computer to function as a detection device that detects whether or not a predetermined detection target pattern is included in an input data string,
Corresponding to each data position of the detection target pattern, a test sequence storage unit that stores a test sequence indicating whether or not a pattern portion up to the data position in the detection target pattern is being detected in the input data sequence;
A data-corresponding pattern generation unit that generates a data-corresponding pattern indicating whether or not each data position of the detection target pattern is data of the kind for each data type;
An update unit that updates the inspection array based on the data correspondence pattern corresponding to the next input data;
A determination unit that determines whether or not the detection target pattern is included in the input data sequence based on an element of the inspection array corresponding to a data position at the end of the detection target pattern;
Program to make it work.   A computer that functions as the first information processing unit or the second information processing unit according to any one of claims 6 to 13.   A program that causes a computer to function as the first information processing unit or the second information processing unit according to any one of claims 6 to 13.

Images