Search
International Association for Cryptologic Research
What's new
Archive
Best Papers
Videos
Authors
Coauthors
By year
By conference
All Committees
Most Committees
Report errors
Maps
About
Alon Rosen
Search web for home page
Program Committees
1
2013
TCC
pc
2
2012
PKC
pc
3
2010
PKC
pc
4
2010
TCC
pc
5
2008
Crypto
pc
6
2007
Eurocrypt
pc
7
2005
TCC
pc
Publications
year
title
booktitle
pages
1
2012
Lossy Functions Do Not Amplify Well
tcc
458-475
2
2012
A Dichotomy for Local Small-Bias Generators
tcc
600-617
3
2012
Pseudorandom Functions and Lattices
eurocrypt
719-737
4
2011
Input Locality and Hardness Amplification
tcc
1
5
2010
Optimistic Concurrent Zero Knowledge
asiacrypt
359-376
6
2010
Sequential Rationality in Cryptographic Protocols
eprint
online
7
2010
More Constructions of Lossy and Correlation-Secure Trapdoor Functions
pkc
279-295
8
2009
Fairness with an Honest Minority and a Rational Majority
tcc
36-53
9
2009
On the (Im)Possibility of Arthur-Merlin Witness Hiding Protocols
tcc
220-237
10
2009
Chosen-Ciphertext Security via Correlated Products
tcc
419-436
11
2008
SWIFFT: A Modest Proposal for FFT Hashing
fse
online
12
2008
Fairness with an Honest Minority and a Rational Majority
eprint
online
13
2008
Chosen-Ciphertext Security via Correlated Products
eprint
online
14
2008
Efficient Lossy Trapdoor Functions based on the Composite Residuosity Assumption
eprint
online
15
2007
Constant-Round Oblivious Transfer in the Bounded Storage Model
jofc
165-202
16
2006
Efficient Collision-Resistant Hashing from Worst-Case Assumptions on Cyclic Lattices
tcc
online
17
2006
Lattices that Admit Logarithmic Worst-Case to Average-Case Connection Factors
eprint
online
18
2006
Completeness in Two-Party Secure Computation: A Computational View
jofc
521-552
19
2005
On Robust Combiners for Oblivious Transfer and Other Primitives
eurocrypt
online
20
2004
A Note on Constant-Round Zero-Knowledge Proofs for NP
tcc
191-202
21
2004
Constant-Round Oblivious Transfer in the Bounded Storage Model
tcc
446-472
22
2001
Black-Box Concurrent Zero-Knowledge Requires $\tilde\Omega(\log n)$ Rounds
eprint
online
23
2001
Pseudo-Random Functions and Factoring
eprint
online
24
2000
A Note on the Round-Complexity of Concurrent Zero-Knowledge
crypto
451-468
Coauthors of Alon Rosen
Benny Applebaum
Abhishek Banerjee
Andrey Bogdanov
Ran Canetti
Yan Zong Ding
David Freeman
Oded Goldreich
Ronen Gradwohl
Iftach Haitner
Danny Harnik
Joe Kilian
Eike Kiltz
Noam Livne
Vadim Lyubashevsky
Daniele Micciancio
Moni Naor
Shien Jin Ong
David C. Parkes
Chris Peikert
Erez Petrank
Krzysztof Pietrzak
Omer Reingold
Gil Segev
Ronen Shaltiel
Abhi Shelat
Salil P. Vadhan