Mathematical Sciences Seminar - Cryptogenography: Anonymity without trust
When:
—
Venue:
Birkbeck Main Building, Malet Street
No booking required
Most research in anonymous communication assumes some amount of trust: for example that there is at least one server that can be trusted. In this talk we will see what happens if no active participant can be trusted and an adversary can see all communication. We consider both the model where the adversary's computational power is bounded and the model where it is unbounded. In both models, we will see that it is possible to achieve something anonymously. However, we will also show very low upper bounds on how much information you can send. This justifies the assumption of trust in anonymity research.
Part of this talk is based on joint work with Claudio Orlandi.
Contact name:
Department of Economics, Mathematics and Statistics