A fork of SealPIR (v2.1) with patches for PIROS microbenchmarking

hao chen 0ab6ff3333 problem fixed! 5 年 前
.gitignore fbd6c9bd26 Initial commit 6 年 前
CMakeLists.txt 7cdd24807e applied Kim's patch for 3.1 5 年 前
LICENSE 76e1a93d3c Initial commit 6 年 前
README.md 603ab7e074 Fix typo in README.md 6 年 前
main.cpp 0ab6ff3333 problem fixed! 5 年 前
pir.cpp 0ab6ff3333 problem fixed! 5 年 前
pir.hpp 0ab6ff3333 problem fixed! 5 年 前
pir_client.cpp 0ab6ff3333 problem fixed! 5 年 前
pir_client.hpp 0ab6ff3333 problem fixed! 5 年 前
pir_server.cpp 0ab6ff3333 problem fixed! 5 年 前
pir_server.hpp 0ab6ff3333 problem fixed! 5 年 前

README.md

SealPIR: A computational PIR library that achieves low communication costs and high performance.

SealPIR is a (research) library and should not be used in production systems. SealPIR allows a client to download an element from a database stored by a server without revealing which element was downloaded. SealPIR was introduced in our paper.

Compiling SEAL

SealPIR depends on SEAL 2.3.1 (link). Download SEAL, and follow the instructions in INSTALL.txt to install it system-wide.

Compiling SealPIR

Once SEAL 2.3.1 is installed, to build SealPIR simply run:

cmake .
make

This should produce a binary file bin/sealpir.

Using SealPIR

Take a look at the example in main.cpp for how to use SealPIR.

Contributing

This project welcomes contributions and suggestions. Most contributions require you to agree to a Contributor License Agreement (CLA) declaring that you have the right to, and actually do, grant us the rights to use your contribution. For details, visit https://cla.microsoft.com.

When you submit a pull request, a CLA-bot will automatically determine whether you need to provide a CLA and decorate the PR appropriately (e.g., label, comment). Simply follow the instructions provided by the bot. You will only need to do this once across all repos using our CLA.

This project has adopted the Microsoft Open Source Code of Conduct. For more information see the Code of Conduct FAQ or contact opencode@microsoft.com with any additional questions or comments.