PhD student Mark Bun is involved in the Privacy Tool's differential privacy work and de-identification meetings, working on differentially private algorithms and lower bounds. 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). In summer 2015, Mark co-mentored REU student Daniel Muise with Kobbi Nissim and Victor Balcer, who returned as a graduate student.
- Order revealing encryption and the hardness of private learning,” in Proceedings of the 12th Theory of Cryptography Conference (TCC 2016), Tel-Aviv, Israel, 2016. ArXiv Version , “
- 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 Version , “
- Dual Lower Bounds for Approximate Degree and Markov-Bernstein Inequalities,” Automata, Languages, and Programming, , vol. 7965, pp. 303-314, 2013.Abstract , “
NSF Site Visit, December 2014
NSF Site Visit, November 2013