An Efficient DC-Net Based Anonymous Message Transmission Protocol

DC-Nets can be considered as an important solution to anonymous communications. However, their high message and bit complexity is a major obstacle in their practical usage. All DC-Net protocols provide anonymity of both sender and receiver by establishing some anonymous channels for message transmission. We propose a new DC-Net protocol that permits n simultaneous anonymous channels with the same message and bit complexity as original DC-Net protocol. Thus, we reduced the bit complexity of DC-Nets by O(n). We prove the anonymity of our protocol and show that it is susceptible to some attacks similar to possible attacks against usual DC-Net protocols. Some existing methods of protecting DC-Nets from adversaries are extended to protect our protocol against possible attacks.

کلیدواژه ها:

Anonymity ، Anonymous Communication ، Dining Cryptographers