(original) (raw)
��
<o:p>
| <![if !vml]> <o:p> <![if !vml]> <o:p> | <o:p> <o:p> <o:p> <o:p> <o:p> <o:p> Rafael Pass<o:p> Professor <o:p> Jacobs Technion-Cornell Institute<o:p> Dept of CS @ Cornell Tech and Cornell University<o:p> <o:p> Visiting Professor<o:p> Technion, Faculty of Computer Science<o:p> <o:p> Cornell-Technion Liason.<o:p> <o:p> Ph.D, MIT, 2006<o:p> first name at cs.cornell.edu<o:p> <o:p> |
<![endif]>
<![endif]><o:p><o:p>
Summary<o:p>
I am a Professor at the Jacobs Technion-Cornell Institute at Cornell Tech, and the Department of Computer Science at Cornell University. <o:p>
I am also a Visiting Professor in the Faculty of Computer Science at the Technion in Israel.<o:p>
I teach the Fall semester at Cornell Tech in NYC and the Spring semester at the Technion in Israel, and serve as the Cornell-Technion Liason.<o:p>
(I am also a Professor of Computer Science at Tel-Aviv University, where I hold the Chair in Cryptography and Information Security, currently on leave.)<o:p>
<o:p>
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. <o:p>
My research focuses on Cryptography and its interplay with Computational Complexity and Game Theory; lately, I have become increasingly interested in the theoretical foundations of blockchains, and even more recently on connections between Cryptography and Kolmogorov complexity (some recent media coverage about this line of work: [quanta] [quanta] [quanta-science-podcast] [info-security-mag] [pour-la-science]; and here is a lighter pop-sci podcast that includes interviews with Diffie and Hellman [Vox])<o:p>
<o:p>
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, a Wallenberg Academy Award, a Google Faculty Award, a JP Morgan Faculty award, as well as grants from AFOSR, BSF, DARPA and IARPA. <o:p>
<o:p>
I am an ACM Fellow and an IACR Fellow.<o:p>
<o:p>
My CV: pdf <o:p>
<o:p>
Books/Lecture Notes<o:p>
- R. Pass: A Course in Networks and Markets: Game-theoretic Models and Reasoning.
The MIT Press, 2019. Free HTML version.<o:p> - 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.<o:p> - R. Pass and A. Shelat: A Course in Cryptography. pdf (last updated Jan 2010).
An upper-level introductory undergraduate course in Cryptography. <o:p>
<o:p>
Projects<o:p>
- anonize.org: An anonymous and accountable survey system
Our system is e.g., used in the Brave browser (founded by Mozilla co-founder Brendan Eich) to enable large-scale anonymous and accountable collection of browsing statistics, with 68M monthly active users.<o:p>
<o:p>
Teaching<o:p>
- CS 5854 Networks and Markets (Meng) [Sp 21] [Fa 20] [Fa 19] [Sp 19] [Fa 17] [Fa 16]<o:p>
- CS 5433 Blockchains, Cryptocurrencies and Smart Contracts [Sp 18]<o:p>
- NBAY 5710 Blockchains and Cryptocurrencies (for MBA) [Sp 21] [Fa 20] [Sp 19] [Fa 18] [Sp 18]� <o:p>
- CS 6830 Cryptography (Ph.D) [Fa 18] [Sp 17] [Sp 16] [Fa 14] [Fa 11] [Fa 09] [Fa 08] [Fa 06]<o:p>
- CS 5831 Security Protocols and Privacy (MEng) [Sp 14]<o:p>
- CS 5830 Cryptography (MEng) [Sp 18] [Fa 13]<o:p>
- CS 4830 Introduction to Cryptography (undergraduate) [Fa 10] [Fa 08] [Fa 07]<o:p>
- CS 2800 Discrete Structures (undergraduate) [Sp 13] [Sp 12] [Sp 11]<o:p>
- CS 6810 Theory of Computing (Ph. D) [Sp 08]<o:p>
- CS 787�� Topics in Cryptography [Sp 07]<o:p>
- CS 7893 Crypto breakfast (Ph. D) every semester since 08<o:p>
- NBAY 5400 Tech for Business (MBA) [Fa 16] [Fa 15]<o:p>
<o:p>
Current Ph.D. Students <o:p>
- Yanyi Liu<o:p>
- Benjamin Chan<o:p>
- Eden Aldema Tshuva<o:p>
- Tomer Solomon
<![if !supportLineBreakNewLine]>
<![endif]><o:p>
Graduated Ph.D. Students<o:p>
- Muthuramakrishnan Venkitasubramaniam (CI Fellow at NYU, now tenured at U. Rochester)<o:p>
- Huijia (Rachel) Lin (postdoc at MIT & BU, now tenured at UW)<o:p>
- Wei-lung Dustin Tseng (now at Google)<o:p>
- Lior Seeman (co-advised with Joseph Halpern, now at Uber Research)<o:p>
- Edward Lui (now at start-up)<o:p>
- Adam Bjorndahl (co-advised with Joseph Halpern, now tenure-track at CMU)<o:p>
- Karn Seth (now at Google Research)<o:p>
- Sidharth Telang (now at Google)<o:p>
- Antonio Marcedone (Cryptography Lead at Zoom)<o:p>
- Andrew Morgan<o:p>
- Cody Freitag (postdoc Northeastern)<o:p>
- Naomi Ephraim (tenure-track at Drexler)<o:p>
<o:p>
Current and Previous Post Docs<o:p>
- Ilan Komargodski (Ph.D. Weizmann, joint with Elaine Shi, now tenure-track at Hebrew University,)<o:p>
- Antigoni Polychroniadou (Ph.D Aarhus, joint with Elaine Shi, now at JP Morgan AI)<o:p>
- Gilad Asharov (Ph.D. Bar-Ilan, Simons fellow, now at JP Morgan AI and tenure-track at Bar-Ilan U.)<o:p>
- Elette Boyle (Ph.D. MIT, now tenured at Reichman University)<o:p>
- Kai-min Chung (Ph.D. Harvard, now tenured at Academia Sinica) <o:p>
- Mohammad Mahmoody (Ph.D. Princeton, now tenured at UVA)<o:p>
- Romain Gay (Ph.D. ENS, now at IBM Research)<o:p>
- Daneil Reichman (Ph.D Weizmann, joint with Joe Halpern, now tenure-track at RPI)<o:p>
- Noam Mazor<o:p>
- Gilad Stern<o:p>
<o:p>
Some on-line papers� (see DBLP for a complete list)<o:p>
<o:p>
Recent Manuscript:<o:p>
- On One-way Functions from NP-Complete Problems
Yanyi Liu and Rafael Pass pdf <o:p> - A Note on One-way Functions and Sparse Languages
Yanyi Liu and Rafael Pass pdf<o:p>
<o:p>
2021<o:p>
<o:p>
- On the Possibility of Basing Cryptography on EXP \neq BPP (Crypto 21, winner of the best paper award)
Yanyi Liu and Rafael Pass pdf <o:p> - Cryptography from Sublinear-time Average-case Hardness of Time-bounded Kolmogorov Complexity (STOC 21)
Yanyi Liu and Rafael Pass pdf<o:p> - Indistinguishability Obfuscation from Circular Security (STOC 21)
Romain Gay and Rafael Pass pdf<o:p> - Non-malleable Time-Lock Puzzles and Applications. (TCC 2021)
Cody Freitag, Ilan Komargodski, Rafael Pass, Naomi Sirkin pdf<o:p> - Non-malleable Codes for Bounded Parallel-Time Tampering (CRYPTO 21)
Dana Dachman-Soled, Ilan Komargodski and Rafael Pass pdf<o:p>
<o:p>
2020<o:p>
- On One-way Functions and Kolmogorov Complexity (FOCS 20)
Yanyi Liu and Rafael Pass pdf<o:p> - Is it Easier to Prove Theorems that are Guaranteed to be True? (FOCS 20)
Rafael Pass and Muthuramakrishnan Venkitasubramaniam pdf<o:p> - SPARKs: Succinct Parallelizable Arguments of Knowledge (EUROCRYPT 20)
Naomi Ephraim, Cody Freitag, Ilan Komargodski and Rafael Pass pdf<o:p> - Continuous Verifiable Delay Functions (EUROCRYPT 20)
Naomi Ephraim, Cody Freitag, Ilan Komargodski and Rafael Pass pdf<o:p> - Succinct Non-Interactive Secure Computation (EUROCRYPT 20)
Andrew Morgan and Rafael Pass and Antigoni Polychroniadou pdf<o:p> - Which Languages Have 4-Round Fully Black-Box Zero-Knowledge Arguments from One-Way Functions? (EUROCRYPT 20)
Carmit Hazay, Rafael Pass, and Muthuramakrishnan Venkitasubramaniam pdf<o:p> - On the Adaptive Security of MACs and PRFs (ASIACRYPT 20)
Andrew Morgan, Rafael Pass, Elaine Shi pdf<o:p> - Impossibility of Strong KDM Security with Auxiliary Input. (SCN 2020)
Cody Freitag, Ilan Komargodski, Rafael Pass pdf pdf<o:p> - Unprovability of Leakage-Resilient Cryptography Beyond the Information-Theoretic Limit. (SCN 2020)
Rafael Pass pdf<o:p>
<o:p>
<o:p>
2019<o:p>
- Non-Uniformly Sound Certificates with Applications to Concurrent Zero-Knowledge. (CRYPTO 19)
Cody Freitag, Ilan Komargodski, Rafael Pass pdf<o:p> - A tutorial on concurrent zero-knowledge (Providing Sound Foundations for Cryptography 20)
Rafael Pass pdf<o:p> - Paradoxes in Fair Computer-Aided Decision Making. (AIES 19)
Andrew Morgan, Rafael Pass pdf<o:p>
- Locality-preserving ORAM (EUROCRYPT 2019)
G. Asharov, H. Chan, K. Nayak, R. Pass, L. Ren and E. Shi pdf<o:p> - Snow White: Robustly Reconfigurable Consensus and Applications to Provably Secure Proof of Stake (FC 19)
P. Daian, R. Pass and E. Shi pdf<o:p> - Minimizing Trust in Hardware Wallets with Two Factor Signatures. (FC 19)
Antonio Marcedone, Rafael Pass, Abhi Shelat pdf<o:p> - On the Existence of Nash Equilibrium in Games with Resource-Bounded Players. (SAGT 19)
Joseph Y. Halpern, Rafael Pass, Daniel Reichman pdf<o:p> - Blind Certificate Authorities. (Oakland 19)
Liang Wang, Gilad Asharov, Rafael Pass, Thomas Ristenpart, Abhi Shelat pdf<o:p> - A Conceptually Well-Founded Characterization of Iterated Admissibility Using an "All I Know" Operator. (TARK 19)
Joseph Y. Halpern, Rafael Pass pdf<o:p>
<o:p>
<o:p>
2018<o:p>
<o:p>
- On the Complexity of Compressing Obfuscation. (CRYPTO 18)
Gilad Asharov, Naomi Ephraim, Ilan Komargodski, Rafael Pass: pdf<o:p> - Thunderella: Blockchains with Optimistic Instant Confirmation. (EUROCRYPT 18)
Rafael Pass, Elaine Shi pdf<o:p> - On the Security Loss of Unique Signatures. (TCC� 18)
Andrew Morgan, Rafael Pass: pdf<o:p> - Achieving Fair Treatment in Algorithmic Classification. (TCC 18)
Andrew Morgan, Rafael Pass pdf<o:p> - Game Theoretic Notions of Fairness in Multi-party Coin Toss. (TCC 18)
Kai-Min Chung , Yue Guo, Wei-Kai Lin, Rafael Pass, Elaine Shi pdf<o:p> - Can We Access a Database Both Locally and Privately? (TCC 18)
E. Boyle, Y. Ishai, R. Pass, and M. Wootters pdf<o:p> - Socially Optimal Mining Pools (EC 18)
B. Fisch, R. Pass and A. Shelat pdf<o:p>
<o:p>
<o:p>
2017<o:p>
- Two-Round and Non-interactive Concurrent Non-Malleable Commitment from Time-Lock Puzzles (FOCS 17, SICOMP 2020)
H. Lin, R. Pass and P. Soni pdf<o:p> - Analysis of the Blockchain Protocol in Asynchronous Networks (EUROCRYPT 17)
R. Pass, L. Seeman and A. Shelat pdf<o:p> - Formal Abstractions for Attested Execution Secure Processors (EUROCRYPT� 17)
Rafael Pass, Elaine Shi, Florian Tramer pdf<o:p> - FruitChains: A Fair Blockchain (PODC 17)
R. Pass and E. Shi pdf<o:p> - The Sleepy Model of Consensus (ASIACRYPT 17)
R. Pass and E. Shi pdf<o:p> - A Knowledge-Based Analysis of the Blockchain Protocol (TARK 17)
J. Halpern and R. Pass pdf<o:p> - Hybrid Consensus: Efficient Consensus in the Permissionless Model (DISC 17)
R. Pass and E. Shi pdf<o:p> - Reasoning about rationality. (GEB 17)<o:p>
Adam Bjorndahl, Joseph Y. Halpern, Rafael Pass pdf<o:p>
<o:p>
2016<o:p>
- Sequential Equilibrium in Games of Imperfect Recall (KR 16, ACM TEAC 19)
J. Halpern and R. Pass pdf<o:p> - Indistinguishability Obfuscation with Non-trivial Efficiency (PKC 16)
H. Lin, R. Pass, K. Seth, and S. Telang pdf<o:p> - Bounded KDM Security from iO and OWF (SCN 16)
A. Marcedone, R. Pass, and A. Shelat pdf<o:p> - Computational Extensive-Form Games (EC 16)
J. Halpern, R. Pass, and L. Seeman pdf<o:p> - Impossibility of VBB Obfuscation with Ideal Constant-Degree Graded Encodings (TCC 16)
R. Pass and A. Shelat pdf<o:p> - Lower Bounds on Assumptions Behind Indistinguishability Obfuscation (TCC 16)
M. Mahmoody, A. Mohammed, S. Nematihaji, R. Pass, and A. Shelat pdf<o:p> - Output-Compressing Randomized Encodings and Applications (TCC 16)
H. Lin, R. Pass, K. Seth, and S. Telang pdf<o:p> - Oblivious Parallel RAM and Applications (TCC 16)
Elette Boyle, Kai-Min Chung, Rafael Pass pdf<o:p>
<o:p>
2015<o:p>
- Tight Revenue Bounds with Possibilistic Beliefs and Level-k Rationality (Econometrica 2015)
J. Chen, S. Micali, R. Pass pdf supplement<o:p> - Algorithmic rationality: Game theory with costly computation (J. Economic Theory 2015)
J. Halpern and R. Pass pdf<o:p> - Limits of Extractability Assumptions with Distributional Auxiliary Input (ASIACRYPT 15)
E. Boyle and R. Pass pdf<o:p> - Micropayments for Decentralized Currencies (CCS 15)
R. Pass and A. Shelat pdf<o:p> - Constant-Round Concurrent Zero-Knowledge from Indistinguishability Obfuscation (CRYPTO 15)
K. Chung, H. Lin and R. Pass pdf<o:p> - Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM Programs (CRYPTO 15)
E. Boyle, K. Chung, R. Pass pdf<o:p> - Voting with Coarse Beliefs (ITCS 15)
S. Leung, E. Lui, and R. Pass pdf<o:p> - Better Outcomes from More Rationality (ITCS 15)
J. Chen, S. Micali, R. Pass
Superseeded by Tight Revenue Bounds with Possibilistic Beliefs and Level-k Rationality (Econometrica 2015)<o:p> - Succinct Randomized Encodings and their Applications (STOC 15)
N. Bitansky, S. Garg, H. Lin, R. Pass and S. Telang pdf
Invited to SIAM Journal of Computing, special issue for selected papers of STOC 2015.<o:p> - From Weak to Strong Zero-Knowledge and Applications (TCC 15)
K. Chung, E. Lui, and R. Pass pdf<o:p> - Tight Parallel Repetition Theorems for Public-Coin Arguments Using KL-Divergence (TCC 15)
K. Chung and R.Pass pdf<o:p> - Round-Efficient Concurrently Composable Secure Computation via a Robust Extraction Lemma (TCC 15)
V. Goyal, H. Lin, O. Pandey, R. Pass, and A. Sahai pdf<o:p> - Outlier Privacy (TCC 15)
E. Lui, and R. Pass pdf<o:p> - Bayesian Games with Intentions (TARK 15, GEB 2020)
A. Bjorndahl, J. Halpern, and R Pass pdf<o:p>
<o:p>
2014<o:p>
- Concurrent Zero Knowledge, Revisited (J. Cryptology 2014)
R. Pass, W. Tseng and M. Venkitasubramaniam pdf<o:p> - On the Impossibility of Black-Box Transformations in Mechanism Design (SAGT 2014)
R. Pass, K. Seth pdf���� <o:p> - ANONIZE: A Large-Scale Anonymous Survey System (Oakland 14, IEEE Security & Privacy 2015)
S. Hohenberger, S. Myers, R. Pass and A. Shelat pdf
Invited to the special issue in IEEE Security & Privacy for selected papers from Oakland 14.<o:p> - Not Just an Empty Threat: Subgame-Perfect Equilibrium in Repeated Games Played by Computationally Bounded Players (WINE 2014)
J. Halpern, R. Pass and L. Seeman. pdf<o:p> - One-way Functions and (Imperfect) Obfuscation (FOCS 14)
I. Komargodski, T. Moran, M. Naor, R. Pass, A. Rosen and E. Yogev. pdf<o:p> - On the Impossibility of Tamper-Resilient Cryptography (CRYPTO 14, Algorithmica 17)
P. Austrin, K. Chung, M. Mahmoody, R. Pass and K. Seth. pdf<o:p> - Indistinguishability Obfuscation from Semantically-secure Multilinear Graded Encodings (CRYPTO 14)
R. Pass, K. Seth and S. Telang. pdf<o:p> - Reasoning About Rationality (KR 14, GEB 2016)
A. Bjorndahl, J. Halpern and R. Pass. pdf<o:p> - The Truth Behing the Myth of the Folk Theorem (ITCS 14, GEB 19)
J. Halpern, R. Pass, and L. Seeman. pdf<o:p> - On Extractability (a.k.a. Differing-Input) Obfuscation (TCC 14)
E. Boyle, K. Chung, R. Pass pdf<o:p> - 4-Round Resettably-Sound Zero-Knowledge (TCC 14)
K. Chung, R. Ostrovsky, R. Pass, I. Visconti and M. Venkitasubramaniam. pdf<o:p> - Statistically-secure ORAM with \tilde{O}(log^2 n) Overhead (AsiaCrypt 14)
K. Chung, Z. Lui and R. Pass. pdf<o:p>
<o:p>
2013<o:p>
- Knowledge-Preserving Interactive Coding (FOCS 13)
K. Chung, R. Pass and S. Telang. pdf<o:p> - Constant-round Concurrent Zero-knowledge from P-Certificates (FOCS 13)
K. Chung, H. Lui and R. Pass. pdf<o:p> - From Unprovability to Enviromental Friendly protocols (FOCS 13)
K. Chung, H. Lui and R. Pass. pdf<o:p> - Simultaneous Resettability From One-way Functions (FOCS 13)
K. Chung, R. Ostrovsky, R. Pass and I. Visconti. pdf<o:p>
- Non-black-box Simulation from One-way Functions and Applications to Resettable Security (STOC 13, SICOMP 2016)
K. Chung, R. Pass and K. Seth. pdf
SIAM Journal of Computing, special issue for selected papers of STOC 2013.<o:p> - Sequential Equilibrium in Computational Games (IJCAI 13)
J. Halpern and R. Pass. pdf<o:p> - Conservative Belief and Rationality (Games and Economic Behavior 13)
J. Halpern and R. Pass. pdf<o:p> - Unprovable Security of Perfect NIZK and Non-interactive Non-malleable Commitments (TCC 13, Computational Complexity 2016)
R. Pass. pdf
Invited to the JoC special issue of selected papers from TCC 13.
Invited to the TCC 10-year anniversary special issue in Computational Complexity.<o:p> - Randomness Dependent Security (TCC 13)
E. Birrell, K. Chung, R. Pass and S. Telang. pdf<o:p> - Game Theory with Translucent Players (TARK 13)
J. Halpern and R. Pass. pdf<o:p> - Language-based Games (TARK 13)
A. Bjorndahl, J. Halpern and R. Pass. pdf<o:p> - On the Power of Many One-Bit Provers (ITCS 13)
P. Austrin, J. Hastad, and R. Pass. pdf<o:p> - On the Power of Non-uniform Proofs of Security (ITCS 13)
K. Chung, H. Lin, M. Mahmoody, and R. Pass. pdf<o:p> - A Cryptographic Treatment of Forecast Testing (ITCS 13)
K. Chung, E. Lui, and R. Pass. pdf<o:p> - A Simple ORAM (manuscript 2013)
K. Chung and R. Pass. pdf<o:p>
<o:p>
2012<o:p>
- Concurrent Zero-knowledge, Revisited (Journal of Cryptology 12)
Rafael Pass, Wei-lung Tseng, and M. Venkitasubramaniam. pdf<o:p> - Crowd-blending Privacy (Crypto 12)
J. Gehrke, M. Hay, E. Lui and R. Pass. pdf<o:p> - 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<o:p> - Black-box Constructions of Composable Protocols Without Set-up (Crypto 12)
H. Lin and R. Pass. pdf<o:p> - 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<o:p> - The Knowledge Tightness of Parallel Zero-knowledge (TCC 12)
K. Chung, R. Pass and W. Tseng. pdf<o:p> - Multi-verifier Signatures. (Journal of Cryptology 12)
T. Roeder, R. Pass, and F. Schneider. pdf<o:p> - Unprovable Security of Two-Message Zero-Knowledge (manuscript 2012)
K. Chung, E. Lui, M. Mahmoody, and R. Pass. pdf<o:p>
<o:p>
2011<o:p>
- The Randomness Complexity of Parallel Repetition. (FOCS 11)
K. Chung and R. Pass. pdf<o:p> - Approximately Strategy-Proof Voting. (IJCAI 11)
Eleanor Birrell and R. Pass. pdf<o:p> - Constant-round Non-malleable Commitments from Any One-way Function. (STOC 11, JACM 2015)
Huijia Lin and R. Pass. pdf <o:p> - Limits of Provable Security from Standard Assumptions. (STOC 11)
R. Pass. pdf<o:p> - Public-coin Parallel Zero-knowledge for NP (Journal of Cryptology 11)
Rafael Pass, Alon Rosen and Wei-lung Tseng. pdf<o:p> - Algorithmic Rationality: Adding Cost of Computation to Game Theory. (SIGECOM 11)
J. Halpern and R. Pass. pdf<o:p> - Reasoning About Justified Belief. (TARK 11)
A. Bjorndahl, J. Halpern and R. Pass. pdf<o:p> - Concurrent Non-malleable Zero Knowledge with Adaptive Inputs. (TCC 11)
H. Lin and R. Pass. pdf <o:p> - Towards Privacy in Social Networks: A Zero-knowledge Based Definition of Privacy. (TCC 11)
J. Gehrke, R. Pass and E. Lui. pdf <o:p> - Towards Non-black-box Separations in Cryptography. (TCC 11)
R. Pass, M. Venkitasubramaniam and W. Tseng. pdf <o:p> - Renegotiation-Safe Protocols. (ICS 11)
R. Pass and A. Shelat. pdf
<![if !supportLineBreakNewLine]>
<![endif]><o:p>
2010<o:p>
- Adaptive Hardness and Composable Security from Standard Assumptions. (FOCS 10, SICOMP 2016)
R. Canetti, H. Lin and R. Pass. pdf
SIAM Journal of Computing, special issue for selected papers of FOCS 2010.<o:p> - Concurrent Non-malleable Zero Knowledge Proofs. (Crypto 10)
H. Lin, R. Pass, M. Venkitasubramaniam and W. Tseng. pdf<o:p> - I Don t Want to Think About it Now: Decision Theory with Costly Computation. (KR 10)
J. Halpern and R. Pass. pdf<o:p> - Constant-round Non-malleable Commitments from Sub-Exponential One-way Functions. (EuroCrypt 10)
R. Pass and H. Wee. pdf<o:p> - Eye for an Eye: Efficient Concurrent Zero Knowledge in the Timing Model. (TCC 10)
R. Pass, M. Venkitasubramaniam and W. Tseng. pdf<o:p> - Private Coins versus Public Coins in Zero-Knowledge Proof Systems. (TCC 10)
R. Pass and M. Venkitasubramaniam. pdf<o:p> - An Efficient Parallel Repetition Theorem. (TCC 10)
J. Hastad, R. Pass, D. Wikstrom and K. Pietrzak. pdf<o:p> - 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).<o:p> - Algorithmic Rationality: Game Theory with Costly Computation.
J. Halpern and R. Pass. pdf (preliminary version in ICS 10)<o:p> - A Computational Game-theoretic Framework for Cryptography.
J. Halpern and R. Pass. pdf (preliminary version in ICS 10)<o:p>
<o:p>
2009<o:p>
- On the Composition of Public-coin Zero Knowledge. (Crypto 09, SICOMP 11)
R. Pass, W. Tseng and D. Wikstrom. pdf<o:p> - A Logical Characterization of Iterated Admissibility. (TARK 09)
J. Halpern and R. Pass. pdf<o:p> - An Epistemic Characterization of Zero Knowledge. (TARK 09)
J. Halpern, R. Pass and V. Raman. pdf<o:p> - 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<o:p> - A Unified Framework for Concurrent Security: Universal Composability from Stand-alone Non-malleability. (STOC 09)
H. Lin, R. Pass and M. Venkitasubramaniam. pdf<o:p> - Black-box Constructions of Two-party Protocols from One-way Functions. (TCC 09)
R. Pass and H. Wee.
<![if !supportLineBreakNewLine]>
<![endif]><o:p>
2008 <o:p>
- Adaptive One-way Functions and Applications. (Crypto 08)
O. Pandey, R. Pass and V. Vaikuntanathan. pdf<o:p> - Precise Concurrent Zero Knowledge. (EuroCrypt 08)
O. Pandey, R. Pass, A. Sahai, W. Tseng and M. Venkitasubramaniam. pdf<o:p> - Concurrent Non-malleable Commitments from One-way Functions. (TCC 08)
H. Lin, R. Pass and M. Venkitasubramaniam. pdf<o:p> - On Constant-Round Concurrent Zero Knowledge. (TCC 08)
R. Pass and M. Venkitasubramaniam. pdf<o:p>
<o:p>
2007 <o:p>
- Precise Zero Knowledge.
S. Micali and R. Pass. pdf
Manuscript, December 2007.
This version combines results from Local Zero Knowledge and Precise Cryptography<o:p> - Precise Cryptography.
S. Micali and R. Pass. pdf
Manuscript, September 2007. See Precise Zero Knowledge.<o:p> - Relations Among Notions of Non-malleability for Encryption. (AsiaCrypt 07)
R. Pass, V. Vaikuntanathan and A. Shelat. pdf<o:p> - Bounded-CCA Secure Encryption. (AsiaCrypt 07)
R. Cramer, G. Hanaoka, D. Hofheinz, H. Imai, E. Kiltz, R. Pass, A. Shelat and V. Vaikuntanathan. pdf<o:p> - Cryptography from Sunspots: How to Use an Imperfect Reference String. (FOCS 07)
R. Canetti, R. Pass and A. Shelat. pdf<o:p> - An Efficient Parallel Repetition Theorem for Arthur-Merlin Games. (STOC 07)
R. Pass and M. Venkitasubramaniam. pdf <o:p> - Universally Composable Protocols with Global Set-up. (TCC 07)
R. Canetti, Y. Dodis, R. Pass and S. Walfish. pdf
<![if !supportLineBreakNewLine]>
<![endif]><o:p>
2006 <o:p>
- A Precise Computational Approach to Knowledge.
R. Pass. pdf
Ph.D Thesis. Massachusetts Institute of Technology, July 2006. <o:p> - Input-Indistinguishable Computation. (FOCS 06)
S. Micali, R. Pass, A. Rosen. pdf<o:p> - Construction of a Non-Malleable Encryption Scheme From Any Semantically Secure One. (Crypto 06)
R. Pass, A. Shelat and V. Vaikuntanathan. pdf<o:p> - 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. <o:p> - Local Zero Knowledge. (STOC 06)
S. Micali and R. Pass.
See A Precise Computational Approach to Knowledge for a longer version.
<![if !supportLineBreakNewLine]>
<![endif]><o:p>
2005 <o:p>
- 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. <o:p> - Unconditional Characterizations of Non-Interactive Zero-Knowledge. (CRYPTO 05)
R. Pass and A. Shelat. pdf <o:p> - Secure Computation Without Authentication. (CRYPTO 05)
B. Barak, R. Canetti, Y. Lindell, R. Pass and T. Rabin. pdf <o:p> - 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.
<![if !supportLineBreakNewLine]>
<![endif]><o:p>
2004 <o:p>
- Universally Composable Protocols with Relaxed Set-up Assumptions. (FOCS 04)
B. Barak, R. Canetti, J. Nielsen and R. Pass. pdf <o:p> - Bounded-Concurrent Secure Multi-Party Computation with a Dishonest Majority. (STOC 04)
R. Pass. pdf <o:p> - On the Possibility of One-Message Weak Zero-Knowledge. (TCC 04)
B. Barak and R. Pass. pdf <o:p> - Alternative Variants of Zero-Knowledge Proofs.
R. Pass. pdf
Licentiate (Master s) Thesis. ISBN 91-7283-933-3, 2004.
<![if !supportLineBreakNewLine]>
<![endif]><o:p>
2003 <o:p>
- Bounded-Concurrent Secure Two-Party Computation in a Constant Number of Rounds. (FOCS 03)
R. Pass and A. Rosen. pdf <o:p> - 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. <o:p> - 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. <o:p>
<![if !supportLineBreakNewLine]>
<![endif]><o:p>
This material is based upon work supported by the National Science Foundation, AFOSR, U.S. Department of Homeland Security, BSF, <o:p>
Sloan Foundation, IBM 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, IBM or Microsoft.<o:p>
<o:p>