Patent ID: 6937728
Filing Date: 2005-08-30
Classification: H04L

Abstract:
1. A verifiable anonymous channel 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 a one-to-one correspondence with each other, comprises: unit permutation means which: randomly permutes n inputs, where n is an integer equal to or greater than 2 but not exceeding said N, and randomizes said n inputs with secret information to provide n outputs; and executes a zero-knowledge proof to said arbitrary verifier that guarantees the existence of said secret information and said random permutation which indicate the correspondence between said n inputs and said n outputs without revealing said secret information and said random permutation to said arbitrary verifier; first repeating means which performs the processing of N inputs by said unit permutation means in groups of n to provide N outputs; and second repeating means which performs the processing of said N messages, provided thereto as initial inputs, by said first repeating means to provide said N outputs and performs the processing of said N outputs as said N inputs by said first repeating means a predetermined number of times to obtain N permuted and randomized output messages that have a one-to-one correspondence with said N messages.