Struct chain_vote::cryptography::zkps::unit_vector::zkp::Zkp

pub struct Zkp {
    ibas: Vec<Announcement>,
    ds: Vec<Ciphertext>,
    zwvs: Vec<ResponseRandomness>,
    r: Scalar,
}

Fields

ibas: Vec<Announcement>

Commitment to the proof randomness and bits of binary representaion of i

ds: Vec<Ciphertext>

Encryption to the polynomial coefficients used in the proof

zwvs: Vec<ResponseRandomness>

Response related to the randomness committed in ibas

r: Scalar

Final response

Implementations

impl Zkp

pub(crate) fn generate<R: RngCore + CryptoRng>( rng: &mut R, crs: &Crs, public_key: &PublicKey, unit_vector: &UnitVector, encryption_randomness: &[Scalar], ciphertexts: &[Ciphertext] ) -> Self

Generate a unit vector proof. In this proof, a prover encrypts each entry of a vector unit_vector, and proves that the vector is a unit vector. In particular, it proves that it is the ith unit vector without disclosing i. Common Reference String (Crs): Pedersen Commitment Key Statement: public key pk, and ciphertexts ciphertexts C_0=Enc_pk(r_0; v_0), …, C_{m-1}=Enc_pk(r_{m-1}; v_{m-1}) Witness: the unit vector unit_vector, and randomness used for encryption encryption_randomness.

The proof communication complexity is logarithmic with respect to the size of the encrypted tuple. Description of the proof available in Figure 8.

pub fn verify( &self, crs: &Crs, public_key: &PublicKey, ciphertexts: &[Ciphertext] ) -> bool

Verify a unit vector proof. The verifier checks that the plaintexts encrypted in ciphertexts, under public_key represent a unit vector. Common Reference String (crs): Pedersen Commitment Key Statement: public key pk, and ciphertexts ciphertexts C_0=Enc_pk(r_0; v_0), …, C_{m-1}=Enc_pk(r_{m-1}; v_{m-1})

Description of the verification procedure available in Figure 9.

fn verify_statements( &self, public_key: &PublicKey, commitment_key: &CommitmentKey, ciphertexts: &Ptp<Ciphertext>, challenge_x: &Scalar, challenge_y: &Scalar ) -> bool

Final verification of the proof, that we compute in a single vartime multiscalar multiplication.

pub fn from_buffer(codec: &mut Codec<&[u8]>) -> Result<Self, ReadError>

Try to generate a Proof from a buffer

pub fn from_parts( ibas: Vec<Announcement>, ds: Vec<Ciphertext>, zwvs: Vec<ResponseRandomness>, r: Scalar ) -> Self

Constructs the proof structure from constituent parts.

Panics

The ibas, ds, and zwvs must have the same length, otherwise the function will panic.

pub fn len(&self) -> usize

Returns the length of the size of the witness vector

pub fn ibas(&self) -> impl Iterator<Item = &Announcement>

Return an iterator of the announcement commitments

pub fn announcments_group_elements(&self) -> Vec<GroupElement>

Return announcement commitments group elements

pub fn ds(&self) -> impl Iterator<Item = &Ciphertext>

Return an iterator of the encryptions of the polynomial coefficients

pub fn zwvs(&self) -> impl Iterator<Item = &ResponseRandomness>

Return an iterator of the response related to the randomness

pub fn response_randomness_group_elements(&self) -> Vec<Scalar>

Return an iterator of the response related to the randomness

pub fn r(&self) -> &Scalar

Return R

Trait Implementations

impl Clone for Zkp

fn clone(&self) -> Zkp

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for Zkp

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Hash for Zkp

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl PartialEq<Zkp> for Zkp

fn eq(&self, other: &Zkp) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Eq for Zkp

impl StructuralEq for Zkp

impl StructuralPartialEq for Zkp