REU Student	Graduate Mentors		Faculty Advisor
Andrew Bortz	Luis von Ahn	Nick Hopper	Lenore Blum

We consider the problem of traceable anonymity, whereby systems that provide anonymity and privacy for general users include features that allow the system to "undo" anonymity in a predetermined and controlled manner for particularly egregious behavior. We also consider the related problem of coercibility in anonymous systems, in analog to the problems in voting systems, and we examine its impact on providing traceable anonymity.

Preliminary Presentation (ppt)

 

Other REUs for Summer 2004

Algorithms for Dynamic Point Location with Good Practical Performance
A Bezier-Based Approach to Unstructured Moving Meshes
Evaluation of Algorithms for the List Update Problem
Exploring PLS-Completeness of Simple Stochastic Game (or Stable Circuit Problem)
Fast and Compact Data Structures
The Game of NimG (Nim on Graphs)
Random Graph Models of Large Real-World Networks
Solving Partial Differential Equations Numerically
Traceable Anonymity

Back to the REU page