Thomas Holenstein

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