Secure graph processing with normalized adjacency lists
AssigneeBenjamin Leo Ostrovsky
InventorBenjamin Leo Ostrovsky
Life of this patent
Estimating the term…
Loading patent…
AssigneeBenjamin Leo Ostrovsky
InventorBenjamin Leo Ostrovsky
Estimating the term…
The present disclosure provides a method for processing a secret-shared adjacency list of a graph. The method includes partitioning the secret-shared adjacency list into blocks, adding a vertex identifier to each tuple in the secret-shared adjacency list, defining a boolean variable for each block, computing a secret-shared vector of row identifiers for each tuple, shuffling tuples and additional tuples, extracting components from the shuffled tuples to form a d-normalized replicated adjacency list, and storing the d-normalized replicated adjacency list in a non-volatile storage device. The method utilizes parallel processing capabilities and a hardware-based random number generator for shuffling. The method also includes securely transmitting and receiving encrypted data related to adjacency lists through a network interface.
A method for converting a secret-shared adjacency list of a graph into a d-normalized replicated adjacency list, the method comprising:
A method for renaming vertices and attributing edges in a secret-shared adjacency list of a graph, the method comprising:
A system for converting a secret-shared adjacency list of a graph into a d-normalized replicated adjacency list, the system comprising:
A non-transitory computer-readable medium storing instructions that, when executed by a processor in a computerized system comprising multiple processors, a memory subsystem including cache memory and main memory, a non-volatile storage device, and a network interface connected via a system bus, cause the computerized system to perform a method for renaming vertices and attributing edges in a secret-shared adjacency list of a graph, the method comprising:
Dependencies are inferred from the claim text.