Method of and device for querying of protected structured data

Willem Jonker (Inventor), Richard Brinkman (Inventor), J.M. Doumen (Inventor), Berry Schoenmakers (Inventor)

Research output: Patent

11 Downloads (Pure)

Abstract

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.
Original languageUndefined
Patent numberWO2005116792
Priority date1/01/04
Publication statusAccepted/In press - 8 Dec 2005

Keywords

  • SCS-Cybersecurity
  • IR-62833
  • EWI-15430
  • METIS-233415

Cite this

Jonker, W., Brinkman, R., Doumen, J. M., & Schoenmakers, B. (Accepted/In press). Method of and device for querying of protected structured data. (Patent No. WO2005116792).
Jonker, Willem (Inventor) ; Brinkman, Richard (Inventor) ; Doumen, J.M. (Inventor) ; Schoenmakers, Berry (Inventor). / Method of and device for querying of protected structured data. Patent No.: WO2005116792.
@misc{f85eddf766b9480ab5e71b67d4745bb7,
title = "Method of and device for querying of protected structured data",
abstract = "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.",
keywords = "SCS-Cybersecurity, IR-62833, EWI-15430, METIS-233415",
author = "Willem Jonker and Richard Brinkman and J.M. Doumen and Berry Schoenmakers",
year = "2005",
month = "12",
day = "8",
language = "Undefined",
type = "Patent",
note = "WO2005116792",

}

Jonker, W, Brinkman, R, Doumen, JM & Schoenmakers, B 2005, Method of and device for querying of protected structured data, Patent No. WO2005116792.

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

Patent No.: WO2005116792.

Research output: Patent

TY - PAT

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

AU - Jonker, Willem

AU - Brinkman, Richard

AU - Doumen, J.M.

AU - Schoenmakers, Berry

PY - 2005/12/8

Y1 - 2005/12/8

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 - IR-62833

KW - EWI-15430

KW - METIS-233415

M3 - Patent

M1 - WO2005116792

ER -

Jonker W, Brinkman R, Doumen JM, Schoenmakers B, inventors. Method of and device for querying of protected structured data. WO2005116792. 2005 Dec 8.