The SCEAS System
| |||||||

## Search the dblp DataBase
Alon Rosen:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Alon Rosen
**A Note on the Round-Complexity of Concurrent Zero-Knowledge.**[Citation Graph (0, 0)][DBLP] CRYPTO, 2000, pp:451-468 [Conf] - Danny Harnik, Joe Kilian, Moni Naor, Omer Reingold, Alon Rosen
**On Robust Combiners for Oblivious Transfer and Other Primitives.**[Citation Graph (0, 0)][DBLP] EUROCRYPT, 2005, pp:96-113 [Conf] - Rafael Pass, Alon Rosen
**Bounded-Concurrent Secure Two-Party Computation in a Constant Number of Rounds.**[Citation Graph (0, 0)][DBLP] FOCS, 2003, pp:404-0 [Conf] - Rafael Pass, Alon Rosen
**Concurrent Non-Malleable Commitments.**[Citation Graph (0, 0)][DBLP] FOCS, 2005, pp:563-572 [Conf] - Manoj Prabhakaran, Alon Rosen, Amit Sahai
**Concurrent Zero Knowledge with Logarithmic Round-Complexity.**[Citation Graph (0, 0)][DBLP] FOCS, 2002, pp:366-375 [Conf] - Silvio Micali, Rafael Pass, Alon Rosen
**Input-Indistinguishable Computation.**[Citation Graph (0, 0)][DBLP] FOCS, 2006, pp:367-378 [Conf] - Ran Canetti, Joe Kilian, Erez Petrank, Alon Rosen
**Black-box concurrent zero-knowledge requires Omega~(log n) rounds.**[Citation Graph (0, 0)][DBLP] STOC, 2001, pp:570-579 [Conf] - Danny Harnik, Moni Naor, Omer Reingold, Alon Rosen
**Completeness in two-party secure computation: a computational view.**[Citation Graph (0, 0)][DBLP] STOC, 2004, pp:252-261 [Conf] - Moni Naor, Omer Reingold, Alon Rosen
**Pseudo-random functions and factoring (extended abstract).**[Citation Graph (0, 0)][DBLP] STOC, 2000, pp:11-20 [Conf] - Rafael Pass, Alon Rosen
**New and improved constructions of non-malleable cryptographic protocols.**[Citation Graph (0, 0)][DBLP] STOC, 2005, pp:533-542 [Conf] - Chris Peikert, Alon Rosen
**Efficient Collision-Resistant Hashing from Worst-Case Assumptions on Cyclic Lattices.**[Citation Graph (0, 0)][DBLP] TCC, 2006, pp:145-166 [Conf] - Alon Rosen
**A Note on Constant-Round Zero-Knowledge Proofs for NP.**[Citation Graph (0, 0)][DBLP] TCC, 2004, pp:191-202 [Conf] - Yan Zong Ding, Danny Harnik, Alon Rosen, Ronen Shaltiel
**Constant-Round Oblivious Transfer in the Bounded Storage Model.**[Citation Graph (0, 0)][DBLP] TCC, 2004, pp:446-472 [Conf] - Ran Canetti, Joe Kilian, Erez Petrank, Alon Rosen
**Black-Box Concurrent Zero-Knowledge Requires ~Omega(log n) Rounds**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2001, v:8, n:50, pp:- [Journal] - Moni Naor, Omer Reingold, Alon Rosen
**Pseudo-Random Functions and Factoring**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2001, v:8, n:064, pp:- [Journal] - Danny Harnik, Moni Naor, Omer Reingold, Alon Rosen
**Completeness in Two-Party Secure Computation - A Computational View**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2003, v:, n:060, pp:- [Journal] - Chris Peikert, Alon Rosen
**Efficient Collision-Resistant Hashing from Worst-Case Assumptions on Cyclic Lattices**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:158, pp:- [Journal] - Danny Harnik, Moni Naor, Omer Reingold, Alon Rosen
**Completeness in Two-Party Secure Computation: A Computational View.**[Citation Graph (0, 0)][DBLP] J. Cryptology, 2006, v:19, n:4, pp:521-552 [Journal] - Ran Canetti, Joe Kilian, Erez Petrank, Alon Rosen
**Black-Box Concurrent Zero-Knowledge Requires (Almost) Logarithmically Many Rounds.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2002, v:32, n:1, pp:1-47 [Journal] - Moni Naor, Omer Reingold, Alon Rosen
**Pseudorandom Functions and Factoring.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2002, v:31, n:5, pp:1383-1404 [Journal] - Chris Peikert, Alon Rosen
**Lattices that admit logarithmic worst-case to average-case connection factors.**[Citation Graph (0, 0)][DBLP] STOC, 2007, pp:478-487 [Conf] - Yan Zong Ding, Danny Harnik, Alon Rosen, Ronen Shaltiel
**Constant-Round Oblivious Transfer in the Bounded Storage Model.**[Citation Graph (0, 0)][DBLP] J. Cryptology, 2007, v:20, n:2, pp:165-202 [Journal] **SWIFFT: A Modest Proposal for FFT Hashing.**[Citation Graph (, )][DBLP]**RIPPLE Authentication for Network Coding.**[Citation Graph (, )][DBLP]**More Constructions of Lossy and Correlation-Secure Trapdoor Functions.**[Citation Graph (, )][DBLP]**Fairness with an Honest Minority and a Rational Majority.**[Citation Graph (, )][DBLP]**On the (Im)Possibility of Arthur-Merlin Witness Hiding Protocols.**[Citation Graph (, )][DBLP]**Chosen-Ciphertext Security via Correlated Products.**[Citation Graph (, )][DBLP]**Sequential Rationality in Cryptographic Protocols**[Citation Graph (, )][DBLP]**Lattices that Admit Logarithmic Worst-Case to Average-Case Connection Factors.**[Citation Graph (, )][DBLP]
Search in 0.003secs, Finished in 0.004secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |