TL;DR
A new PIR protocol called Atom achieves the best of both worlds, having not only low communication but also fast computation, compared to the state-of-the-art KsPIR (CCS’24).
A 2-party computation (2PC) protocol that also incorporates server inputs where the client has perfect privacy, assuming the server is semi-honest in the setup protocol and the server is malicious during the setup protocol is given.
Symmetric private information retrieval (SPIR) lets an inquirer obtain one specific bit only, without leaking any information about its index to the database owner. With a single server, this is impossible for parties with unrestricted quantum power. We show that it becomes possible, with information-theoretic security...
A system that answers "which database vectors are most similar to my query?" without the server ever seeing the query is built, and what this speed costs is measured: the hierarchy's access pattern leaks the database geometry, and it is shown that seeded padding cuts this leak by ~35x.
Fully homomorphic encryption allows arithmetic to be carried out on encrypted values, so that a party performing a computation need not see the data it operates on. This is useful wherever collaborating parties or sites cannot share data records or computed summaries yet need to do a joint analysis. We demonstrate the...
This work proposes a fault-tolerant PIR protocol based on a newly designed (t,p)-threshold distributed point function (FT-DPF), and proves that the stateless protocol guarantees (t−1)-computational privacy under the semi-honest model.
We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.
