CHARTS
CHARTS: Compute-Efficient Anonymous Routing through Tag Sums began as my undergraduate honors thesis and subsequently developed into a full paper, which has been submitted for publication. It explores an efficient anonymous routing scheme where anonymity is guaranteed through one honest-but-curious router and, to our knowledge, achieves the fastest known performance among schemes in this setting. This work was in collaboration with Ke Wu.