- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| j10 |      | Rafael Pass, Alon Rosen, Wei-Lung Dustin Tseng: Public-Coin Parallel Zero-Knowledge for NP. J. Cryptology 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) |
| c58 | | Kai-Min Chung, Edward Lui, Rafael Pass: Can theories be tested?: a cryptographic treatment of forecast testing. ITCS 2013: 47-56 |
| c57 | | |
| c56 | | Kai-Min Chung, Huijia Lin, Mohammad Mahmoody, Rafael Pass: On the power of nonuniformity in proofs of security. ITCS 2013: 389-400 |
| c55 | | Rafael Pass: Unprovable Security of Perfect NIZK and Non-interactive Non-malleable Commitments. TCC 2013: 334-354 |
| c54 | | Eleanor Birrell, Kai-Min Chung, Rafael Pass, Sidharth Telang: Randomness-Dependent Message Security. TCC 2013: 700-720 |
| i18 | | Per Austrin, Johan Håstad, Rafael Pass: On the Power of Many One-Bit Provers. CoRR abs/1301.2729 (2013) |
| i17 | | Kai-Min Chung, Rafael Pass, Karn Seth: Non-Black-Box Simulation from One-Way Functions And Applications to Resettable Security. IACR Cryptology ePrint Archive 2013: 8 (2013) |
| i16 | | Kai-Min Chung, Rafael Pass: Simultaneous Resettable WI from One-way Functions. IACR Cryptology ePrint Archive 2013: 10 (2013) |
| i15 | | Kai-Min Chung, Rafael Pass, Sidharth Telang: Interactive Coding, Revisited. IACR Cryptology ePrint Archive 2013: 160 (2013) |
| i14 | | 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 Cryptology ePrint Archive 2013: 194 (2013) |
| i13 | | |
| 2012 | ||
| j8 | | Joseph Y. Halpern, Rafael Pass: Iterated regret minimization: A new solution concept. Games and Economic Behavior 74(1): 184-207 (2012) |
| j7 | | Tom Roeder, Rafael Pass, Fred B. Schneider: Multi-Verifier Signatures. J. Cryptology 25(2): 310-348 (2012) |
| j6 | | Rafael Pass, Muthuramakrishnan Venkitasubramaniam: A Parallel Repetition Theorem for Constant-Round Arthur-Merlin Proofs. TOCT 4(4): 10 (2012) |
| c53 | | Joseph Y. Halpern, Rafael Pass, Lior Seeman: I'm Doing as Well as I Can: Modeling People as Rational Finite Automata. AAAI 2012 |
| c52 | | Rafael Pass, Huijia Lin, Muthuramakrishnan Venkitasubramaniam: A Unified Framework for UC from Only OT. ASIACRYPT 2012: 699-717 |
| c51 | | Huijia Lin, Rafael Pass: Black-Box Constructions of Composable Protocols without Set-Up. CRYPTO 2012: 461-478 |
| c50 | | |
| c49 | | 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 |
| c48 | | 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 Cryptology ePrint Archive 2012: 456 (2012) |
| i11 | | Mohammad Mahmoody, Rafael Pass: The Curious Case of Non-Interactive Commitments. IACR Cryptology ePrint Archive 2012: 523 (2012) |
| i10 | | Kai-Min Chung, Huijia Lin, Rafael Pass: Constant-Round Concurrent Zero Knowledge From Falsifiable Assumptions. IACR Cryptology ePrint Archive 2012: 563 (2012) |
| i9 | | Kai-Min Chung, Edward Lui, Mohammad Mahmoody, Rafael Pass: Unprovable Security of Two-Message Zero Knowledge. IACR Cryptology ePrint Archive 2012: 711 (2012) |
| 2011 | ||
| j5 | | Boaz Barak, Ran Canetti, Yehuda Lindell, Rafael Pass, Tal Rabin: Secure Computation Without Authentication. J. Cryptology 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 Exchanges 10(2): 9-15 (2011) |
| c47 | | |
| c46 | | |
| c45 | | |
| c44 | | |
| c43 | | Huijia Lin, Rafael Pass: Constant-round non-malleable commitments from any one-way function. STOC 2011: 705-714 |
| c42 | | Adam Bjorndahl, Joseph Y. Halpern, Rafael Pass: Reasoning about justified belief. TARK 2011: 221-227 |
| c41 | | Huijia Lin, Rafael Pass: Concurrent Non-Malleable Zero Knowledge with Adaptive Inputs. TCC 2011: 274-292 |
| c40 | | Johannes Gehrke, Edward Lui, Rafael Pass: Towards Privacy for Social Networks: A Zero-Knowledge Based Definition of Privacy. TCC 2011: 432-449 |
| c39 | | |
| c38 | | 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 | ||
| 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 Cryptology ePrint Archive 2010: 483 (2010) |
| 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 | | |
| 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 | | |
| 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 Cryptology ePrint Archive 2007: 451 (2007) |
| i2 | | Boaz Barak, Ran Canetti, Yehuda Lindell, Rafael Pass, Tal Rabin: Secure Computation Without Authentication. IACR Cryptology ePrint Archive 2007: 464 (2007) |
| 2006 | ||
| c14 | | Rafael Pass: Parallel Repetition of Zero-Knowledge Proofs and the Possibility of Basing Cryptography on NP-Hardness. IEEE Conference on Computational Complexity 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 | | |
| c11 | | |
| i1 | | Ran Canetti, Yevgeniy Dodis, Rafael Pass, Shabsi Walfish: Universally Composable Security with Global Setup. IACR Cryptology ePrint Archive 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 | | |
| 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 | | |
| 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 |
Data released under the ODC-BY 1.0 license — See also our legal information page