Rafael Pass

Rafael Pass
Name	Rafael Pass
Birth date	1977
Birth place	São Paulo, Brazil
Nationality	Brazilian
Fields	Computer Science, Cryptography, Quantum Information
Institutions	Massachusetts Institute of Technology, Deutsches Elektronen-Synchrotron, University of Waterloo
Alma mater	University of São Paulo, University of Cambridge
Known for	Cryptographic reductions, Quantum cryptography, Complexity in cryptography

Rafael Pass is a researcher in theoretical computer science and cryptography known for work on cryptographic reductions, secure multi-party computation, and the foundations of cryptographic hardness. His contributions span computational complexity, information-theoretic security, and quantum-resistant protocols, influencing research at institutions such as the Massachusetts Institute of Technology, the University of California, and leading laboratories in Europe and North America.

Early life and background

Born in São Paulo, Brazil, Pass grew up in a milieu connected to Brazilian academic institutions and international research communities. He was exposed early to mathematics and computing through contacts with faculty at the University of São Paulo, local technology initiatives, and national research centers. That background connected him to global research networks including collaborations with scholars from the University of Cambridge, the École Polytechnique Fédérale de Lausanne, and research groups in the United States and Canada.

Education and career

Pass completed undergraduate studies at the University of São Paulo before moving to the University of Cambridge for graduate work under advisors with ties to theoretical computer science and cryptography. After earning his doctorate, he held positions at the Massachusetts Institute of Technology and visiting appointments at the Institute for Advanced Study and the Perimeter Institute for Theoretical Physics. His academic appointments have included faculty roles at major research universities and affiliations with research labs such as Deutsches Elektronen-Synchrotron and collaborative projects with teams at the University of Waterloo.

Throughout his career, Pass has collaborated with leading figures in cryptography and complexity theory, producing joint work with scholars affiliated with the International Association for Cryptologic Research, the Simons Institute for the Theory of Computing, and members of the ACM and IEEE. He has been an active participant and organizer of program committees for conferences like CRYPTO, FOCS, STOC, and TCC.

Research contributions and publications

Pass's research addresses foundational questions about what cryptographic tasks can be based on particular hardness assumptions and how proofs and reductions can be structured. He is known for results on black-box separations and reductions, building on lines of inquiry connected to work by researchers at the IBM T.J. Watson Research Center and groups around the Stanford University cryptography community. His publications analyze the relationships among primitives such as one-way functions, pseudorandom generators, and secure function evaluation, engaging with frameworks developed at the Crypto Group and formal models advanced by scholars at the Cornell University.

A central theme in his work is composability and concurrent security in settings modeled after the Universal Composability framework, linking to contributions by authors at the Weizmann Institute of Science and the Technion – Israel Institute of Technology. Pass has produced influential papers on statistically secure protocols and computationally binding commitments, engaging with prior results from the University of California, Berkeley and the Princeton University theoretical computer science groups. He has also worked on lower bounds and impossibility results, often drawing on techniques from complexity theory as developed at the Carnegie Mellon University and the University of Toronto.

In the area of quantum cryptography, Pass investigated the resilience of classical primitives against quantum adversaries and contributed to analyses related to post-quantum assumptions, liaising with researchers at the National Institute of Standards and Technology and teams working on quantum-resistant cryptographic standards. His bibliography includes numerous articles in venues such as Journal of Cryptology, proceedings of CRYPTO, and archives associated with the arXiv repository, often coauthored with collaborators from the École Normale Supérieure and the Max Planck Institute for Informatics.

Honors and awards

Pass's work has been recognized by awards and fellowships from organizations supporting theoretical computer science and cryptography. He has received grants and honors associated with the Simons Foundation, research fellowships from national science agencies, and invitations to give keynote lectures at major conferences including Eurocrypt and RSA Conference. His papers have been shortlisted for best paper distinctions at EUROCRYPT and acknowledged by program committees at STOC and FOCS.

He has also been listed among recipients of early-career awards and national science medals in countries where he held appointments or collaborations, with support from agencies like the National Science Foundation and the European Research Council.

Personal life and legacy

Outside academia, Pass has engaged in mentoring initiatives and outreach programs connected to mathematics and computing education in Brazil and abroad, collaborating with initiatives at the University of São Paulo and nonprofit organizations focusing on STEM access. Colleagues and students credit him with shaping lines of inquiry in cryptographic reductions and the study of composable security, influencing subsequent work at research centers including the Simons Institute and the Institute for Quantum Computing.

His legacy includes a body of theoretical results that continue to inform the design of cryptographic protocols and standards, and a generation of researchers trained under his supervision who occupy positions at institutions such as the University of California, Berkeley, the Massachusetts Institute of Technology, and the University of Toronto. He remains cited across surveys and textbooks dealing with cryptographic foundations and complexity-theoretic limits, ensuring ongoing relevance in both theoretical and applied communities.

Category:Brazilian computer scientists Category:Cryptographers Category:1977 births Category:Living people