| http://www.w3.org/ns/prov#value | - A verifiable anonymous communication method in which N encrypted input messages, where N is an integer equal to or greater than 2, are permuted and randomized to obtain N output messages and it is proved to an arbitrary verifier that said output messages and said input messages have one-to-one correspondence with each other, comprise the steps of:
|
