default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRafael Pass
Person information
- affiliation: Cornell University, Ithaca, USA
- affiliation (former): Massachusetts Institute of Technology, Cambridge, MA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c159]Noam Mazor, Rafael Pass:
On Black-Box Meta Complexity and Function Inversion. APPROX/RANDOM 2024: 66:1-66:12- [c158]Noam Mazor, Rafael Pass:
Search-To-Decision Reductions for Kolmogorov Complexity. CCC 2024: 34:1-34:20 - [c157]Noam Mazor, Rafael Pass:
Gap MCSP Is Not (Levin) NP-Complete in Obfustopia. CCC 2024: 36:1-36:21 - [c156]Cody Freitag, Omer Paneth, Rafael Pass:
Public-Coin, Complexity-Preserving, Succinct Arguments of Knowledge for NP from Collision-Resistance. EUROCRYPT (4) 2024: 112-141 - [c155]Yanyi Liu, Rafael Pass:
A Direct PRF Construction from Kolmogorov Complexity. EUROCRYPT (4) 2024: 375-406 - [c154]Noam Mazor, Rafael Pass:
The Non-Uniform Perebor Conjecture for Time-Bounded Kolmogorov Complexity Is False. ITCS 2024: 80:1-80:20 - [i137]Jacob D. Leshno, Elaine Shi, Rafael Pass:
On the Viability of Open-Source Financial Rails: Economic Security of Permissionless Consensus. CoRR abs/2409.08951 (2024) - [i136]Joe Halpern, Rafael Pass, Aditya Saraf:
Fair Interest Rates Are Impossible for Lending Pools: Results from Options Pricing. CoRR abs/2410.11053 (2024) - [i135]Marshall Ball, Yanyi Liu, Noam Mazor, Rafael Pass:
Kolmogorov Comes to Cryptomania: On Interactive Kolmogorov Complexity and Key-Agreement. Electron. Colloquium Comput. Complex. TR24 (2024) - [i134]Yanyi Liu, Noam Mazor, Rafael Pass:
A Note on Zero-Knowledge for NP and One-Way Functions. Electron. Colloquium Comput. Complex. TR24 (2024) - [i133]Yanyi Liu, Rafael Pass:
A Direct PRF Construction from Kolmogorov Complexity. Electron. Colloquium Comput. Complex. TR24 (2024) - [i132]Zhenjian Lu, Noam Mazor, Igor C. Oliveira, Rafael Pass:
Lower Bounds on the Overhead of Indistinguishability Obfuscation. Electron. Colloquium Comput. Complex. TR24 (2024) - [i131]Noam Mazor, Rafael Pass:
Search-to-Decision Reductions for Kolmogorov Complexity. Electron. Colloquium Comput. Complex. TR24 (2024) - [i130]Noam Mazor, Rafael Pass:
Gap MCSP is not (Levin) NP-complete in Obfustopia. Electron. Colloquium Comput. Complex. TR24 (2024) - [i129]Yanyi Liu, Rafael Pass:
A Direct PRF Construction from Kolmogorov Complexity. IACR Cryptol. ePrint Arch. 2024: 399 (2024) - [i128]Noam Mazor, Rafael Pass:
Gap MCSP is not (Levin) NP-complete in Obfustopia. IACR Cryptol. ePrint Arch. 2024: 420 (2024) - [i127]Marshall Ball, Yanyi Liu, Noam Mazor, Rafael Pass:
Kolmogorov Comes to Cryptomania: On Interactive Kolmogorov Complexity and Key-Agreement. IACR Cryptol. ePrint Arch. 2024: 425 (2024) - [i126]Yanyi Liu, Noam Mazor, Rafael Pass:
A Note on Zero-Knowledge for NP and One-Way Functions. IACR Cryptol. ePrint Arch. 2024: 800 (2024) - [i125]Zhenjian Lu, Noam Mazor, Igor C. Oliveira, Rafael Pass:
Lower Bounds on the Overhead of Indistinguishability Obfuscation. IACR Cryptol. ePrint Arch. 2024: 1524 (2024) - 2023
- [j35]Yanyi Liu, Rafael Pass:
Toward Basing Cryptography on the Hardness of EXP. Commun. ACM 66(5): 91-99 (2023) - [j34]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): 3-28 (2023) - [c153]Yanyi Liu, Rafael Pass:
Leakage-Resilient Hardness vs Randomness. CCC 2023: 32:1-32:20 - [c152]Yanyi Liu, Rafael Pass:
One-Way Functions and the Hardness of (Probabilistic) Time-Bounded Kolmogorov Complexity w.r.t. Samplable Distributions. CRYPTO (2) 2023: 645-673 - [c151]Marshall Ball, Yanyi Liu, Noam Mazor, Rafael Pass:
Kolmogorov Comes to Cryptomania: On Interactive Kolmogorov Complexity and Key-Agreement. FOCS 2023: 458-483 - [c150]Noam Mazor, Rafael Pass:
Counting Unpredictable Bits: A Simple PRG from One-Way Functions. TCC (1) 2023: 191-218 - [c149]Yanyi Liu, Rafael Pass:
On One-Way Functions and Sparse Languages. TCC (1) 2023: 219-237 - [c148]Benjamin Y. Chan, Rafael Pass:
Simplex Consensus: A Simple and Fast Consensus Protocol. TCC (4) 2023: 452-479 - [i124]Yanyi Liu, Rafael Pass:
On One-way Functions and the Worst-case Hardness of Time-Bounded Kolmogorov Complexity. Electron. Colloquium Comput. Complex. TR23 (2023) - [i123]Yanyi Liu, Rafael Pass:
One-way Functions and Hardness of (Probabilistic) Time-Bounded Kolmogorov Complexity w.r.t. Samplable Distributions. Electron. Colloquium Comput. Complex. TR23 (2023) - [i122]Noam Mazor, Rafael Pass:
Counting Unpredictable Bits: A Simple PRG from One-way Functions. Electron. Colloquium Comput. Complex. TR23 (2023) - [i121]Noam Mazor, Rafael Pass:
The Non-Uniform Perebor Conjecture for Time-Bounded Kolmogorov Complexity is False. Electron. Colloquium Comput. Complex. TR23 (2023) - [i120]Noam Mazor, Rafael Pass:
A Note On the Universality of Black-box MKtP Solvers. Electron. Colloquium Comput. Complex. TR23 (2023) - [i119]Rafael Pass, Oren Renard:
Characterizing the Power of (Persistent) Randomness in Log-space. Electron. Colloquium Comput. Complex. TR23 (2023) - [i118]Benjamin Y. Chan, Rafael Pass:
Simplex Consensus: A Simple and Fast Consensus Protocol. IACR Cryptol. ePrint Arch. 2023: 463 (2023) - [i117]Yanyi Liu, Rafael Pass:
On One-way Functions and the Worst-case Hardness of Time-Bounded Kolmogorov Complexity. IACR Cryptol. ePrint Arch. 2023: 1086 (2023) - [i116]Omer Paneth, Rafael Pass:
Incrementally Verifiable Computation via Rate-1 Batch Arguments. IACR Cryptol. ePrint Arch. 2023: 1394 (2023) - [i115]Noam Mazor, Rafael Pass:
Counting Unpredictable Bits: A Simple PRG from One-way Functions. IACR Cryptol. ePrint Arch. 2023: 1451 (2023) - [i114]Jacob D. Leshno, Rafael Pass, Elaine Shi:
Can open decentralized ledgers be economically secure? IACR Cryptol. ePrint Arch. 2023: 1516 (2023) - [i113]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: 1591 (2023) - [i112]Noam Mazor, Rafael Pass:
The Non-Uniform Perebor Conjecture for Time-Bounded Kolmogorov Complexity is False. IACR Cryptol. ePrint Arch. 2023: 1765 (2023) - [i111]Noam Mazor, Rafael Pass:
A Note On the Universality of Black-box MKtP Solvers. IACR Cryptol. ePrint Arch. 2023: 1832 (2023) - 2022
- [j33]Naomi Ephraim, Cody Freitag, Ilan Komargodski, Rafael Pass:
SPARKs: Succinct Parallelizable Arguments of Knowledge. J. ACM 69(5): 31:1-31:88 (2022) - [j32]Gilad Asharov, T.-H. Hubert Chan, Kartik Nayak, Rafael Pass, Ling Ren, Elaine Shi:
Locality-Preserving Oblivious RAM. J. Cryptol. 35(2): 6 (2022) - [j31]Gilad Asharov, Ilan Komargodski, Rafael Pass, Naomi Sirkin:
On the Complexity of Compressing Obfuscation. J. Cryptol. 35(3): 21 (2022) - [j30]Ilan Komargodski, Tal Moran, Moni Naor, Rafael Pass, Alon Rosen, Eylon Yogev:
One-Way Functions and (Im)perfect Obfuscation. SIAM J. Comput. 51(6): 1769-1795 (2022) - [c147]Andrew Morgan, Rafael Pass:
Concurrently Composable Non-interactive Secure Computation. ASIACRYPT (1) 2022: 526-555 - [c146]Yanyi Liu, Rafael Pass:
Characterizing Derandomization Through Hardness of Levin-Kolmogorov Complexity. CCC 2022: 35:1-35:17 - [c145]Yanyi Liu, Rafael Pass:
On One-Way Functions from NP-Complete Problems. CCC 2022: 36:1-36:24 - [c144]Omer Paneth, Rafael Pass:
Incrementally Verifiable Computation via Rate-1 Batch Arguments. FOCS 2022: 1045-1056 - [c143]Benjamin Y. Chan, Cody Freitag, Rafael Pass:
Universal Reductions: Reductions Relative to Stateful Oracles. TCC (3) 2022: 151-180 - [c142]Cody Freitag, Rafael Pass, Naomi Sirkin:
Parallelizable Delegation from LWE. TCC (2) 2022: 623-652 - [e4]Vincent Gramoli, Hanna Halaburda, Rafael Pass:
3rd International Conference on Blockchain Economics, Security and Protocols, Tokenomics 2021, November 18-19, 2021, New York University, USA (Virtual Conference). OASIcs 97, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2022, ISBN 978-3-95977-220-4 [contents] - [i110]Yanyi Liu, Rafael Pass:
Characterizing Derandomization Through Hardness of Levin-Kolmogorov Complexity. Electron. Colloquium Comput. Complex. TR22 (2022) - [i109]Yanyi Liu, Rafael Pass:
Leakage-Resilient Hardness v.s. Randomness. Electron. Colloquium Comput. Complex. TR22 (2022) - [i108]Benjamin Y. Chan, Cody Freitag, Rafael Pass:
Cosmic Security. IACR Cryptol. ePrint Arch. 2022: 156 (2022) - [i107]Cody Freitag, Rafael Pass, Naomi Sirkin:
Parallelizable Delegation from LWE. IACR Cryptol. ePrint Arch. 2022: 1025 (2022) - 2021
- [j29]Rafael Pass, Muthuramakrishnan Venkitasubramaniam:
Guest Column: Average-case Complexity Through the Lens of Interactive Puzzles. SIGACT News 52(1): 47-69 (2021) - [j28]Joseph Y. Halpern, Rafael Pass:
Sequential Equilibrium in Games of Imperfect Recall. ACM Trans. Economics and Comput. 9(4): 22:1-22:26 (2021) - [c141]Yanyi Liu, Rafael Pass:
On the Possibility of Basing Cryptography on EXP≠ BPP. CRYPTO (1) 2021: 11-40 - [c140]Dana Dachman-Soled, Ilan Komargodski, Rafael Pass:
Non-malleable Codes for Bounded Parallel-Time Tampering. CRYPTO (3) 2021: 535-565 - [c139]Yanyi Liu, Rafael Pass:
Cryptography from sublinear-time average-case hardness of time-bounded Kolmogorov complexity. STOC 2021: 722-735 - [c138]Romain Gay, Rafael Pass:
Indistinguishability obfuscation from circular security. STOC 2021: 736-749 - [c137]Cody Freitag, Ilan Komargodski, Rafael Pass, Naomi Sirkin:
Non-malleable Time-Lock Puzzles and Applications. TCC (3) 2021: 447-479 - [i106]Yanyi Liu, Rafael Pass:
Cryptography from Sublinear-Time Average-Case Hardness of Time-Bounded Kolmogorov Complexity. Electron. Colloquium Comput. Complex. TR21 (2021) - [i105]Yanyi Liu, Rafael Pass:
On the Possibility of Basing Cryptography on $\EXP \neq \BPP$. Electron. Colloquium Comput. Complex. TR21 (2021) - [i104]Yanyi Liu, Rafael Pass:
On One-way Functions from NP-Complete Problems. Electron. Colloquium Comput. Complex. TR21 (2021) - [i103]Yanyi Liu, Rafael Pass:
A Note on One-way Functions and Sparse Languages. Electron. Colloquium Comput. Complex. TR21 (2021) - [i102]Yanyi Liu, Rafael Pass:
On One-way Functions from NP-Complete Problems. IACR Cryptol. ePrint Arch. 2021: 513 (2021) - [i101]Yanyi Liu, Rafael Pass:
Cryptography from Sublinear-Time Average-Case Hardness of Time-Bounded Kolmogorov Complexity. IACR Cryptol. ePrint Arch. 2021: 517 (2021) - [i100]Yanyi Liu, Rafael Pass:
On the Possibility of Basing Cryptography on $\EXP \neq \BPP$. IACR Cryptol. ePrint Arch. 2021: 535 (2021) - [i99]Rafael Pass:
Unprovability of Leakage-Resilient Cryptography Beyond the Information-Theoretic Limit. IACR Cryptol. ePrint Arch. 2021: 614 (2021) - [i98]Rafael Pass:
A Tutorial on Concurrent Zero Knowledge. IACR Cryptol. ePrint Arch. 2021: 615 (2021) - [i97]Yanyi Liu, Rafael Pass:
A Note on One-way Functions and Sparse Languages. IACR Cryptol. ePrint Arch. 2021: 890 (2021) - [i96]Andrew Morgan, Rafael Pass:
Concurrently Composable Non-Interactive Secure Computation. IACR Cryptol. ePrint Arch. 2021: 1562 (2021) - 2020
- [j27]Adam Bjorndahl, Joseph Y. Halpern, Rafael Pass:
Bayesian games with intentions. Games Econ. Behav. 123: 54-67 (2020) - [j26]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) - [c136]Andrew Morgan, Rafael Pass, Elaine Shi:
On the Adaptive Security of MACs and PRFs. ASIACRYPT (1) 2020: 724-753 - [c135]Naomi Ephraim, Cody Freitag, Ilan Komargodski, Rafael Pass:
Continuous Verifiable Delay Functions. EUROCRYPT (3) 2020: 125-154 - [c134]Andrew Morgan, Rafael Pass, Antigoni Polychroniadou:
Succinct Non-interactive Secure Computation. EUROCRYPT (2) 2020: 216-245 - [c133]Carmit Hazay, Rafael Pass, Muthuramakrishnan Venkitasubramaniam:
Which Languages Have 4-Round Fully Black-Box Zero-Knowledge Arguments from One-Way Functions? EUROCRYPT (3) 2020: 599-619 - [c132]Naomi Ephraim, Cody Freitag, Ilan Komargodski, Rafael Pass:
SPARKs: Succinct Parallelizable Arguments of Knowledge. EUROCRYPT (1) 2020: 707-737 - [c131]Yanyi Liu, Rafael Pass:
On One-way Functions and Kolmogorov Complexity. FOCS 2020: 1243-1254 - [c130]Rafael Pass, Muthuramakrishnan Venkitasubramaniam:
Is it Easier to Prove Theorems that are Guaranteed to be True? FOCS 2020: 1255-1267 - [c129]T.-H. Hubert Chan, Rafael Pass, Elaine Shi:
Sublinear-Round Byzantine Agreement Under Corrupt Majority. Public Key Cryptography (2) 2020: 246-265 - [c128]Cody Freitag, Ilan Komargodski, Rafael Pass:
Impossibility of Strong KDM Security with Auxiliary Input. SCN 2020: 512-524 - [c127]Rafael Pass:
Unprovability of Leakage-Resilient Cryptography Beyond the Information-Theoretic Limit. SCN 2020: 621-642 - [c126]Gilad Asharov, T.-H. Hubert Chan, Kartik Nayak, Rafael Pass, Ling Ren, Elaine Shi:
Bucket Oblivious Sort: An Extremely Simple Oblivious Sort. SOSA 2020: 8-14 - [e3]Rafael Pass, Krzysztof Pietrzak:
Theory of Cryptography - 18th International Conference, TCC 2020, Durham, NC, USA, November 16-19, 2020, Proceedings, Part I. Lecture Notes in Computer Science 12550, Springer 2020, ISBN 978-3-030-64374-4 [contents] - [e2]Rafael Pass, Krzysztof Pietrzak:
Theory of Cryptography - 18th International Conference, TCC 2020, Durham, NC, USA, November 16-19, 2020, Proceedings, Part II. Lecture Notes in Computer Science 12551, Springer 2020, ISBN 978-3-030-64377-5 [contents] - [e1]Rafael Pass, Krzysztof Pietrzak:
Theory of Cryptography - 18th International Conference, TCC 2020, Durham, NC, USA, November 16-19, 2020, Proceedings, Part III. Lecture Notes in Computer Science 12552, Springer 2020, ISBN 978-3-030-64380-5 [contents] - [i95]Gilad Asharov, T.-H. Hubert Chan, Kartik Nayak, Rafael Pass, Ling Ren, Elaine Shi:
Bucket Oblivious Sort: An Extremely Simple Oblivious Sort. CoRR abs/2008.01765 (2020) - [i94]Yanyi Liu, Rafael Pass:
On One-way Functions and Kolmogorov Complexity. CoRR abs/2009.11514 (2020) - [i93]Yanyi Liu, Rafael Pass:
On One-way Functions and Kolmogorov Complexity. Electron. Colloquium Comput. Complex. TR20 (2020) - [i92]Rafael Pass, Muthuramakrishnan Venkitasubramaniam:
Is it Easier to Prove Theorems that are Guaranteed to be True? Electron. Colloquium Comput. Complex. TR20 (2020) - [i91]Yanyi Liu, Rafael Pass:
On One-way Functions and Kolmogorov Complexity. IACR Cryptol. ePrint Arch. 2020: 423 (2020) - [i90]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: 677 (2020) - [i89]Dana Dachman-Soled, Ilan Komargodski, Rafael Pass:
Non-Malleable Codes for Bounded Polynomial Depth Tampering. IACR Cryptol. ePrint Arch. 2020: 776 (2020) - [i88]Naomi Ephraim, Cody Freitag, Ilan Komargodski, Rafael Pass:
Non-Malleable Time-Lock Puzzles and Applications. IACR Cryptol. ePrint Arch. 2020: 779 (2020) - [i87]Naomi Ephraim, Cody Freitag, Ilan Komargodski, Rafael Pass:
SPARKs: Succinct Parallelizable Arguments of Knowledge. IACR Cryptol. ePrint Arch. 2020: 994 (2020) - [i86]Romain Gay, Rafael Pass:
Indistinguishability Obfuscation from Circular Security. IACR Cryptol. ePrint Arch. 2020: 1010 (2020) - [i85]Andrew Morgan, Rafael Pass, Elaine Shi:
On the Adaptive Security of MACs and PRFs. IACR Cryptol. ePrint Arch. 2020: 1090 (2020)
2010 – 2019
- 2019
- [j25]Joseph Y. Halpern, Rafael Pass, Lior Seeman:
The truth behind the myth of the Folk theorem. Games Econ. Behav. 117: 479-498 (2019) - [j24]Joseph Y. Halpern, Rafael Pass:
Sequential Equilibrium in Computational Games. ACM Trans. Economics and Comput. 7(2): 9:1-9:19 (2019) - [c125]Andrew Morgan, Rafael Pass:
Paradoxes in Fair Computer-Aided Decision Making. AIES 2019: 85-90 - [c124]Cody Freitag, Ilan Komargodski, Rafael Pass:
Non-Uniformly Sound Certificates with Applications to Concurrent Zero-Knowledge. CRYPTO (3) 2019: 98-127 - [c123]Yue Guo, Rafael Pass, Elaine Shi:
Synchronous, with a Chance of Partition Tolerance. CRYPTO (1) 2019: 499-529 - [c122]Gilad Asharov, T.-H. Hubert Chan, Kartik Nayak, Rafael Pass, Ling Ren, Elaine Shi:
Locality-Preserving Oblivious RAM. EUROCRYPT (2) 2019: 214-243 - [c121]T.-H. Hubert Chan, Rafael Pass, Elaine Shi:
Consensus Through Herding. EUROCRYPT (1) 2019: 720-749 - [c120]Phil Daian, Rafael Pass, Elaine Shi:
Snow White: Robustly Reconfigurable Consensus and Applications to Provably Secure Proof of Stake. Financial Cryptography 2019: 23-41 - [c119]Antonio Marcedone, Rafael Pass, Abhi Shelat:
Minimizing Trust in Hardware Wallets with Two Factor Signatures. Financial Cryptography 2019: 407-425 - [c118]Ittai Abraham, T.-H. Hubert Chan, Danny Dolev, Kartik Nayak, Rafael Pass, Ling Ren, Elaine Shi:
Communication Complexity of Byzantine Agreement, Revisited. PODC 2019: 317-326 - [c117]Joseph Y. Halpern, Rafael Pass, Daniel Reichman:
On the Existence of Nash Equilibrium in Games with Resource-Bounded Players. SAGT 2019: 139-152 - [c116]Liang Wang, Gilad Asharov, Rafael Pass, Thomas Ristenpart, Abhi Shelat:
Blind Certificate Authorities. IEEE Symposium on Security and Privacy 2019: 1015-1032 - [c115]Joseph Y. Halpern, Rafael Pass:
A Conceptually Well-Founded Characterization of Iterated Admissibility Using an "All I Know" Operator. TARK 2019: 221-232 - [p1]Rafael Pass:
A tutorial on concurrent zero-knowledge. Providing Sound Foundations for Cryptography 2019: 623-648 - [i84]Rafael Pass, Muthuramakrishnan Venkitasubramaniam:
A Round-Collapse Theorem for Computationally-Sound Protocols; or, TFNP is Hard (on Average) in Pessiland. CoRR abs/1906.10837 (2019) - [i83]Antonio Marcedone, Rafael Pass, Abhi Shelat:
Minimizing Trust in Hardware Wallets with Two Factor Signatures. IACR Cryptol. ePrint Arch. 2019: 6 (2019) - [i82]Yue Guo, Rafael Pass, Elaine Shi:
Synchronous, with a Chance of Partition Tolerance. IACR Cryptol. ePrint Arch. 2019: 179 (2019) - [i81]T.-H. Hubert Chan, Rafael Pass, Elaine Shi:
Consensus through Herding. IACR Cryptol. ePrint Arch. 2019: 251 (2019) - [i80]Cody Freitag, Ilan Komargodski, Rafael Pass:
Impossibility of Strong KDM Security with Auxiliary Input. IACR Cryptol. ePrint Arch. 2019: 293 (2019) - [i79]Naomi Ephraim, Cody Freitag, Ilan Komargodski, Rafael Pass:
Continuous Verifiable Delay Functions. IACR Cryptol. ePrint Arch. 2019: 619 (2019) - [i78]Cody Freitag, Ilan Komargodski, Rafael Pass:
Non-Uniformly Sound Certificates with Applications to Concurrent Zero-Knowledge. IACR Cryptol. ePrint Arch. 2019: 631 (2019) - [i77]Rafael Pass, Muthuramakrishnan Venkitasubramaniam:
A Round-Collapse Theorem for Computationally-Sound Protocols; or, TFNP is Hard (on Average) in Pessiland. IACR Cryptol. ePrint Arch. 2019: 754 (2019) - [i76]