Secure integer comparison using binary trees
AssigneeSap SE
InventorsAnselme Tueno, Jonas Janneck
Life of this patent
Estimating the term…
Loading patent…
AssigneeSap SE
InventorsAnselme Tueno, Jonas Janneck
Estimating the term…
Systems, methods, and computer-readable media are disclosed for secure integer comparison using binary trees. A server may receive a first encrypted input and a public encryption key from a client. The server may create a binary tree representing a second encrypted input. The server may evaluate the first encrypted input on the binary tree. The evaluation may comprise computing decision bits along a plurality of paths of the binary tree. The decision bits may then be aggregated along each path of the binary tree and the aggregation stored at a leaf node of each path. The leaf node of each path may be evaluated to obtain a comparison result. The comparison result may be encrypted with the public encryption key. The server may send the comparison result to the client for decryption. The comparison result may indicate whether the first input was larger than the second input.
One or more non-transitory computer-readable media storing computer-executable instructions that, when executed by a processor, perform a method for secure integer comparison using binary decision trees, the method comprising:
A computer-implemented method for secure integer comparison using binary trees, the computer-implemented method comprising:
A system for secure integer comparison using binary decision trees, comprising:
Dependencies are inferred from the claim text.