Struct sigma_fun::And

pub struct And<A, B> {
    pub lhs: A,
    pub rhs: B,
}

Combinator for proving that both A and B are true where A and B are not the same relation.

If A = B it's generally preferable to use all instead.

Fields

lhs: A

The first statement

rhs: B

The second statement

Trait Implementations

impl<A: Clone, B: Clone> Clone for And<A, B>

pub fn clone(&self) -> And<A, B>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<A: Debug, B: Debug> Debug for And<A, B>

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

Formats the value using the given formatter.

impl<A: Default, B: Default> Default for And<A, B>

pub fn default() -> And<A, B>

Returns the "default value" for a type.

impl<A, B> Display for And<A, B> where
    And<A, B>: Sigma, 

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

Formats the value using the given formatter.

impl<A: PartialEq, B: PartialEq> PartialEq<And<A, B>> for And<A, B>

pub fn eq(&self, other: &And<A, B>) -> bool

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

pub fn ne(&self, other: &And<A, B>) -> bool

This method tests for !=.

impl<A, B> Sigma for And<A, B> where
    A: Sigma,
    B: Sigma<ChallengeLength = A::ChallengeLength>, 

type Witness = (A::Witness, B::Witness)

The witness for the relation.

type Statement = (A::Statement, B::Statement)

The elements of the statement the prover is proving.

type Announcement = (A::Announcement, B::Announcement)

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

type AnnounceSecret = (A::AnnounceSecret, B::AnnounceSecret)

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

type Response = (A::Response, B::Response)

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

type ChallengeLength = A::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 announce(
    &self,
    statement: &Self::Statement,
    announce_secret: &Self::AnnounceSecret
) -> Self::Announcement

Generates the prover's announcement message.

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 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,
    statement: &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,
    statement: &Self::Statement
)

Hashes the statement.

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

Hashes the announcement.

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

Hashes the witness.

impl<A, B> StructuralPartialEq for And<A, B>