pub struct SchnorrProof<G: Group + GroupEncoding>(pub LinearRelation<G>);
Expand description
A Schnorr protocol proving knowledge of a witness for a linear group relation.
This implementation generalizes Schnorr’s discrete logarithm proof by using
a LinearRelation
, representing an abstract linear relation over the group.
§Type Parameters
G
: A cryptographic group implementingGroup
andGroupEncoding
.
Tuple Fields§
§0: LinearRelation<G>
Implementations§
Source§impl<G: Group + GroupEncoding> SchnorrProof<G>
impl<G: Group + GroupEncoding> SchnorrProof<G>
pub fn witness_length(&self) -> usize
pub fn commitment_length(&self) -> usize
Trait Implementations§
Source§impl<G: Clone + Group + GroupEncoding> Clone for SchnorrProof<G>
impl<G: Clone + Group + GroupEncoding> Clone for SchnorrProof<G>
Source§fn clone(&self) -> SchnorrProof<G>
fn clone(&self) -> SchnorrProof<G>
1.0.0 · Source§const fn clone_from(&mut self, source: &Self)
const fn clone_from(&mut self, source: &Self)
source
. Read moreSource§impl<G: Debug + Group + GroupEncoding> Debug for SchnorrProof<G>
impl<G: Debug + Group + GroupEncoding> Debug for SchnorrProof<G>
Source§impl<G: Default + Group + GroupEncoding> Default for SchnorrProof<G>
impl<G: Default + Group + GroupEncoding> Default for SchnorrProof<G>
Source§fn default() -> SchnorrProof<G>
fn default() -> SchnorrProof<G>
Source§impl<G> From<LinearRelation<G>> for SchnorrProof<G>where
G: Group + GroupEncoding,
impl<G> From<LinearRelation<G>> for SchnorrProof<G>where
G: Group + GroupEncoding,
Source§fn from(value: LinearRelation<G>) -> Self
fn from(value: LinearRelation<G>) -> Self
Source§impl<G> From<SchnorrProof<G>> for Protocol<G>where
G: Group + GroupEncoding,
impl<G> From<SchnorrProof<G>> for Protocol<G>where
G: Group + GroupEncoding,
Source§fn from(value: SchnorrProof<G>) -> Self
fn from(value: SchnorrProof<G>) -> Self
Source§impl<G> SigmaProtocol for SchnorrProof<G>where
G: Group + GroupEncoding,
impl<G> SigmaProtocol for SchnorrProof<G>where
G: Group + GroupEncoding,
Source§fn prover_commit(
&self,
witness: &Self::Witness,
rng: &mut (impl RngCore + CryptoRng),
) -> Result<(Self::Commitment, Self::ProverState), Error>
fn prover_commit( &self, witness: &Self::Witness, rng: &mut (impl RngCore + CryptoRng), ) -> Result<(Self::Commitment, Self::ProverState), Error>
Prover’s first message: generates a commitment using random nonces.
§Parameters
witness
: A vector of scalars that satisfy the linear map relation.rng
: A cryptographically secure random number generator.
§Returns
- A tuple containing:
- The commitment (a vector of group elements).
- The prover state (random nonces and witness) used to compute the response.
§Errors
-Error::InvalidInstanceWitnessPair
if the witness vector length is incorrect.
Source§fn prover_response(
&self,
prover_state: Self::ProverState,
challenge: &Self::Challenge,
) -> Result<Self::Response, Error>
fn prover_response( &self, prover_state: Self::ProverState, challenge: &Self::Challenge, ) -> Result<Self::Response, Error>
Computes the prover’s response (second message) using the challenge.
§Parameters
state
: The prover state returned byprover_commit
, typically containing randomness and witness components.challenge
: The verifier’s challenge scalar.
§Returns
- A vector of scalars forming the prover’s response.
§Errors
- Returns
Error::InvalidInstanceWitnessPair
if the prover state vectors have incorrect lengths.
Source§fn verifier(
&self,
commitment: &Self::Commitment,
challenge: &Self::Challenge,
response: &Self::Response,
) -> Result<(), Error>
fn verifier( &self, commitment: &Self::Commitment, challenge: &Self::Challenge, response: &Self::Response, ) -> Result<(), Error>
Verifies the correctness of the proof.
§Parameters
commitment
: The prover’s commitment vector (group elements).challenge
: The challenge scalar.response
: The prover’s response vector.
§Returns
Ok(())
if the proof is valid.Err(Error::VerificationFailure)
if the proof is invalid.Err(Error::InvalidInstanceWitnessPair)
if the lengths of commitment or response do not match the expected counts.
§Errors
-Error::VerificationFailure
if the computed relation
does not hold for the provided challenge and response, indicating proof invalidity.
-Error::InvalidInstanceWitnessPair
if the commitment or response length is incorrect.
Source§fn serialize_commitment(&self, commitment: &Self::Commitment) -> Vec<u8> ⓘ
fn serialize_commitment(&self, commitment: &Self::Commitment) -> Vec<u8> ⓘ
Serializes the prover’s commitment into a byte vector.
This function encodes the vector of group elements (the commitment) into a binary format suitable for transmission or storage. This is typically the first message sent in a Sigma protocol round.
§Parameters
commitment
: A vector of group elements representing the prover’s commitment.
§Returns
A Vec<u8>
containing the serialized group elements.
Source§fn serialize_challenge(&self, challenge: &Self::Challenge) -> Vec<u8> ⓘ
fn serialize_challenge(&self, challenge: &Self::Challenge) -> Vec<u8> ⓘ
Serializes the verifier’s challenge scalar into bytes.
Converts the challenge scalar into a fixed-length byte encoding. This can be used for Fiat–Shamir hashing, transcript recording, or proof transmission.
§Parameters
challenge
: The scalar challenge value.
§Returns
A Vec<u8>
containing the serialized scalar.
Source§fn serialize_response(&self, response: &Self::Response) -> Vec<u8> ⓘ
fn serialize_response(&self, response: &Self::Response) -> Vec<u8> ⓘ
Serializes the prover’s response vector into a byte format.
The response is a vector of scalars computed by the prover after receiving the verifier’s challenge. This function encodes the vector into a format suitable for transmission or inclusion in a batchable proof.
§Parameters
response
: A vector of scalar responses computed by the prover.
§Returns
A Vec<u8>
containing the serialized scalars.
Source§fn deserialize_commitment(&self, data: &[u8]) -> Result<Self::Commitment, Error>
fn deserialize_commitment(&self, data: &[u8]) -> Result<Self::Commitment, Error>
Deserializes a byte slice into a vector of group elements (commitment).
This function reconstructs the prover’s commitment from its binary representation. The number of elements expected is determined by the number of linear constraints in the underlying linear relation.
§Parameters
data
: A byte slice containing the serialized commitment.
§Returns
A Vec<G>
containing the deserialized group elements.
§Errors
- Returns
Error::VerificationFailure
if the data is malformed or contains an invalid encoding.
Source§fn deserialize_challenge(&self, data: &[u8]) -> Result<Self::Challenge, Error>
fn deserialize_challenge(&self, data: &[u8]) -> Result<Self::Challenge, Error>
Deserializes a byte slice into a challenge scalar.
This function expects a single scalar to be encoded and returns it as the verifier’s challenge.
§Parameters
data
: A byte slice containing the serialized scalar challenge.
§Returns
The deserialized scalar challenge value.
§Errors
- Returns
Error::VerificationFailure
if deserialization fails or data is invalid.
Source§fn deserialize_response(&self, data: &[u8]) -> Result<Self::Response, Error>
fn deserialize_response(&self, data: &[u8]) -> Result<Self::Response, Error>
Deserializes a byte slice into the prover’s response vector.
The response vector contains scalars used in the second round of the Sigma protocol. The expected number of scalars matches the number of witness variables.
§Parameters
data
: A byte slice containing the serialized response.
§Returns
A vector of deserialized scalars.
§Errors
- Returns
Error::VerificationFailure
if the byte data is malformed or the length is incorrect.
type Commitment = Vec<G>
type ProverState = (Vec<<G as Group>::Scalar>, Vec<<G as Group>::Scalar>)
type Response = Vec<<G as Group>::Scalar>
type Witness = Vec<<G as Group>::Scalar>
type Challenge = <G as Group>::Scalar
fn instance_label(&self) -> impl AsRef<[u8]>
fn protocol_identifier(&self) -> impl AsRef<[u8]>
Source§impl<G> SigmaProtocolSimulator for SchnorrProof<G>where
G: Group + GroupEncoding,
impl<G> SigmaProtocolSimulator for SchnorrProof<G>where
G: Group + GroupEncoding,
Source§fn simulate_transcript<R: Rng + CryptoRng>(
&self,
rng: &mut R,
) -> Result<(Self::Commitment, Self::Challenge, Self::Response), Error>
fn simulate_transcript<R: Rng + CryptoRng>( &self, rng: &mut R, ) -> Result<(Self::Commitment, Self::Challenge, Self::Response), Error>
Source§fn simulate_commitment(
&self,
challenge: &Self::Challenge,
response: &Self::Response,
) -> Result<Self::Commitment, Error>
fn simulate_commitment( &self, challenge: &Self::Challenge, response: &Self::Response, ) -> Result<Self::Commitment, Error>
Recomputes the commitment from the challenge and response (used in compact proofs).
§Parameters
challenge
: The challenge scalar issued by the verifier or derived via Fiat–Shamir.response
: The prover’s response vector.
§Returns
- A vector of group elements representing the simulated commitment (one per linear constraint).
§Errors
Error::InvalidInstanceWitnessPair
if the response length does not match the expected number of scalars.
Auto Trait Implementations§
impl<G> Freeze for SchnorrProof<G>
impl<G> RefUnwindSafe for SchnorrProof<G>
impl<G> Send for SchnorrProof<G>
impl<G> Sync for SchnorrProof<G>
impl<G> Unpin for SchnorrProof<G>
impl<G> UnwindSafe for SchnorrProof<G>
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<T> FmtForward for T
impl<T> FmtForward for T
Source§fn fmt_binary(self) -> FmtBinary<Self>where
Self: Binary,
fn fmt_binary(self) -> FmtBinary<Self>where
Self: Binary,
self
to use its Binary
implementation when Debug
-formatted.Source§fn fmt_display(self) -> FmtDisplay<Self>where
Self: Display,
fn fmt_display(self) -> FmtDisplay<Self>where
Self: Display,
self
to use its Display
implementation when
Debug
-formatted.Source§fn fmt_lower_exp(self) -> FmtLowerExp<Self>where
Self: LowerExp,
fn fmt_lower_exp(self) -> FmtLowerExp<Self>where
Self: LowerExp,
self
to use its LowerExp
implementation when
Debug
-formatted.Source§fn fmt_lower_hex(self) -> FmtLowerHex<Self>where
Self: LowerHex,
fn fmt_lower_hex(self) -> FmtLowerHex<Self>where
Self: LowerHex,
self
to use its LowerHex
implementation when
Debug
-formatted.Source§fn fmt_octal(self) -> FmtOctal<Self>where
Self: Octal,
fn fmt_octal(self) -> FmtOctal<Self>where
Self: Octal,
self
to use its Octal
implementation when Debug
-formatted.Source§fn fmt_pointer(self) -> FmtPointer<Self>where
Self: Pointer,
fn fmt_pointer(self) -> FmtPointer<Self>where
Self: Pointer,
self
to use its Pointer
implementation when
Debug
-formatted.Source§fn fmt_upper_exp(self) -> FmtUpperExp<Self>where
Self: UpperExp,
fn fmt_upper_exp(self) -> FmtUpperExp<Self>where
Self: UpperExp,
self
to use its UpperExp
implementation when
Debug
-formatted.Source§fn fmt_upper_hex(self) -> FmtUpperHex<Self>where
Self: UpperHex,
fn fmt_upper_hex(self) -> FmtUpperHex<Self>where
Self: UpperHex,
self
to use its UpperHex
implementation when
Debug
-formatted.Source§impl<T> Pipe for Twhere
T: ?Sized,
impl<T> Pipe for Twhere
T: ?Sized,
Source§fn pipe<R>(self, func: impl FnOnce(Self) -> R) -> Rwhere
Self: Sized,
fn pipe<R>(self, func: impl FnOnce(Self) -> R) -> Rwhere
Self: Sized,
Source§fn pipe_ref<'a, R>(&'a self, func: impl FnOnce(&'a Self) -> R) -> Rwhere
R: 'a,
fn pipe_ref<'a, R>(&'a self, func: impl FnOnce(&'a Self) -> R) -> Rwhere
R: 'a,
self
and passes that borrow into the pipe function. Read moreSource§fn pipe_ref_mut<'a, R>(&'a mut self, func: impl FnOnce(&'a mut Self) -> R) -> Rwhere
R: 'a,
fn pipe_ref_mut<'a, R>(&'a mut self, func: impl FnOnce(&'a mut Self) -> R) -> Rwhere
R: 'a,
self
and passes that borrow into the pipe function. Read moreSource§fn pipe_borrow<'a, B, R>(&'a self, func: impl FnOnce(&'a B) -> R) -> R
fn pipe_borrow<'a, B, R>(&'a self, func: impl FnOnce(&'a B) -> R) -> R
Source§fn pipe_borrow_mut<'a, B, R>(
&'a mut self,
func: impl FnOnce(&'a mut B) -> R,
) -> R
fn pipe_borrow_mut<'a, B, R>( &'a mut self, func: impl FnOnce(&'a mut B) -> R, ) -> R
Source§fn pipe_as_ref<'a, U, R>(&'a self, func: impl FnOnce(&'a U) -> R) -> R
fn pipe_as_ref<'a, U, R>(&'a self, func: impl FnOnce(&'a U) -> R) -> R
self
, then passes self.as_ref()
into the pipe function.Source§fn pipe_as_mut<'a, U, R>(&'a mut self, func: impl FnOnce(&'a mut U) -> R) -> R
fn pipe_as_mut<'a, U, R>(&'a mut self, func: impl FnOnce(&'a mut U) -> R) -> R
self
, then passes self.as_mut()
into the pipe
function.Source§fn pipe_deref<'a, T, R>(&'a self, func: impl FnOnce(&'a T) -> R) -> R
fn pipe_deref<'a, T, R>(&'a self, func: impl FnOnce(&'a T) -> R) -> R
self
, then passes self.deref()
into the pipe function.Source§impl<T> Tap for T
impl<T> Tap for T
Source§fn tap_borrow<B>(self, func: impl FnOnce(&B)) -> Self
fn tap_borrow<B>(self, func: impl FnOnce(&B)) -> Self
Borrow<B>
of a value. Read moreSource§fn tap_borrow_mut<B>(self, func: impl FnOnce(&mut B)) -> Self
fn tap_borrow_mut<B>(self, func: impl FnOnce(&mut B)) -> Self
BorrowMut<B>
of a value. Read moreSource§fn tap_ref<R>(self, func: impl FnOnce(&R)) -> Self
fn tap_ref<R>(self, func: impl FnOnce(&R)) -> Self
AsRef<R>
view of a value. Read moreSource§fn tap_ref_mut<R>(self, func: impl FnOnce(&mut R)) -> Self
fn tap_ref_mut<R>(self, func: impl FnOnce(&mut R)) -> Self
AsMut<R>
view of a value. Read moreSource§fn tap_deref<T>(self, func: impl FnOnce(&T)) -> Self
fn tap_deref<T>(self, func: impl FnOnce(&T)) -> Self
Deref::Target
of a value. Read moreSource§fn tap_deref_mut<T>(self, func: impl FnOnce(&mut T)) -> Self
fn tap_deref_mut<T>(self, func: impl FnOnce(&mut T)) -> Self
Deref::Target
of a value. Read moreSource§fn tap_dbg(self, func: impl FnOnce(&Self)) -> Self
fn tap_dbg(self, func: impl FnOnce(&Self)) -> Self
.tap()
only in debug builds, and is erased in release builds.Source§fn tap_mut_dbg(self, func: impl FnOnce(&mut Self)) -> Self
fn tap_mut_dbg(self, func: impl FnOnce(&mut Self)) -> Self
.tap_mut()
only in debug builds, and is erased in release
builds.Source§fn tap_borrow_dbg<B>(self, func: impl FnOnce(&B)) -> Self
fn tap_borrow_dbg<B>(self, func: impl FnOnce(&B)) -> Self
.tap_borrow()
only in debug builds, and is erased in release
builds.Source§fn tap_borrow_mut_dbg<B>(self, func: impl FnOnce(&mut B)) -> Self
fn tap_borrow_mut_dbg<B>(self, func: impl FnOnce(&mut B)) -> Self
.tap_borrow_mut()
only in debug builds, and is erased in release
builds.Source§fn tap_ref_dbg<R>(self, func: impl FnOnce(&R)) -> Self
fn tap_ref_dbg<R>(self, func: impl FnOnce(&R)) -> Self
.tap_ref()
only in debug builds, and is erased in release
builds.Source§fn tap_ref_mut_dbg<R>(self, func: impl FnOnce(&mut R)) -> Self
fn tap_ref_mut_dbg<R>(self, func: impl FnOnce(&mut R)) -> Self
.tap_ref_mut()
only in debug builds, and is erased in release
builds.Source§fn tap_deref_dbg<T>(self, func: impl FnOnce(&T)) -> Self
fn tap_deref_dbg<T>(self, func: impl FnOnce(&T)) -> Self
.tap_deref()
only in debug builds, and is erased in release
builds.