Alon Rosen

2009
30	EE	Iftach Haitner, Alon Rosen, Ronen Shaltiel: On the (Im)Possibility of Arthur-Merlin Witness Hiding Protocols. TCC 2009: 220-237
29	EE	Shien Jin Ong, David C. Parkes, Alon Rosen, Salil P. Vadhan: Fairness with an Honest Minority and a Rational Majority. TCC 2009: 36-53
28	EE	Alon Rosen, Gil Segev: Chosen-Ciphertext Security via Correlated Products. TCC 2009: 419-436
2008
27	EE	Vadim Lyubashevsky, Daniele Micciancio, Chris Peikert, Alon Rosen: SWIFFT: A Modest Proposal for FFT Hashing. FSE 2008: 54-72
26	EE	Rafael Pass, Alon Rosen: Concurrent Nonmalleable Commitments. SIAM J. Comput. 37(6): 1891-1925 (2008)
25	EE	Rafael Pass, Alon Rosen: New and Improved Constructions of Nonmalleable Cryptographic Protocols. SIAM J. Comput. 38(2): 702-752 (2008)
2007
24	EE	Chris Peikert, Alon Rosen: Lattices that admit logarithmic worst-case to average-case connection factors. STOC 2007: 478-487
23	EE	Yan Zong Ding, Danny Harnik, Alon Rosen, Ronen Shaltiel: Constant-Round Oblivious Transfer in the Bounded Storage Model. J. Cryptology 20(2): 165-202 (2007)
2006
22		Alon Rosen: Concurrent Zero-Knowledge - With Additional Background by Oded Goldreich Springer 2006
21	EE	Silvio Micali, Rafael Pass, Alon Rosen: Input-Indistinguishable Computation. FOCS 2006: 367-378
20	EE	Chris Peikert, Alon Rosen: Efficient Collision-Resistant Hashing from Worst-Case Assumptions on Cyclic Lattices. TCC 2006: 145-166
19	EE	Chris Peikert, Alon Rosen: Lattices that Admit Logarithmic Worst-Case to Average-Case Connection Factors. Electronic Colloquium on Computational Complexity (ECCC) 13(147): (2006)
18	EE	Danny Harnik, Moni Naor, Omer Reingold, Alon Rosen: Completeness in Two-Party Secure Computation: A Computational View. J. Cryptology 19(4): 521-552 (2006)
2005
17	EE	Danny Harnik, Joe Kilian, Moni Naor, Omer Reingold, Alon Rosen: On Robust Combiners for Oblivious Transfer and Other Primitives. EUROCRYPT 2005: 96-113
16	EE	Rafael Pass, Alon Rosen: Concurrent Non-Malleable Commitments. FOCS 2005: 563-572
15	EE	Rafael Pass, Alon Rosen: New and improved constructions of non-malleable cryptographic protocols. STOC 2005: 533-542
14	EE	Chris Peikert, Alon Rosen: Efficient Collision-Resistant Hashing from Worst-Case Assumptions on Cyclic Lattices Electronic Colloquium on Computational Complexity (ECCC)(158): (2005)
2004
13	EE	Danny Harnik, Moni Naor, Omer Reingold, Alon Rosen: Completeness in two-party secure computation: a computational view. STOC 2004: 252-261
12	EE	Alon Rosen: A Note on Constant-Round Zero-Knowledge Proofs for NP. TCC 2004: 191-202
11	EE	Yan Zong Ding, Danny Harnik, Alon Rosen, Ronen Shaltiel: Constant-Round Oblivious Transfer in the Bounded Storage Model. TCC 2004: 446-472
2003
10	EE	Rafael Pass, Alon Rosen: Bounded-Concurrent Secure Two-Party Computation in a Constant Number of Rounds. FOCS 2003: 404-
9	EE	Danny Harnik, Moni Naor, Omer Reingold, Alon Rosen: Completeness in Two-Party Secure Computation - A Computational View Electronic Colloquium on Computational Complexity (ECCC)(060): (2003)
2002
8	EE	Manoj Prabhakaran, Alon Rosen, Amit Sahai: Concurrent Zero Knowledge with Logarithmic Round-Complexity. FOCS 2002: 366-375
7	EE	Moni Naor, Omer Reingold, Alon Rosen: Pseudorandom Functions and Factoring. SIAM J. Comput. 31(5): 1383-1404 (2002)
6	EE	Ran Canetti, Joe Kilian, Erez Petrank, Alon Rosen: Black-Box Concurrent Zero-Knowledge Requires (Almost) Logarithmically Many Rounds. SIAM J. Comput. 32(1): 1-47 (2002)
2001
5	EE	Ran Canetti, Joe Kilian, Erez Petrank, Alon Rosen: Black-box concurrent zero-knowledge requires Omega~(log n) rounds. STOC 2001: 570-579
4	EE	Moni Naor, Omer Reingold, Alon Rosen: Pseudo-Random Functions and Factoring Electronic Colloquium on Computational Complexity (ECCC) 8(064): (2001)
3	EE	Ran Canetti, Joe Kilian, Erez Petrank, Alon Rosen: Black-Box Concurrent Zero-Knowledge Requires ~Omega(log n) Rounds Electronic Colloquium on Computational Complexity (ECCC) 8(50): (2001)
2000
2	EE	Alon Rosen: A Note on the Round-Complexity of Concurrent Zero-Knowledge. CRYPTO 2000: 451-468
1	EE	Moni Naor, Omer Reingold, Alon Rosen: Pseudo-random functions and factoring (extended abstract). STOC 2000: 11-20

Coauthor Index

1	Ran Canetti	[3] [5] [6]
2	Yan Zong Ding	[11] [23]
3	Iftach Haitner	[30]
4	Danny Harnik	[9] [11] [13] [17] [18] [23]
5	Joe Kilian	[3] [5] [6] [17]
6	Vadim Lyubashevsky	[27]
7	Silvio Micali	[21]
8	Daniele Micciancio	[27]
9	Moni Naor	[1] [4] [7] [9] [13] [17] [18]
10	Shien Jin Ong	[29]
11	David C. Parkes	[29]
12	Rafael Pass	[10] [15] [16] [21] [25] [26]
13	Chris Peikert	[14] [19] [20] [24] [27]
14	Erez Petrank	[3] [5] [6]
15	Manoj Prabhakaran	[8]
16	Omer Reingold	[1] [4] [7] [9] [13] [17] [18]
17	Amit Sahai	[8]
18	Gil Segev	[28]
19	Ronen Shaltiel	[11] [23] [30]
20	Salil P. Vadhan	[29]