Thomas Holenstein

Microsoft Research Silicon Valley
1065 La Avenida
Mountain View, CA 94043
USA

phone: +1 650 693 1780
email: thomahol (at) microsoft (dot) com

Selected Publications

• Posted prices vs. negotations: an asymptotic analysis
  with Liad Blumrosen, EC 2008
• On the (im)possibility of key dependent encryption
  with Ifatch Haitner, submitted, 2008
• Trace reconstruction with constant deletion probability and related results
  with Michael Mitzenmacher, Rina Panigrahi, and Udi Wieder, SODA 2008 (pdf)
• Parallel repetition: simplifications and the no-signaling case
  STOC 2007 (ACM (extended abstract) cs/0607139 ps pdf)
• On the randomness of independent experiments
  with Renato Renner, 2006 (cs/0608007 ps pdf)
• Strengthening key agreement using hard-core sets
  PhD thesis, 2006 (abstract pdf)
• Pseudorandom generators from one-way functions: a simple construction for any hardness
  TCC 2006 (LNCS ps pdf)
• One-way secret-key agreement and applications to circuit polarization and immunization of public-key encryption
  with Renato Renner, CRYPTO 2005 (LNCS ps pdf)
• Key agreement from weak bit agreement
  STOC 2005 (ACM ps pdf)
• Complete classification of bilinear hard-core functions
  with Ueli Maurer and Johan Sjödin, CRYPTO 2004 (LNCS ps pdf)
• Multi-party computation with hybrid security
  with Matthias Fitzi and Jürg Wullschleger, EUROCRYPT 2004 (LNCS ps pdf)
• Two-threshold broadcast and detectable multi-party computation
  with Matthias Fitzi, Martin Hirt, and Jürg Wullschleger, EUROCRYPT 2003 (LNCS ps pdf)
• Detectable byzantine agreement secure against faulty majorities
  with Matthias Fitzi, Daniel Gottesman, Martin Hirt, and Adam Smith, PODC 2002 (ACM ps pdf)