| Next | You can't get there from here | 50 |
First, P assigns random aliases to the cities in the map
| Aix | ai500 | Brussels | br558 |
| Cannes | ca426 | Dayton | da573 |
| Erie | er054 | Panang | pa910 |
| Peoria | pe379 | Perth | pe442 |
| Philadelphia | ph160 | Portland | po839 |
He encrypts the alias list (pink == encrypted)
Then he makes a list of the available routes
| ai500 br558 | ai500 po839 | ai500 er054 |
| br558 ca426 | br558 da573 | br558 ph160 |
| ca426 da573 | ca426 pa910 | da573 er054 |
| da573 pe379 | er054 pe442 | pa910 po839 |
| pe379 po839 | pe379 ph160 | pe442 ph160 |
He encrypts each available route with a different key
He sends all the encrypted stuff over to V
16 separate encrypted messages in this example
Actually, P need not encrypt anything
It's enough to just send over 16 checksums, like in the coin flip problem
As long as he can't change his mind later about what he sent
| Next |  |
Copyright © 2005 M. J. Dominus |