Stuck on an issue?

Lightrun Answers was designed to reduce the constant googling that comes with debugging 3rd party libraries. It collects links to all the places you might be looking at while hunting down a tough bug.

And, if you’re still stuck at the end, we’re happy to hop on a call to see how we can help out.

Possible error in SchnorrProof.make_schnorr_proof(), or spec 2.A changed?

See original GitHub issue

In writing a validator for equation 2.A (“2. Guardian Public-Key Validation”)

   (A) The challenge c i,j is correctly computed as c = H(Q, K, h ) mod q, where Q is the crypto_base_hash.

This test is failing in my validator. But if I remove Q, it works.

c = H(K, h ) mod q.

Looking at line 80 of schnorr.py:

c = hash_elems(k, h)

possible error? Or spec had to be changed because crypto_base_hash not available?

Issue Analytics

State:
Created 3 years ago
Comments:11 (2 by maintainers)

Top GitHub Comments

1reaction

danwallachcommented, Jan 27, 2021

Probably happened because I typed it in wrong from the spec.

0reactions

AddressXceptioncommented, Feb 5, 2021

cross posting from #279

ok great, so for clarity, we’ll make the change in #279 to include the commitments as part of the calculation of the crypto_extended_base_hash. #278 will be closed as WONT_FIX and instead the specification will be adjusted so that schnorr proofs do not include the crypto_base_hash in their calculation and guardians are not explicitly coupled to an election (but an election is still explicitly coupled to a set of guardians.

Top Results From Across the Web

How to Prove Schnorr Assuming Schnorr: Security of Multi

In this work, we prove the security of four different schemes: (1) a three-round multisignature scheme SimpleMuSig with “proofs of possession” ( ...

Lecture 5: Proofs of Knowledge, Schnorr's protocol, NIZK

2 Schnorr's Protocol: Proof of Knowledge of Discrete Log Suppose that a prover wants to prove it knows the discrete logarithm x of...

RFC 8235: Schnorr Non-interactive Zero-Knowledge Proof

The Schnorr NIZK proof allows one to prove the knowledge of a discrete logarithm without leaking any information about its value.

Zero-Knowledge Proofs Notes - Jorge L. Villar, 2022 - UPC

An interactive zero knowledge proof is a two-party protocol run by a prover P ... The soundness error of 1/2 can be reduced...

Proofs, Arguments, and Zero-Knowledge

What is more, any argument can in principle be transformed into one that is zero-knowledge, which means that proofs reveal no information other ......