| CPC H04L 9/3239 (2013.01) [G06F 16/2255 (2019.01); H04L 9/008 (2013.01)] | 17 Claims |

|
1. One or more non-transitory computer-readable media storing computer-executable instructions that, when executed by a processor, perform a method for providing an extended private set intersection nested cuckoo hashing scheme for secure computation of private set intersections, the method comprising:
exchanging, between a server and a client, a set of outer hash functions and a set of inner hash functions,
wherein the set of outer hash functions maps a set of client items and a set of server items to a set of client outer indices and server outer indices, respectively, and wherein the set of inner hash functions maps a set of client items and a set of server items to a set of client inner indices and server inner indices, respectively;
creating a server outer hash table using an outer hash function in the set of hash outer functions and the set of server items to create a set of server bins; and
for each server bin in the server outer hash table, iteratively placing server items to be inserted into a server inner cuckoo hash table using a plurality of inner hash functions corresponding to each server bin, based on determining that a first corresponding hash table position is free,
wherein each outer index in the set of client outer indices uniquely identifies a location within a client cuckoo hash table and wherein client outer index in the set of client outer indices uniquely identifies a cuckoo hash table within a server nested cuckoo hash table, the server nested cuckoo hash table comprising the server outer hash table and a set of server inner cuckoo hash tables.
|