Re: Recognising one's own messages on an anonymous broadcast channel?

You have to consider that one of the clients might guess the private
key of another client, giving a total security failure. As long as
that probability is nonzero there's not much point in insisting that
the collision probability also be nonzero. Instead just make sure
that the probability of either of those occurrences is negligible.

Well, 100% security isn't what is asked for, i.e. the anonymity can be
broken eventually. It is the non-collision part that is important.

How about this scheme?

Clients create client-unique numbers, say 64-bit. The client is given
some private key, say 64-bit. The result is a 128-bit number. 128 bits
are enough to guarantee that collisions will not happen (simple
permutation).

Isn't there any algorithm that has these properties?

.

Relevant Pages

  • Re: Computability
    ... I am sorry if my difficulties with exposition led you to believe ... And the conjecture _is_ interesting. ... probability and that that order will be the order of exposition next ... client cognitions in a pattern of correalations like "when client ...
    (sci.math)
  • Re: Recognising ones own messages on an anonymous broadcast channel?
    ... collision probability of about /1.15e77 which is less than ... crypto-algorithms and pure cleverness rather than just very advanced ... key of another client, ... the collision probability also be nonzero. ...
    (sci.crypt)