PhD student Mark Bun is involved in the Privacy Tool's differential privacy work and de-identification meetings, working on differentially private algorithms. He has previously served as a teaching fellow for PI Vadhan's Cryptography course in Fall 2013, and as a teaching fellow for Differential Privacy in Fall 2014, assisting Visiting Scholar Kobbi Nissim and Fellow Or Sheffet. Alongside Visiting Scholar Nissim, Mark mentored two undergraduate REU students in 2014 (Victor Balcer and Nathan Manohar).
- M. Bun, Ullman, J., and Vadhan, S., “Fingerprinting Codes and the Price of Approximate Differential Privacy,” in Proceedings of the 46th Annual ACM Symposium on Theory of Computing, , New York, NY, USA, 2014, pp. 1–10. Publisher's Versionp1-bun.pdf
- M. Bun and Thaler, J., “Dual Lower Bounds for Approximate Degree and Markov-Bernstein Inequalities,” Automata, Languages, and Programming, , vol. 7965, pp. 303-314, 2013.AbstractPDF
NSF Site Visit, December 2014
NSF Site Visit, November 2013