Struct sigma_fun::EqAll

pub struct EqAll<N, S> { /* fields omitted */ }

Combinator for proving any number of statements of the same kind have the same witness.

Implementations

impl<S, N> EqAll<N, S>

pub fn new(sigma: S) -> Self

Create a EqAll<N,S> from a Sigma protocol S.

Trait Implementations

impl<N: Clone, S: Clone> Clone for EqAll<N, S>

pub fn clone(&self) -> EqAll<N, S>

Returns a copy of the value.

pub fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<N: Debug, S: Debug> Debug for EqAll<N, S>

pub fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<N: Default, S: Default> Default for EqAll<N, S>

pub fn default() -> EqAll<N, S>

Returns the "default value" for a type.

impl<N, S> Display for EqAll<N, S> where
    EqAll<N, S>: Sigma, 

pub fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<N: PartialEq, S: PartialEq> PartialEq<EqAll<N, S>> for EqAll<N, S>

pub fn eq(&self, other: &EqAll<N, S>) -> bool

This method tests for self and other values to be equal, and is used by ==.

pub fn ne(&self, other: &EqAll<N, S>) -> bool

This method tests for !=.

impl<N: Unsigned, S: Sigma> Sigma for EqAll<N, S>

type Witness = S::Witness

The witness for the relation.

type Statement = Vec<S::Statement>

The elements of the statement the prover is proving.

type AnnounceSecret = S::AnnounceSecret

The type for the secret the prover creates when generating the proof.

type Announcement = Vec<S::Announcement>

The type for the public announcement the prover sends in the first round of the protocol.

type Response = S::Response

The type for the response the prover sends in the last round of the protocol.

type ChallengeLength = S::ChallengeLength

The length as a typenum

pub fn respond(
    &self,
    witness: &Self::Witness,
    statement: &Self::Statement,
    announce_secret: Self::AnnounceSecret,
    announce: &Self::Announcement,
    challenge: &GenericArray<u8, Self::ChallengeLength>
) -> Self::Response

Generates the prover's response for the verifier's challenge.

pub fn gen_announce_secret<Rng: CryptoRng + RngCore>(
    &self,
    witness: &Self::Witness,
    rng: &mut Rng
) -> Self::AnnounceSecret

Generates the secret data to create the announcement

pub fn announce(
    &self,
    statement: &Self::Statement,
    announce_secret: &Self::AnnounceSecret
) -> Self::Announcement

Generates the prover's announcement message.

pub fn sample_response<Rng: CryptoRng + RngCore>(
    &self,
    rng: &mut Rng
) -> Self::Response

Uniformly samples a response from the response space of the Sigma protocol.

pub fn implied_announcement(
    &self,
    statements: &Self::Statement,
    challenge: &GenericArray<u8, Self::ChallengeLength>,
    response: &Self::Response
) -> Option<Self::Announcement>

Computes what the announcement must be for the response to be valid.

pub fn write_name<W: Write>(&self, w: &mut W) -> Result

Writes the sigma protocol's name.

pub fn hash_statement<H: Update>(
    &self,
    hash: &mut H,
    statements: &Self::Statement
)

Hashes the statement.

pub fn hash_announcement<H: Update>(
    &self,
    hash: &mut H,
    announcements: &Self::Announcement
)

Hashes the announcement.

pub fn hash_witness<H: Update>(&self, hash: &mut H, witness: &Self::Witness)

Hashes the witness.

impl<N, S> StructuralPartialEq for EqAll<N, S>