Struct ServerKey 

pub struct ServerKey { /* private fields */ }

A server’s key for one mode.

Implementations

impl ServerKey

pub fn generate<R: RandomSource + ?Sized>( mode: Mode, rng: &mut R, ) -> Result<Self>

A fresh key from rng. Pass ic_drbg::Rng.

pub fn derive(mode: Mode, seed: &[u8; 32], info: &[u8]) -> Result<Self>

RFC 9497 section 3.2.1’s DeriveKeyPair: a key from a 32-byte secret seed and a public info.

pub fn from_bytes(mode: Mode, secret: &[u8]) -> Result<Self>

A key from its 32-byte scalar.

pub fn to_bytes(&self) -> Zeroizing<[u8; 32]>

The 32-byte scalar, for storing the key.

pub fn public_key(&self) -> [u8; 33]

The public key, which a VOPRF or POPRF client needs.

pub fn mode(&self) -> Mode

The mode this key serves.

pub fn blind_evaluate<R: RandomSource + ?Sized>( &self, blinded: &[u8; 33], info: &[u8], rng: &mut R, ) -> Result<([u8; 33], Option<[u8; 64]>)>

Evaluate one blinded element; see ServerKey::blind_evaluate_batch.

pub fn blind_evaluate_batch<R: RandomSource + ?Sized>( &self, blinded: &[[u8; 33]], info: &[u8], rng: &mut R, evaluated: &mut [[u8; 33]], ) -> Result<Option<[u8; 64]>>

Evaluate blinded elements, writing one evaluated element for each, and return the batched proof in the verifiable modes.

info is the POPRF’s public input and must be empty in the other two modes. A POPRF info that hashes to the negated key – which only someone who knows the key can find – is refused, as RFC 9497 says, and is a sign the key is known.

pub fn evaluate(&self, input: &[u8], info: &[u8]) -> Result<[u8; 32]>

RFC 9497’s Evaluate: the PRF output for input computed directly with the key, as the client would arrive at it. info is the POPRF’s and must be empty otherwise.

Trait Implementations

impl Drop for ServerKey

fn drop(&mut self)

Executes the destructor for this type.

fn pin_drop(self: Pin<&mut Self>)

🔬This is a nightly-only experimental API. (pin_ergonomics)

Execute the destructor for this type, but different to Drop::drop, it requires self to be pinned.