| 2018 | EuroCrypt | The Communication Complexity of Private Simultaneous Messages, Revisited. | Benny Applebaum, Thomas Holenstein, Manoj Mishra, Ofer Shayevitz |
| 2016 | FPGA | Optimal Circuits for Streamed Linear Permutations Using RAM. | Franois Serre, Thomas Holenstein, Markus Pschel |
| 2015 | STACS | Upper Tail Estimates with Combinatorial Proofs. | Jan Hazla, Thomas Holenstein |
| 2014 | COCOON | A Protocol for Generating Random Elements with Their Probabilities. | Thomas Holenstein, Robin Knzler |
| 2014 | COCOON | A New View on Worst-Case to Average-Case Reductions for NP Problems. | Thomas Holenstein, Robin Knzler |
| 2013 | TCC | A Cookbook for Black-Box Separations and a Recipe for UOWHFs. | Kfir Barhum, Thomas Holenstein |
| 2012 | FOCS | Constructing a Pseudorandom Generator Requires an Almost Linear Number of Calls. | Thomas Holenstein, Makrand Sinha |
| 2011 | SODA | Subsampling Mathematical Relaxations and Average-case Complexity. | Boaz Barak, Moritz Hardt, Thomas Holenstein, David Steurer |
| 2011 | STOC | The equivalence of the random oracle model and the ideal cipher model, revisited. | Thomas Holenstein, Robin Knzler, Stefano Tessaro |
| 2011 | TCC | General Hardness Amplification of Predicates and Puzzles - (Extended Abstract). | Thomas Holenstein, Grant Schoenebeck |
| 2010 | EuroCrypt | Universal One-Way Hash Functions via Inaccessible Entropy. | Iftach Haitner, Thomas Holenstein, Omer Reingold, Salil P. Vadhan, Hoeteck Wee |
| 2009 | TCC | On the (Im)Possibility of Key Dependent Encryption. | Iftach Haitner, Thomas Holenstein |
| 2008 | SODA | Trace reconstruction with constant deletion probability and related results. | Thomas Holenstein, Michael Mitzenmacher, Rina Panigrahy, Udi Wieder |
| 2007 | STOC | Parallel repetition: simplifications and the no-signaling case. | Thomas Holenstein |
| 2006 | TCC | Pseudorandom Generators from One-Way Functions: A Simple Construction for Any Hardness. | Thomas Holenstein |
| 2005 | CRYPTO | One-Way Secret-Key Agreement and Applications to Circuit Polarization and Immunization of Public-Key Encryption. | Thomas Holenstein, Renato Renner |
| 2005 | STOC | Key agreement from weak bit agreement. | Thomas Holenstein |
| 2004 | CRYPTO | Complete Classification of Bilinear Hard-Core Functions. | Thomas Holenstein, Ueli M. Maurer, Johan Sjdin |
| 2004 | EuroCrypt | Multi-party Computation with Hybrid Security. | Matthias Fitzi, Thomas Holenstein, Jrg Wullschleger |
| 2003 | EuroCrypt | Two-Threshold Broadcast and Detectable Multi-party Computation. | Matthias Fitzi, Martin Hirt, Thomas Holenstein, Jrg Wullschleger |
| 2002 | PODC | Detectable byzantine agreement secure against faulty majorities. | Matthias Fitzi, Daniel Gottesman, Martin Hirt, Thomas Holenstein, Adam D. Smith |