He leads or co-leads numerous centers and activities focused on cryptography and social good.

He received his master's degree and PhD in Computer Science from Johns Hopkins University in 2008.

He teaches a popular Algorithms for the People course that surveys, critiques, and aspires to address the ways in which computer science and technology affect marginalized communities.

With Reza Curtmola, Juan Garay and Rafail Ostrovsky, he proposed the first SSE constructions to achieve optimal search time.

[6] He joined a National Academy of Sciences committee focused on "Law Enforcement and Intelligence Access to Plaintext Information in an Era of Widespread Strong Encryption: Options and Tradeoffs", which produced a report on encryption and cybersecurity.