HOPR Basics: Cover Traffic
This is the ninth episode in our series covering the basics of HOPR. Links to previous episodes can be found at the end of the article.
Previous episodes in this series have explained how HOPR ensures that all the data sent through its network is indistinguishable, and how the incentives system keeps relayers honest without exposing their privacy.
However, all this effort to make data packets indistinguishable is only truly effective when there is sufficient traffic. It’s really just a matter of scale: a leaf in the forest is practically invisible, while a leaf in the middle of an otherwise empty floor is going to stand out.
This is particularly problematic for growing networks like HOPR, but even mature global networks have fluctuating levels of traffic. A sufficiently powerful global adversary — an attacker who has access to information about the entire network, rather than just traffic through a single node — might be able to gather enough metadata to start linking users to their traffic. We need a way to ensure that everyone is protected even in periods of lower usage.
How can we do that? Well, returning to our leaf analogy, when there’s no forest to hide your leaf in, what do you do? The answer is to grow your own forest. If there isn’t enough data to confuse a global adversary, we need to make more data from somewhere.
Mixnets like HOPR ensure a constant level of privacy by sending arbitrary data through the network. This is called “cover traffic”, because the arbitrary data provides cover for legitimate packets.
Data packets sent in this way function just like normal packets, except they have no meaningful content. So relayers still get paid for relaying them, and they get mixed in with all the data for “real” packets.
In this way, cover traffic ensures that there’s always a minimum level of traffic in the network, providing a blanket of privacy for users.
Covering the Cost
Cover traffic is not a new concept, but in other mixnet approaches cover traffic is seen as an unfortunate cost which must be paid in exchange for privacy.
HOPR takes a different tack by integrating cover traffic with a second mechanism: staking. The HOPR token is a cryptocurrency, and as with many other cryptocurrencies HOPR holders expect to be rewarded for holding tokens. Integrating these two concepts takes a necessary evil and turns it into a valuable incentive mechanism.
Staking works by awarding stakers with new tokens proportional to their stake. With HOPR, a node has a higher chance of being chosen to relay cover traffic the higher their stake is. This randomness is important: it prevents the routing from being fully predictable and helps preserve privacy for the staking nodes. Like with probabilistic payments, this randomness introduces some short-term volatility, but this will quickly average out.
Current Status
The HOPR protocol does not currently have working cover traffic — it’s the focus of our ongoing staking and testing program, which you can participate in right now. Cover traffic is a complex part of the HOPR protocol, with lots of parameters to balance, including reliability, privacy, fairness, and more. Next time we’ll look at some of these in detail and explain the thinking behind current development work.
Sebastian Bürgel,
HOPR Founder
Website: https://www.hoprnet.org
Twitter: https://twitter.com/hoprnet
Telegram: https://t.me/hoprnet
Discord: https://discord.gg/dEAWC4G
LinkedIn: https://www.linkedin.com/company/hoprnet
Forum: https://forum.hoprnet.org
Github: https://github.com/hoprnet
HOPR Basics Episodes:
Episode 1: What is HOPR?
Episode 2: What is Metadata?
Episode 3: Anonymous Routing
Episode 4: Mixnets
Episode 5: Incentives
Episode 6: Proof of Relay
Episode 7: Tickets and Payment Channels
Episode 8: Probabilistic Payments
Episode 9: Cover Traffic
Episode 10: Cover Traffic Nodes
Episode 11: Balancing Cover Traffic
Episode 12: Intro to the HOPR DAO
