Mixnet: Difference between revisions

From Adam Colton
Jump to navigation Jump to search
Created page with "A service that can run in conjunction with Beeds to increase anonymity, at the cost of speed. The overlay is just a list of nodes and their public keys. Frames are 1 seco..."
 
No edit summary
 
(8 intermediate revisions by the same user not shown)
Line 1: Line 1:
A service that can run in conjunction with [[Beeds]] to increase anonymity, at the cost of speed.
* [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.freehaven.net/anonbib/cache/disad-free-routes.pdf Free Mixnets]


The overlay is just a list of nodes and their public keys. Frames are 1 second long, each frame a percentage of the network is chosen (~1%). We choose by taking the unix timestamp, hashing it and finding the N nodes with ID closest (xor) to it. Those become the mixnet routers for that frame.
== [https://www.freehaven.net/anonbib/cache/DBLP:conf/sp/DanezisG09.pdf Sphinx] 2009 ==
Hides the total number of hops.


The mixnet router will hold incoming messages until it is their frame (starting ~15 frames ahead). Messages must skip at least one frame but not more than 3, so at F0, we will be sending to F2-F4.  
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).


[[Category:Waxnet]]
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] ==
 
=== 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).
 
[[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).