Professor, Blavatnik School of Computer Science, Tel-Aviv University
Incumbent of the Chair in Cryptography and Information Security
Director of the Checkpoint Institute for Information Security
Ph.D, MIT, 2006
Office: Checkpoint 253
Email: rafaelp at tau dot ac dot il
Summary
I am a Professor in the Theory of Computation Group of the Blavatnik School of Computer Science at Tel-Aviv Univeristy and the incumbent of the Chair in Cryptography and Information Security. I serve as the Director of the Checkpoint Institute for Information Security. I am also a Professor (on-leave) at Cornell Tech and in the Department of Computer Science at Cornell University.
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; lately, I have become 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])
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.
I am an ACM Fellow and an IACR Fellow.
My CV: pdf
Books/Lecture Notes
R. Pass: A Course in Networks and Markets: Game-theoretic Models and Reasoning.
The MIT Press, 2019. Free HTML version.
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.
Projects
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 57M monthly active users (in Aug 2022).
Teaching
CS 5854 Networks and Markets (Meng) [Sp 21] [Fa 20] [Fa 19] [Sp 19] [Fa 17] [Fa 16]
CS 5433 Blockchains, Cryptocurrencies and Smart Contracts [Sp 18]
NBAY 5710 Blockchains and Cryptocurrencies (for MBA) [Sp 21] [Fa 20] [Sp 19] [Fa 18] [Sp 18]
CS 6830 Cryptography (Ph.D) [Fa 18] [Sp 17] [Sp 16] [Fa 14] [Fa 11] [Fa 09] [Fa 08] [Fa 06]
CS 5831 Security Protocols and Privacy (MEng) [Sp 14]
CS 5830 Cryptography (MEng) [Sp 18] [Fa 13]
CS 4830 Introduction to Cryptography (undergraduate) [Fa 10] [Fa 08] [Fa 07]
CS 2800 Discrete Structures (undergraduate) [Sp 13] [Sp 12] [Sp 11]
CS 6810 Theory of Computing (Ph. D) [Sp 08]
CS 787 Topics in Cryptography [Sp 07]
CS 7893 Crypto breakfast (Ph. D) every semester since 08
NBAY 5400 Tech for Business (MBA) [Fa 16] [Fa 15]
Current Ph.D. Students
Naomi Ephraim
Cody Freitag
Yanyi Liu
Benjamin Chan
Graduated Ph.D. Students
Muthuramakrishnan Venkitasubramaniam (CI Fellow at NYU, now tenured at U. Rochester)
Huijia (Rachel) Lin (postdoc at MIT & BU, now tenured at UW)
Wei-lung Dustin Tseng (now at Google)
Lior Seeman (co-advised with Joseph Halpern, now at Uber Research)
Edward Lui (now at start-up)
Adam Bjorndahl (co-advised with Joseph Halpern, now tenure-track at CMU)
Karn Seth (now at Google Research)
Sidharth Telang (now at Google)
Antonio Marcedone (Cryptography Lead at Zoom)
Andrew Morgan
Current and Previous Post Docs
Ilan Komargodski (Ph.D. Weizmann, joint with Elaine Shi, now tenure-track at Hebrew University,)
Antigoni Polychroniadou (Ph.D Aarhus, joint with Elaine Shi, now at JP Morgan AI)
Gilad Asharov (Ph.D. Bar-Ilan, Simons fellow, now at JP Morgan AI and tenure-track at Bar-Ilan U.)
Elette Boyle (Ph.D. MIT, now tenured at Reichman University)
Kai-min Chung (Ph.D. Harvard, now tenured at Academia Sinica)
Mohammad Mahmoody (Ph.D. Princeton, now tenured at UVA)
Romain Gay (Ph.D. ENS, now at IBM Research)
Daneil Reichman (Ph.D Weizmann, joint with Joe Halpern, now tenure-track at RPI)
Program Commitees
18th Theory of Cryptography Conference (TCC 20) [PC co-Chair]
10th Innovations in Theoretical Computer Science Conference (ITCS 19)
37th Annual International Cryptology Conference (CRYPTO 17).
10th Annual Conference on Security and Cryptography for Networks (SCN 16).
6th Innovations in Theoretical Computer Science Conference (ITCS 16).
57th Annual IEEE Symposium on Foundations of Computer Science (FOCS 15).
5th Innovations in Theoretical Computer Science Conference (ITCS 15).
34th Annual International Cryptology Conference (CRYPTO 2014).
53rd Annual IEEE Symposium on Foundations of Computer Science (FOCS 2012).
31th Annual International Cryptology Conference (CRYPTO 2011).
30th Annual International Cryptology Conference (CRYPTO 2010).
29th Annual International Cryptology Conference (CRYPTO 2009).
35th International Colloquium on Automata, Languages and Programming (ICALP 08)..
34th International Colloquium on Automata, Languages and Programming (ICALP 07).
Some on-line papers (see DBLP for a complete list)
Recent Manuscript:
On One-way Functions from NP-Complete Problems
Yanyi Liu and Rafael Pass pdf
A Note on One-way Functions and Sparse Languages
Yanyi Liu and Rafael Pass pdf
2021
On the Possibility of Basing Cryptography on EXP \neq BPP (Crypto 21, winner of the best paper award)
Yanyi Liu and Rafael Pass pdf
Cryptography from Sublinear-time Average-case Hardness of Time-bounded Kolmogorov Complexity (STOC 21)
Yanyi Liu and Rafael Pass pdf
Indistinguishability Obfuscation from Circular Security (STOC 21)
Romain Gay and Rafael Pass pdf
Non-malleable Time-Lock Puzzles and Applications. (TCC 2021)
Cody Freitag, Ilan Komargodski, Rafael Pass, Naomi Sirkin pdf
Non-malleable Codes for Bounded Parallel-Time Tampering (CRYPTO 21)
Dana Dachman-Soled, Ilan Komargodski and Rafael Pass pdf
2020
On One-way Functions and Kolmogorov Complexity (FOCS 20)
Yanyi Liu and Rafael Pass pdf
Is it Easier to Prove Theorems that are Guaranteed to be True? (FOCS 20)
Rafael Pass and Muthuramakrishnan Venkitasubramaniam pdf
SPARKs: Succinct Parallelizable Arguments of Knowledge (EUROCRYPT 20)
Naomi Ephraim, Cody Freitag, Ilan Komargodski and Rafael Pass pdf
Continuous Verifiable Delay Functions (EUROCRYPT 20)
Naomi Ephraim, Cody Freitag, Ilan Komargodski and Rafael Pass pdf
Succinct Non-Interactive Secure Computation (EUROCRYPT 20)
Andrew Morgan and Rafael Pass and Antigoni Polychroniadou pdf
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
On the Adaptive Security of MACs and PRFs (ASIACRYPT 20)
Andrew Morgan, Rafael Pass, Elaine Shi pdf
Impossibility of Strong KDM Security with Auxiliary Input. (SCN 2020)
Cody Freitag, Ilan Komargodski, Rafael Pass pdf pdf
Unprovability of Leakage-Resilient Cryptography Beyond the Information-Theoretic Limit. (SCN 2020)
Rafael Pass pdf
2019
Non-Uniformly Sound Certificates with Applications to Concurrent Zero-Knowledge. (CRYPTO 19)
Cody Freitag, Ilan Komargodski, Rafael Pass pdf
A tutorial on concurrent zero-knowledge (Providing Sound Foundations for Cryptography 20)
Rafael Pass pdf
Paradoxes in Fair Computer-Aided Decision Making. (AIES 19)
Andrew Morgan, Rafael Pass pdf
Locality-preserving ORAM (EUROCRYPT 2019)
G. Asharov, H. Chan, K. Nayak, R. Pass, L. Ren and E. Shi pdf
Snow White: Robustly Reconfigurable Consensus and Applications to Provably Secure Proof of Stake (FC 19)
P. Daian, R. Pass and E. Shi pdf
Minimizing Trust in Hardware Wallets with Two Factor Signatures. (FC 19)
Antonio Marcedone, Rafael Pass, Abhi Shelat pdf
On the Existence of Nash Equilibrium in Games with Resource-Bounded Players. (SAGT 19)
Joseph Y. Halpern, Rafael Pass, Daniel Reichman pdf
Blind Certificate Authorities. (Oakland 19)
Liang Wang, Gilad Asharov, Rafael Pass, Thomas Ristenpart, Abhi Shelat pdf
A Conceptually Well-Founded Characterization of Iterated Admissibility Using an "All I Know" Operator. (TARK 19)
Joseph Y. Halpern, Rafael Pass pdf
2018
On the Complexity of Compressing Obfuscation. (CRYPTO 18)
Gilad Asharov, Naomi Ephraim, Ilan Komargodski, Rafael Pass: pdf
Thunderella: Blockchains with Optimistic Instant Confirmation. (EUROCRYPT 18)
Rafael Pass, Elaine Shi pdf
On the Security Loss of Unique Signatures. (TCC 18)
Andrew Morgan, Rafael Pass: pdf
Achieving Fair Treatment in Algorithmic Classification. (TCC 18)
Andrew Morgan, Rafael Pass pdf
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
Can We Access a Database Both Locally and Privately? (TCC 18)
E. Boyle, Y. Ishai, R. Pass, and M. Wootters pdf
Socially Optimal Mining Pools (EC 18)
B. Fisch, R. Pass and A. Shelat pdf
2017
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
Analysis of the Blockchain Protocol in Asynchronous Networks (EUROCRYPT 17)
R. Pass, L. Seeman and A. Shelat pdf
Formal Abstractions for Attested Execution Secure Processors (EUROCRYPT 17)
Rafael Pass, Elaine Shi, Florian Tramer pdf
FruitChains: A Fair Blockchain (PODC 17)
R. Pass and E. Shi pdf
The Sleepy Model of Consensus (ASIACRYPT 17)
R. Pass and E. Shi pdf
A Knowledge-Based Analysis of the Blockchain Protocol (TARK 17)
J. Halpern and R. Pass pdf
Hybrid Consensus: Efficient Consensus in the Permissionless Model (DISC 17)
R. Pass and E. Shi pdf
Reasoning about rationality. (GEB 17)
Adam Bjorndahl, Joseph Y. Halpern, Rafael Pass pdf
2016
Sequential Equilibrium in Games of Imperfect Recall (KR 16, ACM TEC 19)
J. Halpern and R. Pass pdf
Indistinguishability Obfuscation with Non-trivial Efficiency (PKC 16)
H. Lin, R. Pass, K. Seth, and S. Telang pdf
Bounded KDM Security from iO and OWF (SCN 16)
A. Marcedone, R. Pass, and A. Shelat pdf
Computational Extensive-Form Games (EC 16)
J. Halpern, R. Pass, and L. Seeman pdf
Impossibility of VBB Obfuscation with Ideal Constant-Degree Graded Encodings (TCC 16)
R. Pass and A. Shelat pdf
Lower Bounds on Assumptions Behind Indistinguishability Obfuscation (TCC 16)
M. Mahmoody, A. Mohammed, S. Nematihaji, R. Pass, and A. Shelat pdf
Output-Compressing Randomized Encodings and Applications (TCC 16)
H. Lin, R. Pass, K. Seth, and S. Telang pdf
Oblivious Parallel RAM and Applications (TCC 16)
Elette Boyle, Kai-Min Chung, Rafael Pass pdf
2015
Tight Revenue Bounds with Possibilistic Beliefs and Level-k Rationality (Econometrica 2015)
J. Chen, S. Micali, R. Pass pdf supplement
Algorithmic rationality: Game theory with costly computation (J. Economic Theory 2015)
J. Halpern and R. Pass pdf
Limits of Extractability Assumptions with Distributional Auxiliary Input (ASIACRYPT 15)
E. Boyle and R. Pass pdf
Micropayments for Decentralized Currencies (CCS 15)
R. Pass and A. Shelat pdf
Constant-Round Concurrent Zero-Knowledge from Indistinguishability Obfuscation (CRYPTO 15)
K. Chung, H. Lin and R. Pass pdf
Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM Programs (CRYPTO 15)
E. Boyle, K. Chung, R. Pass pdf
Voting with Coarse Beliefs (ITCS 15)
S. Leung, E. Lui, and R. Pass pdf
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)
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.
From Weak to Strong Zero-Knowledge and Applications (TCC 15)
K. Chung, E. Lui, and R. Pass pdf
Tight Parallel Repetition Theorems for Public-Coin Arguments Using KL-Divergence (TCC 15)
K. Chung and R.Pass pdf
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
Outlier Privacy (TCC 15)
E. Lui, and R. Pass pdf
Bayesian Games with Intentions (TARK 15, GEB 2020)
A. Bjorndahl, J. Halpern, and R Pass pdf
2014
Concurrent Zero Knowledge, Revisited (J. Cryptology 2014)
R. Pass, W. Tseng and M. Venkitasubramaniam pdf
On the Impossibility of Black-Box Transformations in Mechanism Design (SAGT 2014)
R. Pass, K. Seth pdf
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.
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
One-way Functions and (Imperfect) Obfuscation (FOCS 14)
I. Komargodski, T. Moran, M. Naor, R. Pass, A. Rosen and E. Yogev. pdf
On the Impossibility of Tamper-Resilient Cryptography (CRYPTO 14, Algorithmica’17)
P. Austrin, K. Chung, M. Mahmoody, R. Pass and K. Seth. pdf
Indistinguishability Obfuscation from Semantically-secure Multilinear Graded Encodings (CRYPTO 14)
R. Pass, K. Seth and S. Telang. pdf
Reasoning About Rationality (KR 14, GEB 2016)
A. Bjorndahl, J. Halpern and R. Pass. pdf
The Truth Behing the Myth of the Folk Theorem (ITCS 14, GEB 19)
J. Halpern, R. Pass, and L. Seeman. pdf
On Extractability (a.k.a. Differing-Input) Obfuscation (TCC 14)
E. Boyle, K. Chung, R. Pass pdf
4-Round Resettably-Sound Zero-Knowledge (TCC 14)
K. Chung, R. Ostrovsky, R. Pass, I. Visconti and M. Venkitasubramaniam. pdf
Statistically-secure ORAM with \tilde{O}(log^2 n) Overhead (AsiaCrypt 14)
K. Chung, Z. Lui and R. Pass. 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, SICOMP 2016)
K. Chung, R. Pass and K. Seth. pdf
SIAM Journal of Computing, special issue for selected papers of STOC 2013.
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, 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.
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
A Simple ORAM (manuscript 2013)
K. Chung 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
Unprovable Security of Two-Message Zero-Knowledge (manuscript 2012)
K. Chung, E. Lui, M. Mahmoody, and R. Pass. 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, JACM 2015)
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, SICOMP 2016)
R. Canetti, H. Lin and R. Pass. pdf
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, Google, JP Morgan 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, DARPA, IARPA, DHS, BSF, Sloan Foundation, Google, JP Morgan or Microsoft.