Thomas Holenstein

Kfir Barhum, Thomas Holenstein: A Cookbook for Black-Box Separations and a Recipe for UOWHFs. TCC 2013: 662-679

Thomas Holenstein, Makrand Sinha: Constructing a Pseudorandom Generator Requires an Almost Linear Number of Calls. FOCS 2012: 698-707

Thomas Holenstein, Makrand Sinha: Constructing a Pseudorandom Generator Requires an Almost Linear Number of Calls. CoRR abs/1205.4576 (2012)

Kfir Barhum, Thomas Holenstein: A Cookbook for Black-Box Separations and a Recipe for UOWHFs. Electronic Colloquium on Computational Complexity (ECCC) 19: 173 (2012)

Thomas Holenstein, Renato Renner: On the Randomness of Independent Experiments. IEEE Transactions on Information Theory 57(4): 1865-1871 (2011)

Chandan K. Dubey, Thomas Holenstein: Approximating the Closest Vector Problem Using an Approximate Shortest Vector Oracle. APPROX-RANDOM 2011: 184-193

Boaz Barak, Moritz Hardt, Thomas Holenstein, David Steurer: Subsampling Mathematical Relaxations and Average-case Complexity. SODA 2011: 512-531

Thomas Holenstein, Robin Künzler, Stefano Tessaro: The equivalence of the random oracle model and the ideal cipher model, revisited. STOC 2011: 89-98

Thomas Holenstein, Grant Schoenebeck: General Hardness Amplification of Predicates and Puzzles - (Extended Abstract). TCC 2011: 19-36

Chandan K. Dubey, Thomas Holenstein: Approximating the Closest Vector Problem Using an Approximate Shortest Vector Oracle. CoRR abs/1106.2619 (2011)

Iftach Haitner, Thomas Holenstein, Omer Reingold, Salil P. Vadhan, Hoeteck Wee: Universal One-Way Hash Functions via Inaccessible Entropy. EUROCRYPT 2010: 616-637

Thomas Holenstein, Grant Schoenebeck: General Hardness Amplification of Predicates and Puzzles. CoRR abs/1002.3534 (2010)

Thomas Holenstein, Robin Künzler, Stefano Tessaro: Equivalence of the Random Oracle Model and the Ideal Cipher Model, Revisited. CoRR abs/1011.1264 (2010)

Iftach Haitner, Thomas Holenstein, Omer Reingold, Salil P. Vadhan, Hoeteck Wee: Universal One-Way Hash Functions via Inaccessible Entropy. IACR Cryptology ePrint Archive 2010: 120 (2010)

Thomas Holenstein: Parallel Repetition: Simplification and the No-Signaling Case. Theory of Computing 5(1): 141-172 (2009)

Iftach Haitner, Thomas Holenstein: On the (Im)Possibility of Key Dependent Encryption. TCC 2009: 202-219

Boaz Barak, Moritz Hardt, Thomas Holenstein, David Steurer: Subsampling Semidefinite Programs and Max-Cut on the Sphere. CoRR abs/0911.5526 (2009)

Boaz Barak, Moritz Hardt, Thomas Holenstein, David Steurer: Subsampling Semidefinite Programs and Max-Cut on the Sphere. Electronic Colloquium on Computational Complexity (ECCC) 16: 129 (2009)

Liad Blumrosen, Thomas Holenstein: Posted prices vs. negotiations: an asymptotic analysis. ACM Conference on Electronic Commerce 2008: 49

Thomas Holenstein, Michael Mitzenmacher, Rina Panigrahy, Udi Wieder: Trace reconstruction with constant deletion probability and related results. SODA 2008: 389-398

Iftach Haitner, Thomas Holenstein: On the (Im)Possibility of Key Dependent Encryption. IACR Cryptology ePrint Archive 2008: 164 (2008)

Thomas Holenstein: Parallel repetition: simplifications and the no-signaling case. STOC 2007: 411-419

Thomas Holenstein: Strengthening key agreement using hard-core sets. ETH Zurich 2006, isbn 3-86628-088-2, pp. 1-152

Thomas Holenstein: Pseudorandom Generators from One-Way Functions: A Simple Construction for Any Hardness. TCC 2006: 443-461

Thomas Holenstein: Parallel repetition: simplifications and the no-signaling case. CoRR abs/cs/0607139 (2006)

Thomas Holenstein, Renato Renner: On the randomness of independent experiments. CoRR abs/cs/0608007 (2006)

Thomas Holenstein, Renato Renner: One-Way Secret-Key Agreement and Applications to Circuit Polarization and Immunization of Public-Key Encryption. CRYPTO 2005: 478-493

Thomas Holenstein: Key agreement from weak bit agreement. STOC 2005: 664-673

Thomas Holenstein, Ueli M. Maurer, Johan Sjödin: Complete Classification of Bilinear Hard-Core Functions. CRYPTO 2004: 73-91

Matthias Fitzi, Thomas Holenstein, Jürg Wullschleger: Multi-party Computation with Hybrid Security. EUROCRYPT 2004: 419-438

Thomas Holenstein: Key Agreement from Weak Bit Agreement. Electronic Colloquium on Computational Complexity (ECCC)(102) (2004)

Matthias Fitzi, Martin Hirt, Thomas Holenstein, Jürg Wullschleger: Two-Threshold Broadcast and Detectable Multi-party Computation. EUROCRYPT 2003: 51-67

Ming C. Hao, Umeshwar Dayal, Daniel Cotting, Thomas Holenstein, Markus H. Gross: Accelerated Force Computation for Physics-Based Information Visualization. VisSym 2003

Matthias Fitzi, Daniel Gottesman, Martin Hirt, Thomas Holenstein, Adam Smith: Detectable byzantine agreement secure against faulty majorities. PODC 2002: 118-126

Matthias Fitzi, Martin Hirt, Thomas Holenstein, Jürg Wullschleger: Extended Validity and Consistency in Byzantine Agreement. IACR Cryptology ePrint Archive 2002: 53 (2002)