Travelled to:
1 × Czech Republic
1 × Greece
1 × Italy
7 × USA
Collaborated with:
S.Khanna S.Lovett D.Aggarwal D.Wichs R.Renner A.Smith ∅ M.Patrascu M.Thorup Y.T.Kalai R.Cole T.Roughgarden T.Kazana M.Obremski
Talks about:
malleabl (3) non (3) cryptographi (2) without (2) network (2) random (2) applic (2) space (2) combinator (1) imperfect (1)
Person: Yevgeniy Dodis
DBLP: Dodis:Yevgeniy
Contributed to:
Wrote 11 papers:
- STOC-2015-AggarwalDKO #reduction
- Non-malleable Reductions and Applications (DA, YD, TK, MO), pp. 459–468.
- STOC-2014-AggarwalDL #combinator
- Non-malleable codes from additive combinatorics (DA, YD, SL), pp. 774–783.
- STOC-2010-DodisPT
- Changing base without losing space (YD, MP, MT), pp. 593–602.
- STOC-2009-DodisKL #encryption #on the
- On cryptography with auxiliary input (YD, YTK, SL), pp. 621–630.
- STOC-2009-DodisW #encryption #symmetry
- Non-malleable extractors and symmetric key cryptography from weak secrets (YD, DW), pp. 601–610.
- ICALP-v2-2006-DodisR #on the #quantum #using
- On the Impossibility of Extracting Classical Randomness Using a Quantum Computer (YD, RR), pp. 204–215.
- STOC-2005-DodisS #fault
- Correcting errors without leaking partial information (YD, AS), pp. 654–663.
- STOC-2003-ColeDR #network
- Pricing network edges for heterogeneous selfish users (RC, YD, TR), pp. 521–530.
- ICALP-2001-Dodis #random
- New Imperfect Random Source with Applications to Coin-Flipping (YD), pp. 297–309.
- ICALP-1999-DodisK #graph #trade-off
- Space Time Tradeoffs for Graph Properties (YD, SK), pp. 291–300.
- STOC-1999-DodisK #bound #design #distance #network
- Design Networks with Bounded Pairwise Distance (YD, SK), pp. 750–759.