Skip to content

Name PEAR's venue and add a benchmark figure to the README #5

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We鈥檒l occasionally send you account related emails.

Already on GitHub? Sign in to your account

Closed
WeiqiNs wants to merge 1 commit into from
Closed

Name PEAR's venue and add a benchmark figure to the README #5

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
9 changes: 5 additions & 4 deletions README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -7,10 +7,11 @@ RustFLPCP lets a client prove its input is valid, such as a one-hot vote or a ve
bounded norm, to a verifier that only computes linear functions of the input and the proof. The
check therefore works on data the verifier cannot read: inner-product functional encryption
(IPFE) ciphertexts or secret shares. It implements Theorem 4.3 of
[Boneh et al.](https://eprint.iacr.org/2019/188) as a generic engine for
[PEAR](https://eprint.iacr.org/2025/420): write a validity circuit once and get a prover,
explicit linear queries, and a decision procedure over any [arkworks](https://arkworks.rs)
FFT field.
[Boneh et al.](https://eprint.iacr.org/2019/188) as a generic engine and is the proof layer of
[PEAR](https://eprint.iacr.org/2025/420) (PETS 2025): write a validity circuit once and get a
prover, explicit linear queries, and a decision procedure over any
[arkworks](https://arkworks.rs) FFT field. Proving a 1,024-entry one-hot vector takes about
1.5 ms and verifying it about 0.12 ms on one CPU core (`cargo bench --bench flp`).

```rust
use ark_bls12_381::Fr;
Expand Down
Loading