VKEM Improvements#957
Open
Daeinar wants to merge 6 commits into
Open
Conversation
benr-ml
reviewed
May 19, 2026
| /// | ||
| /// Round 1: Sample a_i, b_i and send the round-1 commitments a1[i] = a_i * G + b_i * H (Pedersen) and | ||
| /// a2[i] = b_i * G (key recombination). | ||
| /// Round 2: Compute m batching scalars rho = challenge_rho(statement). |
Contributor
There was a problem hiding this comment.
currently we compute hash_to_group(hash(...)) per rho_j
can we just use hash_to_group(hash(...))^j? would be cheaper to compute
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
2 participants
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Introduces batch proving of the auditor decryption handles to make the consistency proof for the verifiable key encapsulation mechanism independent of the number of auditors and thus the proof constant-size.