PRIVATE CONTACT DISCOVERY DE CRISTOFARO ARCHIVE

Multiparty computation with low communication, computation and interaction via threshold FHE Annual International Conference on the Theory and Applications of Cryptographic Techniques. Gilad Asharov, Abhishek Jain, Adriana LГіpez-Alt, Eran Tromer, Vinod Vaikuntanathan, and Daniel Wichs 2012.

PRIVATE CONTACT DISCOVERY DE CRISTOFARO ARCHIVE

IACR Cryptology ePrint Archive (2015/1192). Frederik Armknecht, Colin Boyd, Christopher Carr, Kristian GjГёsteen, Angela J'aschke, Christian A Reuter, and Martin Strand.Backyard cuckoo hashing: Constant worst-case operations with a succinct representation Foundations of Computer Science (FOCS), 2010 51st Annual IEEE Symposium on. Yuriy Arbitman, Moni Naor, and Gil Segev 2010.On the concrete hardness of Learning with Errors. Albrecht, Rachel Player, and Sam Scott 2015. On dual lattice attacks against small-secret LWE and parameter choices in HElib and SEAL Annual International Conference on the Theory and Applications of Cryptographic Techniques. Compared to prior works, this is roughly a 38-115x reduction in communication with minimal difference in computational overhead. 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.

Private contact discovery de cristofaro