Struct sigma_fun::Eq

pub struct Eq<A, B> { /* private fields */ }

Combinator for showing that two Sigma protocols have the same witness.

Note: right now checking whether A and B support secure eq composition is done heurisitically. In the future there will be an explicit trait for this.

Implementations

impl<A, B> Eq<A, B>

pub fn new(lhs: A, rhs: B) -> Self

Create a Eq<A,B> protocol from two other Sigma protocols.

Trait Implementations

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

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

Returns a copy of the value.

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

Performs copy-assignment from source.

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

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

Formats the value using the given formatter.

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

fn default() -> Eq<A, B>

Returns the “default value” for a type.

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

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

Formats the value using the given formatter.

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

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

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

fn ne(&self, other: &Rhs) -> bool

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<A, B> Sigma for Eq<A, B>where
    A: Sigma,
    B: Sigma<ChallengeLength = A::ChallengeLength, Witness = A::Witness, Response = A::Response, AnnounceSecret = A::AnnounceSecret>,

type Witness = <A as Sigma>::Witness

The witness for the relation.

type Statement = (<A as Sigma>::Statement, <B as Sigma>::Statement)

The elements of the statement the prover is proving.

type AnnounceSecret = <A as Sigma>::AnnounceSecret

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

type Announcement = (<A as Sigma>::Announcement, <B as Sigma>::Announcement)

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

type Response = <A as Sigma>::Response

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

type ChallengeLength = <A as Sigma>::ChallengeLength

The length as a typenum

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.

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

Generates the prover’s announcement message.

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

Generates the secret data to create the announcement

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

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

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.

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

Hashes the statement.

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

Hashes the announcement.

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

Hashes the witness.

impl<A: Writable, B: Writable> Writable for Eq<A, B>

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

Asks the thing to write itself to W.

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