Skip to content
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.

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

Already on GitHub? Sign in to your account

Fix a few typos #1

Open
wants to merge 1 commit into
base: main
Choose a base branch
from
Open
Changes from all commits
Commits
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
6 changes: 3 additions & 3 deletions high-assurance-zk/lpzk/README.md
Original file line number Diff line number Diff line change
Expand Up @@ -8,11 +8,11 @@ In this work, we develop an end-to-end machine-checked implementation of LPZK, t
* Optimization based on the execution model: where we explore the usage of parallelism to speed up the computation
* Optimization based on memory management: where we replace and augment the data structures used to store input and randomness values in order to reduce access overhead

Our development was derived from a machine-checked security proof of LPZK that was developed in EasyCrypt, an interactive proof-assistant tailored for cryptographic proofs. All the afore mentioned optimization have also been formalized in EasyCrypt, before code was generated from the proof.
Our development was derived from a machine-checked security proof of LPZK that was developed in EasyCrypt, an interactive proof-assistant tailored for cryptographic proofs. All the aforementioned optimization have also been formalized in EasyCrypt, before the code was generated from the proof.

## Disclaimer

The reviewer may notice that some modifications to the folder were done January 23, therefore after then January 19 submission deadline. These modifications were done **ONLY** at the implementation level, not at the proof level. Concretely, the implementation version submitted January 19 was the test version, that **did not** use correlated randomness and, therefore, produced incorrect results. This version is faster to just benchmark the performance of the implementation without considering it's correctness.
The reviewer may notice that some modifications to the folder were done January 23, therefore, after the January 19 submission deadline. These modifications were done **ONLY** at the implementation level, not at the proof level. Concretely, the implementation version submitted January 19 was the test version, that **did not** use correlated randomness and, therefore, produced incorrect results. This version is faster to just benchmark the performance of the implementation without considering it's correctness.

We have resubmitted the correct version, that creates correlated version before executing the protocol, thus producing the correct result.

Expand Down Expand Up @@ -45,4 +45,4 @@ The `Makefile` at the top level directory makes available the following targets:
- `test-list <prime=P> <size=N> <cores=K>` - runs list-based LPZK implementation matrix multiplication of size N, over field P and using K cores;
- `test-array <prime=P> <size=N> <cores=K>` - runs array-based LPZK implementation matrix multiplication of size N, over field P and using K cores;

Notice that running these targets depends on the availability of the required dependencies. Typing just `make` shows a brief help with information on some additional targets. In addition, each component has specific `Makefile`s that may give access to some additional targets.
Notice that running these targets depends on the availability of the required dependencies. Typing just `make` shows a brief help with information on some additional targets. In addition, each component has specific `Makefile`s that may give access to some additional targets.