Rafael Pass Assistant Professor Department of Computer Science Cornell University Ph.D, MIT, 2006 Mail: first name at cs.cornell.edu Telephone: +1 607 255 55 78 Address: Upson Hall, Cornell University Ithaca, NY 14853 USA

Summary I am an Assistant Professor in the Department of Computer Science at Cornell University since July 2006. I obtained my Ph.D in the Theory of Computation group at MIT with Silvio Micali as advisor. Previously, I completed my Licentiate Thesis (M.S.) under the supervision of Johan Hastad. My research focuses on Cryptography and its interplay with Computational Complexity and Game Theory. My work has been supported by a NSF Career Award, a Microsoft Faculty Fellowship, an AFOSR Young Investigator Award, an Alfred P. Sloan Foundation Fellowship as well as grants from AFOSR, BSF and DARPA. My CV: pdf (Sep 1, 2011) Teaching Spring 2012: COMS 2800 Discrete Structures (undergraduate) and COM S 7893 Crypto breakfast Fall 2011: COM S 6830 Introduction to Cryptography (graduate) and COM S 7893 Crypto breakfast. Spring 2011: COMS 2800 Discrete Structures (undergraduate) and COM S 7893 Crypto breakfast Fall 2010: COM S 4830 Introduction to Cryptography (undergraduate) and COM S 7893 Crypto breakfast. Spring 2010: COM S 7893 Crypto breakfast. Fall 2009: COM S 6830 Introduction to Cryptography (graduate) and COM S 7893 Crypto breakfast. Spring 2008: COM S 6810 Theory of Computing (graduate) and COM S 7893 Crypto breakfast Fall 2008: COM S 4830 Introduction to Cryptography (undergraduate) and COM S 7893 Crypto breakfast. Spring 2008: COM S 687 Cryptography (graduate) and Crypto breakfast. Fall 2007: COM S 487 Introduction to Cryptography (undergraduate) and Crypto breakfast. Spring 2007: COM S 787 Topics in Cryptography. Fall 2006: COM S 687 Cryptography (graduate). Lecture Notes R. Pass and W. Tseng: A Course in Discrete Structures. pdf (last updated Aug 2011) A undergraduate course in basic Discrete Mathematics, with applications in Cryptography and Game Theory. R. Pass and A. Shelat: A Course in Cryptography. pdf (last updated Jan 2010) An upper-level introductory undergraduate course in Cryptography. Current Ph.D. Students Eleanor Birrell Edward Lui Post Docs Kai-min Chung (Ph.D. Harvard) Mohammad Mahmoody (Ph.D. Princeton) Graduated Ph.D. Students Muthuramakrishnan Venkitasubramaniam (CI Fellow at NYU, now tenure-track faculty at U. Rochester) Huijia (Rachel) Lin (now postdoc at MIT) Wei-lung Dustin Tseng (now at Google) Program Commitees 31th Annual International Cryptology Conference (CRYPTO 2011) in Santa Barbara, CA, USA, August 2011. 30th Annual International Cryptology Conference (CRYPTO 2010) in Santa Barbara, CA, USA, August 2010. 1st Innovations in Computer Science (ICS 2010), Beijing, China, January 2010. 29th Annual International Cryptology Conference (CRYPTO 2009) in Santa Barbara, CA, USA, August 2009. 6th Theory of Cryptography Conference (TCC’09), 2009. 39th ACM Symposium on Theory of Computing (STOC’08) in Victoria, May, 2008. 35th International Colloquium on Automata, Languages and Programming (ICALP’08) in Reykjavik, July, 2008. RSA Conference 2008, Cryptographers’ Track (CT-RSA’08) in San Francisco, April 8-11, 2008. 34th International Colloquium on Automata, Languages and Programming (ICALP’07) in Wroclaw, July, 2007. 4th Theory of Cryptography Conference (TCC’07) in Amsterdam, Feb, 2007. Some Recent Talks Concurrency and Non-malleability (invited talk at TCC’11). ppt Limits of Provable Security from Standard Assumptions. ppt Constant-round Non-malleable Commitments from Any One-way Functions. ppt Papers 2011 The Randomness Complexity of Parallel Repetition. (FOCS’11) K. Chung and R. Pass. pdf Approximately Strategy-Proof Voting. (IJCAI’11) Eleanor Birrell and R. Pass. pdf Constant-round Non-malleable Commitments from Any One-way Function. (STOC’11) Huijia Lin and R. Pass. pdf Limits of Provable Security from Standard Assumptions. (STOC’11) R. Pass. pdf Public-coin Parallal Zero-knowledge for NP (Journal of Cryptology’11) Rafael Pass, Alon Rosen and Wei-lung Tseng. pdf Algorithmic Rationality: Adding Cost of Computation to Game Theory. (SIGECOM’11) J. Halpern and R. Pass. pdf Multi-verifier Signatures. (Journal of Cryptology’11) T. Roeder, R. Pass, and F. Schneider. pdf Concurrent Non-malleable Zero Knowledge with Adaptive Inputs. (TCC’11) H. Lin and R. Pass. pdf Towards Privacy in Social Networks: A Zero-knowledge Based Definition of Privacy. (TCC’11) J. Gehrke, R. Pass and E. Lui. pdf Towards Non-black-box Separations in Cryptography. (TCC’11) R. Pass, M. Venkitasubramaniam and W. Tseng. pdf Renegotiation-Safe Protocols. (ICS’11) R. Pass and A. Shelat. pdf 2010 Adaptive Hardness and Composable Security from Standard Assumptions. (FOCS’10) R. Canetti, H. Lin and R. Pass. pdf Invited to SIAM Journal of Computing, special issue for selected papers of FOCS 2010. Concurrent Non-malleable Zero Knowledge Proofs. (Crypto’10) H. Lin, R. Pass, M. Venkitasubramaniam and W. Tseng. pdf I Don’t Want to Think About it Now: Decision Theory with Costly Computation. (KR’10) J. Halpern and R. Pass. pdf Constant-round Non-malleable Commitments from Sub-Exponential One-way Functions. (EuroCrypt’10) R. Pass and H. Wee. pdf Eye for an Eye: Efficient Concurrent Zero Knowledge in the Timing Model. (TCC’10) R. Pass, M. Venkitasubramaniam and W. Tseng. pdf Private Coins versus Public Coins in Zero-Knowledge Proof Systems. (TCC’10) R. Pass, M. Venkitasubramaniam and W. Tseng. pdf An Efficient Parallel Repetition Theorem. (TCC’10) J. Hastad, R. Pass, D. Wikstrom and K. Pietrzak. pdf Game Theory with Costly Computation: Formulation and Application to Protocol Security. (ICS’10) J. Halpern and R. Pass. pdf This paper is significantly extended in the following two working papers Algorithmic Rationality: Game Theory with Costly Computation and A Computational Game-theoretic Framework for Cryptography). Algorithmic Rationality: Game Theory with Costly Computation. J. Halpern and R. Pass. pdf (preliminary version in ICS’10) A Computational Game-theoretic Framework for Cryptography. J. Halpern and R. Pass. pdf (preliminary version in ICS’10) Sequential Equilibrium and Perfect Equilibrium in Games of Imperfect Recall. J. Halpern and R. Pass. pdf Manuscript 2009 On the Composition of Public-coin Zero Knowledge. (Crypto’09, SICOMP’11) R. Pass, W. Tseng and D. Wikstrom. pdf A Logical Characterization of Iterated Admissibility. (TARK’09) J. Halpern and R. Pass. pdf An Epistemic Characterization of Zero Knowledge. (TARK’09) J. Halpern, R. Pass and V. Raman. pdf Iterated Regret Minimization: A New Solution Concept. (IJCAI’09) J. Halpern and R. Pass. pdf (Also presented at World Congress of Game Theory’08) Non-malleability Amplification. (STOC’09) H. Lin and R. Pass. pdf A Unified Framework for Concurrent Security: Universal Composability from Stand-alone Non-malleability. (STOC’09) H. Lin, R. Pass and M. Venkitasubramaniam. pdf Black-box Constructions of Two-party Protocols from One-way Functions. (TCC’09) R. Pass and H. Wee. 2008 Adaptive One-way Functions and Applications. (Crypto’08) O. Pandey, R. Pass and V. Vaikuntanathan. pdf Precise Concurrent Zero Knowledge. (EuroCrypt’08) O. Pandey, R. Pass, A. Sahai, W. Tseng and M. Venkitasubramaniam. pdf Concurrent Non-malleable Commitments from One-way Functions. (TCC’08) H. Lin, R. Pass and M. Venkitasubramaniam. pdf On Constant-Round Concurrent Zero Knowledge. (TCC’08) R. Pass and M. Venkitasubramaniam. pdf 2007 Precise Zero Knowledge. S. Micali and R. Pass. pdf Manuscript, December 2007. This version combines results from Local Zero Knowledge and Precise Cryptography Precise Cryptography. S. Micali and R. Pass. pdf Manuscript, September 2007. See Precise Zero Knowledge. Relations Among Notions of Non-malleability for Encryption. (AsiaCrypt’07) R. Pass, V. Vaikuntanathan and A. Shelat. pdf Bounded-CCA Secure Encryption. (AsiaCrypt’07) R. Cramer, G. Hanaoka, D. Hofheinz, H. Imai, E. Kiltz, R. Pass, A. Shelat and V. Vaikuntanathan. pdf Cryptography from Sunspots: How to Use an Imperfect Reference String. (FOCS’07) R. Canetti, R. Pass and A. Shelat. pdf An Efficient Parallel Repetition Theorem for Arthur-Merlin Games. (STOC’07) R. Pass and M. Venkitasubramaniam. pdf Universally Composable Protocols with Global Set-up. (TCC’07) R. Canetti, Y. Dodis, R. Pass and S. Walfish. pdf 2006 A Precise Computational Approach to Knowledge. R. Pass. pdf Ph.D Thesis. Massachusetts Institute of Technology, July 2006. Input-Indistinguishable Computation. (FOCS’06) S. Micali, R. Pass, A. Rosen. pdf Construction of a Non-Malleable Encryption Scheme From Any Semantically Secure One. (Crypto’06) R. Pass, A. Shelat and V. Vaikuntanathan. pdf On Arthur-Merlin Games and the Possibility of Basing Cryptography on NP-Hardness. (Complexity'06) R. Pass. pdf Invited to Computational Complexity, special issue on Conference of Computational Complexity 2006. Local Zero Knowledge. (STOC'06) S. Micali and R. Pass. See A Precise Computational Approach to Knowledge for a longer version. 2005 Concurrent Non-Malleable Commitments. (FOCS'05, SICOMP’08) R. Pass and A. Rosen. pdf SIAM Journal of Computing, special issue for selected papers of FOCS 2005. Unconditional Characterizations of Non-Interactive Zero-Knowledge. (CRYPTO'05) R. Pass and A. Shelat. ps , pdf Secure Computation Without Authentication. (CRYPTO'05) B. Barak, R. Canetti, Y. Lindell, R. Pass and T. Rabin. ps , pdf New and Improved Constructions of Non-Malleable Cryptographic Protocols. (STOC'05, SICOMP’08) R. Pass and A. Rosen. pdf SIAM Journal of Computing, special issue for selected papers of STOC 2005. 2004 Universally Composable Protocols with Relaxed Set-up Assumptions. (FOCS'04) B. Barak, R. Canetti, J. Nielsen and R. Pass. ps , pdf Bounded-Concurrent Secure Multi-Party Computation with a Dishonest Majority. (STOC'04) R. Pass. ps , pdf On the Possibility of One-Message Weak Zero-Knowledge. (TCC'04) B. Barak and R. Pass. ps , pdf Alternative Variants of Zero-Knowledge Proofs. R. Pass. ps , pdf Licentiate (Master's) Thesis. ISBN 91-7283-933-3, 2004. 2003 Bounded-Concurrent Secure Two-Party Computation in a Constant Number of Rounds. (FOCS'03) R. Pass and A. Rosen. ps , pdf On Deniabililty in the Common Reference String and Random Oracle Models. (CRYPTO'03) R. Pass. See Part II in Alternative Variants of Zero-Knowledge Proofs for a longer version. Simulation in Quasi-Polynomial Time and Its Application to Protocol Composition. (EUROCRYPT'03) R. Pass. See Part I in Alternative Variants of Zero-Knowledge Proofs for a longer version. This material is based upon work supported by the National Science Foundation, AFOSR, U.S. Department of Homeland Security, BSF, Sloan Foundation and Microsoft. Any opinions, findings, and conclusions or recommendations expressed in this publications are those of the author(s) and do not necessarily reflect the views of the NSF, AFOSR, DHS, BSF, Sloan Foundation or Microsoft.