Skip to main content

prove

paillier_zk::paillier_encryption_in_range_with_el_gamal::non_interactive

Function prove 

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

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

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