default search action
Thomas Holenstein
Person information
- affiliation: ETH Zurich, Switzerland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [c27]Ivana Bagaric, Daniel Steinert, Florian Wassmer, Thomas Holenstein, Thomas Nussbaumer, Johann W. Kolar:
Design and Characterization of a Bearingless Cross-Flow Fan. AIM 2021: 1195-1200 - [i25]Iftach Haitner, Thomas Holenstein, Omer Reingold, Salil P. Vadhan, Hoeteck Wee:
Inaccessible Entropy II: IE Functions and Universal One-Way Hashing. CoRR abs/2105.01459 (2021) - 2020
- [j6]Benny Applebaum, Thomas Holenstein, Manoj Mishra, Ofer Shayevitz:
The Communication Complexity of Private Simultaneous Messages, Revisited. J. Cryptol. 33(3): 917-953 (2020) - [j5]Iftach Haitner, Thomas Holenstein, Omer Reingold, Salil P. Vadhan, Hoeteck Wee:
Inaccessible Entropy II: IE Functions and Universal One-Way Hashing. Theory Comput. 16: 1-55 (2020)
2010 – 2019
- 2019
- [j4]Marcel Schuck, Pascal Puentener, Thomas Holenstein
, Johann W. Kolar:
Scaling and design of miniature high-speed bearingless slice motors. Elektrotech. Informationstechnik 136(2): 112-119 (2019) - 2018
- [c26]Benny Applebaum, Thomas Holenstein, Manoj Mishra, Ofer Shayevitz:
The Communication Complexity of Private Simultaneous Messages, Revisited. EUROCRYPT (2) 2018: 261-286 - [i24]Benny Applebaum, Thomas Holenstein, Manoj Mishra, Ofer Shayevitz:
The Communication Complexity of Private Simultaneous Messages, Revisited. Electron. Colloquium Comput. Complex. TR18 (2018) - [i23]Benny Applebaum, Thomas Holenstein, Manoj Mishra, Ofer Shayevitz:
The Communication Complexity of Private Simultaneous Messages, Revisited. IACR Cryptol. ePrint Arch. 2018: 144 (2018) - 2016
- [j3]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): 61-114 (2016) - [c25]Jan Hazla, Thomas Holenstein, Elchanan Mossel:
Lower Bounds on Same-Set Inner Product in Correlated Spaces. APPROX-RANDOM 2016: 34:1-34:11 - [c24]François Serre, Thomas Holenstein, Markus Püschel:
Optimal Circuits for Streamed Linear Permutations Using RAM. FPGA 2016: 215-223 - [i22]Jan Hazla, Thomas Holenstein, Anup Rao:
Forbidden Subgraph Bounds for Parallel Repetition and the Density Hales-Jewett Theorem. CoRR abs/1604.05757 (2016) - 2015
- [c23]Jan Hazla, Thomas Holenstein:
Upper Tail Estimates with Combinatorial Proofs. STACS 2015: 392-405 - [i21]Jan Hazla, Thomas Holenstein, Elchanan Mossel:
Lower Bounds on Same-Set Inner Product in Correlated Spaces. CoRR abs/1509.06191 (2015) - 2014
- [c22]Chandan K. Dubey, Thomas Holenstein:
Sampling a Uniform Solution of a Quadratic Equation Modulo a Prime Power. APPROX-RANDOM 2014: 643-653 - [c21]Thomas Holenstein, Robin Künzler:
A Protocol for Generating Random Elements with Their Probabilities. COCOON 2014: 191-202 - [c20]Thomas Holenstein, Robin Künzler:
A New View on Worst-Case to Average-Case Reductions for NP Problems. COCOON 2014: 203-214 - [i20]Chandan K. Dubey, Thomas Holenstein:
Sampling a Uniformly Random Solution of a Quadratic Equation over Quotient Rings. CoRR abs/1404.0281 (2014) - [i19]Jan Hazla, Thomas Holenstein:
Upper Tail Estimates with Combinatorial Proofs. CoRR abs/1405.2349 (2014) - [i18]Chandan K. Dubey, Thomas Holenstein:
Computing the $p$-adic Canonical Quadratic Form in Polynomial Time. CoRR abs/1409.6199 (2014) - [i17]Chandan K. Dubey, Thomas Holenstein:
Generating a Quadratic Forms from a Given Genus. CoRR abs/1409.6913 (2014) - 2013
- [c19]Kfir Barhum, Thomas Holenstein:
A Cookbook for Black-Box Separations and a Recipe for UOWHFs. TCC 2013: 662-679 - [i16]Thomas Holenstein:
The PFR Conjecture Holds for Two Opposing Special Cases. CoRR abs/1311.0172 (2013) - [i15]Thomas Holenstein, Robin Künzler:
A Protocol for Generating Random Elements with their Probabilities. CoRR abs/1312.2483 (2013) - [i14]Thomas Holenstein, Robin Künzler:
A New View on Worst-Case to Average-Case Reductions for NP Problems. CoRR abs/1312.2490 (2013) - 2012
- [c18]Thomas Holenstein, Makrand Sinha:
Constructing a Pseudorandom Generator Requires an Almost Linear Number of Calls. FOCS 2012: 698-707 - [i13]Thomas Holenstein, Makrand Sinha:
Constructing a Pseudorandom Generator Requires an Almost Linear Number of Calls. CoRR abs/1205.4576 (2012) - [i12]Kfir Barhum, Thomas Holenstein:
A Cookbook for Black-Box Separations and a Recipe for UOWHFs. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [j2]Thomas Holenstein, Renato Renner:
On the Randomness of Independent Experiments. IEEE Trans. Inf. Theory 57(4): 1865-1871 (2011) - [c17]Chandan K. Dubey, Thomas Holenstein:
Approximating the Closest Vector Problem Using an Approximate Shortest Vector Oracle. APPROX-RANDOM 2011: 184-193 - [c16]Boaz Barak, Moritz Hardt, Thomas Holenstein, David Steurer
Subsampling Mathematical Relaxations and Average-case Complexity. SODA 2011: 512-531 - [c15]Thomas Holenstein, Robin Künzler, Stefano Tessaro:
The equivalence of the random oracle model and the ideal cipher model, revisited. STOC 2011: 89-98 - [c14]Thomas Holenstein, Grant Schoenebeck
General Hardness Amplification of Predicates and Puzzles - (Extended Abstract). TCC 2011: 19-36 - [i11]Chandan K. Dubey, Thomas Holenstein:
Approximating the Closest Vector Problem Using an Approximate Shortest Vector Oracle. CoRR abs/1106.2619 (2011) - 2010
- [c13]Iftach Haitner, Thomas Holenstein, Omer Reingold, Salil P. Vadhan, Hoeteck Wee:
Universal One-Way Hash Functions via Inaccessible Entropy. EUROCRYPT 2010: 616-637 - [i10]Thomas Holenstein, Grant Schoenebeck:
General Hardness Amplification of Predicates and Puzzles. CoRR abs/1002.3534 (2010) - [i9]Thomas Holenstein, Robin Künzler, Stefano Tessaro:
Equivalence of the Random Oracle Model and the Ideal Cipher Model, Revisited. CoRR abs/1011.1264 (2010) - [i8]Iftach Haitner, Thomas Holenstein, Omer Reingold, Salil P. Vadhan, Hoeteck Wee:
Universal One-Way Hash Functions via Inaccessible Entropy. IACR Cryptol. ePrint Arch. 2010: 120 (2010)
2000 – 2009
- 2009
- [j1]Thomas Holenstein:
Parallel Repetition: Simplification and the No-Signaling Case. Theory Comput. 5(1): 141-172 (2009) - [c12]Iftach Haitner, Thomas Holenstein:
On the (Im)Possibility of Key Dependent Encryption. TCC 2009: 202-219 - [i7]Boaz Barak, Moritz Hardt, Thomas Holenstein, David Steurer:
Subsampling Semidefinite Programs and Max-Cut on the Sphere. CoRR abs/0911.5526 (2009) - [i6]Boaz Barak, Moritz Hardt, Thomas Holenstein, David Steurer:
Subsampling Semidefinite Programs and Max-Cut on the Sphere. Electron. Colloquium Comput. Complex. TR09 (2009) - 2008
- [c11]Liad Blumrosen, Thomas Holenstein:
Posted prices vs. negotiations: an asymptotic analysis. EC 2008: 49 - [c10]Thomas Holenstein, Michael Mitzenmacher, Rina Panigrahy, Udi Wieder:
Trace reconstruction with constant deletion probability and related results. SODA 2008: 389-398 - [i5]Iftach Haitner, Thomas Holenstein:
On the (Im)Possibility of Key Dependent Encryption. IACR Cryptol. ePrint Arch. 2008: 164 (2008) - 2007
- [c9]Thomas Holenstein:
Parallel repetition: simplifications and the no-signaling case. STOC 2007: 411-419 - 2006
- [b1]Thomas Holenstein:
Strengthening key agreement using hard-core sets. ETH Zurich, 2006, ISBN 3-86628-088-2, pp. 1-152 - [c8]Thomas Holenstein:
Pseudorandom Generators from One-Way Functions: A Simple Construction for Any Hardness. TCC 2006: 443-461 - [i4]Thomas Holenstein:
Parallel repetition: simplifications and the no-signaling case. CoRR abs/cs/0607139 (2006) - [i3]Thomas Holenstein, Renato Renner:
On the randomness of independent experiments. CoRR abs/cs/0608007 (2006) - 2005
- [c7]Thomas Holenstein, Renato Renner:
One-Way Secret-Key Agreement and Applications to Circuit Polarization and Immunization of Public-Key Encryption. CRYPTO 2005: 478-493 - [c6]Thomas Holenstein:
Key agreement from weak bit agreement. STOC 2005: 664-673 - 2004
- [c5]Thomas Holenstein, Ueli M. Maurer, Johan Sjödin:
Complete Classification of Bilinear Hard-Core Functions. CRYPTO 2004: 73-91 - [c4]Matthias Fitzi, Thomas Holenstein, Jürg Wullschleger:
Multi-party Computation with Hybrid Security. EUROCRYPT 2004: 419-438 - [i2]Thomas Holenstein:
Key Agreement from Weak Bit Agreement. Electron. Colloquium Comput. Complex. TR04 (2004) - 2003
- [c3]Matthias Fitzi, Martin Hirt, Thomas Holenstein, Jürg Wullschleger:
Two-Threshold Broadcast and Detectable Multi-party Computation. EUROCRYPT 2003: 51-67 - [c2]Ming C. Hao, Umeshwar Dayal, Daniel Cotting, Thomas Holenstein, Markus H. Gross:
Accelerated Force Computation for Physics-Based Information Visualization. VisSym 2003: 59-66 - 2002
- [c1]Matthias Fitzi, Daniel Gottesman, Martin Hirt, Thomas Holenstein, Adam D. Smith:
Detectable byzantine agreement secure against faulty majorities. PODC 2002: 118-126 - [i1]Matthias Fitzi, Martin Hirt, Thomas Holenstein, Jürg Wullschleger:
Extended Validity and Consistency in Byzantine Agreement. IACR Cryptol. ePrint Arch. 2002: 53 (2002)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-21 21:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: