Mixnet: Difference between revisions
Jump to navigation
Jump to search
Adamcolton (talk | contribs) No edit summary |
Adamcolton (talk | contribs) |
||
| Line 7: | Line 7: | ||
They use the term "linkable message" to describe where two nodes can correlate a message (including the sender with a node in the receiving path or the receiver with a node in the sending path). | They use the term "linkable message" to describe where two nodes can correlate a message (including the sender with a node in the receiving path or the receiver with a node in the sending path). | ||
Left off at section 3.1 | |||
== [https://github.com/dist-ribut-us/docs/tree/master/mixnetrouting Mine] == | == [https://github.com/dist-ribut-us/docs/tree/master/mixnetrouting Mine] == | ||
Revision as of 17:55, 19 July 2018
Sphinx 2009
Hides the total number of hops.
They use the term "linkable message" to describe where two nodes can correlate a message (including the sender with a node in the receiving path or the receiver with a node in the sending path).
Left off at section 3.1
Mine
Onion
I think I could reduce the over head a little by having each node populate part of the header. I could use this approach to strip out the nonce which is about 30% of the header. Start with the end nonce and add a layer of unmacd encryption at each step with a zero nonce key.
Cyclic
I'd like to find a way to use ECC (which I think is possible) or AES (which I don't).