EEMCS

This is the latest version of this eprint.

Full text available as:

PDF - Univ. of Twente only - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader 76 Kb

Official URL: http://v3.espacenet.com/textdoc?IDX=WO2005116792

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.

Available Versions of this Item

• Method of and device for querying of protected structured data (deposited 02 May 2006)
  • Method of and device for querying of protected structured data (deposited 16 June 2009)
    [Currently Displayed]

Export this item as:

• BibTeX
• XML

To request a copy of the PDF please email us request copy

To correct this item please ask your editor

Repository Staff Only: edit this item