Puncturable Pseudorandom Set-Based Private Information Retrieval #178
Conversation
Implemented the dual-server model from the paper Private Information Retrieval with Sublinear Online Time (https://eprint.iacr.org/2019/1075.pdf), supporting both single-bit and multi-bit query mechanisms. The implementation uses AES-CTR encryption as a Pseudorandom Generator (PRG) and constructs a Puncturable Pseudorandom Set using GGM-PRF.
|
All contributors have signed the CLA ✍️ ✅ |
|
I have read the CLA Document and I hereby sign the CLA |
|
|
Moved files to experiment, added a README.md file. Updated default values in PpsPirClient class.
|
This project only implements the dual-server model described in the paper. The implementation of Puncturable Pseudorandom Sets is based on Chapter 2 of the paper, "Construction 4 (Puncturable pseudorandom set from puncturable PRF)." The implementation of the Single-Bits PIR protocol follows "Construction 16 (Two-server PIR with sublinear online time)" from Chapter 3 of the original paper. The implementation of the Multi-Bits PIR protocol is based on Chapter 4 and Appendix D's "Construction 44 (Multi-query offline/online PIR)." |
… issues and resolved logic.
|
Stale pull request message. Please comment to remove stale tag. Otherwise this pr will be closed soon. |
… issues and resolved logic.
|
LGTM |
|
LGTM |
Feynman-young
dismissed stale reviews from huocun-ant and qxzhou1010
via
974013e
Implemented the dual-server model from the paper Private Information Retrieval with Sublinear Online Time (https://eprint.iacr.org/2019/1075.pdf), supporting both single-bit and multi-bit query mechanisms. The implementation uses AES-CTR encryption as a Pseudorandom Generator (PRG) and constructs a Puncturable Pseudorandom Set using GGM-PRF.