Thomas Holenstein

Postdoctoral Researcher at Princeton University
Thomas Holenstein
Department of Computer Science
Princeton University
35 Olden Street
Princeton, New Jersey, 08540
My email address is tholenst followed by the cs.princeton.edu.

Selected Publications

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