proof_of_possession.hpp

Go to the documentation of this file.

#pragma once
 
#include <utility>
 
#include "barretenberg/common/serialize.hpp"
#include "schnorr.hpp"
 
namespace bb::crypto {
 
template <typename G1, typename Hash> struct SchnorrProofOfPossession {
    using Fq = typename G1::Fq;
    using Fr = typename G1::Fr;
    using affine_element = typename G1::affine_element;
    using element = typename G1::element;
    using key_pair = crypto::schnorr_key_pair<Fr, G1>;
 
    // challenge = e = H_reg(pk,pk,R)
    std::array<uint8_t, 32> challenge;
    // response = z = k - e * sk
    Fr response = Fr::zero();
 
    // restore default constructor to enable deserialization
    SchnorrProofOfPossession() = default;
 
    SchnorrProofOfPossession(const key_pair& account)
    {
        auto secret_key = account.private_key;
        auto public_key = account.public_key;
 
        // Fr::random_element() will call std::random_device, which in turn relies on system calls to generate a string
        // of random bits. It is important to ensure that the execution environment will correctly supply system calls
        // that give std::random_device access to an entropy source that produces a string of non-deterministic
        // uniformly random bits. For example, when compiling into a wasm binary, it is essential that the random_get
        // method is overloaded to utilise a suitable entropy source
        // (see https://github.com/WebAssembly/WASI/blob/main/phases/snapshot/docs.md)
        // TODO: securely erase `k`
        Fr k = Fr::random_element();
 
        affine_element R = G1::one * k;
 
        auto challenge_bytes = generate_challenge(public_key, R);
        std::copy(challenge_bytes.begin(), challenge_bytes.end(), challenge.begin());
 
        Fr challenge_fr = Fr::serialize_from_buffer(&challenge_bytes[0]);
        response = k - challenge_fr * secret_key;
    }
 
    bool verify(const affine_element& public_key) const
    {
        Fr challenge_fr = Fr::serialize_from_buffer(&challenge[0]);
        // this ensures that a default constructed proof is invalid
        if (response.is_zero())
            return false;
 
        if (!public_key.on_curve() || public_key.is_point_at_infinity())
            return false;
 
        // R = e•pk + z•G
        affine_element R = element(public_key) * challenge_fr + G1::one * response;
        if (R.is_point_at_infinity())
            return false;
 
        // recompute the challenge e
        auto challenge_computed = generate_challenge(public_key, R);
        return std::equal(challenge.begin(), challenge.end(), challenge_computed.begin(), challenge_computed.end());
    }
 
  private:
    static auto generate_challenge(const affine_element& public_key, const affine_element& R)
    {
        // Domain separation challenges
        const std::string domain_separator_pop("h_reg");
 
        // buffer containing (domain_sep, G, X, X, R)
        std::vector<uint8_t> challenge_buf;
 
        // write domain separator
        std::copy(domain_separator_pop.begin(), domain_separator_pop.end(), std::back_inserter(challenge_buf));
 
        // write the group generator
        write(challenge_buf, G1::affine_one);
 
        // write X twice as per the spec
        write(challenge_buf, public_key);
        write(challenge_buf, public_key);
 
        // write R
        write(challenge_buf, R);
 
        // generate the raw bits of H_reg(X,X,R)
        return Hash::hash(challenge_buf);
    }
};
 
template <typename B, typename G1, typename Hash>
inline void read(B& it, SchnorrProofOfPossession<G1, Hash>& proof_of_possession)
{
    read(it, proof_of_possession.challenge);
    read(it, proof_of_possession.response);
}
 
template <typename B, typename G1, typename Hash>
inline void write(B& buf, SchnorrProofOfPossession<G1, Hash> const& proof_of_possession)
{
    write(buf, proof_of_possession.challenge);
    write(buf, proof_of_possession.response);
}
 
} // namespace bb::crypto