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

Add Lova to lattices #24

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
2 changes: 2 additions & 0 deletions README.md
Original file line number Diff line number Diff line change
Expand Up @@ -148,6 +148,8 @@ Extensions to the Nova proof system that explore PCS in terms of linear codes, f
We develop a new "uniformizing" compiler for NP statements that converts any poly-time computation to a sequence of identical simple steps
- [Accumulation without Homomorphism](https://eprint.iacr.org/2024/474)
We construct an accumulation scheme from *non-homomorphic* vector commitments which can be realized from solely symmetric-key assumptions (e.g. Merkle trees).
- [Lova: Lattice-Based Folding Scheme from Unstructured Lattices](https://eprint.iacr.org/2024/1964)
Lova is an adaptation of Nova to lattices. It is a post-quantum folding scheme that follows decompose-and-fold approach. A new exact Euclidean norm proof is proposed.

## Code (software repositories)

Expand Down