 | 2010 |
| 38 |  | Johan Håstad,
Rafael Pass,
Douglas Wikström,
Krzysztof Pietrzak:
An Efficient Parallel Repetition Theorem.
TCC 2010: 1-18 |
| 37 |  | Rafael Pass,
Wei-Lung Dustin Tseng,
Muthuramakrishnan Venkitasubramaniam:
Eye for an Eye: Efficient Concurrent Zero-Knowledge in the Timing Model.
TCC 2010: 518-534 |
| 36 |  | Rafael Pass,
Muthuramakrishnan Venkitasubramaniam:
Private Coins versus Public Coins in Zero-Knowledge Proof Systems.
TCC 2010: 588-605 |
| 2009 |
| 35 |  | Rafael Pass,
Wei-Lung Dustin Tseng,
Douglas Wikström:
On the Composition of Public-Coin Zero-Knowledge Protocols.
CRYPTO 2009: 160-176 |
| 34 |  | Joseph Y. Halpern,
Rafael Pass:
Iterated Regret Minimization: A New Solution Concept.
IJCAI 2009: 153-158 |
| 33 |  | Huijia Lin,
Rafael Pass,
Muthuramakrishnan Venkitasubramaniam:
A unified framework for concurrent security: universal composability from stand-alone non-malleability.
STOC 2009: 179-188 |
| 32 |  | Huijia Lin,
Rafael Pass:
Non-malleability amplification.
STOC 2009: 189-198 |
| 31 |  | Joseph Y. Halpern,
Rafael Pass:
A logical characterization of iterated admissibility.
TARK 2009: 146-155 |
| 30 |  | Joseph Y. Halpern,
Rafael Pass,
Vasumathi Raman:
An epistemic characterization of zero knowledge.
TARK 2009: 156-165 |
| 29 |  | Rafael Pass,
Hoeteck Wee:
Black-Box Constructions of Two-Party Protocols from One-Way Functions.
TCC 2009: 403-418 |
| 28 |  | Joseph Y. Halpern,
Rafael Pass:
A Logical Characterization of Iterated Admissibility
CoRR abs/0906.4326: (2009) |
| 2008 |
| 27 |  | Omkant Pandey,
Rafael Pass,
Vinod Vaikuntanathan:
Adaptive One-Way Functions and Applications.
CRYPTO 2008: 57-74 |
| 26 |  | Omkant Pandey,
Rafael Pass,
Amit Sahai,
Wei-Lung Dustin Tseng,
Muthuramakrishnan Venkitasubramaniam:
Precise Concurrent Zero Knowledge.
EUROCRYPT 2008: 397-414 |
| 25 |  | Rafael Pass,
Muthuramakrishnan Venkitasubramaniam:
On Constant-Round Concurrent Zero-Knowledge.
TCC 2008: 553-570 |
| 24 |  | Huijia Lin,
Rafael Pass,
Muthuramakrishnan Venkitasubramaniam:
Concurrent Non-malleable Commitments from Any One-Way Function.
TCC 2008: 571-588 |
| 23 |  | Joseph Y. Halpern,
Rafael Pass:
Game Theory with Costly Computation
CoRR abs/0809.0024: (2008) |
| 22 |  | Joseph Y. Halpern,
Rafael Pass:
Iterated Regret Minimization: A More Realistic Solution Concept
CoRR abs/0810.3023: (2008) |
| 21 |  | Rafael Pass,
Alon Rosen:
Concurrent Nonmalleable Commitments.
SIAM J. Comput. 37(6): 1891-1925 (2008) |
| 20 |  | Rafael Pass,
Alon Rosen:
New and Improved Constructions of Nonmalleable Cryptographic Protocols.
SIAM J. Comput. 38(2): 702-752 (2008) |
| 2007 |
| 19 |  | Ronald Cramer,
Goichiro Hanaoka,
Dennis Hofheinz,
Hideki Imai,
Eike Kiltz,
Rafael Pass,
Abhi Shelat,
Vinod Vaikuntanathan:
Bounded CCA2-Secure Encryption.
ASIACRYPT 2007: 502-518 |
| 18 |  | Rafael Pass,
Abhi Shelat,
Vinod Vaikuntanathan:
Relations Among Notions of Non-malleability for Encryption.
ASIACRYPT 2007: 519-535 |
| 17 |  | Ran Canetti,
Rafael Pass,
Abhi Shelat:
Cryptography from Sunspots: How to Use an Imperfect Reference String.
FOCS 2007: 249-259 |
| 16 |  | Rafael Pass,
Muthuramakrishnan Venkitasubramaniam:
An efficient parallel repetition theorem for Arthur-Merlin games.
STOC 2007: 420-429 |
| 15 |  | Ran Canetti,
Yevgeniy Dodis,
Rafael Pass,
Shabsi Walfish:
Universally Composable Security with Global Setup.
TCC 2007: 61-85 |
| 2006 |
| 14 |  | Rafael Pass,
Abhi Shelat,
Vinod Vaikuntanathan:
Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One.
CRYPTO 2006: 271-289 |
| 13 |  | Silvio Micali,
Rafael Pass,
Alon Rosen:
Input-Indistinguishable Computation.
FOCS 2006: 367-378 |
| 12 |  | 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 |
| 11 |  | Silvio Micali,
Rafael Pass:
Local zero knowledge.
STOC 2006: 306-315 |
| 2005 |
| 10 |  | Rafael Pass,
Abhi Shelat:
Unconditional Characterizations of Non-interactive Zero-Knowledge.
CRYPTO 2005: 118-134 |
| 9 |  | Boaz Barak,
Ran Canetti,
Yehuda Lindell,
Rafael Pass,
Tal Rabin:
Secure Computation Without Authentication.
CRYPTO 2005: 361-377 |
| 8 |  | Rafael Pass,
Alon Rosen:
Concurrent Non-Malleable Commitments.
FOCS 2005: 563-572 |
| 7 |  | Rafael Pass,
Alon Rosen:
New and improved constructions of non-malleable cryptographic protocols.
STOC 2005: 533-542 |
| 2004 |
| 6 |  | Boaz Barak,
Ran Canetti,
Jesper Buus Nielsen,
Rafael Pass:
Universally Composable Protocols with Relaxed Set-Up Assumptions.
FOCS 2004: 186-195 |
| 5 |  | Rafael Pass:
Bounded-concurrent secure multi-party computation with a dishonest majority.
STOC 2004: 232-241 |
| 4 |  | Boaz Barak,
Rafael Pass:
On the Possibility of One-Message Weak Zero-Knowledge.
TCC 2004: 121-132 |
| 2003 |
| 3 |  | Rafael Pass:
On Deniability in the Common Reference String and Random Oracle Model.
CRYPTO 2003: 316-337 |
| 2 |  | Rafael Pass:
Simulation in Quasi-Polynomial Time, and Its Application to Protocol Composition.
EUROCRYPT 2003: 160-176 |
| 1 |  | Rafael Pass,
Alon Rosen:
Bounded-Concurrent Secure Two-Party Computation in a Constant Number of Rounds.
FOCS 2003: 404- |