[Top][All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: [Taler] question about "how to issue": quantum computer attacks

From: Jeff Burdges
Subject: Re: [Taler] question about "how to issue": quantum computer attacks
Date: Fri, 21 Oct 2022 23:01:27 +0200

On Oct 21 2022, at 4:55 pm, Calvin Burns via Taler <taler@gnu.org> wrote:
> I cite from [1]: "Furthermore, RSA blinding would provide privacy protection
> even against quantum computer attacks."
> Could someone please give an explanation for why this is true?
> Or please give a link to literature or some keywords or other pointers.

Many blind signature flavors like RSA, BLS, Schnor have issuing that
morally looks like  b^{-1} (sk (b x))  with () being protocol moves, so
the bank sees  b x  when issuing and  x  when spending.  As b is random,
these are perfectly / statistically / information theoretically hiding,
as opposed to only computationally hiding.

Many zero knowledge proofs like Groth16 in ZCash are similarly perfectly hiding.


reply via email to

[Prev in Thread] Current Thread [Next in Thread]