WO2016002020A1 - 行列生成装置及び行列生成方法及び行列生成プログラム - Google Patents
行列生成装置及び行列生成方法及び行列生成プログラム Download PDFInfo
- Publication number
- WO2016002020A1 WO2016002020A1 PCT/JP2014/067609 JP2014067609W WO2016002020A1 WO 2016002020 A1 WO2016002020 A1 WO 2016002020A1 JP 2014067609 W JP2014067609 W JP 2014067609W WO 2016002020 A1 WO2016002020 A1 WO 2016002020A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- matrix
- node
- row
- column
- processing unit
- Prior art date
Links
Images
Classifications
-
- G—PHYSICS
- G09—EDUCATION; CRYPTOGRAPHY; DISPLAY; ADVERTISING; SEALS
- G09C—CIPHERING OR DECIPHERING APPARATUS FOR CRYPTOGRAPHIC OR OTHER PURPOSES INVOLVING THE NEED FOR SECRECY
- G09C1/00—Apparatus or methods whereby a given sequence of signs, e.g. an intelligible text, is transformed into an unintelligible sequence of signs by transposing the signs or groups of signs or by replacing them by others according to a predetermined system
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
- H04L9/0816—Key establishment, i.e. cryptographic processes or cryptographic protocols whereby a shared secret becomes available to two or more parties, for subsequent use
- H04L9/085—Secret sharing or secret splitting, e.g. threshold schemes
Definitions
- the present invention relates to a matrix generation device, a matrix generation method, and a matrix generation program.
- the present invention relates to an apparatus, method, and program for generating a secret sharing matrix used for encryption and decryption, for example.
- secret information is divided into several pieces of shared information.
- the combination of distributed information to be collected can be defined by a logical expression using logical sum or logical product.
- the secret sharing matrix is obtained by converting the logical expression into a matrix form. Elements included in the logical expression are assigned to each row of the secret sharing matrix.
- the secret sharing matrix is designed so that the sum or product of the rows of elements satisfying the logical expression becomes a desired value. A desired value cannot be obtained by any combination of rows of elements that do not satisfy the logical expression.
- the logical expression F is a logical product of the variable P and the variable Q, and the variable P is assigned to the first row and the variable Q is assigned to the second row.
- the logical expression F becomes true. That is, the combination of the variable P and the variable Q satisfies the logical expression F. Neither the variable P nor the variable Q alone satisfies the logical expression F. Therefore, the secret sharing matrix M is designed so that the first row and the second row are not desired values, and the sum or product of the first row and the second row is a desired value.
- the secret sharing matrix is used for functional encryption (for example, see Patent Document 1).
- Non-Patent Documents 1 and 2 Conventionally, several methods for generating a secret sharing matrix have been proposed (see, for example, Non-Patent Documents 1 and 2).
- Non-Patent Document 1 In the method described in Non-Patent Document 1, three values of 1, 1, ⁇ 1, and 0 must be used as matrix components. Even in the method described in Non-Patent Document 2, many values are used. In the conventional method, the secret sharing matrix cannot be generated efficiently.
- An object of the present invention is to efficiently generate a matrix from a logical expression, for example.
- a matrix generation device includes: A tree structure generation unit that receives an input of a logical expression and generates tree structure data representing the logical expression; Among the elements of the logical expression, a route processing unit that determines a type of an element expressed by a root of the tree structure data generated by the tree structure generation unit, and generates a matrix according to the determined type; When the matrix generated by the route processing unit is stored in a memory, nodes other than the root of the tree structure data generated by the tree structure generation unit are sequentially selected, and a node having child nodes is selected.
- the logical expression when an operation corresponding to the type of element expressed by the selected node is performed on the matrix stored in the memory and a node having no child node is selected, the logical expression The variable that is the element represented by the selected node is associated with one row of the matrix stored in the memory, and after selecting the node of the tree structure data, the matrix stored in the memory And a node processing unit that outputs information indicating a variable associated with each row of the matrix.
- a matrix corresponding to the type of element represented by the root of the tree structure data is generated. Thereafter, an operation corresponding to the type of element represented by each node of the tree structure data is performed on the matrix. For nodes that represent variables, the variables are associated with one row of the matrix. Finally, a matrix in which variables are associated with each row is obtained. As described above, according to the present invention, it is possible to efficiently generate a matrix by tracing tree structure data representing a logical expression.
- FIG. 6 shows an example of a matrix finally generated in the first embodiment.
- 1 is a block diagram showing a configuration of a matrix generation device according to Embodiment 1.
- FIG. FIG. 3 is a block diagram showing a configuration of a tree structure generation unit of the matrix generation device according to the first embodiment.
- FIG. 3 shows an example of a binary tree generated in the first embodiment. The figure which shows the recursive structure of the binary tree of FIG.
- FIG. 3 is a block diagram showing a configuration of a route processing unit of the matrix generation device according to the first embodiment.
- FIG. 3 is a block diagram showing a configuration of a node processing unit of the matrix generation device according to the first embodiment.
- 5 is a flowchart showing an operation of a route processing unit of the matrix generation device according to the first embodiment.
- FIG. 5 is a flowchart showing an operation of a node processing unit of the matrix generation device according to the first embodiment.
- FIG. 3 shows an example of generating a matrix in the first embodiment.
- the figure which shows an example of the hardware constitutions of the matrix production
- variable P is expressed by the following expression.
- A a
- the value a is “male” or “female”.
- variable P is expressed by the following expression.
- A! A
- the rows of the matrix M are counted in ascending order from top to bottom (ie, ordinal numbers are assigned).
- the top line is the first line.
- the line immediately below the first line is the second line.
- the columns of the matrix M are counted in ascending order from left to right (ie, ordinal numbers are assigned). For example, the leftmost column is the first column. The column immediately to the right of the first column is the second column.
- mapping is established between the row number (that is, the ordinal number) of the matrix M and the variable of the logical expression F.
- FIG. 1 is a diagram illustrating an example of a matrix M finally generated in the present embodiment.
- a matrix M is a secret sharing matrix of L rows ⁇ r columns.
- the mapping ⁇ associates each row of the matrix M with one variable included in the variable set ⁇ p 1 ,..., P n ⁇ . That is, all the rows of the matrix M are associated with one variable by the mapping ⁇ .
- N 4.
- the matrix M and the mapping ⁇ are final outputs. This output is used for functional encryption, for example.
- the matrix M may be a matrix other than the secret sharing matrix.
- the number of rows L, the number of columns r, and the number of variables n can be changed as appropriate.
- the contents of each variable can also be changed as appropriate.
- FIG. 2 is a block diagram showing a configuration of the matrix generation device 100 according to the present embodiment.
- the matrix generation device 100 includes a tree structure generation unit 110, a route processing unit 120, and a node processing unit 130.
- the tree structure generation unit 110 receives the logical expression F and generates a binary tree T expressing the logical expression F.
- the logical expression F is created by combining operators such as logical product (and), logical sum (or), negation (not), and variables.
- the operators and variables are elements of the logical expression F, respectively.
- the logical formula F is, for example, a logical formula that defines a combination of information distributed by the secret sharing scheme.
- Binary tree T is an example of tree structure data.
- the binary tree T has elements of the logical expression F as nodes.
- Each node is assigned a node number.
- the node number of the route is 1, and the node numbers are sequentially assigned to each node with priority given to the left child node. For example, if the root has a child node on the left side, the node number of the child node is 2. If a node with a node number of 2 has a child node (that is, a grandchild node of the root) on the left side, the node number of that child node is 3. If the node with node number 2 has no child node and the root has a child node on the right side, the node number of that child node is 3. Note that the node number assignment method can be changed as appropriate.
- the tree structure generation unit 110 outputs the generated binary tree T and the number N of nodes of the binary tree T to the route processing unit 120 and the node processing unit 130.
- the route processing unit 120 receives the binary tree T generated by the tree structure generation unit 110 and the number N of nodes of the binary tree T, and is expressed by the root of the binary tree T among the elements of the logical expression F. Determine the type of element.
- the route processing unit 120 generates a matrix M according to the determined type.
- the route processing unit 120 executes a logical product process.
- a matrix M corresponding to the logical product operator is generated.
- the node number I next to the root node number is calculated.
- the route processing unit 120 executes a logical sum process.
- a matrix M corresponding to the logical sum operator is generated.
- the node number I next to the root node number is calculated.
- the route processing unit 120 executes variable processing.
- variable processing a matrix M corresponding to the variable is generated.
- the node number I next to the root node number is calculated.
- the variable is associated with one row of the matrix M by the mapping ⁇ .
- the route processing unit 120 outputs the generated matrix M to the node processing unit 130.
- the route processing unit 120 also outputs the calculated node number I to the node processing unit 130. If the route processing unit 120 generates the mapping ⁇ , the route processing unit 120 also outputs the mapping ⁇ to the node processing unit 130.
- the node processing unit 130 includes a binary tree T generated by the tree structure generation unit 110, the number N of nodes of the binary tree T, a matrix M generated by the route processing unit 120, a mapping ⁇ (if any), a node In response to the input of the number I, the binary tree T, the number N of nodes, the matrix M, the node number I, and the mapping ⁇ are stored in a memory (not shown).
- the node processing unit 130 sequentially selects nodes other than the root of the binary tree T. Specifically, the node processing unit 130 selects a node corresponding to the node number I. The node number I is incremented by 1 until the number N of nodes is exceeded.
- the node processing unit 130 selects a node having child nodes, the node processing unit 130 performs an operation corresponding to the type of the element expressed by the selected node among the elements of the logical expression F on the matrix M stored in the memory. Do.
- the node processing unit 130 performs a logical product process.
- the logical product process an operation corresponding to the logical product operator is performed on the matrix M.
- the node processing unit 130 executes a logical OR process.
- a logical OR process an operation corresponding to the logical sum operator is performed on the matrix M.
- a node that is, a leaf
- a matrix M in which variables that are elements represented by the selected node among the elements of the logical expression F are stored in the memory. Correspond to one line.
- the node processing unit 130 executes variable processing.
- the variable is associated with one row of the matrix M by the mapping ⁇ .
- the node processing unit 130 After completing the selection of the nodes of the binary tree T, the node processing unit 130 outputs the matrix M and the mapping ⁇ stored in the memory.
- the mapping ⁇ is information indicating a variable associated with each row of the matrix M.
- FIG. 3 is a block diagram showing a configuration of the tree structure generation unit 110.
- FIG. 4 is a diagram illustrating an example of the binary tree T generated in the present embodiment.
- the tree structure generation unit 110 includes a logical expression input unit 111, a binary tree generation unit 112, and a binary tree output unit 113.
- the logical expression input unit 111 receives an input of the following logical expression F, which is a combination of logical product (and), logical sum (or), and negation (not).
- F a combination of logical product (and), logical sum (or), and negation (not).
- This logical formula F is valid when A is not 10, B is 20, and C is not 30, or when A is not 10 and D is 40.
- the binary tree generation unit 112 converts the logical expression F obtained by the logical expression input unit 111 into a binary tree T.
- Priority of operations in the logical expression F is the order of logical expressions in parentheses, logical product (and), and logical sum (or). Therefore, the calculation order of the logical expression F is the logical product (and) in parentheses, the logical sum (or) in parentheses, and the logical product (and) outside the parentheses.
- the binary tree generation unit 112 arranges the elements of the logical expression F from the root in the reverse order of the calculation order of the logical expression F. Specifically, first, the binary tree generation unit 112 arranges the operator X to be calculated last (in the example of FIG. 4, a logical product outside the parentheses) at the root.
- the binary tree generating unit 112 applies the operator that is last calculated by the logical expression on the left side of the operator Y1 to the left child node of the operator Y1. Place variables. Similarly, the binary tree generation unit 112 places the operator or variable that is finally calculated by the logical expression on the right side of the operator Y1 in the child node on the right side of the operator Y1. Thereafter, the binary tree generating unit 112 performs the same process on the child node on the right side of the operator X.
- the binary tree generating unit 112 performs the process on the child node on the right side of the operator X as it is.
- the binary tree generation unit 112 alternately repeats the process for the left child node and the process for the right child node until the variables have been allocated to all the leaves.
- the binary tree generation unit 112 assigns a node number to each node. 1 is assigned to the route. Other nodes are assigned numbers after 2 with priority on the left side.
- the binary tree generator 112 records the maximum value of the node number as the number N of nodes.
- the binary tree output unit 113 outputs the binary tree T generated by the binary tree generation unit 112 and the number N of nodes recorded by the binary tree generation unit 112.
- the processing is performed using a recursive structure as shown in FIG.
- FIG. 6 is a block diagram showing a configuration of the route processing unit 120.
- FIG. 7 is a block diagram illustrating a configuration of the node processing unit 130.
- FIG. 8 is a flowchart showing the operation of the route processing unit 120.
- FIG. 9 is a flowchart showing the operation of the node processing unit 130.
- the route processing unit 120 includes a route determination unit 121, a logical product processing unit 122a, a logical sum processing unit 122b, a variable processing unit 122c, and a processing result output unit 123.
- the node processing unit 130 includes a node determination unit 131, a logical product processing unit 132a, a logical sum processing unit 132b, a variable processing unit 132c, a processing number determination unit 133, and a processing result output unit 134.
- the route determination unit 121 receives input of the binary tree T and the number of nodes N.
- the route determination unit 121 initializes the mapping ⁇ from the row number to the variable.
- the route determination unit 121 determines whether the root of the binary tree T is a logical product, a logical sum, or a variable. If the route is a logical product, the flow proceeds to S24a. If the route is a logical sum, the flow proceeds to S24b. If the route is a variable, the flow proceeds to S24c.
- the logical product processing unit 122a receives the input of the binary tree T from the route determination unit 121 and generates the following matrix M. The flow proceeds to S25a.
- the logical product processing unit 122a obtains a node number I by adding 1 to the node number of the root of the binary tree T. The flow proceeds to S26.
- the logical sum processing unit 122b receives the input of the binary tree T from the route determination unit 121 and generates the following matrix M. The flow proceeds to S25b.
- the logical sum processing unit 122b adds 1 to the node number of the root of the binary tree T to obtain the node number I.
- the flow proceeds to S26.
- variable processing unit 122 c receives the binary tree T and the mapping ⁇ from the route determination unit 121 and generates the following matrix M. The flow proceeds to S25c. (1)
- variable processing unit 122c obtains the node number I by adding 1 to the node number of the root of the binary tree T.
- variable processing unit 122c updates the mapping ⁇ as follows. The flow proceeds to S26. ⁇ : ⁇ (1, p 1 ) ⁇
- the processing result output unit 123 outputs the matrix M generated by any of the logical product processing unit 122a, the logical sum processing unit 122b, and the variable processing unit 122c.
- the processing result output unit 123 also outputs the node number I calculated by any of the logical product processing unit 122a, the logical sum processing unit 122b, and the variable processing unit 122c.
- the processing result output unit 123 further outputs the mapping ⁇ in the initial state or the mapping ⁇ updated by the variable processing unit 122c.
- the node determination unit 131 receives inputs of the binary tree T, the number of nodes N, the matrix M, the node number I, and the mapping ⁇ .
- the node determination unit 131 sets the processing row number CR to 1.
- the CR row of the matrix M is a row to which variables are associated next.
- the processing number determination unit 133 determines whether the node number I is larger than the node number N. If the node number I is smaller than or equal to the node number N (ie, I ⁇ N), the flow proceeds to S34. If the node number I is greater than the node number N (ie, I> N), the binary tree T has no more nodes to select, and the flow proceeds to S36.
- the node determination unit 131 selects a node corresponding to the node number I.
- the node determination unit 131 determines whether the selected node is a logical product, a logical sum, or a variable. If the node (in this case, a node having child nodes) is a logical product, the flow proceeds to S35a. If the node (in this case, a node having child nodes) is a logical sum, the flow proceeds to S35b. If the node (in this case, a leaf) is a variable, the flow proceeds to S35c.
- the logical product processing unit 132a receives the input of the binary tree T, the matrix M, the processing row number CR, the node number I, and the mapping ⁇ from the node determination unit 131, and executes the logical product processing. In the logical product process, the matrix M and the node number I are updated. Details of the logical product processing will be described later. The flow returns to S33.
- the logical sum processing unit 132b receives the input of the binary tree T, the matrix M, the processing row number CR, the node number I, and the mapping ⁇ from the node determination unit 131, and executes the logical sum processing. In the logical sum process, the matrix M and the node number I are updated. Details of the logical sum processing will be described later. The flow returns to S33.
- variable processing unit 132c receives input of the binary tree T, the matrix M, the processing row number CR, the node number I, and the mapping ⁇ from the node determining unit 131, and executes variable processing.
- the matrix M, the processing row number CR, the node number I, and the mapping ⁇ are updated. Details of the variable processing will be described later. The flow returns to S33.
- the processing number determination unit 133 sets the matrix M and the node number I updated by any one of the logical product processing unit 132a, the logical sum processing unit 132b, and the variable processing unit 132c. The data is passed to the node determination unit 131. If the processing line number CR and the mapping ⁇ are updated by the variable processing unit 132c, the processing number determination unit 133 also passes the updated processing line number CR and the mapping ⁇ to the node determination unit 131.
- the processing result output unit 134 receives the matrix M and the mapping ⁇ from the processing number determination unit 133, and outputs the matrix M and the mapping ⁇ .
- the logical product processing unit 132a receives a binary tree T, a matrix M of L ′ ⁇ r ′, a processing row number CR, a node number I, and a mapping ⁇ as inputs.
- the logical product processing unit 132a adds a row in which all the components are 0 as the (L ′ + 1) th row in the L ′ ⁇ r ′ matrix M. Since rows are added, the matrix M is a (L ′ + 1) ⁇ r ′ matrix.
- the logical product processing unit 132a adds a column whose components are all 0 as the (r ′ + 1) th column in the (L ′ + 1) ⁇ r ′ matrix M. Since columns are added, the matrix M is a matrix of (L ′ + 1) ⁇ (r ′ + 1).
- the logical product processing unit 132a defines a column in which 1 is present on the leftmost side of the CR row as the CL column in the (L ′ + 1) ⁇ (r ′ + 1) matrix M.
- the logical product processing unit 132a overwrites the (i + 1) th column with the i-th column in the (L ′ + 1) ⁇ (r ′ + 1) matrix M, where i is a value from r ′ to CL. That is, the logical product processing unit 132a copies the r ′ column to the (r ′ + 1) column, the (r′ ⁇ 1) column to the r ′ column,... The column is copied to the (CL + 1) column.
- the logical product processing unit 132a overwrites the (j + 1) th row with the jth row in the matrix M of (L ′ + 1) ⁇ (r ′ + 1), where j is a value from L ′ to CR. That is, the logical product processing unit 132a copies the L ′ line to the (L ′ + 1) line, the (L′ ⁇ 1) line to the L ′ line,... The line is copied to the (CR + 1) line.
- the logical product processing unit 132a sets the CR row and CL column components to 1, and the CR row (CL + 1) column components to 0 ( The component in the (CR + 1) th row and the CL column is rewritten to 0, and the component in the (CR + 1) th row (CL + 1) column is rewritten to 1.
- the logical product processing unit 132a adds 1 to the node number I.
- the logical product processing unit 132a outputs a binary tree T, a matrix M of (L ′ + 1) ⁇ (r ′ + 1), a processing row number CR, a node number I, and a mapping ⁇ .
- the logical sum processing unit 132b receives as input the binary tree T, the matrix M of L ′ ⁇ r ′, the processing row number CR, the node number I, and the mapping ⁇ .
- the logical sum processing unit 132b adds a row whose components are all 0 as the (L ′ + 1) th row in the L ′ ⁇ r ′ matrix M. Since rows are added, the matrix M is a (L ′ + 1) ⁇ r ′ matrix.
- the logical sum processing unit 132b overwrites the (j + 1) th row with the jth row in the (L ′ + 1) ⁇ r ′ matrix M, where j is a value from L ′ to CR. That is, the logical product processing unit 132a copies the L ′ line to the (L ′ + 1) line, the (L′ ⁇ 1) line to the L ′ line,... The line is copied to the (CR + 1) line.
- the logical sum processing unit 132b adds 1 to the node number I.
- the logical sum processing unit 132b outputs a binary tree T, a matrix L of (L ′ + 1) ⁇ r ′, a processing row number CR, a node number I, and a mapping ⁇ .
- variable processing unit 132c receives as input the binary tree T, the matrix M of L ′ ⁇ r ′, the processing row number CR, the node number I, and the mapping ⁇ .
- variable processing unit 132c adds (CR, p k ) to the mapping ⁇ .
- variable processing unit 132c adds 1 to the node number I.
- variable processing unit 132c adds 1 to the processing line number CR.
- the variable processing unit 132c outputs a binary tree T, a matrix M of L ′ ⁇ r ′, a processing row number CR, a node number I, and a mapping ⁇ .
- the combination of rows in which the addition result of all the columns is 1 when the components of the same column are added is associated with each row. If the given variable is true, the logical expression F is true.
- the variable associated with each row is Even if true, the logical expression F is false.
- the above-described route processing and node processing are performed in the present embodiment.
- the route processing unit 120 performs the process of S24a. That is, the route processing unit 120 calculates a matrix of 2 rows and 2 columns in which the first row, first column and second row, second column components are 1, and the first row, second column and second row, first column components are 0. A matrix M corresponding to the product operator is generated.
- the route processing unit 120 performs the process of S24b. That is, the route processing unit 120 generates a two-row, one-column matrix in which all components are 1, as a matrix M corresponding to the logical sum operator.
- the node processing unit 130 performs the process of S35a. That is, the node processing unit 130 adds a new row and column, sets the row to which the variable is associated next as the CR row, and selects the column with the smallest ordinal number among the columns whose CR row has a component of 1 as CL. As the column, the CR row CL column and the (CR + 1) th row (CL + 1) column component are set to 1, and the CR row (CL + 1) and (CR + 1) row CL column components are set to 0. The operation is performed on the matrix M as an operation corresponding to the logical product operator.
- the CR line is substantially expanded to 2 lines, and the (CR + 1) th and subsequent lines are shifted downward by one line.
- the CL column is expanded to two columns, and the (CL + 1) th column and beyond are shifted to the right by one column.
- the component of the CR row before the expansion and the CL column is converted into the same 2-row / 2-column submatrix as the matrix generated by the processing of S24a, and the expansion (that is, the operation corresponding to the AND operator). ) Can be prevented from affecting other components. For this reason, the logical product operator expressed by the selected node can be appropriately reflected in the matrix M.
- the node processing unit 130 performs the process of S35b. In other words, the node processing unit 130 adds a new line, and sets the component corresponding to the variable to the CR line, and sets each component in the (CR + 1) line to the same value as each component in the CR line. Is performed on the matrix M as an operation corresponding to the logical sum operator.
- the CR line is substantially expanded to 2 lines, and the (CR + 1) th and subsequent lines are shifted downward by one line.
- the component having a value of 1 in the CR row before the expansion is converted into a sub-matrix having the same 2-row and one-column as the matrix generated by the processing of S24b, and the expansion (that is, the operation corresponding to the logical sum operator). ) Can be prevented from affecting other components. For this reason, the logical sum operator expressed by the selected node can be appropriately reflected in the matrix M.
- the matrix M can be efficiently generated by following the binary tree T expressing the logical expression F.
- the node processing unit 130 executes processing for each node of the binary tree T by recursive calling. Therefore, the matrix M can be generated more efficiently.
- the matrix generation method performs a process on the input of the logical expression F, the step of generating a tree structure equivalent to the logical expression F, and the root of the tree structure.
- a step of determining whether or not a tree-structured node has a child node, a step of processing a child node by recursion if the node has a child node, and a node being a child node In the case of not having, the step of associating a variable with a row and returning to the parent node is included.
- the component of the generated matrix M is 0 or 1.
- a vector consisting of all 1s can be generated. Even if the row vectors of sub-matrices composed of rows in which the logical expression F is not established are linearly combined, a vector consisting of all 1s cannot be generated.
- the size of the matrix M can be reduced by using this matrix generation method. Further, the conversion process from the logical expression F to the matrix M can be made efficient. Furthermore, the program size at the time of mounting can be reduced.
- the following matrix (or partial matrix) is generated by the logical product processing of S24a and S35a.
- the following matrix (or partial matrix) may be generated by the logical product processing of S24a and S35a.
- the matrix M is composed of 0 and 1, but the matrix M may be composed of integer values other than 0 and 1 or real values.
- FIG. 10 is a diagram illustrating an example of generating the matrix M in the present embodiment.
- the route determination unit 121 receives an input of a binary tree T expressing the following logical expression F and the number of nodes N.
- the number N of nodes having nodes is seven.
- the route determination unit 121 initializes the mapping ⁇ .
- the route determination unit 121 determines that the route of the binary tree T is a logical product. The flow proceeds to S24a.
- the processing result output unit 123 outputs the matrix M, the node number I, and the mapping ⁇ .
- the node determination unit 131 receives inputs of the binary tree T, the number of nodes N, the matrix M, the node number I, and the mapping ⁇ .
- the number N of nodes is 7.
- Node number I is 2.
- the node determination unit 131 sets the processing row number CR to 1.
- the node determination unit 131 selects a node corresponding to the node number I.
- variable processing unit 132c receives as input the binary tree T, 2 ⁇ 2 matrix M, processing row number CR, node number I, and mapping ⁇ .
- the processing line number CR is 1.
- Node number I is 2.
- variable processing unit 132c updates the node number I from 2 to 3.
- variable processing unit 132c updates the processing line number CR from 1 to 2.
- variable processing unit 132c outputs a binary tree T, a 2 ⁇ 2 matrix M, a processing row number CR, a node number I, and a mapping ⁇ . The flow returns to S33.
- the node determination unit 131 selects a node corresponding to the node number I.
- the node determination unit 131 determines that the selected node is a logical sum. The flow proceeds to S35b.
- the logical sum processing unit 132b receives as input the binary tree T, the 2 ⁇ 2 matrix M, the processing row number CR, the node number I, and the mapping ⁇ .
- the processing line number CR is 2.
- Node number I is three.
- the logical sum processing unit 132b adds a row whose components are all 0 as the third row. Since rows are added, the matrix M becomes the following 3 ⁇ 2 matrix.
- the logical sum processing unit 132b copies the second row to the third row in the 3 ⁇ 2 matrix M.
- the matrix M becomes the following matrix.
- the logical sum processing unit 132b updates the node number I from 3 to 4.
- the logical sum processing unit 132b outputs a binary tree T, a 3 ⁇ 2 matrix M, a processing row number CR, a node number I, and a mapping ⁇ . The flow returns to S33.
- the processing result output unit 134 receives the matrix M and the mapping ⁇ from the processing number determination unit 133, and outputs the matrix M and the mapping ⁇ .
- the node determination unit 131 selects a node corresponding to the node number I.
- the node determination unit 131 determines that the selected node is a logical product. The flow proceeds to S35a.
- the logical product processing unit 132a receives as input the binary tree T, the 3 ⁇ 2 matrix M, the processing row number CR, the node number I, and the mapping ⁇ .
- the processing line number CR is 2.
- Node number I is four.
- the logical product processing unit 132a adds a row in which all the components are 0 as the fourth row in the 3 ⁇ 2 matrix M. Since rows are added, the matrix M becomes the following 4 ⁇ 2 matrix.
- the logical product processing unit 132a adds a column whose components are all 0 as the third column in the 4 ⁇ 2 matrix M. Since columns are added, the matrix M is the following 4 ⁇ 3 matrix.
- the logical product processing unit 132a defines a column in the 4 ⁇ 3 matrix M having 1 at the leftmost position of the CR row as the CL column. That is, the logical product processing unit 132a sets CL to 2.
- the AND processing unit 132a copies the second column to the third column in the 4 ⁇ 3 matrix M.
- the matrix M becomes the following matrix.
- the logical product processing unit 132a copies the third row to the fourth row and copies the second row to the third row.
- the matrix M becomes the following matrix.
- the logical product processing unit 132a sets the CR row CL column component to 1, the CR row (CL + 1) column component to 0, and the (CR + 1) row CL column.
- the component is rewritten to 0, and the component in the (CR + 1) th row (CL + 1) th column is rewritten to 1. That is, the logical product processing unit 132a sets the components of the second row, second column, and third row, third column to 1, and sets the components of the second row, third column, and third row, second column to 0.
- the matrix M becomes the following matrix.
- the logical product processing unit 132a updates the node number I from 4 to 5.
- the logical product processing unit 132a outputs a binary tree T, a 4 ⁇ 3 matrix M, a processing row number CR, a node number I, and a mapping ⁇ . The flow returns to S33.
- the node determination unit 131 selects a node corresponding to the node number I.
- variable processing unit 132c receives as input the binary tree T, the 4 ⁇ 3 matrix M, the processing row number CR, the node number I, and the mapping ⁇ .
- the processing line number CR is 2.
- the node number I is 5.
- variable processing unit 132c updates the node number I from 5 to 6.
- variable processing unit 132c updates the processing line number CR from 2 to 3.
- variable processing unit 132c outputs a binary tree T, a 4 ⁇ 3 matrix M, a processing row number CR, a node number I, and a mapping ⁇ . The flow returns to S33.
- the node determination unit 131 selects a node corresponding to the node number I.
- variable processing unit 132c receives as input the binary tree T, the 4 ⁇ 3 matrix M, the processing row number CR, the node number I, and the mapping ⁇ .
- the processing line number CR is 3.
- Node number I is six.
- variable processing unit 132c updates the node number I from 6 to 7.
- variable processing unit 132c updates the processing line number CR from 3 to 4.
- variable processing unit 132c outputs a binary tree T, a 4 ⁇ 3 matrix M, a processing row number CR, a node number I, and a mapping ⁇ . The flow returns to S33.
- the node determination unit 131 selects a node corresponding to the node number I.
- variable processing unit 132c receives as input the binary tree T, the 4 ⁇ 3 matrix M, the processing row number CR, the node number I, and the mapping ⁇ .
- the processing line number CR is 3.
- the node number I is 7.
- variable processing unit 132c updates the node number I from 7 to 8.
- variable processing unit 132c updates the processing line number CR from 4 to 5.
- variable processing unit 132c outputs a binary tree T, a 4 ⁇ 3 matrix M, a processing row number CR, a node number I, and a mapping ⁇ . The flow returns to S33.
- the processing result output unit 134 outputs the 4 ⁇ 3 matrix M and the mapping ⁇ .
- FIG. 11 is a diagram illustrating an example of a hardware configuration of the matrix generation device 100 according to the embodiment of the present invention.
- the matrix generation device 100 is a computer and includes hardware such as an output device 910, an input device 920, a storage device 930, and a processing device 940.
- the hardware is used by each unit of the matrix generation device 100 (described as “unit” in the description of the embodiment of the present invention).
- the output device 910 is, for example, a display device such as an LCD (Liquid / Crystal / Display), a printer, or a communication module (communication circuit or the like).
- the output device 910 is used for outputting (transmitting) data, information, and signals by what is described as “unit” in the description of the embodiment of the present invention.
- the input device 920 is, for example, a keyboard, a mouse, a touch panel, a communication module (communication circuit or the like).
- the input device 920 is used for inputting (receiving) data, information, and signals by what is described as a “unit” in the description of the embodiment of the present invention.
- the storage device 930 is, for example, a ROM (Read / Only / Memory), a RAM (Random / Access / Memory), a HDD (Hard / Disk / Drive), or an SSD (Solid / State / Drive).
- the storage device 930 stores a program 931 and a file 932.
- the program 931 includes a program for executing processing (function) described as “unit” in the description of the embodiment of the present invention.
- the file 932 includes data, information, signals (values), and the like that are calculated, processed, read, written, used, input, output, etc. by what is described as “parts” in the description of the embodiment of the present invention. It is.
- the processing device 940 is, for example, a CPU (Central Processing Unit).
- the processing device 940 is connected to other hardware devices via a bus or the like, and controls those hardware devices.
- the processing device 940 reads the program 931 from the storage device 930 and executes the program 931.
- the processing device 940 is used for performing calculation, processing, reading, writing, use, input, output, and the like by what is described as “unit” in the description of the embodiment of the present invention.
Landscapes
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Computer Security & Cryptography (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
Description
論理式の入力を受けて、前記論理式を表現する木構造データを生成する木構造生成部と、
前記論理式の要素のうち、前記木構造生成部により生成された木構造データのルートによって表現される要素の種類を判定し、判定した種類に応じた行列を生成するルート処理部と、
前記ルート処理部により生成された行列をメモリに格納するとともに、前記木構造生成部により生成された木構造データの前記ルート以外のノードを順次選択し、子ノードを持つノードを選択した場合は、前記論理式の要素のうち、選択したノードによって表現される要素の種類に応じた操作を、前記メモリに格納した行列に対して行い、子ノードを持たないノードを選択した場合は、前記論理式の要素のうち、選択したノードによって表現される要素である変数を、前記メモリに格納した行列の一行に対応付け、当該木構造データのノードを選択し終えた後は、前記メモリに格納した行列及びその行列の各行に対応付けた変数を示す情報を出力するノード処理部とを備える。
A=a
A!=a
ρ(ROW)=P
ρ:{(1,p1),(2,p2)}
図1は、本実施の形態で最終的に生成される行列Mの一例を示す図である。
ρ:{(1,(A!=10)),(2,(B=20)),(3,(C!=30)),(4,(D=40))}
A!=10 and ((B=20 and C!=30) or D=40)
・ノード番号1(ルート):論理積(and)
・ノード番号2(リーフ):A!=10
・ノード番号3:論理和(or)
・ノード番号4:論理積(and)
・ノード番号5(リーフ):B=20
・ノード番号6(リーフ):C!=30
・ノード番号7(リーフ):D=40
(1)
ρ(1)=p1
ρ:{(1,p1)}
ρ(CR)=pk
A!=10 and ((B=20 and C!=30) or D=40)
・ノード番号1(ルート):論理積(and)
・ノード番号2(リーフ):A!=10
・ノード番号3:論理和(or)
・ノード番号4:論理積(and)
・ノード番号5(リーフ):B=20
・ノード番号6(リーフ):C!=30
・ノード番号7(リーフ):D=40
ρ(1)=(A!=10)
ρ(2)=(B=20)
ρ(3)=(C!=30)
ρ(4)=(D=40)
Claims (12)
- 論理式の入力を受けて、前記論理式を表現する木構造データを生成する木構造生成部と、
前記論理式の要素のうち、前記木構造生成部により生成された木構造データのルートによって表現される要素の種類を判定し、判定した種類に応じた行列を生成するルート処理部と、
前記ルート処理部により生成された行列をメモリに格納するとともに、前記木構造生成部により生成された木構造データの前記ルート以外のノードを順次選択し、子ノードを持つノードを選択した場合は、前記論理式の要素のうち、選択したノードによって表現される要素の種類に応じた操作を、前記メモリに格納した行列に対して行い、子ノードを持たないノードを選択した場合は、前記論理式の要素のうち、選択したノードによって表現される要素である変数を、前記メモリに格納した行列の一行に対応付け、当該木構造データのノードを選択し終えた後は、前記メモリに格納した行列及びその行列の各行に対応付けた変数を示す情報を出力するノード処理部と
を備えることを特徴とする行列生成装置。 - 前記ルート処理部は、判定した種類が論理和演算子である場合は、全ての成分が1である二行一列の行列を、論理和演算子に応じた行列として生成することを特徴とする請求項1の行列生成装置。
- 前記ノード処理部は、選択したノードによって表現される要素の種類が論理和演算子である場合は、新たな行を追加するとともに、次に変数を対応付ける行をCR行目として、(CR+1)行目の各成分をCR行目の各成分と同じ値に設定する操作を、論理和演算子に応じた操作として行うことを特徴とする請求項2の行列生成装置。
- 前記ルート処理部は、判定した種類が論理積演算子である場合は、一行目一列目及び二行目二列目の成分が1、一行目二列目及び二行目一列目の成分が0である二行二列の行列を、論理積演算子に応じた行列として生成することを特徴とする請求項1から3のいずれかの行列生成装置。
- 前記ノード処理部は、選択したノードによって表現される要素の種類が論理積演算子である場合は、新たな行及び列を追加するとともに、次に変数を対応付ける行をCR行目とし、CR行目の成分が1である列のうち、序数が最小の列をCL列目として、CR行目CL列目及び(CR+1)行目(CL+1)列目の成分を1、CR行目(CL+1)列目及び(CR+1)行目CL列目の成分を0に設定する操作を、論理積演算子に応じた操作として行うことを特徴とする請求項4の行列生成装置。
- 前記ルート処理部は、判定した種類が論理積演算子である場合は、一行目一列目及び二行目二列目の成分が0、一行目二列目及び二行目一列目の成分が1である二行二列の行列を、論理積演算子に応じた行列として生成することを特徴とする請求項1から3のいずれかの行列生成装置。
- 前記ノード処理部は、選択したノードによって表現される要素の種類が論理積演算子である場合は、新たな行及び列を追加するとともに、次に変数を対応付ける行をCR行目とし、CR行目の成分が1である列のうち、序数が最小の列をCL列目として、CR行目CL列目及び(CR+1)行目(CL+1)列目の成分を0、CR行目(CL+1)列目及び(CR+1)行目CL列目の成分を1に設定する操作を、論理積演算子に応じた操作として行うことを特徴とする請求項6の行列生成装置。
- 前記ノード処理部により出力される行列の行のうち、同じ列の成分を加算した場合に全ての列の加算結果が1になる行の組み合わせについては、各行に対応付けられた変数が真であれば、前記論理式が真となり、
前記ノード処理部により出力される行列の行のうち、同じ列の成分を加算した場合に少なくとも一列の加算結果が1にならない行の組み合わせについては、各行に対応付けられた変数が真であっても、前記論理式が偽となることを特徴とする請求項1から7のいずれかの行列生成装置。 - 前記ノード処理部は、前記木構造データのノードごとの処理を再帰呼び出しにより実行することを特徴とする請求項1から8のいずれかの行列生成装置。
- 前記論理式は、秘密分散方式で分散された情報の組み合わせを定義する論理式であることを特徴とする請求項1から9のいずれかの行列生成装置。
- コンピュータが、論理式の入力を受けて、前記論理式を表現する木構造データを生成し、
前記コンピュータが、前記論理式の要素のうち、前記木構造データのルートによって表現される要素の種類を判定し、判定した種類に応じた行列を生成し、
前記コンピュータが、生成した行列をメモリに格納するとともに、前記木構造データの前記ルート以外のノードを順次選択し、子ノードを持つノードを選択した場合は、前記論理式の要素のうち、選択したノードによって表現される要素の種類に応じた操作を、前記メモリに格納した行列に対して行い、子ノードを持たないノードを選択した場合は、前記論理式の要素のうち、選択したノードによって表現される要素である変数を、前記メモリに格納した行列の一行に対応付け、前記木構造データのノードを選択し終えた後は、前記メモリに格納した行列及びその行列の各行に対応付けた変数を示す情報を出力することを特徴とする行列生成方法。 - コンピュータに、
論理式の入力を受けて、前記論理式を表現する木構造データを生成する木構造生成処理と、
前記論理式の要素のうち、前記木構造生成処理により生成された木構造データのルートによって表現される要素の種類を判定し、判定した種類に応じた行列を生成するルート処理と、
前記ルート処理により生成された行列をメモリに格納するとともに、前記木構造生成処理により生成された木構造データの前記ルート以外のノードを順次選択し、子ノードを持つノードを選択した場合は、前記論理式の要素のうち、選択したノードによって表現される要素の種類に応じた操作を、前記メモリに格納した行列に対して行い、子ノードを持たないノードを選択した場合は、前記論理式の要素のうち、選択したノードによって表現される要素である変数を、前記メモリに格納した行列の一行に対応付け、当該木構造データのノードを選択し終えた後は、前記メモリに格納した行列及びその行列の各行に対応付けた変数を示す情報を出力するノード処理と
を実行させることを特徴とする行列生成プログラム。
Priority Applications (5)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201480080242.4A CN106471558B (zh) | 2014-07-02 | 2014-07-02 | 矩阵生成装置及矩阵生成方法 |
US15/320,239 US20170148357A1 (en) | 2014-07-02 | 2014-07-02 | Matrix generation apparatus, matrix generation method, and non-transitory computer-readable recording medium storing matrix generation program |
JP2016530740A JP6104469B2 (ja) | 2014-07-02 | 2014-07-02 | 行列生成装置及び行列生成方法及び行列生成プログラム |
EP14896317.6A EP3166094B1 (en) | 2014-07-02 | 2014-07-02 | Matrix generation device, matrix generation method, and matrix generation program |
PCT/JP2014/067609 WO2016002020A1 (ja) | 2014-07-02 | 2014-07-02 | 行列生成装置及び行列生成方法及び行列生成プログラム |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
PCT/JP2014/067609 WO2016002020A1 (ja) | 2014-07-02 | 2014-07-02 | 行列生成装置及び行列生成方法及び行列生成プログラム |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2016002020A1 true WO2016002020A1 (ja) | 2016-01-07 |
Family
ID=55018620
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/JP2014/067609 WO2016002020A1 (ja) | 2014-07-02 | 2014-07-02 | 行列生成装置及び行列生成方法及び行列生成プログラム |
Country Status (5)
Country | Link |
---|---|
US (1) | US20170148357A1 (ja) |
EP (1) | EP3166094B1 (ja) |
JP (1) | JP6104469B2 (ja) |
CN (1) | CN106471558B (ja) |
WO (1) | WO2016002020A1 (ja) |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN108520131A (zh) * | 2018-03-30 | 2018-09-11 | 河南理工大学 | 基于节点重合和关联矩阵的井下高压电网短路计算方法 |
Families Citing this family (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN109787755B (zh) * | 2018-12-14 | 2021-11-12 | 魏勇 | 一种密钥生成方法、密钥生成装置及电子设备 |
US20200264970A1 (en) * | 2019-02-19 | 2020-08-20 | Nvidia Corporation | Memory management system |
Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2012203182A (ja) * | 2011-03-25 | 2012-10-22 | Mitsubishi Electric Corp | 暗号処理システム、鍵生成装置、暗号化装置、復号装置、暗号処理方法及び暗号処理プログラム |
US8559631B1 (en) * | 2013-02-09 | 2013-10-15 | Zeutro Llc | Systems and methods for efficient decryption of attribute-based encryption |
JP2014095847A (ja) * | 2012-11-12 | 2014-05-22 | Nippon Telegr & Teleph Corp <Ntt> | 関数型暗号システム、鍵生成装置、暗号化装置、復号装置、関数型暗号方法、およびプログラム |
Family Cites Families (11)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US7415110B1 (en) * | 1999-03-24 | 2008-08-19 | Intel Corporation | Method and apparatus for the generation of cryptographic keys |
JP2001154771A (ja) * | 1999-12-01 | 2001-06-08 | Nec Corp | 論理式の図式化方法、及び情報処理装置 |
CN101394271A (zh) * | 2008-10-28 | 2009-03-25 | 上海电力学院 | 传感器网络中同时建立对密钥和组密钥的方法 |
KR101362443B1 (ko) * | 2009-08-03 | 2014-02-11 | 니뽄 덴신 덴와 가부시키가이샤 | 함수 암호 응용 시스템, 정보 출력 장치, 정보 처리 장치, 암호 프로토콜 실행 방법, 정보 출력 방법, 정보 처리 방법, 프로그램, 및 기록 매체 |
JP5424974B2 (ja) * | 2010-04-27 | 2014-02-26 | 三菱電機株式会社 | 暗号処理システム、鍵生成装置、暗号化装置、復号装置、署名処理システム、署名装置及び検証装置 |
CN102315935A (zh) * | 2010-07-02 | 2012-01-11 | 中国人民解放军总参谋部第六十一研究所 | 无线传感器网与计算机网融合网络密钥管理方法 |
JP5466763B2 (ja) * | 2010-07-23 | 2014-04-09 | 日本電信電話株式会社 | 暗号化装置、復号装置、暗号化方法、復号方法、プログラム、及び記録媒体 |
JP5379914B2 (ja) * | 2010-07-23 | 2013-12-25 | 日本電信電話株式会社 | 秘密分散システム、分散装置、分散管理装置、取得装置、秘密分散方法、プログラム、及び記録媒体 |
CN102164367B (zh) * | 2011-04-14 | 2014-04-16 | 北京理工大学 | 一种用于无线传感器网络的密钥管理方法 |
US8516244B2 (en) * | 2011-06-10 | 2013-08-20 | Zeutro Llc | System, apparatus and method for decentralizing attribute-based encryption information |
CN102665210B (zh) * | 2012-05-19 | 2014-10-08 | 佛山科学技术学院 | 分区的无线传感器网络的安全密钥设置方法 |
-
2014
- 2014-07-02 WO PCT/JP2014/067609 patent/WO2016002020A1/ja active Application Filing
- 2014-07-02 EP EP14896317.6A patent/EP3166094B1/en active Active
- 2014-07-02 US US15/320,239 patent/US20170148357A1/en not_active Abandoned
- 2014-07-02 CN CN201480080242.4A patent/CN106471558B/zh active Active
- 2014-07-02 JP JP2016530740A patent/JP6104469B2/ja active Active
Patent Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2012203182A (ja) * | 2011-03-25 | 2012-10-22 | Mitsubishi Electric Corp | 暗号処理システム、鍵生成装置、暗号化装置、復号装置、暗号処理方法及び暗号処理プログラム |
JP2014095847A (ja) * | 2012-11-12 | 2014-05-22 | Nippon Telegr & Teleph Corp <Ntt> | 関数型暗号システム、鍵生成装置、暗号化装置、復号装置、関数型暗号方法、およびプログラム |
US8559631B1 (en) * | 2013-02-09 | 2013-10-15 | Zeutro Llc | Systems and methods for efficient decryption of attribute-based encryption |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN108520131A (zh) * | 2018-03-30 | 2018-09-11 | 河南理工大学 | 基于节点重合和关联矩阵的井下高压电网短路计算方法 |
Also Published As
Publication number | Publication date |
---|---|
JPWO2016002020A1 (ja) | 2017-04-27 |
EP3166094B1 (en) | 2018-12-26 |
EP3166094A1 (en) | 2017-05-10 |
CN106471558B (zh) | 2018-03-20 |
CN106471558A (zh) | 2017-03-01 |
EP3166094A4 (en) | 2018-02-14 |
JP6104469B2 (ja) | 2017-03-29 |
US20170148357A1 (en) | 2017-05-25 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
Dougherty et al. | The combinatorics of LCD codes: linear programming bound and orthogonal matrices | |
WO2013114509A1 (ja) | 多次元データ可視化装置、方法およびプログラム | |
Kao et al. | A slacks-based measure model for calculating cross efficiency in data envelopment analysis | |
Eppstein | The lattice dimension of a graph | |
JP6104469B2 (ja) | 行列生成装置及び行列生成方法及び行列生成プログラム | |
JP2020087127A (ja) | グラフ構造を有するデータのエンコードに関するプログラム、情報処理方法及び情報処理システム | |
JP7031682B2 (ja) | 秘密計算装置、システム、方法、プログラム | |
CN106464484A (zh) | 预定函数的混淆执行 | |
Faure et al. | Implementation of irreducible Sobol’sequences in prime power bases | |
JP2006157252A5 (ja) | ||
Bamberg et al. | Unitals in the Desarguesian projective plane of order 16 | |
Leonard et al. | Bayesian D-optimal screening experiments with partial replication | |
JP2010039723A (ja) | 非負値行列分解の数値計算方法、非負値行列分解の数値計算装置、プログラムおよび記憶媒体 | |
CN113726975B (zh) | 基于混沌系统的图像加密方法、装置、介质及电子设备 | |
JP6321216B2 (ja) | 行列・キー生成装置、行列・キー生成システム、行列結合装置、行列・キー生成方法、プログラム | |
EP3912094A1 (en) | Training in communication systems | |
CN111133495B (zh) | 秘密读取装置、秘密写入装置、它们的方法以及记录介质 | |
Cerreia-Vioglio et al. | A characterization of probabilities with full support and the Laplace method | |
WO2021024300A1 (ja) | 情報処理装置 | |
JP2021135683A (ja) | 学習装置、推論装置、学習方法及び推論方法 | |
JP4313803B2 (ja) | 行列における数値分解方法 | |
JP2019008640A (ja) | 類似度計算装置及び類似度計算方法 | |
Nguyen et al. | Oracle model selection for correlated data via residuals | |
JP7494932B2 (ja) | 秘密決定木テスト装置、秘密決定木テストシステム、秘密決定木テスト方法、及びプログラム | |
WO2023119682A1 (ja) | データ解析方法、データ解析装置、及び、データ解析プログラム |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
121 | Ep: the epo has been informed by wipo that ep was designated in this application |
Ref document number: 14896317 Country of ref document: EP Kind code of ref document: A1 |
|
ENP | Entry into the national phase |
Ref document number: 2016530740 Country of ref document: JP Kind code of ref document: A |
|
WWE | Wipo information: entry into national phase |
Ref document number: 15320239 Country of ref document: US |
|
REEP | Request for entry into the european phase |
Ref document number: 2014896317 Country of ref document: EP |
|
WWE | Wipo information: entry into national phase |
Ref document number: 2014896317 Country of ref document: EP |
|
NENP | Non-entry into the national phase |
Ref country code: DE |