pub struct Secret<S: Suite> { /* private fields */ }Expand description
Secret key for VRF operations.
Contains the private scalar and cached public key. Implements automatic zeroization on drop.
Implementations§
Source§impl<S: Suite> Secret<S>
impl<S: Suite> Secret<S>
Sourcepub fn from_scalar(scalar: ScalarField<S>) -> Self
pub fn from_scalar(scalar: ScalarField<S>) -> Self
Construct a Secret from the given scalar.
Sourcepub fn from_seed(seed: [u8; 32]) -> Self
pub fn from_seed(seed: [u8; 32]) -> Self
Derives a Secret scalar deterministically from a seed.
The seed is hashed using the suite’s transcript, and the output is
reduced modulo the curve’s order to produce a valid scalar in the
range [1, n - 1]. No clamping or multiplication by the cofactor is
performed, regardless of the curve.
The caller is responsible for ensuring that the resulting scalar is used safely with respect to the target curve’s cofactor and subgroup properties.
Sourcepub fn from_rand(rng: &mut impl RngCore) -> Self
pub fn from_rand(rng: &mut impl RngCore) -> Self
Construct an ephemeral Secret using the provided randomness source.
Sourcepub fn scalar(&self) -> &ScalarField<S>
pub fn scalar(&self) -> &ScalarField<S>
Get the secret scalar.
Trait Implementations§
Source§impl<S: Suite> CanonicalDeserialize for Secret<S>
impl<S: Suite> CanonicalDeserialize for Secret<S>
Source§fn deserialize_with_mode<R: Read>(
reader: R,
compress: Compress,
validate: Validate,
) -> Result<Self, SerializationError>
fn deserialize_with_mode<R: Read>( reader: R, compress: Compress, validate: Validate, ) -> Result<Self, SerializationError>
fn deserialize_compressed<R>(reader: R) -> Result<Self, SerializationError>where
R: Read,
fn deserialize_compressed_unchecked<R>(
reader: R,
) -> Result<Self, SerializationError>where
R: Read,
fn deserialize_uncompressed<R>(reader: R) -> Result<Self, SerializationError>where
R: Read,
fn deserialize_uncompressed_unchecked<R>(
reader: R,
) -> Result<Self, SerializationError>where
R: Read,
Source§impl<S: Suite> CanonicalSerialize for Secret<S>
impl<S: Suite> CanonicalSerialize for Secret<S>
Source§fn serialize_with_mode<W: Write>(
&self,
writer: W,
compress: Compress,
) -> Result<(), SerializationError>
fn serialize_with_mode<W: Write>( &self, writer: W, compress: Compress, ) -> Result<(), SerializationError>
fn serialized_size(&self, compress: Compress) -> usize
fn serialize_compressed<W>(&self, writer: W) -> Result<(), SerializationError>where
W: Write,
fn compressed_size(&self) -> usize
fn serialize_uncompressed<W>(&self, writer: W) -> Result<(), SerializationError>where
W: Write,
fn uncompressed_size(&self) -> usize
Source§impl<S: PedersenSuite> Prover<S> for Secret<S>
impl<S: PedersenSuite> Prover<S> for Secret<S>
Source§impl<S: ThinVrfSuite> Prover<S> for Secret<S>
impl<S: ThinVrfSuite> Prover<S> for Secret<S>
Source§impl<S: TinySuite> Prover<S> for Secret<S>
impl<S: TinySuite> Prover<S> for Secret<S>
Source§fn prove(&self, ios: impl AsRef<[VrfIo<S>]>, ad: impl AsRef<[u8]>) -> Proof<S>
fn prove(&self, ios: impl AsRef<[VrfIo<S>]>, ad: impl AsRef<[u8]>) -> Proof<S>
Tiny VRF proving algorithm.
Prepends the Schnorr pair (G, Y) to the I/O list and proves a single DLEQ on the delinearized merged pair:
- Generate a deterministic nonce
k - Compute nonce commitment
R = k * I_m - Compute the challenge
c - Compute the response
s = k + c * x
Source§impl<S: Suite> Valid for Secret<S>
impl<S: Suite> Valid for Secret<S>
fn check(&self) -> Result<(), SerializationError>
fn batch_check<'a>(
batch: impl Iterator<Item = &'a Self> + Send,
) -> Result<(), SerializationError>where
Self: 'a,
impl<S: Suite> StructuralPartialEq for Secret<S>
Auto Trait Implementations§
impl<S> Freeze for Secret<S>
impl<S> RefUnwindSafe for Secret<S>where
<<S as Suite>::Affine as AffineRepr>::ScalarField: RefUnwindSafe,
<S as Suite>::Affine: RefUnwindSafe,
impl<S> Send for Secret<S>
impl<S> Sync for Secret<S>
impl<S> Unpin for Secret<S>
impl<S> UnsafeUnpin for Secret<S>where
<<S as Suite>::Affine as AffineRepr>::ScalarField: UnsafeUnpin,
<S as Suite>::Affine: UnsafeUnpin,
impl<S> UnwindSafe for Secret<S>where
<<S as Suite>::Affine as AffineRepr>::ScalarField: UnwindSafe,
<S as Suite>::Affine: UnwindSafe,
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> CanonicalSerializeHashExt for Twhere
T: CanonicalSerialize,
impl<T> CanonicalSerializeHashExt for Twhere
T: CanonicalSerialize,
fn hash<H>(&self) -> GenericArray<u8, <H as OutputSizeUser>::OutputSize>where
H: Digest,
fn hash_uncompressed<H>(
&self,
) -> GenericArray<u8, <H as OutputSizeUser>::OutputSize>where
H: Digest,
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read more