[messaging] Encrypted Pulic Contact Discovery

[Daniel Reichert]

Private Set Intersection has come a long ways since 2009.  Just this year a
paper[1] was published where private contact discovery is a primary use
case.  Detailed benchmarks for varying sizes of the client and server set
sizes are included.  Sadly it's still not practical since the only way to
prevent a brute force search requires making the protocol O(n1*n2) where n1
is the client set size and n2 is the server set size.

Daniel Reichert

[1] http://eprint.iacr.org/2015/634.pdf

On Wed, Aug 19, 2015 at 10:01 AM, Tony Arcieri <bascule at gmail.com> wrote:

> It seems like a private set intersection would be useful here:
>
> https://eprint.iacr.org/2009/491.pdf
>
> --
> Tony Arcieri
>
> _______________________________________________
> Messaging mailing list
> Messaging at moderncrypto.org
> https://moderncrypto.org/mailman/listinfo/messaging
>
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://moderncrypto.org/mail-archive/messaging/attachments/20150819/790e4446/attachment.html>