Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Alon Rosen
2010 – today
- 2013
[j11]Rafael Pass, Alon Rosen, Wei-Lung Dustin Tseng: Public-Coin Parallel Zero-Knowledge for NP. J. Cryptology 26(1): 1-10 (2013)- [j10]David Mandell Freeman, Oded Goldreich, Eike Kiltz, Alon Rosen, Gil Segev: More Constructions of Lossy and Correlation-Secure Trapdoor Functions. J. Cryptology 26(1): 39-74 (2013)
- [j9]Andrej Bogdanov, Alon Rosen: Input Locality and Hardness Amplification. J. Cryptology 26(1): 144-171 (2013)
- [j8]Ronen Gradwohl, Noam Livne, Alon Rosen: Sequential rationality in cryptographic protocols. ACM Trans. Economics and Comput. 1(1): 2 (2013)
- 2012
- [c27]Abhishek Banerjee, Chris Peikert, Alon Rosen: Pseudorandom Functions and Lattices. EUROCRYPT 2012: 719-737
- [c26]Jonathan Ben-Nun, Niko Fahri, Morgan Llewellyn, Ben Riva, Alon Rosen, Amnon Ta-Shma, Douglas Wikström: A New Implementation of a Dual (Paper and Cryptographic) Voting System. Electronic Voting 2012: 315-329
- [c25]
- [c24]Benny Applebaum, Andrej Bogdanov, Alon Rosen: A Dichotomy for Local Small-Bias Generators. TCC 2012: 600-617
- 2011
- [c23]
- [i19]R. Michael Alvarez, Josh Benaloh, Alon Rosen, Peter Y. A. Ryan: Verifiable Elections and the Public (Dagstuhl Seminar 11281). Dagstuhl Reports 1(7): 36-52 (2011)
- [i18]Andrej Bogdanov, Alon Rosen: Input locality and hardness amplification. Electronic Colloquium on Computational Complexity (ECCC) 18: 12 (2011)
- [i17]Benny Applebaum, Andrej Bogdanov, Alon Rosen: A Dichotomy for Local Small-Bias Generators. Electronic Colloquium on Computational Complexity (ECCC) 18: 126 (2011)
- [i16]Abhishek Banerjee, Chris Peikert, Alon Rosen: Pseudorandom Functions and Lattices. IACR Cryptology ePrint Archive 2011: 401 (2011)
- [i15]Benny Applebaum, Andrej Bogdanov, Alon Rosen: A Dichotomy for Local Small-Bias Generators. IACR Cryptology ePrint Archive 2011: 512 (2011)
- 2010
- [j7]Alon Rosen, Gil Segev: Chosen-Ciphertext Security via Correlated Products. SIAM J. Comput. 39(7): 3058-3088 (2010)
- [c22]
- [c21]Ronen Gradwohl, Noam Livne, Alon Rosen: Sequential Rationality in Cryptographic Protocols. FOCS 2010: 623-632
- [c20]Yaping Li, Hongyi Yao, Minghua Chen, Sidharth Jaggi, Alon Rosen: RIPPLE Authentication for Network Coding. INFOCOM 2010: 2258-2266
- [c19]David Mandell Freeman, Oded Goldreich, Eike Kiltz, Alon Rosen, Gil Segev: More Constructions of Lossy and Correlation-Secure Trapdoor Functions. Public Key Cryptography 2010: 279-295
- [i14]Ronen Gradwohl, Noam Livne, Alon Rosen: Sequential Rationality in Cryptographic Protocols. CoRR abs/1008.3123 (2010)
- [i13]Ronen Gradwohl, Noam Livne, Alon Rosen: Sequential Rationality in Cryptographic Protocols. IACR Cryptology ePrint Archive 2010: 448 (2010)
2000 – 2009
- 2009
- [c18]Shien Jin Ong, David C. Parkes, Alon Rosen, Salil P. Vadhan: Fairness with an Honest Minority and a Rational Majority. TCC 2009: 36-53
- [c17]Iftach Haitner, Alon Rosen, Ronen Shaltiel: On the (Im)Possibility of Arthur-Merlin Witness Hiding Protocols. TCC 2009: 220-237
- [c16]
- [i12]David Mandell Freeman, Oded Goldreich, Eike Kiltz, Alon Rosen, Gil Segev: More Constructions of Lossy and Correlation-Secure Trapdoor Functions. IACR Cryptology ePrint Archive 2009: 590 (2009)
- 2008
- [j6]Rafael Pass, Alon Rosen: Concurrent Nonmalleable Commitments. SIAM J. Comput. 37(6): 1891-1925 (2008)
- [j5]Rafael Pass, Alon Rosen: New and Improved Constructions of Nonmalleable Cryptographic Protocols. SIAM J. Comput. 38(2): 702-752 (2008)
- [c15]Vadim Lyubashevsky, Daniele Micciancio, Chris Peikert, Alon Rosen: SWIFFT: A Modest Proposal for FFT Hashing. FSE 2008: 54-72
- [i11]Shien Jin Ong, David C. Parkes, Alon Rosen, Salil P. Vadhan: Fairness with an Honest Minority and a Rational Majority. IACR Cryptology ePrint Archive 2008: 97 (2008)
- [i10]Alon Rosen, Gil Segev: Chosen-Ciphertext Security via Correlated Products. IACR Cryptology ePrint Archive 2008: 116 (2008)
- [i9]Alon Rosen, Gil Segev: Efficient Lossy Trapdoor Functions based on the Composite Residuosity Assumption. IACR Cryptology ePrint Archive 2008: 134 (2008)
- 2007
- [j4]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)
- [c14]Chris Peikert, Alon Rosen: Lattices that admit logarithmic worst-case to average-case connection factors. STOC 2007: 478-487
- 2006
- [b2]Alon Rosen: Concurrent zero-knowledge. Springer 2006, ISBN 978-3-540-32938-1, pp. I-XIII, 1-184
- [b1]Alon Rosen: Concurrent Zero-Knowledge - With Additional Background by Oded Goldreich. Information Security and Cryptography, Springer 2006, ISBN 978-3-540-32938-1
- [j3]Danny Harnik, Moni Naor, Omer Reingold, Alon Rosen: Completeness in Two-Party Secure Computation: A Computational View. J. Cryptology 19(4): 521-552 (2006)
- [c13]
- [c12]Chris Peikert, Alon Rosen: Efficient Collision-Resistant Hashing from Worst-Case Assumptions on Cyclic Lattices. TCC 2006: 145-166
- [i8]Chris Peikert, Alon Rosen: Lattices that Admit Logarithmic Worst-Case to Average-Case Connection Factors. Electronic Colloquium on Computational Complexity (ECCC) 13(147) (2006)
- [i7]Chris Peikert, Alon Rosen: Lattices that Admit Logarithmic Worst-Case to Average-Case Connection Factors. IACR Cryptology ePrint Archive 2006: 444 (2006)
- 2005
- [c11]Danny Harnik, Joe Kilian, Moni Naor, Omer Reingold, Alon Rosen: On Robust Combiners for Oblivious Transfer and Other Primitives. EUROCRYPT 2005: 96-113
- [c10]
- [c9]Rafael Pass, Alon Rosen: New and improved constructions of non-malleable cryptographic protocols. STOC 2005: 533-542
- [i6]Chris Peikert, Alon Rosen: Efficient Collision-Resistant Hashing from Worst-Case Assumptions on Cyclic Lattices. Electronic Colloquium on Computational Complexity (ECCC)(158) (2005)
- 2004
- [c8]Danny Harnik, Moni Naor, Omer Reingold, Alon Rosen: Completeness in two-party secure computation: a computational view. STOC 2004: 252-261
- [c7]
- [c6]Yan Zong Ding, Danny Harnik, Alon Rosen, Ronen Shaltiel: Constant-Round Oblivious Transfer in the Bounded Storage Model. TCC 2004: 446-472
- 2003
- [c5]Rafael Pass, Alon Rosen: Bounded-Concurrent Secure Two-Party Computation in a Constant Number of Rounds. FOCS 2003: 404-413
- [i5]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
- [j2]Moni Naor, Omer Reingold, Alon Rosen: Pseudorandom Functions and Factoring. SIAM J. Comput. 31(5): 1383-1404 (2002)
- [j1]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)
- [c4]Manoj Prabhakaran, Alon Rosen, Amit Sahai: Concurrent Zero Knowledge with Logarithmic Round-Complexity. FOCS 2002: 366-375
- 2001
- [c3]Ran Canetti, Joe Kilian, Erez Petrank, Alon Rosen: Black-box concurrent zero-knowledge requires Omega~(log n) rounds. STOC 2001: 570-579
- [i4]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)
- [i3]Moni Naor, Omer Reingold, Alon Rosen: Pseudo-Random Functions and Factoring. Electronic Colloquium on Computational Complexity (ECCC) 8(064) (2001)
- [i2]Ran Canetti, Joe Kilian, Erez Petrank, Alon Rosen: Black-Box Concurrent Zero-Knowledge Requires Omega(log n) Rounds. IACR Cryptology ePrint Archive 2001: 51 (2001)
- [i1]Moni Naor, Omer Reingold, Alon Rosen: Pseudo-Random Functions and Factoring. IACR Cryptology ePrint Archive 2001: 75 (2001)
- 2000
- [c2]
- [c1]Moni Naor, Omer Reingold, Alon Rosen: Pseudo-random functions and factoring (extended abstract). STOC 2000: 11-20
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-02-19 20:08 CET by the dblp team