Parametric searching under fully homomorphic encryption
US12386825B1 · kind B1 · utility
Assignee
Inventors
Key dates
| Filing date | Oct 7, 2024 |
| Grant date | Aug 12, 2025 |
| Priority date | — |
| Expiry date | Oct 7, 2044 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH04L9/008
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
A computer-implemented method for identifying a leaf in a tree is provided. A processor set receives a first point representing one or more values within a d-dimensional space for identifying the leaf in the tree. The processor set generates a parameter for identifying the leaf in the tree. The processor set identifies a node at highest depth of the tree. The processor set determines a first value of the parameter for generating a range. The processor set selects a subset of child nodes from the number of child nodes associated with the node at the highest depth of the tree based on the range. The processor sets the subset of child nodes as the node at the highest depth of the tree. The processor set traverses the tree by repeating the identifying step, the determining step, the selecting step, and setting steps until the leaf in the tree is identified.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.