See any bugs/typos/confusing explanations? Open a GitHub issue. You can also comment below

★ See also the **PDF version of this chapter** (better formatting/references) ★

# Anonymous communication

Encryption is meant to protect the contents of communication, but sometimes the bigger secret is that the communication existed in the first place. If a whistleblower wants to leak some information to the New York Times, the mere fact that she sent an email would reveal her identity. There are two main concepts aimed at achieving anonymity:

*Anonymous routing*is about ensuring that Alice and Bob can communicate without that fact being revealed.*Steganography*is about having Alice and Bob hiding an encrypted communication in the context of an seemingly innocuous conversation.

## Steganography

The goal in a stegnaographic communication is to hide cryptographic (or non cryptographic) content without being detected. The idea is simple: let’s start with the *symmetric case* and assume Alice and Bob share a shared key \(k\) and Alice wants to transmit a bit \(b\) to Bob. We assume that Alice and has a choice of \(t\) words \(w_1,\ldots,w_t\) that would be reasonable for her to send at this point in the conversation. Alice will choose a word \(w_i\) such that \(f_k(w_i)=b\) where \(\{ f_k \}\) is a pseudorandom function collection. With probability \(1-2^{-t}\) there will be such a word. Bob will decode the message using \(f_k(w_i)\). Alice and Bob can use an error correcting code to compensate for the probability \(2^{-t}\) that Alice is forced to send the wrong bit.

In the *public key setting*, suppose that Bob publishes a public key \(e\) for an encryption scheme that has *pseudorandom ciphertexts*. That is, to a party that does not know the key, an encryption is indistinguishable from a random string. To send some message \(m\) to Bob, Alice computes \(c = E_e(m)\) and transmits it to Bob one bit at a time. Given the \(t\) words \(w_1,\ldots,w_t\), to transmit the bit \(c_j\) Alice chooses a word \(w_i\) such that \(H(w_i)=c_j\) where \(H:\{0,1\}^*\rightarrow\{0,1\}\) is a hash function modeled as a random oracle. The distribution of words output by Alice \(w^1,\ldots,w^\ell\) is uniform conditioned on \((H(w^1),\ldots,H(w^\ell))=c\). But note that if \(H\) is a random oracle, then \(H(w^1),\ldots,H(w^\ell)\) is going to be uniform, and hence indistinguishable from \(c\).

## Anonymous routing

**Low latency communication:**Aqua, Crowds, LAP, ShadowWalker, Tarzan, Tor**Message at a time, protection against timing / traffic analysis:**Mix-nets, e-voting, Dining Cryptographer network (DC net), Dissent, Herbivore, Riposte

## Tor

Basic arhictecture. Attacks

## Telex

## Riposte

## Comments

Comments are posted on the GitHub repository using the utteranc.es app. A GitHub login is required to comment. If you don't want to authorize the app to post on your behalf, you can also comment directly on the GitHub issue for this page.

Compiled on 04/01/2020 19:09:26

Copyright 2019, Boaz Barak.

This work is
licensed under a Creative Commons
Attribution-NonCommercial-NoDerivatives 4.0 International License.

Produced using pandoc and panflute with templates derived from gitbook and bookdown.