Travelled to:2 × Canada
4 × USA
Collaborated with:T.Rabin E.Kushilevitz ∅ B.Barak Y.Aumann Y.T.Kalai M.Prabhakaran A.Lysyanskaya S.D.Gordon C.Hazay J.Katz Y.Ishai E.Petrank R.Canetti R.Ostrovsky A.Sahai
Talks about:secur (7) comput (4) parti (4) composit (3) two (3) protocol (2) concurr (2) time (2) construct (1) agreement (1)
Person: Yehuda Lindell
DBLP: Lindell:Yehuda
Contributed to:
20082006200520032002
1999Wrote 9 papers:
- STOC-2008-GordonHKL
- Complete fairness in secure two-party computation (SDG, CH, JK, YL), pp. 413–422.
- STOC-2006-IshaiKLP #black box
- Black-box constructions for secure computation (YI, EK, YL, EP), pp. 99–108.
- STOC-2006-KushilevitzLR #composition #protocol #security
- Information-theoretically secure protocols and security under composition (EK, YL, TR), pp. 109–118.
- STOC-2005-KalaiLP #composition #concurrent #protocol
- Concurrent general composition of secure protocols in the timing model (YTK, YL, MP), pp. 644–653.
- STOC-2003-Lindell #bound
- Bounded-concurrent secure two-party computation without setup assumptions (YL), pp. 683–692.
- STOC-2002-BarakL #polynomial #simulation #strict
- Strict polynomial-time in simulation and extraction (BB, YL), pp. 484–493.
- STOC-2002-CanettiLOS #composition #multi
- Universally composable two-party and multi-party secure computation (RC, YL, RO, AS), pp. 494–503.
- STOC-2002-LindellLR #authentication #composition #on the
- On the composition of authenticated byzantine agreement (YL, AL, TR), pp. 514–523.
- KDD-1999-AumannL #statistics
- A Statistical Theory for Quantitative Association Rules (YA, YL), pp. 261–270.