Thomas Holenstein

Orcid: 0000-0003-0261-3292

Affiliations:

ETH Zurich, Switzerland

According to our database¹, Thomas Holenstein authored at least 41 papers between 2002 and 2021.

Collaborative distances:

Dijkstra number² of three.
Erdős number³ of three.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Bibliography

2021

Design and Characterization of a Bearingless Cross-Flow Fan.

[BibT_eX]

[DOI]

Proceedings of the IEEE/ASME International Conference on Advanced Intelligent Mechatronics, 2021

2020

Inaccessible Entropy II: IE Functions and Universal One-Way Hashing.

[BibT_eX]

[DOI]

Theory Comput., 2020

The Communication Complexity of Private Simultaneous Messages, Revisited.

[BibT_eX]

[DOI]

J. Cryptol., 2020

2019

Scaling and design of miniature high-speed bearingless slice motors.

[BibT_eX]

[DOI]

Elektrotech. Informationstechnik, 2019

2016

How to Build an Ideal Cipher: The Indifferentiability of the Feistel Construction.

[BibT_eX]

[DOI]

J. Cryptol., 2016

Forbidden Subgraph Bounds for Parallel Repetition and the Density Hales-Jewett Theorem.

[BibT_eX]

[DOI]

Jan Hazla

Thomas Holenstein

Anup Rao

CoRR, 2016

Optimal Circuits for Streamed Linear Permutations Using RAM.

[BibT_eX]

[DOI]

François Serre

Thomas Holenstein

Markus Püschel

Proceedings of the 2016 ACM/SIGDA International Symposium on Field-Programmable Gate Arrays, 2016

Lower Bounds on Same-Set Inner Product in Correlated Spaces.

[BibT_eX]

[DOI]

Jan Hazla

Thomas Holenstein

Elchanan Mossel

Proceedings of the Approximation, 2016

2015

Upper Tail Estimates with Combinatorial Proofs.

[BibT_eX]

[DOI]

Jan Hazla

Thomas Holenstein

Proceedings of the 32nd International Symposium on Theoretical Aspects of Computer Science, 2015

2014

Generating a Quadratic Forms from a Given Genus.

[BibT_eX]

[DOI]

Chandan K. Dubey

Thomas Holenstein

CoRR, 2014

Computing the $p$-adic Canonical Quadratic Form in Polynomial Time.

[BibT_eX]

[DOI]

Chandan K. Dubey

Thomas Holenstein

CoRR, 2014

Sampling a Uniformly Random Solution of a Quadratic Equation over Quotient Rings.

[BibT_eX]

[DOI]

Chandan K. Dubey

Thomas Holenstein

CoRR, 2014

A New View on Worst-Case to Average-Case Reductions for NP Problems.

[BibT_eX]

[DOI]

Thomas Holenstein

Robin Künzler

Proceedings of the Computing and Combinatorics - 20th International Conference, 2014

A Protocol for Generating Random Elements with Their Probabilities.

[BibT_eX]

[DOI]

Thomas Holenstein

Robin Künzler

Proceedings of the Computing and Combinatorics - 20th International Conference, 2014

Sampling a Uniform Solution of a Quadratic Equation Modulo a Prime Power.

[BibT_eX]

[DOI]

Chandan K. Dubey

Thomas Holenstein

Proceedings of the Approximation, 2014

2013

The PFR Conjecture Holds for Two Opposing Special Cases.

[BibT_eX]

[DOI]

Thomas Holenstein

CoRR, 2013

2012

A Cookbook for Black-Box Separations and a Recipe for UOWHFs.

[BibT_eX]

[DOI]

Kfir Barhum

Thomas Holenstein

Electron. Colloquium Comput. Complex., 2012

Constructing a Pseudorandom Generator Requires an Almost Linear Number of Calls.

[BibT_eX]

[DOI]

Thomas Holenstein

Makrand Sinha

Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, 2012

2011

On the Randomness of Independent Experiments.

[BibT_eX]

[DOI]

Thomas Holenstein

Renato Renner

IEEE Trans. Inf. Theory, 2011

General Hardness Amplification of Predicates and Puzzles - (Extended Abstract).

[BibT_eX]

[DOI]

Thomas Holenstein

Grant Schoenebeck

Proceedings of the Theory of Cryptography - 8th Theory of Cryptography Conference, 2011

The equivalence of the random oracle model and the ideal cipher model, revisited.

[BibT_eX]

[DOI]

Thomas Holenstein

Robin Künzler

Stefano Tessaro

Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011

Subsampling Mathematical Relaxations and Average-case Complexity.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Approximating the Closest Vector Problem Using an Approximate Shortest Vector Oracle.

[BibT_eX]

[DOI]

Chandan K. Dubey

Thomas Holenstein

Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2011

2010

Universal One-Way Hash Functions via Inaccessible Entropy.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2010

General Hardness Amplification of Predicates and Puzzles

[BibT_eX]

[DOI]

Thomas Holenstein

Grant Schoenebeck

CoRR, 2010

2009

Parallel Repetition: Simplification and the No-Signaling Case.

[BibT_eX]

[DOI]

Thomas Holenstein

Theory Comput., 2009

Subsampling Semidefinite Programs and Max-Cut on the Sphere.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2009

2008

On the (Im)Possibility of Key Dependent Encryption.

[BibT_eX]

[DOI]

Iftach Haitner

Thomas Holenstein

IACR Cryptol. ePrint Arch., 2008

Trace reconstruction with constant deletion probability and related results.

[BibT_eX]

[DOI]

Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Posted prices vs. negotiations: an asymptotic analysis.

[BibT_eX]

[DOI]

Liad Blumrosen

Thomas Holenstein

Proceedings of the Proceedings 9th ACM Conference on Electronic Commerce (EC-2008), 2008

2007

Parallel repetition: simplifications and the no-signaling case.

[BibT_eX]

[DOI]

Thomas Holenstein

Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007

2006

Strengthening key agreement using hard-core sets.

[BibT_eX]

[DOI]

Thomas Holenstein

PhD thesis, 2006

Pseudorandom Generators from One-Way Functions: A Simple Construction for Any Hardness.

[BibT_eX]

[DOI]

Thomas Holenstein

Proceedings of the Theory of Cryptography, Third Theory of Cryptography Conference, 2006

2005

One-Way Secret-Key Agreement and Applications to Circuit Polarization and Immunization of Public-Key Encryption.

[BibT_eX]

[DOI]

Thomas Holenstein

Renato Renner

Proceedings of the Advances in Cryptology, 2005

2004

Key Agreement from Weak Bit Agreement

[BibT_eX]

[DOI]

Thomas Holenstein

Electron. Colloquium Comput. Complex., 2004

Multi-party Computation with Hybrid Security.

[BibT_eX]

[DOI]

Matthias Fitzi

Thomas Holenstein

Jürg Wullschleger

Proceedings of the Advances in Cryptology, 2004

Complete Classification of Bilinear Hard-Core Functions.

[BibT_eX]

[DOI]

Thomas Holenstein

Ueli M. Maurer

Johan Sjödin

Proceedings of the Advances in Cryptology, 2004

2003

Accelerated Force Computation for Physics-Based Information Visualization.

[BibT_eX]

[DOI]

Proceedings of the 5th Joint Eurographics - IEEE TCVG Symposium on Visualization, 2003

Two-Threshold Broadcast and Detectable Multi-party Computation.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2003

2002

Extended Validity and Consistency in Byzantine Agreement.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2002

Detectable byzantine agreement secure against faulty majorities.

[BibT_eX]

[DOI]

Proceedings of the Twenty-First Annual ACM Symposium on Principles of Distributed Computing, 2002

Thomas Holenstein

Timeline

Legend:

Links

Online presence:

On csauthors.net:

Bibliography

Loading...