A simpler rate-optimal CPIR protocol
From MaRDI portal
Recommendations
Cites work
- A generalisation, a simplification and some applications of Paillier's probabilistic public-key system
- A length-flexible threshold cryptosystem with applications
- A new and efficient all-or-nothing disclosure of secrets protocol
- A simple public-key cryptosystem with a double trapdoor decryption mechanism and its applications
- Branching Programs and Binary Decision Diagrams
- Communication Complexity in Algebraic Two-Party Protocols
- Communication optimal Tardos-based asymmetric fingerprinting
- Computationally private information retrieval with polylogarithmic communication
- Evaluating Branching Programs on Encrypted Data
- Information Security
- Public-key cryptosystems based on composite degree residuosity classes
- Single-database private information retrieval with constant communication rate
- Strong conditional oblivious transfer and computing on intervals
Cited in
(6)- On the privacy of a code-based single-server computational PIR scheme
- Compressible FHE with applications to PIR
- A survey on single server private information retrieval in a coding theory perspective
- \textsf{TreePIR}: sublinear-time and polylog-bandwidth private information retrieval from DDH
- Near-optimal private information retrieval with preprocessing
- Single server private information retrieval protocols with codes over rings
This page was built for publication: A simpler rate-optimal CPIR protocol
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5854446)