Travelled to:1 × Greece
5 × USA
Collaborated with:M.Naor O.Reingold R.Canetti C.Peikert R.Pass N.Bitansky O.Paneth D.Harnik J.Kilian E.Petrank
Talks about:function (2) factor (2) comput (2) case (2) cryptograph (1) logarithm (1) construct (1) protocol (1) malleabl (1) knowledg (1)
Person: Alon Rosen
DBLP: Rosen:Alon
Contributed to:
201420072005200420012000Wrote 6 papers:
- STOC-2014-BitanskyCPR #on the
- On the existence of extractable one-way functions (NB, RC, OP, AR), pp. 505–514.
- STOC-2007-PeikertR #worst-case
- Lattices that admit logarithmic worst-case to average-case connection factors (CP, AR), pp. 478–487.
- STOC-2005-PassR #encryption #protocol
- New and improved constructions of non-malleable cryptographic protocols (RP, AR), pp. 533–542.
- STOC-2004-HarnikNRR #perspective
- Completeness in two-party secure computation: a computational view (DH, MN, OR, AR), pp. 252–261.
- STOC-2001-CanettiKPR #black box #concurrent
- Black-box concurrent zero-knowledge requires Ω(log n) rounds (RC, JK, EP, AR), pp. 570–579.
- STOC-2000-NaorRR #pseudo
- Pseudo-random functions and factoring (MN, OR, AR), pp. 11–20.