| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Abhishek Banerjee 0001, Chris Peikert, Alon Rosen |
Pseudorandom Functions and Lattices.  |
EUROCRYPT  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Krzysztof Pietrzak, Alon Rosen, Gil Segev |
Lossy Functions Do Not Amplify Well. |
TCC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Benny Applebaum, Andrej Bogdanov, Alon Rosen |
A Dichotomy for Local Small-Bias Generators. |
TCC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Benny Applebaum, Andrej Bogdanov, Alon Rosen |
A Dichotomy for Local Small-Bias Generators. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Andrej Bogdanov, Alon Rosen |
Input locality and hardness amplification. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Benny Applebaum, Andrej Bogdanov, Alon Rosen |
A Dichotomy for Local Small-Bias Generators. |
IACR Cryptology ePrint Archive |
2011 |
DBLP BibTeX RDF |
|
| 1 | Abhishek Banerjee 0001, Chris Peikert, Alon Rosen |
Pseudorandom Functions and Lattices. |
IACR Cryptology ePrint Archive |
2011 |
DBLP BibTeX RDF |
|
| 1 | R. Michael Alvarez, Josh Benaloh, Alon Rosen, Peter Y. A. Ryan |
Verifiable Elections and the Public (Dagstuhl Seminar 11281). |
Dagstuhl Reports |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrej Bogdanov, Alon Rosen |
Input Locality and Hardness Amplification. |
TCC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Ronen Gradwohl, Noam Livne, Alon Rosen |
Sequential Rationality in Cryptographic Protocols. |
IACR Cryptology ePrint Archive |
2010 |
DBLP BibTeX RDF |
|
| 1 | Ronen Gradwohl, Noam Livne, Alon Rosen |
Sequential Rationality in Cryptographic Protocols |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Alon Rosen, Gil Segev |
Chosen-Ciphertext Security via Correlated Products. |
SIAM J. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | David Mandell Freeman, Oded Goldreich, Eike Kiltz, Alon Rosen, Gil Segev |
More Constructions of Lossy and Correlation-Secure Trapdoor Functions. |
Public Key Cryptography |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Yaping Li, Hongyi Yao, Minghua Chen, Sidharth Jaggi, Alon Rosen |
RIPPLE Authentication for Network Coding. |
INFOCOM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Alon Rosen, Abhi Shelat |
Optimistic Concurrent Zero Knowledge. |
ASIACRYPT |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Ronen Gradwohl, Noam Livne, Alon Rosen |
Sequential Rationality in Cryptographic Protocols. |
FOCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP BibTeX RDF |
|
| 1 | Alon Rosen, Gil Segev |
Chosen-Ciphertext Security via Correlated Products. |
TCC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Shien Jin Ong, David C. Parkes, Alon Rosen, Salil P. Vadhan |
Fairness with an Honest Minority and a Rational Majority. |
TCC |
2009 |
DBLP DOI BibTeX RDF |
game theory, fairness, secret sharing |
| 1 | Iftach Haitner, Alon Rosen, Ronen Shaltiel |
On the (Im)Possibility of Arthur-Merlin Witness Hiding Protocols. |
TCC |
2009 |
DBLP DOI BibTeX RDF |
Witness-Hiding, Arthur Merlin protocols, Zero-Knowledge, Black-box reductions |
| 1 | Alon Rosen, Gil Segev |
Efficient Lossy Trapdoor Functions based on the Composite Residuosity Assumption. |
IACR Cryptology ePrint Archive |
2008 |
DBLP BibTeX RDF |
|
| 1 | Alon Rosen, Gil Segev |
Chosen-Ciphertext Security via Correlated Products. |
IACR Cryptology ePrint Archive |
2008 |
DBLP BibTeX RDF |
|
| 1 | 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 |
DBLP BibTeX RDF |
|
| 1 | Rafael Pass, Alon Rosen |
Concurrent Nonmalleable Commitments. |
SIAM J. Comput. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Rafael Pass, Alon Rosen |
New and Improved Constructions of Nonmalleable Cryptographic Protocols. |
SIAM J. Comput. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Vadim Lyubashevsky, Daniele Micciancio, Chris Peikert, Alon Rosen |
SWIFFT: A Modest Proposal for FFT Hashing. |
FSE |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Yan Zong Ding, Danny Harnik, Alon Rosen, Ronen Shaltiel |
Constant-Round Oblivious Transfer in the Bounded Storage Model. |
J. Cryptology |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Chris Peikert, Alon Rosen |
Lattices that admit logarithmic worst-case to average-case connection factors. |
STOC |
2007 |
DBLP DOI BibTeX RDF |
algebraic number theory, worst-case to average-case reductions, lattices |
| 1 | Chris Peikert, Alon Rosen |
Lattices that Admit Logarithmic Worst-Case to Average-Case Connection Factors. |
Electronic Colloquium on Computational Complexity (ECCC) |
2006 |
DBLP BibTeX RDF |
|
| 1 | Chris Peikert, Alon Rosen |
Lattices that Admit Logarithmic Worst-Case to Average-Case Connection Factors. |
IACR Cryptology ePrint Archive |
2006 |
DBLP BibTeX RDF |
|
| 1 | Danny Harnik, Moni Naor, Omer Reingold, Alon Rosen |
Completeness in Two-Party Secure Computation: A Computational View. |
J. Cryptology |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Alon Rosen |
Concurrent Zero-Knowledge - With Additional Background by Oded Goldreich |
|
2006 |
DOI RDF |
|
| 1 | Alon Rosen |
Concurrent zero-knowledge. |
|
2006 |
DOI RDF |
|
| 1 | Chris Peikert, Alon Rosen |
Efficient Collision-Resistant Hashing from Worst-Case Assumptions on Cyclic Lattices. |
TCC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Silvio Micali, Rafael Pass, Alon Rosen |
Input-Indistinguishable Computation. |
FOCS |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Chris Peikert, Alon Rosen |
Efficient Collision-Resistant Hashing from Worst-Case Assumptions on Cyclic Lattices |
Electronic Colloquium on Computational Complexity (ECCC) |
2005 |
DBLP BibTeX RDF |
|
| 1 | Danny Harnik, Joe Kilian, Moni Naor, Omer Reingold, Alon Rosen |
On Robust Combiners for Oblivious Transfer and Other Primitives. |
EUROCRYPT |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Rafael Pass, Alon Rosen |
Concurrent Non-Malleable Commitments. |
FOCS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Rafael Pass, Alon Rosen |
New and improved constructions of non-malleable cryptographic protocols. |
STOC |
2005 |
DBLP DOI BibTeX RDF |
non black-box simulation, cryptography, zero-knowledge, non-malleability, round-complexity, man-in-the-middle |
| 1 | Alon Rosen |
A Note on Constant-Round Zero-Knowledge Proofs for NP. |
TCC |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Yan Zong Ding, Danny Harnik, Alon Rosen, Ronen Shaltiel |
Constant-Round Oblivious Transfer in the Bounded Storage Model. |
TCC |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Danny Harnik, Moni Naor, Omer Reingold, Alon Rosen |
Completeness in two-party secure computation: a computational view. |
STOC |
2004 |
DBLP DOI BibTeX RDF |
oblivious tansfer, completeness, secure computation |
| 1 | Danny Harnik, Moni Naor, Omer Reingold, Alon Rosen |
Completeness in Two-Party Secure Computation - A Computational View |
Electronic Colloquium on Computational Complexity (ECCC) |
2003 |
DBLP BibTeX RDF |
|
| 1 | Rafael Pass, Alon Rosen |
Bounded-Concurrent Secure Two-Party Computation in a Constant Number of Rounds. |
FOCS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Moni Naor, Omer Reingold, Alon Rosen |
Pseudorandom Functions and Factoring. |
SIAM J. Comput. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Ran Canetti, Joe Kilian, Erez Petrank, Alon Rosen |
Black-Box Concurrent Zero-Knowledge Requires (Almost) Logarithmically Many Rounds. |
SIAM J. Comput. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Manoj Prabhakaran, Alon Rosen, Amit Sahai |
Concurrent Zero Knowledge with Logarithmic Round-Complexity. |
FOCS |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Moni Naor, Omer Reingold, Alon Rosen |
Pseudo-Random Functions and Factoring |
Electronic Colloquium on Computational Complexity (ECCC) |
2001 |
DBLP BibTeX RDF |
|
| 1 | Ran Canetti, Joe Kilian, Erez Petrank, Alon Rosen |
Black-Box Concurrent Zero-Knowledge Requires ~Omega(log n) Rounds |
Electronic Colloquium on Computational Complexity (ECCC) |
2001 |
DBLP BibTeX RDF |
|
| 1 | Ran Canetti, Joe Kilian, Erez Petrank, Alon Rosen |
Black-Box Concurrent Zero-Knowledge Requires Omega(log n) Rounds. |
IACR Cryptology ePrint Archive |
2001 |
DBLP BibTeX RDF |
|
| 1 | Moni Naor, Omer Reingold, Alon Rosen |
Pseudo-Random Functions and Factoring. |
IACR Cryptology ePrint Archive |
2001 |
DBLP BibTeX RDF |
|
| 1 | Ran Canetti, Joe Kilian, Erez Petrank, Alon Rosen |
Black-box concurrent zero-knowledge requires Omega~(log n) rounds. |
STOC |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Alon Rosen |
A Note on the Round-Complexity of Concurrent Zero-Knowledge. |
CRYPTO |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Moni Naor, Omer Reingold, Alon Rosen |
Pseudo-random functions and factoring (extended abstract). |
STOC |
2000 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")