Rafael Pass

ORCID

Publication Activity (10 Years)

Years Active: 2003-2024
Publications (10 Years): 172

Top Venues

IACR Cryptol. ePrint Arch.

Electron. Colloquium Comput. Complex.

CoRR

TCC (1)

Massachusetts Institute of Technology, Cambridge, MA, USA (PHD)

Education History

Massachusetts Institute of Technology, Cambridge, MA, USA

PHD

Publications

Yanyi Liu, Rafael Pass
A Direct PRF Construction from Kolmogorov Complexity. IACR Cryptol. ePrint Arch. 2024 (2024)
Yanyi Liu, Rafael Pass
A Direct PRF Construction from Kolmogorov Complexity. Electron. Colloquium Comput. Complex. (2024)
Noam Mazor, Rafael Pass
Search-to-Decision Reductions for Kolmogorov Complexity. Electron. Colloquium Comput. Complex. (2024)
Marshall Ball, Yanyi Liu, Noam Mazor, Rafael Pass
Kolmogorov Comes to Cryptomania: On Interactive Kolmogorov Complexity and Key-Agreement. IACR Cryptol. ePrint Arch. 2024 (2024)
Noam Mazor, Rafael Pass
Gap MCSP is not (Levin) NP-complete in Obfustopia. IACR Cryptol. ePrint Arch. 2024 (2024)
Yanyi Liu, Rafael Pass
A Direct PRF Construction from Kolmogorov Complexity. EUROCRYPT (4) (2024)
Noam Mazor, Rafael Pass
Gap MCSP Is Not (Levin) NP-Complete in Obfustopia. CCC (2024)
Marshall Ball, Yanyi Liu, Noam Mazor, Rafael Pass
Kolmogorov Comes to Cryptomania: On Interactive Kolmogorov Complexity and Key-Agreement. Electron. Colloquium Comput. Complex. (2024)
Noam Mazor, Rafael Pass
Search-To-Decision Reductions for Kolmogorov Complexity. CCC (2024)
Noam Mazor, Rafael Pass
Gap MCSP is not (Levin) NP-complete in Obfustopia. Electron. Colloquium Comput. Complex. (2024)
Noam Mazor, Rafael Pass
The Non-Uniform Perebor Conjecture for Time-Bounded Kolmogorov Complexity Is False. ITCS (2024)
Yanyi Liu, Noam Mazor, Rafael Pass
A Note on Zero-Knowledge for NP and One-Way Functions. Electron. Colloquium Comput. Complex. (2024)
Yanyi Liu, Noam Mazor, Rafael Pass
A Note on Zero-Knowledge for NP and One-Way Functions. IACR Cryptol. ePrint Arch. 2024 (2024)
Cody Freitag, Omer Paneth, Rafael Pass
Public-Coin, Complexity-Preserving, Succinct Arguments of Knowledge for NP from Collision-Resistance. EUROCRYPT (4) (2024)
Marshall Ball, Yanyi Liu, Noam Mazor, Rafael Pass
Kolmogorov Comes to Cryptomania: On Interactive Kolmogorov Complexity and Key-Agreement. FOCS (2023)
Yanyi Liu, Rafael Pass
One-way Functions and Hardness of (Probabilistic) Time-Bounded Kolmogorov Complexity w.r.t. Samplable Distributions. Electron. Colloquium Comput. Complex. (2023)
Yanyi Liu, Rafael Pass
One-way Functions and Hardness of (Probabilistic) Time-Bounded Kolmogorov Complexity w.r.t. Samplable Distributions. IACR Cryptol. ePrint Arch. 2023 (2023)
Benjamin Y. Chan, Rafael Pass
Simplex Consensus: A Simple and Fast Consensus Protocol. IACR Cryptol. ePrint Arch. 2023 (2023)
Yanyi Liu, Rafael Pass
On One-way Functions and the Worst-case Hardness of Time-Bounded Kolmogorov Complexity. IACR Cryptol. ePrint Arch. 2023 (2023)
Noam Mazor, Rafael Pass
Counting Unpredictable Bits: A Simple PRG from One-way Functions. Electron. Colloquium Comput. Complex. (2023)
Noam Mazor, Rafael Pass
The Non-Uniform Perebor Conjecture for Time-Bounded Kolmogorov Complexity is False. Electron. Colloquium Comput. Complex. (2023)
Noam Mazor, Rafael Pass
A Note On the Universality of Black-box MKtP Solvers. Electron. Colloquium Comput. Complex. (2023)
Noam Mazor, Rafael Pass
The Non-Uniform Perebor Conjecture for Time-Bounded Kolmogorov Complexity is False. IACR Cryptol. ePrint Arch. 2023 (2023)
Noam Mazor, Rafael Pass
A Note On the Universality of Black-box MKtP Solvers. IACR Cryptol. ePrint Arch. 2023 (2023)
Rafael Pass, Oren Renard
Characterizing the Power of (Persistent) Randomness in Log-space. Electron. Colloquium Comput. Complex. (2023)
Benjamin Y. Chan, Rafael Pass
Simplex Consensus: A Simple and Fast Consensus Protocol. TCC (4) (2023)
Yanyi Liu, Rafael Pass
Toward Basing Cryptography on the Hardness of EXP. Commun. ACM 66 (5) (2023)
Noam Mazor, Rafael Pass
Counting Unpredictable Bits: A Simple PRG from One-Way Functions. TCC (1) (2023)
Yanyi Liu, Rafael Pass
On One-Way Functions and Sparse Languages. TCC (1) (2023)
Omer Paneth, Rafael Pass
Incrementally Verifiable Computation via Rate-1 Batch Arguments. IACR Cryptol. ePrint Arch. 2023 (2023)
Ittai Abraham, T.-H. Hubert Chan, Danny Dolev, Kartik Nayak, Rafael Pass, Ling Ren, Elaine Shi
Communication complexity of byzantine agreement, revisited. Distributed Comput. 36 (1) (2023)
Yanyi Liu, Rafael Pass
On One-way Functions and the Worst-case Hardness of Time-Bounded Kolmogorov Complexity. Electron. Colloquium Comput. Complex. (2023)
Yanyi Liu, Rafael Pass
One-Way Functions and the Hardness of (Probabilistic) Time-Bounded Kolmogorov Complexity w.r.t. Samplable Distributions. CRYPTO (2) (2023)
Yanyi Liu, Rafael Pass
Leakage-Resilient Hardness vs Randomness. CCC (2023)
Noam Mazor, Rafael Pass
Counting Unpredictable Bits: A Simple PRG from One-way Functions. IACR Cryptol. ePrint Arch. 2023 (2023)
Jacob Leshno, Rafael Pass, Elaine Shi
Can open decentralized ledgers be economically secure? IACR Cryptol. ePrint Arch. 2023 (2023)
Naomi Ephraim, Cody Freitag, Ilan Komargodski, Rafael Pass
SPARKs: Succinct Parallelizable Arguments of Knowledge. J. ACM 69 (5) (2022)
Gilad Asharov, T.-H. Hubert Chan, Kartik Nayak, Rafael Pass, Ling Ren, Elaine Shi
Locality-Preserving Oblivious RAM. J. Cryptol. 35 (2) (2022)
Ilan Komargodski, Tal Moran, Moni Naor, Rafael Pass, Alon Rosen, Eylon Yogev
One-Way Functions and (Im)perfect Obfuscation. SIAM J. Comput. 51 (6) (2022)
Yanyi Liu, Rafael Pass
Characterizing Derandomization Through Hardness of Levin-Kolmogorov Complexity. CCC (2022)
Gilad Asharov, Ilan Komargodski, Rafael Pass, Naomi Sirkin
On the Complexity of Compressing Obfuscation. J. Cryptol. 35 (3) (2022)
Cody Freitag, Rafael Pass, Naomi Sirkin
Parallelizable Delegation from LWE. IACR Cryptol. ePrint Arch. 2022 (2022)
Yanyi Liu, Rafael Pass
On One-Way Functions from NP-Complete Problems. CCC (2022)
Andrew Morgan, Rafael Pass
Concurrently Composable Non-interactive Secure Computation. ASIACRYPT (1) (2022)
Benjamin Chan, Cody Freitag, Rafael Pass
Universal Reductions: Reductions Relative to Stateful Oracles. TCC (3) (2022)
Omer Paneth, Rafael Pass
Incrementally Verifiable Computation via Rate-1 Batch Arguments. FOCS (2022)
Yanyi Liu, Rafael Pass
Leakage-Resilient Hardness v.s. Randomness. Electron. Colloquium Comput. Complex. (2022)
Benjamin Chan, Cody Freitag, Rafael Pass
Cosmic Security. IACR Cryptol. ePrint Arch. 2022 (2022)
Yanyi Liu, Rafael Pass
Characterizing Derandomization Through Hardness of Levin-Kolmogorov Complexity. Electron. Colloquium Comput. Complex. (2022)
Cody Freitag, Rafael Pass, Naomi Sirkin
Parallelizable Delegation from LWE. TCC (2) (2022)
Yanyi Liu, Rafael Pass
On One-way Functions from NP-Complete Problems. Electron. Colloquium Comput. Complex. 28 (2021)
Yanyi Liu, Rafael Pass
On the Possibility of Basing Cryptography on $\EXP \neq \BPP$. Electron. Colloquium Comput. Complex. 28 (2021)
Yanyi Liu, Rafael Pass
A Note on One-way Functions and Sparse Languages. Electron. Colloquium Comput. Complex. 28 (2021)
Yanyi Liu, Rafael Pass
On the Possibility of Basing Cryptography on EXP≠ BPP. CRYPTO (1) (2021)
Rafael Pass
A Tutorial on Concurrent Zero Knowledge. IACR Cryptol. ePrint Arch. 2021 (2021)
Yanyi Liu, Rafael Pass
Cryptography from Sublinear-Time Average-Case Hardness of Time-Bounded Kolmogorov Complexity. IACR Cryptol. ePrint Arch. 2021 (2021)
Cody Freitag, Ilan Komargodski, Rafael Pass, Naomi Sirkin
Non-malleable Time-Lock Puzzles and Applications. TCC (3) (2021)
Joseph Y. Halpern, Rafael Pass
Sequential Equilibrium in Games of Imperfect Recall. ACM Trans. Economics and Comput. 9 (4) (2021)
Yanyi Liu, Rafael Pass
Cryptography from sublinear-time average-case hardness of time-bounded Kolmogorov complexity. STOC (2021)
Yanyi Liu, Rafael Pass
On the Possibility of Basing Cryptography on $\EXP \neq \BPP$. IACR Cryptol. ePrint Arch. 2021 (2021)
Dana Dachman-Soled, Ilan Komargodski, Rafael Pass
Non-malleable Codes for Bounded Parallel-Time Tampering. CRYPTO (3) (2021)
Yanyi Liu, Rafael Pass
Cryptography from Sublinear-Time Average-Case Hardness of Time-Bounded Kolmogorov Complexity. Electron. Colloquium Comput. Complex. 28 (2021)
Rafael Pass, Muthuramakrishnan Venkitasubramaniam
Guest Column: Average-case Complexity Through the Lens of Interactive Puzzles. SIGACT News 52 (1) (2021)
Rafael Pass
Unprovability of Leakage-Resilient Cryptography Beyond the Information-Theoretic Limit. IACR Cryptol. ePrint Arch. 2021 (2021)
Andrew Morgan, Rafael Pass
Concurrently Composable Non-Interactive Secure Computation. IACR Cryptol. ePrint Arch. 2021 (2021)
Yanyi Liu, Rafael Pass
A Note on One-way Functions and Sparse Languages. IACR Cryptol. ePrint Arch. 2021 (2021)
Romain Gay, Rafael Pass
Indistinguishability obfuscation from circular security. STOC (2021)
Yanyi Liu, Rafael Pass
On One-way Functions from NP-Complete Problems. IACR Cryptol. ePrint Arch. 2021 (2021)
Yanyi Liu, Rafael Pass
On One-way Functions and Kolmogorov Complexity. FOCS (2020)
Carmit Hazay, Rafael Pass, Muthuramakrishnan Venkitasubramaniam
Which Languages Have 4-Round Fully Black-Box Zero-Knowledge Arguments from One-Way Functions? EUROCRYPT (3) (2020)
Gilad Asharov, T.-H. Hubert Chan, Kartik Nayak, Rafael Pass, Ling Ren, Elaine Shi
Bucket Oblivious Sort: An Extremely Simple Oblivious Sort. CoRR (2020)
T.-H. Hubert Chan, Rafael Pass, Elaine Shi
Sublinear-Round Byzantine Agreement Under Corrupt Majority. Public Key Cryptography (2) (2020)
Adam Bjorndahl, Joseph Y. Halpern, Rafael Pass
Bayesian games with intentions. Games Econ. Behav. 123 (2020)
Huijia Lin, Rafael Pass, Pratik Soni
Two-Round and Non-Interactive Concurrent Non-Malleable Commitments from Time-Lock Puzzles. SIAM J. Comput. 49 (4) (2020)
Gilad Asharov, T.-H. Hubert Chan, Kartik Nayak, Rafael Pass, Ling Ren, Elaine Shi
Bucket Oblivious Sort: An Extremely Simple Oblivious Sort. SOSA (2020)
Andrew Morgan, Rafael Pass, Antigoni Polychroniadou
Succinct Non-interactive Secure Computation. EUROCRYPT (2) (2020)
Andrew Morgan, Rafael Pass, Elaine Shi
On the Adaptive Security of MACs and PRFs. IACR Cryptol. ePrint Arch. 2020 (2020)
T.-H. Hubert Chan, Naomi Ephraim, Antonio Marcedone, Andrew Morgan, Rafael Pass, Elaine Shi
Blockchain with Varying Number of Players. IACR Cryptol. ePrint Arch. 2020 (2020)
Cody Freitag, Ilan Komargodski, Rafael Pass
Impossibility of Strong KDM Security with Auxiliary Input. SCN (2020)
Andrew Morgan, Rafael Pass, Elaine Shi
On the Adaptive Security of MACs and PRFs. ASIACRYPT (1) (2020)
Naomi Ephraim, Cody Freitag, Ilan Komargodski, Rafael Pass
SPARKs: Succinct Parallelizable Arguments of Knowledge. EUROCRYPT (1) (2020)
Naomi Ephraim, Cody Freitag, Ilan Komargodski, Rafael Pass
Continuous Verifiable Delay Functions. EUROCRYPT (3) (2020)
Dana Dachman-Soled, Ilan Komargodski, Rafael Pass
Non-Malleable Codes for Bounded Polynomial Depth Tampering. IACR Cryptol. ePrint Arch. 2020 (2020)
Naomi Ephraim, Cody Freitag, Ilan Komargodski, Rafael Pass
SPARKs: Succinct Parallelizable Arguments of Knowledge. IACR Cryptol. ePrint Arch. 2020 (2020)
Rafael Pass, Muthuramakrishnan Venkitasubramaniam
Is it Easier to Prove Theorems that are Guaranteed to be True? FOCS (2020)
Yanyi Liu, Rafael Pass
On One-way Functions and Kolmogorov Complexity. CoRR (2020)
Naomi Ephraim, Cody Freitag, Ilan Komargodski, Rafael Pass
Non-Malleable Time-Lock Puzzles and Applications. IACR Cryptol. ePrint Arch. 2020 (2020)
Yanyi Liu, Rafael Pass
On One-way Functions and Kolmogorov Complexity. IACR Cryptol. ePrint Arch. 2020 (2020)
Yanyi Liu, Rafael Pass
On One-way Functions and Kolmogorov Complexity. Electron. Colloquium Comput. Complex. 27 (2020)
Rafael Pass, Muthuramakrishnan Venkitasubramaniam
Is it Easier to Prove Theorems that are Guaranteed to be True? Electron. Colloquium Comput. Complex. 27 (2020)
Rafael Pass
Unprovability of Leakage-Resilient Cryptography Beyond the Information-Theoretic Limit. SCN (2020)
Romain Gay, Rafael Pass
Indistinguishability Obfuscation from Circular Security. IACR Cryptol. ePrint Arch. 2020 (2020)
Yue Guo, Rafael Pass, Elaine Shi
Synchronous, with a Chance of Partition Tolerance. CRYPTO (1) (2019)
Yue Guo, Rafael Pass, Elaine Shi
Synchronous, with a Chance of Partition Tolerance. IACR Cryptol. ePrint Arch. 2019 (2019)
Antonio Marcedone, Rafael Pass, Abhi Shelat
Minimizing Trust in Hardware Wallets with Two Factor Signatures. Financial Cryptography (2019)
Gilad Asharov, T.-H. Hubert Chan, Kartik Nayak, Rafael Pass, Ling Ren, Elaine Shi
Locality-Preserving Oblivious RAM. EUROCRYPT (2) (2019)
Rafael Pass, Muthuramakrishnan Venkitasubramaniam
A Round-Collapse Theorem for Computationally-Sound Protocols; or, TFNP is Hard (on Average) in Pessiland. CoRR (2019)
Andrew Morgan, Rafael Pass
Paradoxes in Fair Computer-Aided Decision Making. AIES (2019)
Ittai Abraham, T.-H. Hubert Chan, Danny Dolev, Kartik Nayak, Rafael Pass, Ling Ren, Elaine Shi
Communication Complexity of Byzantine Agreement, Revisited. PODC (2019)
T.-H. Hubert Chan, Rafael Pass, Elaine Shi
Consensus Through Herding. EUROCRYPT (1) (2019)

Rafael Pass.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Rafael Pass