On Deniability in the Common Reference String and Random Oracle Model. - Rafael Pass (CRYPTO, 2003)

Simulation in Quasi-Polynomial Time, and Its Application to Protocol Composition. - Rafael Pass (EUROCRYPT, 2003)

Bounded-Concurrent Secure Two-Party Computation in a Constant Number of Rounds. - Rafael Pass; Alon Rosen (FOCS, 2003)

Universally Composable Protocols with Relaxed Set-Up Assumptions. - Boaz Barak; Ran Canetti; Jesper Buus Nielsen; Rafael Pass (FOCS, 2004)

Bounded-concurrent secure multi-party computation with a dishonest majority. - Rafael Pass (STOC, 2004)

On the Possibility of One-Message Weak Zero-Knowledge. - Boaz Barak; Rafael Pass (TCC, 2004)

Unconditional Characterizations of Non-interactive Zero-Knowledge. - Rafael Pass; Abhi Shelat (CRYPTO, 2005)

Concurrent Non-Malleable Commitments. - Rafael Pass; Alon Rosen (FOCS, 2005)

New and improved constructions of non-malleable cryptographic protocols. - Rafael Pass; Alon Rosen (STOC, 2005)

Parallel Repetition of Zero-Knowledge Proofs and the Possibility of Basing Cryptography on NP-Hardness. - Rafael Pass (CCC, 2006)

Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One. - Rafael Pass; Abhi Shelat; Vinod Vaikuntanathan (CRYPTO, 2006)

Input-Indistinguishable Computation. - Silvio Micali; Rafael Pass; Alon Rosen (FOCS, 2006)

Local zero knowledge. - Silvio Micali; Rafael Pass (STOC, 2006)

Universally Composable Security with Global Setup. - Ran Canetti; Yevgeniy Dodis; Rafael Pass; Shabsi Walfish (IACR Cryptol. ePrint Arch., 2006)

A precise computational approach to knowledge. - Rafael Pass (2006)

Bounded CCA2-Secure Encryption. - Ronald Cramer; Goichiro Hanaoka; Dennis Hofheinz; Hideki Imai; Eike Kiltz; Rafael Pass; Abhi Shelat; Vinod Vaikuntanathan (ASIACRYPT, 2007)

Relations Among Notions of Non-malleability for Encryption. - Rafael Pass; Abhi Shelat; Vinod Vaikuntanathan (ASIACRYPT, 2007)

Cryptography from Sunspots: How to Use an Imperfect Reference String. - Ran Canetti; Rafael Pass; Abhi Shelat (FOCS, 2007)

An efficient parallel repetition theorem for Arthur-Merlin games. - Rafael Pass; Muthuramakrishnan Venkitasubramaniam (STOC, 2007)

Precise Concurrent Zero Knowledge. - Omkant Pandey; Rafael Pass; Amit Sahai; Wei-Lung Dustin Tseng; Muthuramakrishnan Venkitasubramaniam (IACR Cryptol. ePrint Arch., 2007)

Adaptive One-Way Functions and Applications. - Omkant Pandey; Rafael Pass; Vinod Vaikuntanathan (CRYPTO, 2008)

Concurrent Non-malleable Commitments from Any One-Way Function. - Huijia Lin; Rafael Pass; Muthuramakrishnan Venkitasubramaniam (TCC, 2008)

On Constant-Round Concurrent Zero-Knowledge. - Rafael Pass; Muthuramakrishnan Venkitasubramaniam (TCC, 2008)

Game Theory with Costly Computation - Joseph Y. Halpern; Rafael Pass (CoRR, 2008)

Iterated Regret Minimization: A More Realistic Solution Concept - Joseph Y. Halpern; Rafael Pass (CoRR, 2008)

Concurrent Nonmalleable Commitments. - Rafael Pass; Alon Rosen (SIAM J. Comput., 2008)

New and Improved Constructions of Nonmalleable Cryptographic Protocols. - Rafael Pass; Alon Rosen (SIAM J. Comput., 2008)

Non-malleability amplification. - Huijia Lin; Rafael Pass (STOC, 2009)

A unified framework for concurrent security: universal composability from stand-alone non-malleability. - Huijia Lin; Rafael Pass; Muthuramakrishnan Venkitasubramaniam (STOC, 2009)

A logical characterization of iterated admissibility. - Joseph Y. Halpern; Rafael Pass (TARK, 2009)

An epistemic characterization of zero knowledge. - Joseph Y. Halpern; Rafael Pass; Vasumathi Raman (TARK, 2009)

Black-Box Constructions of Two-Party Protocols from One-Way Functions. - Rafael Pass; Hoeteck Wee (TCC, 2009)

Concurrent Non-Malleable Zero Knowledge Proofs. - Huijia Lin; Rafael Pass; Wei-Lung Dustin Tseng; Muthuramakrishnan Venkitasubramaniam (CRYPTO, 2010)

Constant-Round Non-malleable Commitments from Sub-exponential One-Way Functions. - Rafael Pass; Hoeteck Wee (EUROCRYPT, 2010)

Game Theory with Costly Computation: Formulation and Application to Protocol Security. - Joseph Y. Halpern; Rafael Pass (ICS, 2010)

An Efficient Parallel Repetition Theorem. - Johan Håstad; Rafael Pass; Douglas Wikström; Krzysztof Pietrzak (TCC, 2010)

Eye for an Eye: Efficient Concurrent Zero-Knowledge in the Timing Model. - Rafael Pass; Wei-Lung Dustin Tseng; Muthuramakrishnan Venkitasubramaniam (TCC, 2010)

Private Coins versus Public Coins in Zero-Knowledge Proof Systems. - Rafael Pass; Muthuramakrishnan Venkitasubramaniam (TCC, 2010)

Constant-round Non-Malleable Commitments from Any One-Way Function. - Huijia Lin; Rafael Pass (IACR Cryptol. ePrint Arch., 2010)

The Randomness Complexity of Parallel Repetition. - Kai-Min Chung; Rafael Pass (FOCS, 2011)

Approximately Strategy-Proof Voting. - Eleanor Birrell; Rafael Pass (IJCAI, 2011)

Renegotiation-Safe Protocols. - Rafael Pass; Abhi Shelat (ICS, 2011)

Limits of provable security from standard assumptions. - Rafael Pass (STOC, 2011)

Reasoning about justified belief. - Adam Bjorndahl; Joseph Y. Halpern; Rafael Pass (TARK, 2011)

Towards Privacy for Social Networks: A Zero-Knowledge Based Definition of Privacy. - Johannes Gehrke; Edward Lui; Rafael Pass (TCC, 2011)

Concurrent Non-Malleable Zero Knowledge with Adaptive Inputs. - Huijia Lin; Rafael Pass (TCC, 2011)

Concurrent Security and Non-malleability. - Rafael Pass (TCC, 2011)

Towards Non-Black-Box Lower Bounds in Cryptography. - Rafael Pass; Wei-Lung Dustin Tseng; Muthuramakrishnan Venkitasubramaniam (TCC, 2011)

I Don't Want to Think About it Now:Decision Theory With Costly Computation - Joseph Y. Halpern; Rafael Pass (CoRR, 2011)

Secure Computation Without Authentication. - Boaz Barak; Ran Canetti; Yehuda Lindell; Rafael Pass; Tal Rabin (J. Cryptol., 2011)

On the Composition of Public-Coin Zero-Knowledge Protocols. - Rafael Pass; Wei-Lung Dustin Tseng; Douglas Wikström (SIAM J. Comput., 2011)

Algorithmic rationality: adding cost of computation to game theory. - Joseph Y. Halpern; Rafael Pass (SIGecom Exch., 2011)

I'm Doing as Well as I Can: Modeling People as Rational Finite Automata. - Joseph Y. Halpern; Rafael Pass; Lior Seeman (AAAI, 2012)

A Unified Framework for UC from Only OT. - Rafael Pass; Huijia Lin; Muthuramakrishnan Venkitasubramaniam (ASIACRYPT, 2012)

Black-Box Constructions of Composable Protocols without Set-Up. - Huijia Lin; Rafael Pass (CRYPTO, 2012)

The Curious Case of Non-Interactive Commitments - On the Power of Black-Box vs. Non-Black-Box Use of Primitives. - Mohammad Mahmoody; Rafael Pass (CRYPTO, 2012)

The Knowledge Tightness of Parallel Zero-Knowledge. - Kai-Min Chung; Rafael Pass; Wei-Lung Dustin Tseng (TCC, 2012)

Iterated regret minimization: A new solution concept. - Joseph Y. Halpern; Rafael Pass (Games Econ. Behav., 2012)

Unprovable Security of Two-Message Zero Knowledge. - Kai-Min Chung; Edward Lui; Mohammad Mahmoody; Rafael Pass (IACR Cryptol. ePrint Arch., 2012)

Constant-Round Concurrent Zero Knowledge From Falsifiable Assumptions. - Kai-Min Chung; Huijia Lin; Rafael Pass (IACR Cryptol. ePrint Arch., 2012)

Crowd-Blending Privacy. - Johannes Gehrke; Michael Hay; Edward Lui; Rafael Pass (IACR Cryptol. ePrint Arch., 2012)

The Curious Case of Non-Interactive Commitments. - Mohammad Mahmoody; Rafael Pass (IACR Cryptol. ePrint Arch., 2012)

Multi-Verifier Signatures. - Tom Roeder; Rafael Pass; Fred B. Schneider (J. Cryptol., 2012)

A Parallel Repetition Theorem for Constant-Round Arthur-Merlin Proofs. - Rafael Pass; Muthuramakrishnan Venkitasubramaniam (ACM Trans. Comput. Theory, 2012)

From Unprovability to Environmentally Friendly Protocols. - Ran Canetti; Huijia Lin; Rafael Pass (FOCS, 2013)

Constant-Round Concurrent Zero Knowledge from P-Certificates. - Kai-Min Chung; Huijia Lin; Rafael Pass (FOCS, 2013)

Simultaneous Resettability from One-Way Functions. - Kai-Min Chung; Rafail Ostrovsky; Rafael Pass; Ivan Visconti (FOCS, 2013)

Knowledge-Preserving Interactive Coding. - Kai-Min Chung; Rafael Pass; Sidharth Telang (FOCS, 2013)

Language-Based Games. - Adam Bjorndahl; Joseph Y. Halpern; Rafael Pass (IJCAI, 2013)

On the power of many one-bit provers. - Per Austrin; Johan Håstad; Rafael Pass (ITCS, 2013)

On the power of nonuniformity in proofs of security. - Kai-Min Chung; Huijia Lin; Mohammad Mahmoody; Rafael Pass (ITCS, 2013)

Can theories be tested?: a cryptographic treatment of forecast testing. - Kai-Min Chung; Edward Lui; Rafael Pass (ITCS, 2013)

Randomness-Dependent Message Security. - Eleanor Birrell; Kai-Min Chung; Rafael Pass; Sidharth Telang (TCC, 2013)

Statistically-secure ORAM with $ tilde{O}( log^2 n)$ Overhead. - Kai-Min Chung; Zhenming Liu; Rafael Pass (CoRR, 2013)

Conservative belief and rationality. - Joseph Y. Halpern; Rafael Pass (Games Econ. Behav., 2013)

On the (Im)Possibility of Tamper-Resilient Cryptography: Using Fourier Analysis in Computer Viruses. - Per Austrin; Kai-Min Chung; Mohammad Mahmoody; Rafael Pass; Karn Seth (IACR Cryptol. ePrint Arch., 2013)

On Extractability Obfuscation. - Elette Boyle; Kai-Min Chung; Rafael Pass (IACR Cryptol. ePrint Arch., 2013)

Limits of Extractability Assumptions with Distributional Auxiliary Input. - Elette Boyle; Rafael Pass (IACR Cryptol. ePrint Arch., 2013)

From Weak to Strong Zero-Knowledge and Applications. - Kai-Min Chung; Edward Lui; Rafael Pass (IACR Cryptol. ePrint Arch., 2013)

Simultaneous Resettable WI from One-way Functions. - Kai-Min Chung; Rafael Pass (IACR Cryptol. ePrint Arch., 2013)

A Simple ORAM. - Kai-Min Chung; Rafael Pass (IACR Cryptol. ePrint Arch., 2013)

Interactive Coding, Revisited. - Kai-Min Chung; Rafael Pass; Sidharth Telang (IACR Cryptol. ePrint Arch., 2013)

Obfuscation from Semantically-Secure Multi-linear Encodings. - Rafael Pass; Sidharth Telang; Karn Seth (IACR Cryptol. ePrint Arch., 2013)

Public-Coin Parallel Zero-Knowledge for NP. - Rafael Pass; Alon Rosen; Wei-Lung Dustin Tseng (J. Cryptol., 2013)

Guest column: parallel repetition theorems for interactive arguments. - Kai-Min Chung; Rafael Pass (SIGACT News, 2013)

Statistically-secure ORAM with Õ(log2 n) Overhead. - Kai-Min Chung; Zhenming Liu; Rafael Pass (ASIACRYPT (2), 2014)

Indistinguishability Obfuscation from Semantically-Secure Multilinear Encodings. - Rafael Pass; Karn Seth; Sidharth Telang (CRYPTO (1), 2014)

Axiomatizing Rationality. - Adam Bjorndahl; Joseph Y. Halpern; Rafael Pass (KR, 2014)

On the Impossibility of Black-Box Transformations in Mechanism Design. - Rafael Pass; Karn Seth (SAGT, 2014)

4-Round Resettably-Sound Zero Knowledge. - Kai-Min Chung; Rafail Ostrovsky; Rafael Pass; Muthuramakrishnan Venkitasubramaniam; Ivan Visconti (TCC, 2014)

Not Just an Empty Threat: Subgame-Perfect Equilibrium in Repeated Games Played by Computationally Bounded Players. - Joseph Y. Halpern; Rafael Pass; Lior Seeman (WINE, 2014)

Large-Scale Secure Computation. - Elette Boyle; Kai-Min Chung; Rafael Pass (IACR Cryptol. ePrint Arch., 2014)

Oblivious Parallel RAM. - Elette Boyle; Kai-Min Chung; Rafael Pass (IACR Cryptol. ePrint Arch., 2014)

Constant-Round Concurrent Zero-knowledge from Indistinguishability Obfuscation. - Kai-Min Chung; Huijia Lin; Rafael Pass (IACR Cryptol. ePrint Arch., 2014)

Succinct Garbling Schemes and Applications. - Huijia Lin; Rafael Pass (IACR Cryptol. ePrint Arch., 2014)

Outlier Privacy. - Edward Lui; Rafael Pass (IACR Cryptol. ePrint Arch., 2014)

Concurrent Zero Knowledge, Revisited. - Rafael Pass; Wei-Lung Dustin Tseng; Muthuramakrishnan Venkitasubramaniam (J. Cryptol., 2014)

Decision Theory with Resource-Bounded Agents. - Joseph Y. Halpern; Rafael Pass; Lior Seeman (Top. Cogn. Sci., 2014)

Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM Programs. - Elette Boyle; Kai-Min Chung; Rafael Pass (CRYPTO (2), 2015)

Better Outcomes from More Rationality. - Jing Chen 017; Silvio Micali; Rafael Pass (ITCS, 2015)

Voting with Coarse Beliefs. - Samantha Leung; Edward Lui; Rafael Pass (ITCS, 2015)

Round-Efficient Concurrently Composable Secure Computation via a Robust Extraction Lemma. - Vipul Goyal; Huijia Lin; Omkant Pandey; Rafael Pass; Amit Sahai (TCC (1), 2015)

Bayesian Games with Intentions. - Adam Bjorndahl; Joseph Y. Halpern; Rafael Pass (TARK, 2015)

On the Non-Existence of Nash Equilibrium in Games with Resource-Bounded Players. - Joseph Y. Halpern; Rafael Pass; Daniel Reichman 001 (CoRR, 2015)

Stronger Impossibility Results for Strategy-Proof Voting with i.i.d. Beliefs. - Samantha Leung; Edward Lui; Rafael Pass (CoRR, 2015)

Succinct Randomized Encodings and their Applications. - Nir Bitansky; Sanjam Garg; Huijia Lin; Rafael Pass; Sidharth Telang (IACR Cryptol. ePrint Arch., 2015)

Tight Parallel Repetition Theorems for Public-Coin Arguments using KL-divergence. - Kai-Min Chung; Rafael Pass (IACR Cryptol. ePrint Arch., 2015)

ANONIZE: A Large-Scale Anonymous Survey System. - Susan Hohenberger; Steven A. Myers; Rafael Pass; Abhi Shelat (IACR Cryptol. ePrint Arch., 2015)

How to Use SNARKs in Universally Composable Protocols. - Ahmed E. Kosba; Zhichao Zhao; Andrew Miller 001; Yi Qian; T.-H. Hubert Chan; Charalampos Papamanthou; Rafael Pass; Abhi Shelat; Elaine Shi (IACR Cryptol. ePrint Arch., 2015)

Output-Compressing Randomized Encodings and Applications. - Huijia Lin; Rafael Pass; Karn Seth; Sidharth Telang (IACR Cryptol. ePrint Arch., 2015)

Lower Bounds on Assumptions behind Indistinguishability Obfuscation. - Mohammad Mahmoody; Ameer Mohammed; Soheil Nematihaji; Rafael Pass; Abhi Shelat (IACR Cryptol. ePrint Arch., 2015)

Impossibility of VBB Obfuscation with Ideal Constant-Degree Graded Encodings. - Rafael Pass; Abhi Shelat (IACR Cryptol. ePrint Arch., 2015)

An Overview of ANONIZE: A Large-Scale Anonymous Survey System. - Susan Hohenberger; Steven A. Myers; Rafael Pass; Abhi Shelat (IEEE Secur. Priv., 2015)

Constant-Round Nonmalleable Commitments from Any One-Way Function. - Huijia Lin; Rafael Pass (J. ACM, 2015)

Algorithmic rationality: Game theory with costly computation. - Joseph Y. Halpern; Rafael Pass (J. Econ. Theory, 2015)

Computational Extensive-Form Games. - Joseph Y. Halpern; Rafael Pass; Lior Seeman (EC, 2016)

Oblivious Parallel RAM and Applications. - Elette Boyle; Kai-Min Chung; Rafael Pass (TCC (A2), 2016)

Unprovable Security of Perfect NIZK and Non-interactive Non-malleable Commitments. - Rafael Pass (Comput. Complex., 2016)

The Sleepy Model of Consensus. - Iddo Bentov; Rafael Pass; Elaine Shi (IACR Cryptol. ePrint Arch., 2016)

Snow White: Provably Secure Proofs of Stake. - Iddo Bentov; Rafael Pass; Elaine Shi (IACR Cryptol. ePrint Arch., 2016)

Indistinguishability Obfuscation with Non-trivial Efficiency. - Huijia Lin; Rafael Pass; Karn Seth; Sidharth Telang (IACR Cryptol. ePrint Arch., 2016)

A Note on Black-Box Complexity of Indistinguishability Obfuscation. - Mohammad Mahmoody; Ameer Mohammed; Soheil Nematihaji; Rafael Pass; Abhi Shelat (IACR Cryptol. ePrint Arch., 2016)

Bounded KDM Security from iO and OWF. - Antonio Marcedone; Rafael Pass; Abhi Shelat (IACR Cryptol. ePrint Arch., 2016)

Micropayments for Decentralized Currencies. - Rafael Pass; Abhi Shelat (IACR Cryptol. ePrint Arch., 2016)

FruitChains: A Fair Blockchain. - Rafael Pass; Elaine Shi (IACR Cryptol. ePrint Arch., 2016)

Hybrid Consensus: Efficient Consensus in the Permissionless Model. - Rafael Pass; Elaine Shi (IACR Cryptol. ePrint Arch., 2016)

Analysis of the Blockchain Protocol in Asynchronous Networks. - Rafael Pass; Lior Seeman; Abhi Shelat (IACR Cryptol. ePrint Arch., 2016)

Formal Abstractions for Attested Execution Secure Processors. - Rafael Pass; Elaine Shi; Florian Tramèr (IACR Cryptol. ePrint Arch., 2016)

Secure Channel Injection and Anonymous Proofs of Account Ownership. - Liang Wang 023; Rafael Pass; Abhi Shelat; Thomas Ristenpart (IACR Cryptol. ePrint Arch., 2016)

Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions. - Ran Canetti; Huijia Lin; Rafael Pass (SIAM J. Comput., 2016)

Non-Black-Box Simulation from One-Way Functions and Applications to Resettable Security. - Kai-Min Chung; Rafael Pass; Karn Seth (SIAM J. Comput., 2016)

The Sleepy Model of Consensus. - Rafael Pass; Elaine Shi (ASIACRYPT (2), 2017)

Socially Optimal Mining Pools. - Ben Fisch; Rafael Pass; Abhi Shelat (WINE, 2017)

On the Impossibility of Cryptography with Tamperable Randomness. - Per Austrin; Kai-Min Chung; Mohammad Mahmoody; Rafael Pass; Karn Seth (Algorithmica, 2017)

A Knowledge-Based Analysis of the Blockchain Protocol. - Joseph Y. Halpern; Rafael Pass (TARK, 2017)

Reasoning about rationality. - Adam Bjorndahl; Joseph Y. Halpern; Rafael Pass (Games Econ. Behav., 2017)

Oblivious Computation with Data Locality. - Gilad Asharov; T.-H. Hubert Chan; Kartik Nayak; Rafael Pass; Ling Ren 001; Elaine Shi (IACR Cryptol. ePrint Arch., 2017)

Can We Access a Database Both Locally and Privately? - Elette Boyle; Yuval Ishai; Rafael Pass; Mary Wootters (IACR Cryptol. ePrint Arch., 2017)

Two-Round Concurrent Non-Malleable Commitment from Time-Lock Puzzles. - Huijia Lin; Rafael Pass; Pratik Soni (IACR Cryptol. ePrint Arch., 2017)

Thunderella: Blockchains with Optimistic Instant Confirmation. - Rafael Pass; Elaine Shi (IACR Cryptol. ePrint Arch., 2017)

Communication-Efficient Byzantine Agreement without Erasures. - T.-H. Hubert Chan; Rafael Pass; Elaine Shi (CoRR, 2018)

PiLi: An Extremely Simple Synchronous Blockchain. - T.-H. Hubert Chan; Rafael Pass; Elaine Shi (IACR Cryptol. ePrint Arch., 2018)

PaLa: A Simple Partially Synchronous Blockchain. - T.-H. Hubert Chan; Rafael Pass; Elaine Shi (IACR Cryptol. ePrint Arch., 2018)

Game Theoretic Notions of Fairness in Multi-Party Coin Toss. - Kai-Min Chung; Yue Guo; Wei-Kai Lin; Rafael Pass; Elaine Shi (IACR Cryptol. ePrint Arch., 2018)

On the Security Loss of Unique Signatures. - Andrew Morgan; Rafael Pass (IACR Cryptol. ePrint Arch., 2018)

Achieving Fair Treatment in Algorithmic Classification. - Andrew Morgan; Rafael Pass (IACR Cryptol. ePrint Arch., 2018)

Rethinking Large-Scale Consensus. - Rafael Pass; Elaine Shi (IACR Cryptol. ePrint Arch., 2018)

Blind Certificate Authorities. - Liang Wang 023; Gilad Asharov; Rafael Pass; Thomas Ristenpart; Abhi Shelat (IACR Cryptol. ePrint Arch., 2018)

Game theory with translucent players. - Joseph Y. Halpern; Rafael Pass (Int. J. Game Theory, 2018)

Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings. - Nir Bitansky; Ran Canetti; Sanjam Garg; Justin Holmgren; Abhishek Jain 002; Huijia Lin; Rafael Pass; Sidharth Telang; Vinod Vaikuntanathan (SIAM J. Comput., 2018)

A tutorial on concurrent zero-knowledge. - Rafael Pass (Providing Sound Foundations for Cryptography, 2019)

Paradoxes in Fair Computer-Aided Decision Making. - Andrew Morgan; Rafael Pass (AIES, 2019)

Snow White: Robustly Reconfigurable Consensus and Applications to Provably Secure Proof of Stake. - Phil Daian; Rafael Pass; Elaine Shi (Financial Cryptography, 2019)

On the Existence of Nash Equilibrium in Games with Resource-Bounded Players. - Joseph Y. Halpern; Rafael Pass; Daniel Reichman 001 (SAGT, 2019)

A Conceptually Well-Founded Characterization of Iterated Admissibility Using an "All I Know" Operator. - Joseph Y. Halpern; Rafael Pass (TARK, 2019)

The truth behind the myth of the Folk theorem. - Joseph Y. Halpern; Rafael Pass; Lior Seeman (Games Econ. Behav., 2019)

On Perfect Correctness without Derandomization. - Gilad Asharov; Naomi Ephraim; Ilan Komargodski; Rafael Pass (IACR Cryptol. ePrint Arch., 2019)

Consensus through Herding. - T.-H. Hubert Chan; Rafael Pass; Elaine Shi (IACR Cryptol. ePrint Arch., 2019)

Round Complexity of Byzantine Agreement, Revisited. - T.-H. Hubert Chan; Rafael Pass; Elaine Shi (IACR Cryptol. ePrint Arch., 2019)

Continuous Verifiable Delay Functions. - Naomi Ephraim; Cody Freitag; Ilan Komargodski; Rafael Pass (IACR Cryptol. ePrint Arch., 2019)

Impossibility of Strong KDM Security with Auxiliary Input. - Cody Freitag; Ilan Komargodski; Rafael Pass (IACR Cryptol. ePrint Arch., 2019)

Non-Uniformly Sound Certificates with Applications to Concurrent Zero-Knowledge. - Cody Freitag; Ilan Komargodski; Rafael Pass (IACR Cryptol. ePrint Arch., 2019)

Synchronous, with a Chance of Partition Tolerance. - Yue Guo; Rafael Pass; Elaine Shi (IACR Cryptol. ePrint Arch., 2019)

Minimizing Trust in Hardware Wallets with Two Factor Signatures. - Antonio Marcedone; Rafael Pass; Abhi Shelat (IACR Cryptol. ePrint Arch., 2019)

Succinct Non-Interactive Secure Computation. - Andrew Morgan; Rafael Pass; Antigoni Polychroniadou (IACR Cryptol. ePrint Arch., 2019)

A Round-Collapse Theorem for Computationally-Sound Protocols; or, TFNP is Hard (on Average) in Pessiland. - Rafael Pass; Muthuramakrishnan Venkitasubramaniam (IACR Cryptol. ePrint Arch., 2019)

Sequential Equilibrium in Computational Games. - Joseph Y. Halpern; Rafael Pass (ACM Trans. Economics and Comput., 2019)

Which Languages Have 4-Round Fully Black-Box Zero-Knowledge Arguments from One-Way Functions? - Carmit Hazay; Rafael Pass; Muthuramakrishnan Venkitasubramaniam (EUROCRYPT (3), 2020)

Sublinear-Round Byzantine Agreement Under Corrupt Majority. - T.-H. Hubert Chan; Rafael Pass; Elaine Shi (Public Key Cryptography (2), 2020)

Bucket Oblivious Sort: An Extremely Simple Oblivious Sort. - Gilad Asharov; T.-H. Hubert Chan; Kartik Nayak; Rafael Pass; Ling Ren 001; Elaine Shi (SOSA, 2020)

On One-way Functions and Kolmogorov Complexity. - Yanyi Liu; Rafael Pass (Electron. Colloquium Comput. Complex., 2020)

Is it Easier to Prove Theorems that are Guaranteed to be True? - Rafael Pass; Muthuramakrishnan Venkitasubramaniam (Electron. Colloquium Comput. Complex., 2020)

Blockchain with Varying Number of Players. - T.-H. Hubert Chan; Naomi Ephraim; Antonio Marcedone; Andrew Morgan; Rafael Pass; Elaine Shi (IACR Cryptol. ePrint Arch., 2020)

Non-Malleable Codes for Bounded Polynomial Depth Tampering. - Dana Dachman-Soled; Ilan Komargodski; Rafael Pass (IACR Cryptol. ePrint Arch., 2020)

Non-Malleable Time-Lock Puzzles and Applications. - Naomi Ephraim; Cody Freitag; Ilan Komargodski; Rafael Pass (IACR Cryptol. ePrint Arch., 2020)

Indistinguishability Obfuscation from Circular Security. - Romain Gay; Rafael Pass (IACR Cryptol. ePrint Arch., 2020)

On the Adaptive Security of MACs and PRFs. - Andrew Morgan; Rafael Pass; Elaine Shi (IACR Cryptol. ePrint Arch., 2020)

Two-Round and Non-Interactive Concurrent Non-Malleable Commitments from Time-Lock Puzzles. - Huijia Lin; Rafael Pass; Pratik Soni (SIAM J. Comput., 2020)

Non-malleable Codes for Bounded Parallel-Time Tampering. - Dana Dachman-Soled; Ilan Komargodski; Rafael Pass (CRYPTO (3), 2021)

On the Possibility of Basing Cryptography on EXP≠ BPP. - Yanyi Liu; Rafael Pass (CRYPTO (1), 2021)

Cryptography from Sublinear-Time Average-Case Hardness of Time-Bounded Kolmogorov Complexity. - Yanyi Liu; Rafael Pass (Electron. Colloquium Comput. Complex., 2021)

On the Possibility of Basing Cryptography on $ EXP neq BPP$. - Yanyi Liu; Rafael Pass (Electron. Colloquium Comput. Complex., 2021)

On One-way Functions from NP-Complete Problems. - Yanyi Liu; Rafael Pass (Electron. Colloquium Comput. Complex., 2021)

A Note on One-way Functions and Sparse Languages. - Yanyi Liu; Rafael Pass (Electron. Colloquium Comput. Complex., 2021)

Concurrently Composable Non-Interactive Secure Computation. - Andrew Morgan; Rafael Pass (IACR Cryptol. ePrint Arch., 2021)

Unprovability of Leakage-Resilient Cryptography Beyond the Information-Theoretic Limit. - Rafael Pass (IACR Cryptol. ePrint Arch., 2021)

A Tutorial on Concurrent Zero Knowledge. - Rafael Pass (IACR Cryptol. ePrint Arch., 2021)

Guest Column: Average-case Complexity Through the Lens of Interactive Puzzles. - Rafael Pass; Muthuramakrishnan Venkitasubramaniam (SIGACT News, 2021)

Sequential Equilibrium in Games of Imperfect Recall. - Joseph Y. Halpern; Rafael Pass (ACM Trans. Economics and Comput., 2021)

Universal Reductions: Reductions Relative to Stateful Oracles. - Benjamin Y. Chan; Cody Freitag; Rafael Pass (TCC (3), 2022)

Characterizing Derandomization Through Hardness of Levin-Kolmogorov Complexity. - Yanyi Liu; Rafael Pass (Electron. Colloquium Comput. Complex., 2022)

Leakage-Resilient Hardness v.s. Randomness. - Yanyi Liu; Rafael Pass (Electron. Colloquium Comput. Complex., 2022)

Cosmic Security. - Benjamin Y. Chan; Cody Freitag; Rafael Pass (IACR Cryptol. ePrint Arch., 2022)

Parallelizable Delegation from LWE. - Cody Freitag; Rafael Pass; Naomi Sirkin (IACR Cryptol. ePrint Arch., 2022)

SPARKs: Succinct Parallelizable Arguments of Knowledge. - Naomi Ephraim; Cody Freitag; Ilan Komargodski; Rafael Pass (J. ACM, 2022)

Locality-Preserving Oblivious RAM. - Gilad Asharov; T.-H. Hubert Chan; Kartik Nayak; Rafael Pass; Ling Ren 001; Elaine Shi (J. Cryptol., 2022)

On the Complexity of Compressing Obfuscation. - Gilad Asharov; Ilan Komargodski; Rafael Pass; Naomi Sirkin (J. Cryptol., 2022)

One-Way Functions and (Im)perfect Obfuscation. - Ilan Komargodski; Tal Moran; Moni Naor; Rafael Pass; Alon Rosen; Eylon Yogev (SIAM J. Comput., 2022)

Leakage-Resilient Hardness vs Randomness. - Yanyi Liu; Rafael Pass (CCC, 2023)

On One-Way Functions and Sparse Languages. - Yanyi Liu; Rafael Pass (TCC (1), 2023)

On One-way Functions and the Worst-case Hardness of Time-Bounded Kolmogorov Complexity. - Yanyi Liu; Rafael Pass (Electron. Colloquium Comput. Complex., 2023)

One-way Functions and Hardness of (Probabilistic) Time-Bounded Kolmogorov Complexity w.r.t. Samplable Distributions. - Yanyi Liu; Rafael Pass (Electron. Colloquium Comput. Complex., 2023)

Counting Unpredictable Bits: A Simple PRG from One-way Functions. - Noam Mazor; Rafael Pass (Electron. Colloquium Comput. Complex., 2023)

The Non-Uniform Perebor Conjecture for Time-Bounded Kolmogorov Complexity is False. - Noam Mazor; Rafael Pass (Electron. Colloquium Comput. Complex., 2023)

A Note On the Universality of Black-box MKtP Solvers. - Noam Mazor; Rafael Pass (Electron. Colloquium Comput. Complex., 2023)

Characterizing the Power of (Persistent) Randomness in Log-space. - Rafael Pass; Oren Renard (Electron. Colloquium Comput. Complex., 2023)

Simplex Consensus: A Simple and Fast Consensus Protocol. - Benjamin Y. Chan; Rafael Pass (IACR Cryptol. ePrint Arch., 2023)

Can open decentralized ledgers be economically secure? - Jacob D. Leshno; Rafael Pass; Elaine Shi (IACR Cryptol. ePrint Arch., 2023)

Incrementally Verifiable Computation via Rate-1 Batch Arguments. - Omer Paneth; Rafael Pass (IACR Cryptol. ePrint Arch., 2023)

Communication complexity of byzantine agreement, revisited. - Ittai Abraham; T.-H. Hubert Chan; Danny Dolev; Kartik Nayak; Rafael Pass; Ling Ren 001; Elaine Shi (Distributed Comput., 2023)

Toward Basing Cryptography on the Hardness of EXP. - Yanyi Liu; Rafael Pass (Commun. ACM, 2023)

On Black-Box Meta Complexity and Function Inversion. - Noam Mazor; Rafael Pass (APPROX/RANDOM, 2024)

Public-Coin, Complexity-Preserving, Succinct Arguments of Knowledge for NP from Collision-Resistance. - Cody Freitag; Omer Paneth; Rafael Pass (EUROCRYPT (4), 2024)

On One-Way Functions, the Worst-Case Hardness of Time-Bounded Kolmogorov Complexity, and Computational Depth. - Yanyi Liu; Rafael Pass (TCC (1), 2024)

On the Viability of Open-Source Financial Rails: Economic Security of Permissionless Consensus. - Jacob D. Leshno; Elaine Shi; Rafael Pass (CoRR, 2024)

Fair Interest Rates Are Impossible for Lending Pools: Results from Options Pricing. - Joe Halpern; Rafael Pass; Aditya Saraf (CoRR, 2024)

Kolmogorov Comes to Cryptomania: On Interactive Kolmogorov Complexity and Key-Agreement. - Marshall Ball; Yanyi Liu; Noam Mazor; Rafael Pass (Electron. Colloquium Comput. Complex., 2024)

A Note on Zero-Knowledge for NP and One-Way Functions. - Yanyi Liu; Noam Mazor; Rafael Pass (Electron. Colloquium Comput. Complex., 2024)

On Witness Encryption and Laconic Zero-Knowledge Arguments. - Yanyi Liu; Noam Mazor; Rafael Pass (Electron. Colloquium Comput. Complex., 2024)

On White-Box Learning and Public-Key Encryption. - Yanyi Liu; Noam Mazor; Rafael Pass (Electron. Colloquium Comput. Complex., 2024)

A Direct PRF Construction from Kolmogorov Complexity. - Yanyi Liu; Rafael Pass (Electron. Colloquium Comput. Complex., 2024)

Lower Bounds on the Overhead of Indistinguishability Obfuscation. - Zhenjian Lu; Noam Mazor; Igor C. Oliveira 001; Rafael Pass (Electron. Colloquium Comput. Complex., 2024)

Search-to-Decision Reductions for Kolmogorov Complexity. - Noam Mazor; Rafael Pass (Electron. Colloquium Comput. Complex., 2024)

Gap MCSP is not (Levin) NP-complete in Obfustopia. - Noam Mazor; Rafael Pass (Electron. Colloquium Comput. Complex., 2024)

Hardness Along the Boundary: Towards One-Way Functions from the Worst-Case Hardness of Time-Bounded Kolmogorov Complexity. - Yanyi Liu; Rafael Pass (CRYPTO (1), 2025)

Guest Column: On Cryptography and Meta-Complexity. - Noam Mazor; Rafael Pass (SIGACT News, 2025)