Rafael Pass graduated from MIT in 2006 and has since been a faculty member in the Computer Science Department at Cornell University. In 2013, he joined the newly founded Cornell Tech campus in New York city. His research interests are in Cryptography and its connections to Complexity Theory and Game Theory. He is the recipient of the NSF Career Award in 2008, the AFOSR Young Investigator Award in 2010, the Google Faculty award in 2015 and was named a Microsoft Faculty Fellow in 2009, a Sloan Research Fellow in 2011, and a JP Morgan Faculty fellow in 2020.
Networks and Markets, Cryptography, Complexity Theory, Discrete Structures
- Yanyi Liu and Rafael Pass. On One-way Functions and Kolmogorov Complexity. In FOCS 2020.
- Rafael Pass and Muthuramakrishnan Venkitasubramaniam. Is it Easier to Prove Theorems that are Guaranteed to be True? In FOCS 2020.
- Andrew Morgan, Rafael Pass and Antigoni Polychroniadou. Succinct Non-interactive Secure Computation. In EUROCRYPT 2020, pages 216-245.
- Naomi Ephraim, Cody Freitag. Ilan Komargodski and Rafael Pass. Continuous Verifiable Delay Functions. In EUROCRYPT 2020, pages 125-154.
- Naomi Ephraim, Cody Freitag. Ilan Komargodski and Rafael Pass. SPARKs: Succinct Parallelizable Arguments of Knowledge. In EUROCRYPT 2020, pages 707-737.
Selected Awards and Honors
- JP Morgan Faculty Award, 2020.
- Invited Full Professor at the Ecole Normale Superieur, Paris, 2016.
- Google Faculty Award, 2015.
- Fiona Ip Li and Donald Li Excellence in Teaching Award, 2012.
- Alfred P. Sloan Fellow, 2011.
- AFOSR Young Investigator Award, 2010.
- Microsoft Research Faculty Fellow, 2009.
Massachusetts Institute of Technology 2006