Thomas Holenstein

Publication Activity (10 Years)

Years Active: 2002-2021
Publications (10 Years): 14

Top Topics

Worst Case Analysis

Learning Curves

Top Venues

Electron. Colloquium Comput. Complex.

ETH Zurich (PHD)

Education History

ETH Zurich

PHD

Publications

Iftach Haitner, Thomas Holenstein, Omer Reingold, Salil P. Vadhan, Hoeteck Wee
Inaccessible Entropy II: IE Functions and Universal One-Way Hashing. CoRR (2021)
Ivana Bagaric, Daniel Steinert, Florian Wassmer, Thomas Holenstein, Thomas Nussbaumer, Johann W. Kolar
Design and Characterization of a Bearingless Cross-Flow Fan. AIM (2021)
Benny Applebaum, Thomas Holenstein, Manoj Mishra, Ofer Shayevitz
The Communication Complexity of Private Simultaneous Messages, Revisited. J. Cryptol. 33 (3) (2020)
Iftach Haitner, Thomas Holenstein, Omer Reingold, Salil P. Vadhan, Hoeteck Wee
Inaccessible Entropy II: IE Functions and Universal One-Way Hashing. Theory Comput. 16 (2020)
Marcel Schuck, Pascal Puentener, Thomas Holenstein, Johann W. Kolar
Scaling and design of miniature high-speed bearingless slice motors. Elektrotech. Informationstechnik 136 (2) (2019)
Benny Applebaum, Thomas Holenstein, Manoj Mishra, Ofer Shayevitz
The Communication Complexity of Private Simultaneous Messages, Revisited. EUROCRYPT (2) (2018)
Benny Applebaum, Thomas Holenstein, Manoj Mishra, Ofer Shayevitz
The Communication Complexity of Private Simultaneous Messages, Revisited. Electron. Colloquium Comput. Complex. 25 (2018)
Benny Applebaum, Thomas Holenstein, Manoj Mishra, Ofer Shayevitz
The Communication Complexity of Private Simultaneous Messages, Revisited. IACR Cryptol. ePrint Arch. 2018 (2018)
Jan Hazla, Thomas Holenstein, Elchanan Mossel
Lower Bounds on Same-Set Inner Product in Correlated Spaces. APPROX-RANDOM (2016)
Jan Hazla, Thomas Holenstein, Anup Rao
Forbidden Subgraph Bounds for Parallel Repetition and the Density Hales-Jewett Theorem. CoRR (2016)
François Serre, Thomas Holenstein, Markus Püschel
Optimal Circuits for Streamed Linear Permutations Using RAM. FPGA (2016)
Jean-Sébastien Coron, Thomas Holenstein, Robin Künzler, Jacques Patarin, Yannick Seurin, Stefano Tessaro
How to Build an Ideal Cipher: The Indifferentiability of the Feistel Construction. J. Cryptol. 29 (1) (2016)
Jan Hazla, Thomas Holenstein, Elchanan Mossel
Lower Bounds on Same-Set Inner Product in Correlated Spaces. CoRR (2015)
Jan Hazla, Thomas Holenstein
Upper Tail Estimates with Combinatorial Proofs. STACS (2015)
Thomas Holenstein, Robin Künzler
A Protocol for Generating Random Elements with Their Probabilities. COCOON (2014)
Chandan K. Dubey, Thomas Holenstein
Sampling a Uniform Solution of a Quadratic Equation Modulo a Prime Power. APPROX-RANDOM (2014)
Chandan K. Dubey, Thomas Holenstein
Computing the $p$-adic Canonical Quadratic Form in Polynomial Time. CoRR (2014)
Jan Hazla, Thomas Holenstein
Upper Tail Estimates with Combinatorial Proofs. CoRR (2014)
Chandan K. Dubey, Thomas Holenstein
Sampling a Uniformly Random Solution of a Quadratic Equation over Quotient Rings. CoRR (2014)
Chandan K. Dubey, Thomas Holenstein
Generating a Quadratic Forms from a Given Genus. CoRR (2014)
Thomas Holenstein, Robin Künzler
A New View on Worst-Case to Average-Case Reductions for NP Problems. COCOON (2014)
Thomas Holenstein, Robin Künzler
A Protocol for Generating Random Elements with their Probabilities. CoRR (2013)
Kfir Barhum, Thomas Holenstein
A Cookbook for Black-Box Separations and a Recipe for UOWHFs. TCC (2013)
Thomas Holenstein
The PFR Conjecture Holds for Two Opposing Special Cases. CoRR (2013)
Thomas Holenstein, Robin Künzler
A New View on Worst-Case to Average-Case Reductions for NP Problems. CoRR (2013)
Kfir Barhum, Thomas Holenstein
A Cookbook for Black-Box Separations and a Recipe for UOWHFs. Electron. Colloquium Comput. Complex. 19 (2012)
Thomas Holenstein, Makrand Sinha
Constructing a Pseudorandom Generator Requires an Almost Linear Number of Calls CoRR (2012)
Thomas Holenstein, Makrand Sinha
Constructing a Pseudorandom Generator Requires an Almost Linear Number of Calls. FOCS (2012)
Boaz Barak, Moritz Hardt, Thomas Holenstein, David Steurer
Subsampling Mathematical Relaxations and Average-case Complexity. SODA (2011)
Thomas Holenstein, Robin Künzler, Stefano Tessaro
The equivalence of the random oracle model and the ideal cipher model, revisited. STOC (2011)
Chandan K. Dubey, Thomas Holenstein
Approximating the Closest Vector Problem Using an Approximate Shortest Vector Oracle. APPROX-RANDOM (2011)
Chandan K. Dubey, Thomas Holenstein
Approximating the Closest Vector Problem Using an Approximate Shortest Vector Oracle CoRR (2011)
Thomas Holenstein, Grant Schoenebeck
General Hardness Amplification of Predicates and Puzzles - (Extended Abstract). TCC (2011)
Thomas Holenstein, Renato Renner
On the Randomness of Independent Experiments. IEEE Trans. Inf. Theory 57 (4) (2011)
Iftach Haitner, Thomas Holenstein, Omer Reingold, Salil P. Vadhan, Hoeteck Wee
Universal One-Way Hash Functions via Inaccessible Entropy. IACR Cryptol. ePrint Arch. 2010 (2010)
Thomas Holenstein, Robin Künzler, Stefano Tessaro
Equivalence of the Random Oracle Model and the Ideal Cipher Model, Revisited CoRR (2010)
Thomas Holenstein, Grant Schoenebeck
General Hardness Amplification of Predicates and Puzzles CoRR (2010)
Iftach Haitner, Thomas Holenstein, Omer Reingold, Salil P. Vadhan, Hoeteck Wee
Universal One-Way Hash Functions via Inaccessible Entropy. EUROCRYPT (2010)
Iftach Haitner, Thomas Holenstein
On the (Im)Possibility of Key Dependent Encryption. TCC (2009)
Thomas Holenstein
Parallel Repetition: Simplification and the No-Signaling Case. Theory Comput. 5 (1) (2009)
Boaz Barak, Moritz Hardt, Thomas Holenstein, David Steurer
Subsampling Semidefinite Programs and Max-Cut on the Sphere CoRR (2009)
Boaz Barak, Moritz Hardt, Thomas Holenstein, David Steurer
Subsampling Semidefinite Programs and Max-Cut on the Sphere. Electron. Colloquium Comput. Complex. 16 (2009)
Thomas Holenstein, Michael Mitzenmacher, Rina Panigrahy, Udi Wieder
Trace reconstruction with constant deletion probability and related results. SODA (2008)
Iftach Haitner, Thomas Holenstein
On the (Im)Possibility of Key Dependent Encryption. IACR Cryptol. ePrint Arch. 2008 (2008)
Liad Blumrosen, Thomas Holenstein
Posted prices vs. negotiations: an asymptotic analysis. EC (2008)
Thomas Holenstein
Parallel repetition: simplifications and the no-signaling case. STOC (2007)
Thomas Holenstein
Pseudorandom Generators from One-Way Functions: A Simple Construction for Any Hardness. TCC (2006)
Thomas Holenstein, Renato Renner
On the randomness of independent experiments CoRR (2006)
Thomas Holenstein
Parallel repetition: simplifications and the no-signaling case CoRR (2006)
Thomas Holenstein, Renato Renner
One-Way Secret-Key Agreement and Applications to Circuit Polarization and Immunization of Public-Key Encryption. CRYPTO (2005)
Thomas Holenstein
Key agreement from weak bit agreement. STOC (2005)
Thomas Holenstein
Key Agreement from Weak Bit Agreement Electron. Colloquium Comput. Complex. (102) (2004)
Matthias Fitzi, Thomas Holenstein, Jürg Wullschleger
Multi-party Computation with Hybrid Security. EUROCRYPT (2004)
Thomas Holenstein, Ueli M. Maurer, Johan Sjödin
Complete Classification of Bilinear Hard-Core Functions. CRYPTO (2004)
Ming C. Hao, Umeshwar Dayal, Daniel Cotting, Thomas Holenstein, Markus H. Gross
Accelerated Force Computation for Physics-Based Information Visualization. VisSym (2003)
Matthias Fitzi, Martin Hirt, Thomas Holenstein, Jürg Wullschleger
Two-Threshold Broadcast and Detectable Multi-party Computation. EUROCRYPT (2003)
Matthias Fitzi, Martin Hirt, Thomas Holenstein, Jürg Wullschleger
Extended Validity and Consistency in Byzantine Agreement. IACR Cryptol. ePrint Arch. 2002 (2002)
Matthias Fitzi, Daniel Gottesman, Martin Hirt, Thomas Holenstein, Adam D. Smith
Detectable byzantine agreement secure against faulty majorities. PODC (2002)