pub struct ProofSquareFree(/* private fields */);
Expand description

Proof that a Paillier modulus is square free. The proof checks that there are “small” factors, that can be inverted in with a Paillier modulus and the number of parallel instances needed for soundness relates to how high to check. For a security parameter k, where we check for prime factors up to t, need l parallel instances where l is the smallest integer such that t^l > 2^k. For 128-bit security, t = 1000 and l = 13, and Paillier modulus is ≥ 2048 bits.

This proof is used in https://eprint.iacr.org/2020/540 and https://eprint.iacr.org/2017/552 as part of their DKG. A paillier key generator can prove the parameters where created honestly.

Implementations§

source§

impl ProofSquareFree

source

pub fn generate<D: Digest>(sk: &DecryptionKey, nonce: &[u8]) -> Option<Self>

Generate a new SF proof. GG20 paper uses lots of values for the entropy like the ECDSA Public key, the curve generator and prime, and the participant id as follows generateChallenges(g, q, y, N, pi, l)

source

pub fn verify<D: Digest>(&self, pk: &EncryptionKey, nonce: &[u8]) -> bool

Verify a Paillier modulus is square-free.

source

pub fn to_bytes(&self) -> Vec<u8>

Get this proof’s byte representation

source

pub fn from_bytes<B: AsRef<[u8]>>(data: B) -> Result<Self, String>

Convert a byte representation to a proof

Trait Implementations§

source§

impl Clone for ProofSquareFree

source§

fn clone(&self) -> ProofSquareFree

Returns a copy of the value. Read more
1.0.0 · source§

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

Performs copy-assignment from source. Read more
source§

impl Debug for ProofSquareFree

source§

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

Formats the value using the given formatter. Read more
source§

impl<'de> Deserialize<'de> for ProofSquareFree

source§

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>
where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer. Read more
source§

impl Serialize for ProofSquareFree

source§

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>
where __S: Serializer,

Serialize this value into the given Serde serializer. Read more

Auto Trait Implementations§

Blanket Implementations§

source§

impl<T> Any for T
where T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

source§

impl<T, U> Into<U> for T
where U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source§

impl<T> Same for T

§

type Output = T

Should always be Self
source§

impl<T> ToOwned for T
where T: Clone,

§

type Owned = T

The resulting type after obtaining ownership.
source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
source§

impl<T> DeserializeOwned for T
where T: for<'de> Deserialize<'de>,