Naive PIR

Send the whole database over the wire

Communication O(n)

Computation O(1)

1 GB database ⇒ send 1 GB / request

We can do better

State of the art

Uses homomorphic encryption

Yi et. al, Single-Database PIR from Fully Homomorphic Encryption

Communication O(log(n))

Computation O(nlog(n))

10 mln records, 1 GB database ⇒

send 1.5 MB / request

Blindstore

Wannabe implementation of

the state-of-the-art PIR

• Currently implementation of less effective PIR from FHE, but
• Works

Roadmap

Now

• Implementation of the state-of-the-art
• Implementation of the Hash table
• Detailed documentation

Later

• Compression
• Libraries for different languages
• Parallelization

Applications

DNS Server

No one will know what domain did you request

Signaling

No one will know whom did you want to call

peer-to-peer