asciilifeform: found) only consumes roughly as many random bits as the size of the output primes, but we can show that its output distribution, even if it can be shown to have high entropy if the prime r-tuple conjecture holds, is also provably quite far from uniform... It is likely that most algorithms that proceed deterministically beyond an initial random choice, including those of Joye, Paillier and Vaudenay... ...or Maurer... exhibit similar d

asciilifeform: btw i've been trying to come up with useful scheme standing on paillier, for >decade now, and if mircea_popescu writes one, i promise to read it.

asciilifeform: this dun work with paillier. or any other known scheme.

asciilifeform: paillier adds, that's all it does.

asciilifeform: problem is that paillier dun multiply. or turingate at all.

asciilifeform: based on the most obvious scheme, that i toyed with as a student, paillier (see oooooold l0gz)

asciilifeform: !s paillier

asciilifeform: !s paillier

asciilifeform: incidentally, the 'we want an0nym1ty!!1' folks could be satisfied - use paillier's arithmetic to represent balances. so you need private key to know the state of an address.

asciilifeform: benkay: "homomorphic or semi-homomorphic" encryption, where 3 parties each control << this is an entire science. see, for instance, Pascal Paillier's boojum.

asciilifeform: http://en.wikipedia.org/wiki/Paillier_cryptosystem

asciilifeform: cads: i reinvented the concept, as probably just about every maths student has, when first reading about Paillier's Addition and thinking 'what if you glue this to OISC - 'jump if zero' - machine.