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
[c160]Noam Mazor, Rafael Pass:
On Black-Box Meta Complexity and Function Inversion. APPROX/RANDOM 2024: 66:1-66:12- [c159]Noam Mazor, Rafael Pass:
Search-To-Decision Reductions for Kolmogorov Complexity. CCC 2024: 34:1-34:20 - [c158]Noam Mazor, Rafael Pass:
Gap MCSP Is Not (Levin) NP-Complete in Obfustopia. CCC 2024: 36:1-36:21 - [c157]Cody Freitag, Omer Paneth, Rafael Pass:
Public-Coin, Complexity-Preserving, Succinct Arguments of Knowledge for NP from Collision-Resistance. EUROCRYPT (4) 2024: 112-141 - [c156]Yanyi Liu, Rafael Pass:
A Direct PRF Construction from Kolmogorov Complexity. EUROCRYPT (4) 2024: 375-406 - [c155]Noam Mazor, Rafael Pass:
The Non-Uniform Perebor Conjecture for Time-Bounded Kolmogorov Complexity Is False. ITCS 2024: 80:1-80:20 - [c154]Yanyi Liu, Rafael Pass:
On One-Way Functions, the Worst-Case Hardness of Time-Bounded Kolmogorov Complexity, and Computational Depth. TCC (1) 2024: 222-252 - [i141]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) - [i140]Joe Halpern, Rafael Pass, Aditya Saraf:
Fair Interest Rates Are Impossible for Lending Pools: Results from Options Pricing. CoRR abs/2410.11053 (2024) - [i139]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) - [i138]Yanyi Liu, Noam Mazor, Rafael Pass:
A Note on Zero-Knowledge for NP and One-Way Functions. Electron. Colloquium Comput. Complex. TR24 (2024) - [i137]Yanyi Liu, Noam Mazor, Rafael Pass:
On Witness Encryption and Laconic Zero-Knowledge Arguments. Electron. Colloquium Comput. Complex. TR24 (2024) - [i136]Yanyi Liu, Noam Mazor, Rafael Pass:
On White-Box Learning and Public-Key Encryption. Electron. Colloquium Comput. Complex. TR24 (2024) - [i135]Yanyi Liu, Rafael Pass:
A Direct PRF Construction from Kolmogorov Complexity. Electron. Colloquium Comput. Complex. TR24 (2024) - [i134]Zhenjian Lu, Noam Mazor, Igor C. Oliveira, Rafael Pass:
Lower Bounds on the Overhead of Indistinguishability Obfuscation. Electron. Colloquium Comput. Complex. TR24 (2024) - [i133]Noam Mazor, Rafael Pass:
Search-to-Decision Reductions for Kolmogorov Complexity. Electron. Colloquium Comput. Complex. TR24 (2024) - [i132]Noam Mazor, Rafael Pass:
Gap MCSP is not (Levin) NP-complete in Obfustopia. Electron. Colloquium Comput. Complex. TR24 (2024) - [i131]Yanyi Liu, Rafael Pass:
A Direct PRF Construction from Kolmogorov Complexity. IACR Cryptol. ePrint Arch. 2024: 399 (2024) - [i130]Noam Mazor, Rafael Pass:
Gap MCSP is not (Levin) NP-complete in Obfustopia. IACR Cryptol. ePrint Arch. 2024: 420 (2024) - [i129]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) - [i128]Yanyi Liu, Noam Mazor, Rafael Pass:
A Note on Zero-Knowledge for NP and One-Way Functions. IACR Cryptol. ePrint Arch. 2024: 800 (2024) - [i127]Zhenjian Lu, Noam Mazor, Igor C. Oliveira, Rafael Pass:
Lower Bounds on the Overhead of Indistinguishability Obfuscation. IACR Cryptol. ePrint Arch. 2024: 1524 (2024) - [i126]Yanyi Liu, Noam Mazor, Rafael Pass:
On White-Box Learning and Public-Key Encryption. IACR Cryptol. ePrint Arch. 2024: 1931 (2024) - [i125]Yanyi Liu, Noam Mazor, Rafael Pass:
On Witness Encryption and Laconic Zero-Knowledge Arguments. IACR Cryptol. ePrint Arch. 2024: 1932 (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]T.-H. Hubert Chan, Rafael Pass, Elaine Shi:
Round Complexity of Byzantine Agreement, Revisited. IACR Cryptol. ePrint Arch. 2019: 886 (2019) - [i75]Gilad Asharov, Naomi Ephraim, Ilan Komargodski, Rafael Pass:
On Perfect Correctness without Derandomization. IACR Cryptol. ePrint Arch. 2019: 1025 (2019) - [i74]Andrew Morgan, Rafael Pass, Antigoni Polychroniadou:
Succinct Non-Interactive Secure Computation. IACR Cryptol. ePrint Arch. 2019: 1341 (2019) - 2018
- [j23]Joseph Y. Halpern, Rafael Pass:
Game theory with translucent players. Int. J. Game Theory 47(3): 949-976 (2018) - [j22]Nir Bitansky, Ran Canetti, Sanjam Garg, Justin Holmgren, Abhishek Jain, Huijia Lin, Rafael Pass, Sidharth Telang, Vinod Vaikuntanathan:
Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings. SIAM J. Comput. 47(3): 1123-1210 (2018) - [c114]Gilad Asharov, Naomi Ephraim, Ilan Komargodski, Rafael Pass:
On the Complexity of Compressing Obfuscation. CRYPTO (3) 2018: 753-783 - [c113]Rafael Pass, Elaine Shi:
Thunderella: Blockchains with Optimistic Instant Confirmation. EUROCRYPT (2) 2018: 3-33 - [c112]Andrew Morgan, Rafael Pass:
On the Security Loss of Unique Signatures. TCC (1) 2018: 507-536 - [c111]Kai-Min Chung, Yue Guo, Wei-Kai Lin, Rafael Pass, Elaine Shi:
Game Theoretic Notions of Fairness in Multi-party Coin Toss. TCC (1) 2018: 563-596 - [c110]Andrew Morgan, Rafael Pass:
Achieving Fair Treatment in Algorithmic Classification. TCC (1) 2018: 597-625 - [i73]T.-H. Hubert Chan, Rafael Pass, Elaine Shi:
Communication-Efficient Byzantine Agreement without Erasures. CoRR abs/1805.03391 (2018) - [i72]Rafael Pass, Elaine Shi:
Rethinking Large-Scale Consensus. IACR Cryptol. ePrint Arch. 2018: 302 (2018) - [i71]Gilad Asharov, Naomi Ephraim, Ilan Komargodski, Rafael Pass:
On the Complexity of Compressing Obfuscation. IACR Cryptol. ePrint Arch. 2018: 552 (2018) - [i70]Andrew Morgan, Rafael Pass:
On the Security Loss of Unique Signatures. IACR Cryptol. ePrint Arch. 2018: 905 (2018) - [i69]Andrew Morgan, Rafael Pass:
Achieving Fair Treatment in Algorithmic Classification. IACR Cryptol. ePrint Arch. 2018: 911 (2018) - [i68]T.-H. Hubert Chan, Rafael Pass, Elaine Shi:
PiLi: An Extremely Simple Synchronous Blockchain. IACR Cryptol. ePrint Arch. 2018: 980 (2018) - [i67]T.-H. Hubert Chan, Rafael Pass, Elaine Shi:
PaLa: A Simple Partially Synchronous Blockchain. IACR Cryptol. ePrint Arch. 2018: 981 (2018) - [i66]Liang Wang, Gilad Asharov, Rafael Pass, Thomas Ristenpart, Abhi Shelat:
Blind Certificate Authorities. IACR Cryptol. ePrint Arch. 2018: 1022 (2018) - [i65]Kai-Min Chung, Yue Guo, Wei-Kai Lin, Rafael Pass, Elaine Shi:
Game Theoretic Notions of Fairness in Multi-Party Coin Toss. IACR Cryptol. ePrint Arch. 2018: 1076 (2018) - 2017
- [j21]Per Austrin, Kai-Min Chung, Mohammad Mahmoody, Rafael Pass, Karn Seth:
On the Impossibility of Cryptography with Tamperable Randomness. Algorithmica 79(4): 1052-1101 (2017) - [j20]Adam Bjorndahl, Joseph Y. Halpern, Rafael Pass:
Reasoning about rationality. Games Econ. Behav. 104: 146-164 (2017) - [c109]Rafael Pass, Elaine Shi:
The Sleepy Model of Consensus. ASIACRYPT (2) 2017: 380-409 - [c108]Rafael Pass, Elaine Shi:
Rethinking Large-Scale Consensus. CSF 2017: 115-129 - [c107]Rafael Pass, Elaine Shi, Florian Tramèr:
Formal Abstractions for Attested Execution Secure Processors. EUROCRYPT (1) 2017: 260-289 - [c106]Rafael Pass, Lior Seeman, Abhi Shelat:
Analysis of the Blockchain Protocol in Asynchronous Networks. EUROCRYPT (2) 2017: 643-673 - [c105]Huijia Lin, Rafael Pass, Pratik Soni:
Two-Round and Non-Interactive Concurrent Non-Malleable Commitments from Time-Lock Puzzles. FOCS 2017: 576-587 - [c104]Rafael Pass, Elaine Shi:
FruitChains: A Fair Blockchain. PODC 2017: 315-324 - [c103]Elette Boyle, Yuval Ishai, Rafael Pass, Mary Wootters:
Can We Access a Database Both Locally and Privately? TCC (2) 2017: 662-693 - [c102]Rafael Pass, Elaine Shi:
Hybrid Consensus: Efficient Consensus in the Permissionless Model. DISC 2017: 39:1-39:16 - [c101]Ben Fisch, Rafael Pass, Abhi Shelat:
Socially Optimal Mining Pools. WINE 2017: 205-218 - [c100]Joseph Y. Halpern, Rafael Pass:
A Knowledge-Based Analysis of the Blockchain Protocol. TARK 2017: 324-335 - [i64]Ben A. Fisch, Rafael Pass, Abhi Shelat:
Socially Optimal Mining Pools. CoRR abs/1703.03846 (2017) - [i63]Andrew Morgan, Rafael Pass:
Paradoxes in Fair Computer-Aided Decision Making. CoRR abs/1711.11066 (2017) - [i62]Huijia Lin, Rafael Pass, Pratik Soni:
Two-Round Concurrent Non-Malleable Commitment from Time-Lock Puzzles. IACR Cryptol. ePrint Arch. 2017: 273 (2017) - [i61]Elette Boyle, Yuval Ishai, Rafael Pass, Mary Wootters:
Can We Access a Database Both Locally and Privately? IACR Cryptol. ePrint Arch. 2017: 567 (2017) - [i60]Gilad Asharov, T.-H. Hubert Chan, Kartik Nayak, Rafael Pass, Ling Ren, Elaine Shi:
Oblivious Computation with Data Locality. IACR Cryptol. ePrint Arch. 2017: 772 (2017) - [i59]Rafael Pass, Elaine Shi:
Thunderella: Blockchains with Optimistic Instant Confirmation. IACR Cryptol. ePrint Arch. 2017: 913 (2017) - 2016
- [j19]Rafael Pass:
Unprovable Security of Perfect NIZK and Non-interactive Non-malleable Commitments. Comput. Complex. 25(3): 607-666 (2016) - [j18]Kai-Min Chung, Rafael Pass, Karn Seth:
Non-Black-Box Simulation from One-Way Functions and Applications to Resettable Security. SIAM J. Comput. 45(2): 415-458 (2016) - [j17]Ran Canetti, Huijia Lin, Rafael Pass:
Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions. SIAM J. Comput. 45(5): 1793-1834 (2016) - [c99]Joseph Y. Halpern, Rafael Pass:
Sequential Equilibrium in Games of Imperfect Recall. KR 2016: 278-287 - [c98]Huijia Lin, Rafael Pass, Karn Seth, Sidharth Telang:
Indistinguishability Obfuscation with Non-trivial Efficiency. Public Key Cryptography (2) 2016: 447-462 - [c97]Antonio Marcedone, Rafael Pass, Abhi Shelat:
Bounded KDM Security from iO and OWF. SCN 2016: 571-586 - [c96]Joseph Y. Halpern, Rafael Pass, Lior Seeman:
Computational Extensive-Form Games. EC 2016: 681-698 - [c95]Rafael Pass, Abhi Shelat:
Impossibility of VBB Obfuscation with Ideal Constant-Degree Graded Encodings. TCC (A1) 2016: 3-17 - [c94]Mohammad Mahmoody, Ameer Mohammed, Soheil Nematihaji, Rafael Pass, Abhi Shelat:
Lower Bounds on Assumptions Behind Indistinguishability Obfuscation. TCC (A1) 2016: 49-66 - [c93]Huijia Lin, Rafael Pass, Karn Seth, Sidharth Telang:
Output-Compressing Randomized Encodings and Applications. TCC (A1) 2016: 96-124 - [c92]Elette Boyle, Kai-Min Chung, Rafael Pass:
Oblivious Parallel RAM and Applications. TCC (A2) 2016: 175-204 - [i58]Huijia Lin, Rafael Pass, Karn Seth, Sidharth Telang:
Indistinguishability Obfuscation with Non-trivial Efficiency. IACR Cryptol. ePrint Arch. 2016: 6 (2016) - [i57]Mohammad Mahmoody, Ameer Mohammed, Soheil Nematihaji, Rafael Pass, Abhi Shelat:
A Note on Black-Box Complexity of Indistinguishability Obfuscation. IACR Cryptol. ePrint Arch. 2016: 316 (2016) - [i56]Rafael Pass, Abhi Shelat:
Micropayments for Decentralized Currencies. IACR Cryptol. ePrint Arch. 2016: 332 (2016) - [i55]Rafael Pass, Lior Seeman, Abhi Shelat:
Analysis of the Blockchain Protocol in Asynchronous Networks. IACR Cryptol. ePrint Arch. 2016: 454 (2016) - [i54]Antonio Marcedone, Rafael Pass, Abhi Shelat:
Bounded KDM Security from iO and OWF. IACR Cryptol. ePrint Arch. 2016: 688 (2016) - [i53]Rafael Pass, Elaine Shi:
FruitChains: A Fair Blockchain. IACR Cryptol. ePrint Arch. 2016: 916 (2016) - [i52]Rafael Pass, Elaine Shi:
Hybrid Consensus: Efficient Consensus in the Permissionless Model. IACR Cryptol. ePrint Arch. 2016: 917 (2016) - [i51]Iddo Bentov, Rafael Pass, Elaine Shi:
The Sleepy Model of Consensus. IACR Cryptol. ePrint Arch. 2016: 918 (2016) - [i50]Iddo Bentov, Rafael Pass, Elaine Shi:
Snow White: Provably Secure Proofs of Stake. IACR Cryptol. ePrint Arch. 2016: 919 (2016) - [i49]Liang Wang, Rafael Pass, Abhi Shelat, Thomas Ristenpart:
Secure Channel Injection and Anonymous Proofs of Account Ownership. IACR Cryptol. ePrint Arch. 2016: 925 (2016) - [i48]Rafael Pass, Elaine Shi, Florian Tramèr:
Formal Abstractions for Attested Execution Secure Processors. IACR Cryptol. ePrint Arch. 2016: 1027 (2016) - 2015
- [j16]Susan Hohenberger, Steven A. Myers, Rafael Pass, Abhi Shelat:
An Overview of ANONIZE: A Large-Scale Anonymous Survey System. IEEE Secur. Priv. 13(2): 22-29 (2015) - [j15]Huijia Lin, Rafael Pass:
Constant-Round Nonmalleable Commitments from Any One-Way Function. J. ACM 62(1): 5:1-5:30 (2015) - [j14]Joseph Y. Halpern, Rafael Pass:
Algorithmic rationality: Game theory with costly computation. J. Econ. Theory 156: 246-268 (2015) - [c91]Elette Boyle, Rafael Pass:
Limits of Extractability Assumptions with Distributional Auxiliary Input. ASIACRYPT (2) 2015: 236-261 - [c90]Rafael Pass, Abhi Shelat:
Micropayments for Decentralized Currencies. CCS 2015: 207-218 - [c89]Kai-Min Chung, Huijia Lin, Rafael Pass:
Constant-Round Concurrent Zero-Knowledge from Indistinguishability Obfuscation. CRYPTO (1) 2015: 287-307 - [c88]Elette Boyle, Kai-Min Chung, Rafael Pass:
Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM Programs. CRYPTO (2) 2015: 742-762 - [c87]Samantha Leung, Edward Lui, Rafael Pass:
Voting with Coarse Beliefs. ITCS 2015: 61 - [c86]Jing Chen, Silvio Micali, Rafael Pass:
Better Outcomes from More Rationality. ITCS 2015: 325 - [c85]Nir Bitansky, Sanjam Garg, Huijia Lin, Rafael Pass, Sidharth Telang:
Succinct Randomized Encodings and their Applications. STOC 2015: 439-448 - [c84]Kai-Min Chung, Edward Lui, Rafael Pass:
From Weak to Strong Zero-Knowledge and Applications. TCC (1) 2015: 66-92 - [c83]Kai-Min Chung, Rafael Pass:
Tight Parallel Repetition Theorems for Public-Coin Arguments Using KL-Divergence. TCC (2) 2015: 229-246 - [c82]Vipul Goyal, Huijia Lin, Omkant Pandey, Rafael Pass, Amit Sahai:
Round-Efficient Concurrently Composable Secure Computation via a Robust Extraction Lemma. TCC (1) 2015: 260-289 - [c81]Edward Lui, Rafael Pass:
Outlier Privacy. TCC (2) 2015: 277-305 - [c80]Adam Bjorndahl, Joseph Y. Halpern, Rafael Pass:
Bayesian Games with Intentions. TARK 2015: 99-113 - [i47]Samantha Leung, Edward Lui, Rafael Pass:
Stronger Impossibility Results for Strategy-Proof Voting with i.i.d. Beliefs. CoRR abs/1504.02514 (2015) - [i46]Joseph Y. Halpern, Rafael Pass, Lior Seeman:
Computational Extensive-Form Games. CoRR abs/1506.03030 (2015) - [i45]Joseph Y. Halpern, Rafael Pass, Daniel Reichman:
On the Non-Existence of Nash Equilibrium in Games with Resource-Bounded Players. CoRR abs/1507.01501 (2015) - [i44]Kai-Min Chung, Rafael Pass:
Tight Parallel Repetition Theorems for Public-Coin Arguments using KL-divergence. IACR Cryptol. ePrint Arch. 2015: 31 (2015) - [i43]Nir Bitansky, Sanjam Garg, Huijia Lin, Rafael Pass, Sidharth Telang:
Succinct Randomized Encodings and their Applications. IACR Cryptol. ePrint Arch. 2015: 356 (2015) - [i42]Rafael Pass, Abhi Shelat:
Impossibility of VBB Obfuscation with Ideal Constant-Degree Graded Encodings. IACR Cryptol. ePrint Arch. 2015: 383 (2015) - [i41]Susan Hohenberger, Steven A. Myers, Rafael Pass, Abhi Shelat:
ANONIZE: A Large-Scale Anonymous Survey System. IACR Cryptol. ePrint Arch. 2015: 681 (2015) - [i40]Huijia Lin, Rafael Pass, Karn Seth, Sidharth Telang:
Output-Compressing Randomized Encodings and Applications. IACR Cryptol. ePrint Arch. 2015: 720 (2015) - [i39]Mohammad Mahmoody, Ameer Mohammed, Soheil Nematihaji, Rafael Pass, Abhi Shelat:
Lower Bounds on Assumptions behind Indistinguishability Obfuscation. IACR Cryptol. ePrint Arch. 2015: 1062 (2015) - [i38]Ahmed E. Kosba, Zhichao Zhao, Andrew Miller, Yi Qian, T.-H. Hubert Chan, Charalampos Papamanthou, Rafael Pass, Abhi Shelat, Elaine Shi:
How to Use SNARKs in Universally Composable Protocols. IACR Cryptol. ePrint Arch. 2015: 1093 (2015) - 2014
- [j13]Rafael Pass, Wei-Lung Dustin Tseng, Muthuramakrishnan Venkitasubramaniam:
Concurrent Zero Knowledge, Revisited. J. Cryptol. 27(1): 45-66 (2014) - [j12]Joseph Y. Halpern, Rafael Pass, Lior Seeman:
Decision Theory with Resource-Bounded Agents. Top. Cogn. Sci. 6(2): 245-257 (2014) - [c79]Kai-Min Chung, Zhenming Liu, Rafael Pass:
Statistically-secure ORAM with Õ(log2 n) Overhead. ASIACRYPT (2) 2014: 62-81 - [c78]Per Austrin, Kai-Min Chung, Mohammad Mahmoody, Rafael Pass, Karn Seth:
On the Impossibility of Cryptography with Tamperable Randomness. CRYPTO (1) 2014: 462-479 - [c77]Rafael Pass, Karn Seth, Sidharth Telang:
Indistinguishability Obfuscation from Semantically-Secure Multilinear Encodings. CRYPTO (1) 2014: 500-517 - [c76]Ilan Komargodski, Tal Moran, Moni Naor, Rafael Pass, Alon Rosen, Eylon Yogev:
One-Way Functions and (Im)Perfect Obfuscation. FOCS 2014: 374-383 - [c75]Joseph Y. Halpern, Rafael Pass, Lior Seeman:
The truth behind the myth of the folk theorem. ITCS 2014: 543-554 - [c74]Adam Bjorndahl, Joseph Y. Halpern, Rafael Pass:
Axiomatizing Rationality. KR 2014 - [c73]Rafael Pass, Karn Seth:
On the Impossibility of Black-Box Transformations in Mechanism Design. SAGT 2014: 279-290 - [c72]Susan Hohenberger, Steven A. Myers, Rafael Pass, Abhi Shelat:
ANONIZE: A Large-Scale Anonymous Survey System. IEEE Symposium on Security and Privacy 2014: 375-389 - [c71]Elette Boyle, Kai-Min Chung, Rafael Pass:
On Extractability Obfuscation. TCC 2014: 52-73 - [c70]Kai-Min Chung, Rafail Ostrovsky, Rafael Pass, Muthuramakrishnan Venkitasubramaniam, Ivan Visconti:
4-Round Resettably-Sound Zero Knowledge. TCC 2014: 192-216 - [c69]Joseph Y. Halpern, Rafael Pass, Lior Seeman:
Not Just an Empty Threat: Subgame-Perfect Equilibrium in Repeated Games Played by Computationally Bounded Players. WINE 2014: 249-262 - [i37]Samantha Leung, Edward Lui, Rafael Pass:
Voting with Coarse Beliefs. CoRR abs/1405.5827 (2014) - [i36]Joseph Y. Halpern, Rafael Pass:
Algorithmic Rationality: Game Theory with Costly Computation. CoRR abs/1412.2993 (2014) - [i35]Joseph Y. Halpern, Rafael Pass:
Sequential Equilibrium in Computational Games. CoRR abs/1412.6361 (2014) - [i34]Ilan Komargodski, Tal Moran, Moni Naor, Rafael Pass, Alon Rosen, Eylon Yogev:
One-Way Functions and (Im)perfect Obfuscation. IACR Cryptol. ePrint Arch. 2014: 347 (2014) - [i33]Elette Boyle, Kai-Min Chung, Rafael Pass:
Large-Scale Secure Computation. IACR Cryptol. ePrint Arch. 2014: 404 (2014) - [i32]Elette Boyle, Kai-Min Chung, Rafael Pass:
Oblivious Parallel RAM. IACR Cryptol. ePrint Arch. 2014: 594 (2014) - [i31]Huijia Lin, Rafael Pass:
Succinct Garbling Schemes and Applications. IACR Cryptol. ePrint Arch. 2014: 766 (2014) - [i30]Edward Lui, Rafael Pass:
Outlier Privacy. IACR Cryptol. ePrint Arch. 2014: 982 (2014) - [i29]Kai-Min Chung, Huijia Lin, Rafael Pass:
Constant-Round Concurrent Zero-knowledge from Indistinguishability Obfuscation. IACR Cryptol. ePrint Arch. 2014: 991 (2014) - 2013
- [j11]Joseph Y. Halpern, Rafael Pass:
Conservative belief and rationality. Games Econ. Behav. 80: 186-192 (2013) - [j10]Rafael Pass, Alon Rosen, Wei-Lung Dustin Tseng:
Public-Coin Parallel Zero-Knowledge for NP. J. Cryptol. 26(1): 1-10 (2013) - [j9]Kai-Min Chung, Rafael Pass:
Guest column: parallel repetition theorems for interactive arguments. SIGACT News 44(1): 50-69 (2013) - [c68]Kai-Min Chung, Huijia Lin, Rafael Pass:
Constant-Round Concurrent Zero Knowledge from P-Certificates. FOCS 2013: 50-59 - [c67]Kai-Min Chung, Rafail Ostrovsky, Rafael Pass, Ivan Visconti:
Simultaneous Resettability from One-Way Functions. FOCS 2013: 60-69 - [c66]Ran Canetti, Huijia Lin, Rafael Pass:
From Unprovability to Environmentally Friendly Protocols. FOCS 2013: 70-79 - [c65]Kai-Min Chung, Rafael Pass, Sidharth Telang:
Knowledge-Preserving Interactive Coding. FOCS 2013: 449-458 - [c64]Joseph Y. Halpern, Rafael Pass:
Sequential Equilibrium in Computational Games. IJCAI 2013: 171-176 - [c63]Adam Bjorndahl, Joseph Y. Halpern, Rafael Pass:
Language-Based Games. IJCAI 2013: 2967-2971 - [c62]Kai-Min Chung, Edward Lui, Rafael Pass:
Can theories be tested?: a cryptographic treatment of forecast testing. ITCS 2013: 47-56 - [c61]Per Austrin, Johan Håstad, Rafael Pass:
On the power of many one-bit provers. ITCS 2013: 215-220 - [c60]Kai-Min Chung, Huijia Lin, Mohammad Mahmoody, Rafael Pass:
On the power of nonuniformity in proofs of security. ITCS 2013: 389-400 - [c59]Kai-Min Chung, Rafael Pass, Karn Seth:
Non-black-box simulation from one-way functions and applications to resettable security. STOC 2013: 231-240 - [c58]Adam Bjorndahl, Joseph Y. Halpern, Rafael Pass:
Language-based Games. TARK 2013 - [c57]Joseph Y. Halpern, Rafael Pass:
Game Theory with Translucent Players. TARK 2013 - [c56]Rafael Pass:
Unprovable Security of Perfect NIZK and Non-interactive Non-malleable Commitments. TCC 2013: 334-354 - [c55]Eleanor Birrell, Kai-Min Chung, Rafael Pass, Sidharth Telang:
Randomness-Dependent Message Security. TCC 2013: 700-720 - [i28]Per Austrin, Johan Håstad, Rafael Pass:
On the Power of Many One-Bit Provers. CoRR abs/1301.2729 (2013) - [i27]Kai-Min Chung, Zhenming Liu, Rafael Pass:
Statistically-secure ORAM with $\tilde{O}(\log^2 n)$ Overhead. CoRR abs/1307.3699 (2013) - [i26]Joseph Y. Halpern, Rafael Pass:
Game Theory with Translucent Players. CoRR abs/1308.3778 (2013) - [i25]Joseph Y. Halpern, Rafael Pass, Lior Seeman:
Decision Theory with Resource-Bounded Agents. CoRR abs/1308.3780 (2013) - [i24]Adam Bjorndahl, Joseph Y. Halpern, Rafael Pass:
Language-based Games. CoRR abs/1310.6408 (2013) - [i23]Joseph Y. Halpern, Rafael Pass:
Game Theory with Translucent Players. CoRR abs/1310.6438 (2013) - [i22]Joseph Y. Halpern, Rafael Pass, Lior Seeman:
The Truth Behind the Myth of the Folk Theorem. CoRR abs/1312.1017 (2013) - [i21]Kai-Min Chung, Rafael Pass, Karn Seth:
Non-Black-Box Simulation from One-Way Functions And Applications to Resettable Security. IACR Cryptol. ePrint Arch. 2013: 8 (2013) - [i20]Kai-Min Chung, Rafael Pass:
Simultaneous Resettable WI from One-way Functions. IACR Cryptol. ePrint Arch. 2013: 10 (2013) - [i19]Kai-Min Chung, Rafael Pass, Sidharth Telang:
Interactive Coding, Revisited. IACR Cryptol. ePrint Arch. 2013: 160 (2013) - [i18]Per Austrin, Kai-Min Chung, Mohammad Mahmoody, Rafael Pass, Karn Seth:
On the (Im)Possibility of Tamper-Resilient Cryptography: Using Fourier Analysis in Computer Viruses. IACR Cryptol. ePrint Arch. 2013: 194 (2013) - [i17]Kai-Min Chung, Rafael Pass:
A Simple ORAM. IACR Cryptol. ePrint Arch. 2013: 243 (2013) - [i16]Kai-Min Chung, Edward Lui, Rafael Pass:
From Weak to Strong Zero-Knowledge and Applications. IACR Cryptol. ePrint Arch. 2013: 260 (2013) - [i15]Elette Boyle, Kai-Min Chung, Rafael Pass:
On Extractability Obfuscation. IACR Cryptol. ePrint Arch. 2013: 650 (2013) - [i14]Elette Boyle, Rafael Pass:
Limits of Extractability Assumptions with Distributional Auxiliary Input. IACR Cryptol. ePrint Arch. 2013: 703 (2013) - [i13]Rafael Pass, Sidharth Telang, Karn Seth:
Obfuscation from Semantically-Secure Multi-linear Encodings. IACR Cryptol. ePrint Arch. 2013: 781 (2013) - 2012
- [j8]Joseph Y. Halpern, Rafael Pass:
Iterated regret minimization: A new solution concept. Games Econ. Behav. 74(1): 184-207 (2012) - [j7]Tom Roeder, Rafael Pass, Fred B. Schneider:
Multi-Verifier Signatures. J. Cryptol. 25(2): 310-348 (2012) - [j6]Rafael Pass, Muthuramakrishnan Venkitasubramaniam:
A Parallel Repetition Theorem for Constant-Round Arthur-Merlin Proofs. ACM Trans. Comput. Theory 4(4): 10:1-10:22 (2012) - [c54]Joseph Y. Halpern, Rafael Pass, Lior Seeman:
I'm Doing as Well as I Can: Modeling People as Rational Finite Automata. AAAI 2012: 1917-1923 - [c53]Rafael Pass, Huijia Lin, Muthuramakrishnan Venkitasubramaniam:
A Unified Framework for UC from Only OT. ASIACRYPT 2012: 699-717 - [c52]Huijia Lin, Rafael Pass:
Black-Box Constructions of Composable Protocols without Set-Up. CRYPTO 2012: 461-478 - [c51]Johannes Gehrke, Michael Hay, Edward Lui, Rafael Pass:
Crowd-Blending Privacy. CRYPTO 2012: 479-496 - [c50]Mohammad Mahmoody, Rafael Pass:
The Curious Case of Non-Interactive Commitments - On the Power of Black-Box vs. Non-Black-Box Use of Primitives. CRYPTO 2012: 701-718 - [c49]Kai-Min Chung, Rafael Pass, Wei-Lung Dustin Tseng:
The Knowledge Tightness of Parallel Zero-Knowledge. TCC 2012: 512-529 - [i12]Johannes Gehrke, Michael Hay, Edward Lui, Rafael Pass:
Crowd-Blending Privacy. IACR Cryptol. ePrint Arch. 2012: 456 (2012) - [i11]Mohammad Mahmoody, Rafael Pass:
The Curious Case of Non-Interactive Commitments. IACR Cryptol. ePrint Arch. 2012: 523 (2012) - [i10]Kai-Min Chung, Huijia Lin, Rafael Pass:
Constant-Round Concurrent Zero Knowledge From Falsifiable Assumptions. IACR Cryptol. ePrint Arch. 2012: 563 (2012) - [i9]Kai-Min Chung, Edward Lui, Mohammad Mahmoody, Rafael Pass:
Unprovable Security of Two-Message Zero Knowledge. IACR Cryptol. ePrint Arch. 2012: 711 (2012) - 2011
- [j5]Boaz Barak, Ran Canetti, Yehuda Lindell, Rafael Pass, Tal Rabin:
Secure Computation Without Authentication. J. Cryptol. 24(4): 720-760 (2011) - [j4]Rafael Pass, Wei-Lung Dustin Tseng, Douglas Wikström:
On the Composition of Public-Coin Zero-Knowledge Protocols. SIAM J. Comput. 40(6): 1529-1553 (2011) - [j3]Joseph Y. Halpern, Rafael Pass:
Algorithmic rationality: adding cost of computation to game theory. SIGecom Exch. 10(2): 9-15 (2011) - [c48]Kai-Min Chung, Rafael Pass:
The Randomness Complexity of Parallel Repetition. FOCS 2011: 658-667 - [c47]Eleanor Birrell, Rafael Pass:
Approximately Strategy-Proof Voting. IJCAI 2011: 67-72 - [c46]Rafael Pass, Abhi Shelat:
Renegotiation-Safe Protocols. ICS 2011: 61-78 - [c45]Rafael Pass:
Limits of provable security from standard assumptions. STOC 2011: 109-118 - [c44]Huijia Lin, Rafael Pass:
Constant-round non-malleable commitments from any one-way function. STOC 2011: 705-714 - [c43]Adam Bjorndahl, Joseph Y. Halpern, Rafael Pass:
Reasoning about justified belief. TARK 2011: 221-227 - [c42]Huijia Lin, Rafael Pass:
Concurrent Non-Malleable Zero Knowledge with Adaptive Inputs. TCC 2011: 274-292 - [c41]Johannes Gehrke, Edward Lui, Rafael Pass:
Towards Privacy for Social Networks: A Zero-Knowledge Based Definition of Privacy. TCC 2011: 432-449 - [c40]Rafael Pass:
Concurrent Security and Non-malleability. TCC 2011: 540 - [c39]Rafael Pass, Wei-Lung Dustin Tseng, Muthuramakrishnan Venkitasubramaniam:
Towards Non-Black-Box Lower Bounds in Cryptography. TCC 2011: 579-596 - [i8]Joseph Y. Halpern, Rafael Pass:
I Don't Want to Think About it Now:Decision Theory With Costly Computation. CoRR abs/1106.2657 (2011) - 2010
- [c38]Rafael Pass, Joe Halpern:
Game theory with costly computation: formulation and application to protocol security. BQGT 2010: 89:1 - [c37]Huijia Lin, Rafael Pass, Wei-Lung Dustin Tseng, Muthuramakrishnan Venkitasubramaniam:
Concurrent Non-Malleable Zero Knowledge Proofs. CRYPTO 2010: 429-446 - [c36]Rafael Pass, Hoeteck Wee:
Constant-Round Non-malleable Commitments from Sub-exponential One-Way Functions. EUROCRYPT 2010: 638-655 - [c35]Ran Canetti, Huijia Lin, Rafael Pass:
Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions. FOCS 2010: 541-550 - [c34]Joseph Y. Halpern, Rafael Pass:
Game Theory with Costly Computation: Formulation and Application to Protocol Security. ICS 2010: 120-142 - [c33]Johan Håstad, Rafael Pass, Douglas Wikström, Krzysztof Pietrzak:
An Efficient Parallel Repetition Theorem. TCC 2010: 1-18 - [c32]Rafael Pass, Wei-Lung Dustin Tseng, Muthuramakrishnan Venkitasubramaniam:
Eye for an Eye: Efficient Concurrent Zero-Knowledge in the Timing Model. TCC 2010: 518-534 - [c31]Rafael Pass, Muthuramakrishnan Venkitasubramaniam:
Private Coins versus Public Coins in Zero-Knowledge Proof Systems. TCC 2010: 588-605 - [i7]Huijia Lin, Rafael Pass:
Constant-round Non-Malleable Commitments from Any One-Way Function. IACR Cryptol. ePrint Arch. 2010: 483 (2010)
2000 – 2009
- 2009
- [c30]Rafael Pass, Wei-Lung Dustin Tseng, Douglas Wikström:
On the Composition of Public-Coin Zero-Knowledge Protocols. CRYPTO 2009: 160-176 - [c29]Joseph Y. Halpern, Rafael Pass:
Iterated Regret Minimization: A New Solution Concept. IJCAI 2009: 153-158 - [c28]Huijia Lin, Rafael Pass, Muthuramakrishnan Venkitasubramaniam:
A unified framework for concurrent security: universal composability from stand-alone non-malleability. STOC 2009: 179-188 - [c27]Huijia Lin, Rafael Pass:
Non-malleability amplification. STOC 2009: 189-198 - [c26]Joseph Y. Halpern, Rafael Pass:
A logical characterization of iterated admissibility. TARK 2009: 146-155 - [c25]Joseph Y. Halpern, Rafael Pass, Vasumathi Raman:
An epistemic characterization of zero knowledge. TARK 2009: 156-165 - [c24]Rafael Pass, Hoeteck Wee:
Black-Box Constructions of Two-Party Protocols from One-Way Functions. TCC 2009: 403-418 - [i6]Joseph Y. Halpern, Rafael Pass:
A Logical Characterization of Iterated Admissibility. CoRR abs/0906.4326 (2009) - 2008
- [j2]Rafael Pass, Alon Rosen:
Concurrent Nonmalleable Commitments. SIAM J. Comput. 37(6): 1891-1925 (2008) - [j1]Rafael Pass, Alon Rosen:
New and Improved Constructions of Nonmalleable Cryptographic Protocols. SIAM J. Comput. 38(2): 702-752 (2008) - [c23]Omkant Pandey, Rafael Pass, Vinod Vaikuntanathan:
Adaptive One-Way Functions and Applications. CRYPTO 2008: 57-74 - [c22]Omkant Pandey, Rafael Pass, Amit Sahai, Wei-Lung Dustin Tseng, Muthuramakrishnan Venkitasubramaniam:
Precise Concurrent Zero Knowledge. EUROCRYPT 2008: 397-414 - [c21]Rafael Pass, Muthuramakrishnan Venkitasubramaniam:
On Constant-Round Concurrent Zero-Knowledge. TCC 2008: 553-570 - [c20]Huijia Lin, Rafael Pass, Muthuramakrishnan Venkitasubramaniam:
Concurrent Non-malleable Commitments from Any One-Way Function. TCC 2008: 571-588 - [i5]Joseph Y. Halpern, Rafael Pass:
Game Theory with Costly Computation. CoRR abs/0809.0024 (2008) - [i4]Joseph Y. Halpern, Rafael Pass:
Iterated Regret Minimization: A More Realistic Solution Concept. CoRR abs/0810.3023 (2008) - 2007
- [c19]Ronald Cramer, Goichiro Hanaoka, Dennis Hofheinz, Hideki Imai, Eike Kiltz, Rafael Pass, Abhi Shelat, Vinod Vaikuntanathan:
Bounded CCA2-Secure Encryption. ASIACRYPT 2007: 502-518 - [c18]Rafael Pass, Abhi Shelat, Vinod Vaikuntanathan:
Relations Among Notions of Non-malleability for Encryption. ASIACRYPT 2007: 519-535 - [c17]Ran Canetti, Rafael Pass, Abhi Shelat:
Cryptography from Sunspots: How to Use an Imperfect Reference String. FOCS 2007: 249-259 - [c16]Rafael Pass, Muthuramakrishnan Venkitasubramaniam:
An efficient parallel repetition theorem for Arthur-Merlin games. STOC 2007: 420-429 - [c15]Ran Canetti, Yevgeniy Dodis, Rafael Pass, Shabsi Walfish:
Universally Composable Security with Global Setup. TCC 2007: 61-85 - [i3]Omkant Pandey, Rafael Pass, Amit Sahai, Wei-Lung Dustin Tseng, Muthuramakrishnan Venkitasubramaniam:
Precise Concurrent Zero Knowledge. IACR Cryptol. ePrint Arch. 2007: 451 (2007) - [i2]Boaz Barak, Ran Canetti, Yehuda Lindell, Rafael Pass, Tal Rabin:
Secure Computation Without Authentication. IACR Cryptol. ePrint Arch. 2007: 464 (2007) - 2006
- [b1]Rafael Pass:
A precise computational approach to knowledge. Massachusetts Institute of Technology, Cambridge, MA, USA, 2006 - [c14]Rafael Pass:
Parallel Repetition of Zero-Knowledge Proofs and the Possibility of Basing Cryptography on NP-Hardness. CCC 2006: 96-110 - [c13]Rafael Pass, Abhi Shelat, Vinod Vaikuntanathan:
Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One. CRYPTO 2006: 271-289 - [c12]Silvio Micali, Rafael Pass, Alon Rosen:
Input-Indistinguishable Computation. FOCS 2006: 367-378 - [c11]Silvio Micali, Rafael Pass:
Local zero knowledge. STOC 2006: 306-315 - [i1]Ran Canetti, Yevgeniy Dodis, Rafael Pass, Shabsi Walfish:
Universally Composable Security with Global Setup. IACR Cryptol. ePrint Arch. 2006: 432 (2006) - 2005
- [c10]Rafael Pass, Abhi Shelat:
Unconditional Characterizations of Non-interactive Zero-Knowledge. CRYPTO 2005: 118-134 - [c9]Boaz Barak, Ran Canetti, Yehuda Lindell, Rafael Pass, Tal Rabin:
Secure Computation Without Authentication. CRYPTO 2005: 361-377 - [c8]Rafael Pass, Alon Rosen:
Concurrent Non-Malleable Commitments. FOCS 2005: 563-572 - [c7]Rafael Pass, Alon Rosen:
New and improved constructions of non-malleable cryptographic protocols. STOC 2005: 533-542 - 2004
- [c6]Boaz Barak, Ran Canetti, Jesper Buus Nielsen, Rafael Pass:
Universally Composable Protocols with Relaxed Set-Up Assumptions. FOCS 2004: 186-195 - [c5]Rafael Pass:
Bounded-concurrent secure multi-party computation with a dishonest majority. STOC 2004: 232-241 - [c4]Boaz Barak, Rafael Pass:
On the Possibility of One-Message Weak Zero-Knowledge. TCC 2004: 121-132 - 2003
- [c3]Rafael Pass:
On Deniability in the Common Reference String and Random Oracle Model. CRYPTO 2003: 316-337 - [c2]Rafael Pass:
Simulation in Quasi-Polynomial Time, and Its Application to Protocol Composition. EUROCRYPT 2003: 160-176 - [c1]Rafael Pass, Alon Rosen:
Bounded-Concurrent Secure Two-Party Computation in a Constant Number of Rounds. FOCS 2003: 404-413
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-18 18:27 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
