Skip to main content

prove

paillier_zk::paillier_encryption_in_range::non_interactive

Function prove 

Source 
pub fn prove<D: Digest>(
    shared_state: &impl Digestable,
    aux: &Aux,
    data: Data<'_>,
    pdata: PrivateData<'_>,
    security: &SecurityParams,
    rng: &mut impl RngCore,
) -> Result<NiProof, Error>
Expand description

Compute proof for the given data, producing random commitment and deriving determenistic challenge.

Obtained from the above interactive proof via Fiat-Shamir heuristic.