cryptoProhard

ternarya

kalmarctf

Task: forge a ternary-membership proof for Pedersen commitments on P-256 while later opening every commitment to a non-ternary value. Solution: turn each verifier equation into a quadratic with chosen roots {0, 2^i} for m=3, then split the random challenge by its bit decomposition.

$ ls tags/ techniques/
zkpcryptoelliptic_curvepedersen_commitmentsoundness_bugchallenge_splittingpolynomial_root_forgery
challenge_splittingpolynomial_root_forgerybatched_transcript_forgerypedersen_commitment_manipulation
🔒

Permission denied (requires tier.pro)

Sign in to access full writeups

Sign in with GitHub to continue. No email required.

$sign in

$ grep --similar

Similar writeups