Thomas Holenstein

	2011
31		Chandan K. Dubey, Thomas Holenstein: Approximating the Closest Vector Problem Using an Approximate Shortest Vector Oracle. APPROX-RANDOM 2011: 184-193
30		Boaz Barak, Moritz Hardt, Thomas Holenstein, David Steurer: Subsampling Mathematical Relaxations and Average-case Complexity. SODA 2011: 512-531
29		Thomas Holenstein, Robin Künzler, Stefano Tessaro: The equivalence of the random oracle model and the ideal cipher model, revisited. STOC 2011: 89-98
28		Thomas Holenstein, Grant Schoenebeck: General Hardness Amplification of Predicates and Puzzles - (Extended Abstract). TCC 2011: 19-36
27		Chandan K. Dubey, Thomas Holenstein: Approximating the Closest Vector Problem Using an Approximate Shortest Vector Oracle CoRR abs/1106.2619: (2011)
26		Thomas Holenstein, Renato Renner: On the Randomness of Independent Experiments. IEEE Transactions on Information Theory 57(4): 1865-1871 (2011)
	2010
25		Iftach Haitner, Thomas Holenstein, Omer Reingold, Salil P. Vadhan, Hoeteck Wee: Universal One-Way Hash Functions via Inaccessible Entropy. EUROCRYPT 2010: 616-637
24		Thomas Holenstein, Grant Schoenebeck: General Hardness Amplification of Predicates and Puzzles CoRR abs/1002.3534: (2010)
23		Thomas Holenstein, Robin Künzler, Stefano Tessaro: Equivalence of the Random Oracle Model and the Ideal Cipher Model, Revisited CoRR abs/1011.1264: (2010)
22		Iftach Haitner, Thomas Holenstein, Omer Reingold, Salil P. Vadhan, Hoeteck Wee: Universal One-Way Hash Functions via Inaccessible Entropy. IACR Cryptology ePrint Archive 2010: 120 (2010)
	2009
21		Iftach Haitner, Thomas Holenstein: On the (Im)Possibility of Key Dependent Encryption. TCC 2009: 202-219
20		Boaz Barak, Moritz Hardt, Thomas Holenstein, David Steurer: Subsampling Semidefinite Programs and Max-Cut on the Sphere CoRR abs/0911.5526: (2009)
19		Boaz Barak, Moritz Hardt, Thomas Holenstein, David Steurer: Subsampling Semidefinite Programs and Max-Cut on the Sphere. Electronic Colloquium on Computational Complexity (ECCC) 16: 129 (2009)
18		Thomas Holenstein: Parallel Repetition: Simplification and the No-Signaling Case. Theory of Computing 5(1): 141-172 (2009)
	2008
17		Liad Blumrosen, Thomas Holenstein: Posted prices vs. negotiations: an asymptotic analysis. ACM Conference on Electronic Commerce 2008: 49
16		Thomas Holenstein, Michael Mitzenmacher, Rina Panigrahy, Udi Wieder: Trace reconstruction with constant deletion probability and related results. SODA 2008: 389-398
15		Iftach Haitner, Thomas Holenstein: On the (Im)Possibility of Key Dependent Encryption. IACR Cryptology ePrint Archive 2008: 164 (2008)
	2007
14		Thomas Holenstein: Parallel repetition: simplifications and the no-signaling case. STOC 2007: 411-419
	2006
13		Thomas Holenstein: Pseudorandom Generators from One-Way Functions: A Simple Construction for Any Hardness. TCC 2006: 443-461
12		Thomas Holenstein: Parallel repetition: simplifications and the no-signaling case CoRR abs/cs/0607139: (2006)
11		Thomas Holenstein, Renato Renner: On the randomness of independent experiments CoRR abs/cs/0608007: (2006)
10		Thomas Holenstein: Strengthening key agreement using hard-core sets. ETH Zurich 2006: 1-152
	2005
9		Thomas Holenstein, Renato Renner: One-Way Secret-Key Agreement and Applications to Circuit Polarization and Immunization of Public-Key Encryption. CRYPTO 2005: 478-493
8		Thomas Holenstein: Key agreement from weak bit agreement. STOC 2005: 664-673
	2004
7		Thomas Holenstein, Ueli M. Maurer, Johan Sjödin: Complete Classification of Bilinear Hard-Core Functions. CRYPTO 2004: 73-91
6		Matthias Fitzi, Thomas Holenstein, Jürg Wullschleger: Multi-party Computation with Hybrid Security. EUROCRYPT 2004: 419-438
5		Thomas Holenstein: Key Agreement from Weak Bit Agreement Electronic Colloquium on Computational Complexity (ECCC)(102): (2004)
	2003
4		Matthias Fitzi, Martin Hirt, Thomas Holenstein, Jürg Wullschleger: Two-Threshold Broadcast and Detectable Multi-party Computation. EUROCRYPT 2003: 51-67
3		Ming C. Hao, Umeshwar Dayal, Daniel Cotting, Thomas Holenstein, Markus H. Gross: Accelerated Force Computation for Physics-Based Information Visualization. VisSym 2003
	2002
2		Matthias Fitzi, Daniel Gottesman, Martin Hirt, Thomas Holenstein, Adam Smith: Detectable byzantine agreement secure against faulty majorities. PODC 2002: 118-126
1		Matthias Fitzi, Martin Hirt, Thomas Holenstein, Jürg Wullschleger: Extended Validity and Consistency in Byzantine Agreement. IACR Cryptology ePrint Archive 2002: 53 (2002)

Coauthor Index

1	Boaz Barak	[19] [20] [30]
2	Liad Blumrosen	[17]
3	Daniel Cotting	[3]
4	Umeshwar Dayal	[3]
5	Chandan K. Dubey	[27] [31]
6	Matthias Fitzi	[1] [2] [4] [6]
7	Daniel Gottesman	[2]
8	Markus H. Gross	[3]
9	Iftach Haitner	[15] [21] [22] [25]
10	Ming C. Hao	[3]
11	Moritz Hardt	[19] [20] [30]
12	Martin Hirt	[1] [2] [4]
13	Robin Künzler	[23] [29]
14	Ueli Maurer (Ueli M. Maurer)	[7]
15	Michael Mitzenmacher	[16]
16	Rina Panigrahy	[16]
17	Omer Reingold	[22] [25]
18	Renato Renner	[9] [11] [26]
19	Grant Schoenebeck	[24] [28]
20	Johan Sjödin	[7]
21	Adam Smith (Adam D. Smith)	[2]
22	David Steurer	[19] [20] [30]
23	Stefano Tessaro	[23] [29]
24	Salil P. Vadhan	[22] [25]
25	Hoeteck Wee	[22] [25]
26	Udi Wieder	[16]
27	Jürg Wullschleger	[1] [4] [6]

Colors in the list of coauthors

Last update Thu May 31 18:55:10 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page