| 2010 |
17 | | Thomas Holenstein,
Grant Schoenebeck:
General Hardness Amplification of Predicates and Puzzles
CoRR abs/1002.3534: (2010) |
| 2009 |
16 | | Iftach Haitner,
Thomas Holenstein:
On the (Im)Possibility of Key Dependent Encryption.
TCC 2009: 202-219 |
15 | | Boaz Barak,
Moritz Hardt,
Thomas Holenstein,
David Steurer:
Subsampling Semidefinite Programs and Max-Cut on the Sphere
CoRR abs/0911.5526: (2009) |
| 2008 |
14 | | Liad Blumrosen,
Thomas Holenstein:
Posted prices vs. negotiations: an asymptotic analysis.
ACM Conference on Electronic Commerce 2008: 49 |
13 | | Thomas Holenstein,
Michael Mitzenmacher,
Rina Panigrahy,
Udi Wieder:
Trace reconstruction with constant deletion probability and related results.
SODA 2008: 389-398 |
| 2007 |
12 | | Thomas Holenstein:
Parallel repetition: simplifications and the no-signaling case.
STOC 2007: 411-419 |
| 2006 |
11 | | Thomas Holenstein:
Pseudorandom Generators from One-Way Functions: A Simple Construction for Any Hardness.
TCC 2006: 443-461 |
10 | | Thomas Holenstein:
Parallel repetition: simplifications and the no-signaling case
CoRR abs/cs/0607139: (2006) |
9 | | Thomas Holenstein,
Renato Renner:
On the randomness of independent experiments
CoRR abs/cs/0608007: (2006) |
| 2005 |
8 | | Thomas Holenstein,
Renato Renner:
One-Way Secret-Key Agreement and Applications to Circuit Polarization and Immunization of Public-Key Encryption.
CRYPTO 2005: 478-493 |
7 | | Thomas Holenstein:
Key agreement from weak bit agreement.
STOC 2005: 664-673 |
| 2004 |
6 | | Thomas Holenstein,
Ueli M. Maurer,
Johan Sjödin:
Complete Classification of Bilinear Hard-Core Functions.
CRYPTO 2004: 73-91 |
5 | | Matthias Fitzi,
Thomas Holenstein,
Jürg Wullschleger:
Multi-party Computation with Hybrid Security.
EUROCRYPT 2004: 419-438 |
4 | | Thomas Holenstein:
Key Agreement from Weak Bit Agreement
Electronic Colloquium on Computational Complexity (ECCC)(102): (2004) |
| 2003 |
3 | | Matthias Fitzi,
Martin Hirt,
Thomas Holenstein,
Jürg Wullschleger:
Two-Threshold Broadcast and Detectable Multi-party Computation.
EUROCRYPT 2003: 51-67 |
2 | | Ming C. Hao,
Umeshwar Dayal,
Daniel Cotting,
Thomas Holenstein,
Markus H. Gross:
Accelerated Force Computation for Physics-Based Information Visualization.
VisSym 2003 |
| 2002 |
1 | | Matthias Fitzi,
Daniel Gottesman,
Martin Hirt,
Thomas Holenstein,
Adam Smith:
Detectable byzantine agreement secure against faulty majorities.
PODC 2002: 118-126 |