Struct StatisticalPrivacyEngine 

pub struct StatisticalPrivacyEngine { /* private fields */ }

Statistical privacy engine

Implementations

impl StatisticalPrivacyEngine

pub fn new() -> Self

pub fn initialize(&mut self) -> Result<(), StatisticalError>

pub fn add_laplace_noise( &mut self, value: f64, sensitivity: f64, ) -> Result<(f64, f64), StatisticalError>

pub fn add_histogram_noise( &mut self, counts: &[u32], ) -> Result<(Vec<u32>, f64), StatisticalError>

pub fn encrypt_result(&self, data: &[u8]) -> Result<Vec<u8>, StatisticalError>

Encrypt (seal) a statistical result using the fiduciary crypto system.

FiduciaryCrypto exposes ML-DSA (FIPS-204) signing rather than symmetric encryption, so “encryption” here means producing an authenticated signature over the result bytes. The returned bytes are the ML-DSA signature; a holder of the public key can verify that the result was produced by this engine and has not been tampered with. A default signing key is generated lazily on first use.

pub fn verify_result( &self, data: &[u8], signature: &[u8], ) -> Result<bool, StatisticalError>

Verify (open) a statistical result sealed by encrypt_result.

Returns Ok(true) when the signature is valid for data under the engine’s statistical-results key.

pub fn prove_computation( &self, computation_id: &str, inputs: &[Vec<u8>], outputs: &[Vec<u8>], ) -> Result<Vec<u8>, StatisticalError>

Generate a zero-knowledge proof that a statistical computation was performed correctly.

The proof binds the private inputs and public outputs together: a SHA-256 commitment over all inputs/outputs becomes a private witness, and the same commitment is exposed as the single public input. The circuit enforces one * commitment = commitment, so a verifying party learns only that the prover knows the commitment bound to the published outputs — not the inputs themselves. The returned bytes are a serde_json-serialised ZkProof (which carries its own public inputs), so it can be verified by verify_computation without extra state.

pub fn verify_computation( &self, proof: &[u8], public_inputs: &[Vec<u8>], ) -> Result<bool, StatisticalError>

Verify a zero-knowledge computation proof produced by prove_computation.

proof is the serialised ZkProof bytes. When public_inputs is non-empty, each entry is interpreted as a 32-byte little-endian field element and checked against the public inputs embedded in the proof, so callers can confirm the proof binds to the outputs they expect.