### Abstract

Original language | Undefined |
---|---|

Patent number | PHNL040611 US |

DOIs | |

Publication status | Submitted - May 2004 |

### Keywords

- SCS-Cybersecurity
- EWI-1761

### Cite this

*PHNL040611 US*). https://doi.org/04102375.5

}

*Method of and device for querying of protected structured data*, Patent No. PHNL040611 US. https://doi.org/04102375.5

**Method of and device for querying of protected structured data.** / Brinkman, Richard (Inventor); Doumen, J.M. (Inventor); Jonker, Willem (Inventor); Schoenmakers, B. (Inventor).

Research output: Patent

TY - PAT

T1 - Method of and device for querying of protected structured data

AU - Brinkman, Richard

AU - Doumen, J.M.

AU - Jonker, Willem

AU - Schoenmakers, B.

PY - 2004/5

Y1 - 2004/5

N2 - Method of and device for querying of protected data structured in the form of a tree. A corresponding tree of node polynomials is constructed such that each node polynomial evaluates to zero for an input equal to an identifier assigned to a node name occurring in a branch of the data tree starting with the node in question. A tree of blinding polynomials and a tree of difference polynomials are constructed such that each polynomial in the tree of node polynomials equals the sum of the corresponding polynomial in the tree of blinding polynomials and the corresponding polynomial in the tree of difference polynomials. The blinding tree is given to a client, the difference tree to a server. By combining the outcomes of the evaluations of the client and the server, it is possible to identify nodes that match a given query.

AB - Method of and device for querying of protected data structured in the form of a tree. A corresponding tree of node polynomials is constructed such that each node polynomial evaluates to zero for an input equal to an identifier assigned to a node name occurring in a branch of the data tree starting with the node in question. A tree of blinding polynomials and a tree of difference polynomials are constructed such that each polynomial in the tree of node polynomials equals the sum of the corresponding polynomial in the tree of blinding polynomials and the corresponding polynomial in the tree of difference polynomials. The blinding tree is given to a client, the difference tree to a server. By combining the outcomes of the evaluations of the client and the server, it is possible to identify nodes that match a given query.

KW - SCS-Cybersecurity

KW - EWI-1761

U2 - 04102375.5

DO - 04102375.5

M3 - Patent

M1 - PHNL040611 US

ER -