Alice wants to send a message to Bob.  Using Matryoshka Communications, Alice and Bob’s locations will not be known to each other nor anyone else.  No evidence will be exposed that any communications ever takes place.

Alice’s computer has a local copy of the map if IP addresses and public keys for a sufficient number of Matryoshka Nodes as well as the Matryoshka Storage device for Bob.

Alice’s computer encrypts the message into a Cryptogram using Bob’s public message key.

The Cryptogram is given an instruction to store it for Bob and encrypted again using node 5’s public key.

The Cryptogram is given an instruction to send it to node 5 and encrypted again using node 4’s public key.

The Cryptogram is given an instruction to send it to node 4 and encrypted again using node 3’s public key.

The Cryptogram is given an instruction to send it to node 3 and encrypted again using node 2’s public key.

The Cryptogram is then queued to be sent from Alice’s computer (1) to node 2 at the next regular interval.

Node 2 receives the Cryptogram and decrypts it with its private key.  It finds an instruction to send it to node 3 and queues it for the next regular interval.

Node 3 receives the Cryptogram and decrypts it with its private key.  It finds an instruction to send it to node 4 and queues it for the next regular interval.

Node 4 receives the Cryptogram and decrypts it with its private key.  It finds an instruction to send it to node 5 and queues it for the next regular interval.

Node 5 receives the Cryptogram and decrypts it with its private key.  It finds an instruction to store the Cryptogram for Bob.

Bob’s computer sends a Cryptogram with node 5’s public key that contains a list of instructions for node 5 to execute.  When Bob want’s to retrieve his message he will specify the route to the storage node and the return route.  The routes do not need to be the same.

Bob’s computer prepares a Cryptogram with an instruction to send it to himself and encrypts it with node 10’s public key.

The Cryptogram is given an instruction to send it to node 10 and encrypted again using node 7’s public key.

The Cryptogram is given an instruction to send it to node 7 and encrypted again using node 6’s public key.

The Cryptogram is given an instruction fetch the message Cryptogram, append this list of instructions and send it to node 6 and encrypted again using node 5’s public key.

The Cryptogram is given an instruction to send it to node 5 and encrypted again using node 6’s public key.

The Cryptogram is given an instruction to send it to node 6 and encrypted again using node 7’s public key.

The Cryptogram is given an instruction to send it to node 7 and encrypted again using node 8’s public key.

The Cryptogram is then queued to be sent from Bob computer (9) to node 8 at the next regular interval.

Node 8 receives the Cryptogram and decrypts it with its private key.  It finds an instruction to send it to node 7 and queues it for the next regular interval.

Node 7 receives the Cryptogram and decrypts it with its private key.  It finds an instruction to send it to node 6 and queues it for the next regular interval.

Node 6 receives the Cryptogram and decrypts it with its private key.  It finds an instruction to send it to node 5 and queues it for the next regular interval.

Node 5 receives the Cryptogram and decrypts it with its private key.  It finds an instruction to send it to fetch Bob’s message Cryptogram.  It appends the message to the current Cryptogram and sends it to node 6.

Node 6 receives the Cryptogram and decrypts it with its private key.  It finds an instruction to send it to node 7 and queues it for the next regular interval.

Node 7 receives the Cryptogram and decrypts it with its private key.  It finds an instruction to send it to node 10 and queues it for the next regular interval.

Node 10 receives the Cryptogram and decrypts it with its private key.  It finds an instruction to send it to node 9 and queues it for the next regular interval.

Bob’s computer (9) receives the Cryptogram and decrypts it with its private key.  It finds an instruction that indicates the Cryptogram is a message and now Bob has the decrypted message.

Summary

Alice’s (1) computer is the only one who knows the route taken from her machine to the storage node.

Bob’s (9) computer is the only one who know the route taken from his machine to the storage and back.

None of the intermediary nodes (2, 3, 4, 6, 7, 8, and 10) know the source or destination of any of the messages.