Struct BlindSignatureScheme 

pub struct BlindSignatureScheme {
    pub n: u64,
    pub e: u64,
    pub d: u64,
}

Simplified Chaum blind signature protocol over Z_p*.

Protocol:

1. Signer has key (d, e, n): d=private, e=public, n=modulus (RSA-like but tiny)
2. User blinds message m: c = r^e * m mod n (r is blinding factor)
3. Signer signs blinded message: s’ = c^d mod n
4. User unblinds: s = s’ * r^{-1} mod n
5. Verify: s^e = m mod n

WARNING

Educational only. Real blind RSA requires SHA-based full-domain hash + PKCS1v2.1.

Fields

n: u64

RSA-like modulus n = p*q (tiny, insecure)

e: u64

Public exponent e

d: u64

Private exponent d (e*d ≡ 1 mod λ(n))

Implementations

impl BlindSignatureScheme

pub fn blind(&self, m: u64, r: u64) -> u64

User blinds message m with factor r: returns blinded = r^e * m mod n.

pub fn sign_blinded(&self, blinded: u64) -> u64

Signer signs blinded message: s_prime = blinded^d mod n.

pub fn unblind(&self, s_prime: u64, r: u64) -> u64

User unblinds: s = s_prime * r^{-1} mod n.

pub fn verify(&self, m: u64, s: u64) -> bool

Verify signature: check s^e ≡ m (mod n).

Trait Implementations

impl Clone for BlindSignatureScheme

fn clone(&self) -> BlindSignatureScheme

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for BlindSignatureScheme

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

Formats the value using the given formatter.