3/4/2023 0 Comments Private contact discovery![]() ![]() Our running-time-optimized benchmarks show that it takes 36 seconds of online-computation, 71 seconds of non-interactive (receiver-independent) pre-processing, and only 12.5MB of round trip communication to intersect five thousand 32-bit strings with 16 million 32-bit strings. More precisely, if the set sizes are N y < N x, we achieve a communication overhead of O( N y log N x). Our protocol has communication complexity linear in the size of the smaller set, and logarithmic in the larger set. WhatsApp), such as in the Private Contact Discovery application. This is of particular concern when performing PSI between a constrained device (cellphone) holding a small set, and a large service provider (e.g. The most computationally efficient PSI protocols have been constructed using tools such as hash functions and oblivious transfer, but a potential limitation with these approaches is the communication complexity, which scales linearly with the size of the larger set. We use fully homomorphic encryption to construct a fast PSI protocol with a small communication overhead that works particularly well when one of the two sets is much smaller than the other, and is secure against semi-honest adversaries. Private Set Intersection (PSI) is a cryptographic technique that allows two parties to compute the intersection of their sets without revealing anything except the intersection. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |