Anonymous Communication Network

1. what does the term anonymous communication stand for ?
2. Graphical presentation of the network problem
3. Chaum's solution
4. Is Chaum Solution Right ?(Not really)
5. The idea for our solution
6. Problems in the idea are being answered
7. what else can you find in this site ?

Our idea is making the external viewer lose track of the message we are sending, so it is similar in concept, but very different in implementation (it also has a proof).
We send the message to the agent thru a path of agents, we use cascade encryption so that every agent in path that is not the recipient knows only who was before him in the path and who is after him, never knowing the real sender and recipient.
Even though it is hard to trace the message thru its path, it is still possible for a highly organized external viewer such as a large authority. Using many dummy agents assures that the message will go thru them making the path visible and the information of who is the sender and who is the recipient obvious. 

It is not likely though, that all agents in path are dummies if we choose a random path with a length proportional to the number of dummies we suspect that exist in the network.

Another tracing method is based on the fact that some messages might move faster in their path than others. That makes messages very easy to trace, we just watch the faster messages exiting the vertices of the path, and we find out who the sender and recipient are.

Our solution is making the agents send and receive messages in isolated constant time intervals. One message cannot be faster than the others going thru a path of the same size, because its moves one agent forward (in the path) in each constant time interval. If the number of messages for each agent is large than it is even harder to detect the message since many messages are send in the same time.

Even with all these new techniques a very competent viewer that can view all edges, meaning all communication lines and non agent computers, can gather the information and after a long time consuming process decide who is the message sender and who is the recipient, our defense against such a viewer is simple real life facts on the web. Often communication lines fall so there is never a 100% view of the edges. 

We hope our solution is good for you, in the main page you may find the article which is the mathematical foundation to our work, and implementations to the agents and to the additional center program which works as a server of names and IP of the agents, the center implementation here is not a secure one but it doesn't have to be for the network to work since agents inner communication achieves the anonymity goal.