Rafael Pass Home Page Coauthor index DBLP Vis pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

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

Coauthor Index

1Boaz Barak [4] [6] [9]
2Ran Canetti [6] [9] [15] [17]
3Ronald Cramer [19]
4Yevgeniy Dodis [15]
5Joseph Y. Halpern [22] [23] [28] [30] [31] [34]
6Goichiro Hanaoka [19]
7Johan Håstad [38]
8Dennis Hofheinz [19]
9Hideki Imai [19]
10Eike Kiltz [19]
11Huijia Lin [24] [32] [33]
12Yehuda Lindell (Andrew Y. Lindell) [9]
13Silvio Micali [11] [13]
14Jesper Buus Nielsen [6]
15Omkant Pandey [26] [27]
16Krzysztof Pietrzak [38]
17Tal Rabin [9]
18Vasumathi Raman [30]
19Alon Rosen [1] [7] [8] [13] [20] [21]
20Amit Sahai [26]
21Abhi Shelat [10] [14] [17] [18] [19]
22Wei-Lung Dustin Tseng [26] [35] [37]
23Vinod Vaikuntanathan (V. Vinod) [14] [18] [19] [27]
24Muthuramakrishnan Venkitasubramaniam [16] [24] [25] [26] [33] [36] [37]
25Shabsi Walfish [15]
26Hoeteck Wee [29]
27Douglas Wikström [35] [38]

Colors in the list of coauthors

Copyright © Tue Feb 9 14:55:32 2010 by Michael Ley (ley@uni-trier.de)