Summary
I am an Associate Professor in the Department
of Computer Science at Cornell University and at Cornell NYC Tech.
I obtained my Ph.D in 2006 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
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
- Edward Lui
- Lior Seeman (joint with Joseph Halpern)
- Sidharth Telang
- Karn Seth
Post Docs
- Kai-min Chung (Ph.D. Harvard,
now tenure-track at Academia Sinica)
- Mohammad Mahmoody
(Ph.D. Princeton, now at tenure-track at UVA)
- Elette Boyle
(Ph.D. MIT)
Graduated Ph.D. Students
Program Commitees
- 34th Annual
International Cryptology Conference (CRYPTO 2014) in Santa Barbara,
CA, USA, 2014.
31th Annual International Conference
on the Theory and Applications of Cryptographic Techniques (EuroCrypt
2014) in Copenhagen, Denmark, 2014.
- 26th Annual IEEE Computer Security
Foundations (CSF 2013) in New Orleans, 2013.
- 53rd Annual IEEE Symposium
on Foundations of Computer Science (FOCS 2012) in New Brunswick, 2012.
- 31th Annual
International Cryptology Conference (CRYPTO 2011) in Santa Barbara,
CA, USA, 2011.
- 30th Annual
International Cryptology Conference (CRYPTO 2010) in Santa Barbara,
CA, USA, 2010.
- 1st Innovations in
Computer Science (ICS 2010), Beijing, China, 2010.
- 29th Annual
International Cryptology Conference (CRYPTO 2009) in Santa Barbara,
CA, USA, 2009.
- 6th Theory of Cryptography
Conference (TCCÕ09),
2009.
- 39th ACM Symposium on Theory
of Computing (STOCÕ08) in Victoria, 2008.
- 35th International Colloquium on
Automata, Languages and Programming (ICALPÕ08) in Reykjavik, 2008.
- RSA Conference 2008,
CryptographersÕ Track (CT-RSAÕ08) in San Francisco, 2008.
- 34th International Colloquium on
Automata, Languages and Programming (ICALPÕ07) in Wroclaw, 2007.
- 4th Theory of Cryptography Conference
(TCCÕ07) in Amsterdam, 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
Manuscripts
- Unprovable Security of
Two-Message Zero-Knowledge
K. Chung, E. Lui, M. Mahmoody, and R.
Pass. pdf
- A
Simple ORAM
K. Chung and R.
Pass. pdf
- Statistically-secure
ORAM with \tilde{O}(log^2 n) Overhead
K. Chung, Z. Lui and R. Pass. pdf
- On
the Impossibility of Tamper-Resilient Cryptography
P. Austrin, K. Chung, M. Mahmoody,
R. Pass and K. Seth. pdf
2013
- Knowledge-Preserving
Interactive Coding (FOCSÕ13)
K. Chung, R. Pass
and S. Telang. pdf
- Constant-round
Concurrent Zero-knowledge from P-Certificates (FOCSÕ13)
K. Chung, H. Lui and R. Pass. pdf
- From
Unprovability to Enviromental
Friendly protocols (FOCSÕ13)
K. Chung, H. Lui and R. Pass. pdf
- Simultaneous
Resettability From One-way Functions (FOCSÕ13)
K. Chung, R. Ostrovsky, R. Pass and I. Visconti. pdf
- Non-black-box
Simulation from One-way Functions and Applications to Resettable Security (STOCÕ13)
K. Chung, R. Pass
and K. Seth. pdf
- Sequential
Equilibrium in Computational Games (IJCAIÕ13)
J. Halpern and R. Pass. pdf
- Conservative
Belief and Rationality (Games
and Economic BehaviorÕ13)
J. Halpern and R. Pass. pdf
- Unprovable Security of
Perfect NIZK and Non-interactive Non-malleable Commitments (TCCÕ13)
R. Pass. pdf
- Randomness
Dependent Security (TCCÕ13)
E. Birrell, K. Chung, R. Pass and S. Telang.
pdf
- Game
Theory with Translucent Players (TARKÕ13)
J. Halpern and R. Pass. pdf
- Language-based
Games (TARKÕ13)
A. Bjorndahl, J.
Halpern and R. Pass. pdf
- On
the Power of Many One-Bit Provers (ITCSÕ13)
P. Austrin, J. Hastad, and R. Pass. pdf
- On
the Power of Non-uniform Proofs of Security (ITCSÕ13)
K. Chung, H. Lin, M. Mahmoody, and R. Pass. pdf
- A
Cryptographic Treatment of Forecast Testing (ITCSÕ13)
K. Chung, E. Lui, and
R. Pass. pdf
2012
- Concurrent
Zero-knowledge, Revisited (Journal of
CryptologyÕ12)
Rafael Pass, Wei-lung Tseng, and M. Venkitasubramaniam.
pdf
- Crowd-blending
Privacy (CryptoÕ12)
J. Gehrke, M. Hay, E. Lui and R. Pass. pdf
- The
Curious Case of Non-interactive Commitments: On The Power of Black-box v.s. Non-black-box Use of Primitives (CryptoÕ12)
M. Mahmoody and R.
Pass. pdf
- Black-box
Constructions of Composable Protocols Without
Set-up (CryptoÕ12)
H. Lin and R. Pass. pdf
- IÕm
doing as Well as a I Can: Modeling People and
Rational Finite Automata (AAAIÕ12)
J. Halpern, R. Pass, and L. Seeman. pdf
- The
Knowledge Tightness of Parallel Zero-knowledge (TCCÕ12)
K. Chung, R. Pass and W. Tseng. pdf
- Multi-verifier
Signatures. (Journal of CryptologyÕ12)
T. Roeder, R. Pass, and F. Schneider. pdf
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
Parallel 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
- Reasoning
About Justified Belief. (TARKÕ11)
A. Bjorndahl, J. Halpern and R. Pass. 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 and M. Venkitasubramaniam. 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)
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, Games and Economic BehaviorÕ12)
J. Halpern and R. Pass. pdf
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. pdf
- Secure
Computation Without Authentication. (CRYPTO'05)
B. Barak, R. Canetti, Y. Lindell, R. Pass and T.
Rabin. 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. pdf
- Bounded-Concurrent
Secure Multi-Party Computation with a Dishonest Majority. (STOC'04)
R. Pass. pdf
- On
the Possibility of One-Message Weak Zero-Knowledge.
(TCC'04)
B. Barak and R. Pass. pdf
- Alternative
Variants of Zero-Knowledge Proofs.
R. Pass. 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. 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.