Mixnet: Difference between revisions
Jump to navigation
Jump to search
Adamcolton (talk | contribs) No edit summary |
Adamcolton (talk | contribs) No edit summary |
||
| (5 intermediate revisions by the same user not shown) | |||
| Line 1: | Line 1: | ||
* [https://leastauthority.com/blog/mixnet-intro/ Overview] | |||
* [https://www.umic.rwth-aachen.de/fileadmin/user_upload/umic/results/publications/2007/landsiedel-More.pdf More] | * [https://www.umic.rwth-aachen.de/fileadmin/user_upload/umic/results/publications/2007/landsiedel-More.pdf More] | ||
* [https:// | * [https://www.freehaven.net/anonbib/cache/disad-free-routes.pdf Free Mixnets] | ||
== [https://www.freehaven.net/anonbib/cache/DBLP:conf/sp/DanezisG09.pdf Sphinx] == | == [https://www.freehaven.net/anonbib/cache/DBLP:conf/sp/DanezisG09.pdf Sphinx] 2009 == | ||
Hides the total number of hops. | 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). | |||
Cool trick with cycling the public key. | |||
== [https://arxiv.org/pdf/1507.05724.pdf Hornet] == | |||
Very similar to the structure I'm looking for. | |||
== [https://github.com/dist-ribut-us/docs/tree/master/mixnetrouting Mine] == | == [https://github.com/dist-ribut-us/docs/tree/master/mixnetrouting Mine] == | ||
=== Onion === | === 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. | 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 === | === Cyclic === | ||
I'd like to find a way to use ECC (which I think is possible) or AES (which I don't). | I'd like to find a way to use ECC (which I think is possible) or AES (which I don't). | ||
[[Category:Dist.ribut.us]] | [[Category:Dist.ribut.us]] | ||
Latest revision as of 12:30, 23 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).
Cool trick with cycling the public key.
Hornet
Very similar to the structure I'm looking for.
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).