Hoeteck Wee

	2009
21		Seung Geol Choi, Dana Dachman-Soled, Tal Malkin, Hoeteck Wee: Improved Non-committing Encryption with Applications to Adaptively Secure Protocols. ASIACRYPT 2009: 287-302
20		Hoeteck Wee: Zero Knowledge in the Random Oracle Model, Revisited. ASIACRYPT 2009: 417-434
19		Iftach Haitner, Omer Reingold, Salil P. Vadhan, Hoeteck Wee: Inaccessible entropy. STOC 2009: 611-620
18		Seung Geol Choi, Dana Dachman-Soled, Tal Malkin, Hoeteck Wee: Simple, Black-Box Constructions of Adaptively Secure Protocols. TCC 2009: 387-402
17		Rafael Pass, Hoeteck Wee: Black-Box Constructions of Two-Party Protocols from One-Way Functions. TCC 2009: 403-418
	2008
16		Dana Dachman-Soled, Homin K. Lee, Tal Malkin, Rocco A. Servedio, Andrew Wan, Hoeteck Wee: Optimal Cryptographic Hardness of Learning Monotone Functions. ICALP (1) 2008: 36-47
15		Seung Geol Choi, Dana Dachman-Soled, Tal Malkin, Hoeteck Wee: Black-Box Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One. TCC 2008: 427-444
	2007
14		Ran Canetti, Ronald L. Rivest, Madhu Sudan, Luca Trevisan, Salil P. Vadhan, Hoeteck Wee: Amplifying Collision Resistance: A Complexity-Theoretic Treatment. CRYPTO 2007: 264-283
13		Hoeteck Wee: Lower Bounds for Non-interactive Zero-Knowledge. TCC 2007: 103-117
12		Hoeteck Wee: One-Way Permutations, Interactive Hashing and Statistically Hiding Commitments. TCC 2007: 419-433
	2006
11		Hoeteck Wee: Finding Pessiland. TCC 2006: 429-442
	2005
10		Cynthia Dwork, Moni Naor, Hoeteck Wee: Pebbling and Proofs of Work. CRYPTO 2005: 37-54
9		Hoeteck Wee: On Round-Efficient Argument Systems. ICALP 2005: 140-152
8		Andrej Bogdanov, Hoeteck Wee: More on Noncommutative Polynomial Identity Testing. IEEE Conference on Computational Complexity 2005: 92-99
7		Hoeteck Wee: On obfuscating point functions. STOC 2005: 523-532
6		Henry C. Lin, Luca Trevisan, Hoeteck Wee: On Hardness Amplification of One-Way Functions. TCC 2005: 34-49
5		Shuchi Chawla, Cynthia Dwork, Frank McSherry, Adam Smith, Hoeteck Wee: Toward Privacy in Public Databases. TCC 2005: 363-385
	2004
4		Andrej Bogdanov, Hoeteck Wee: A Stateful Implementation of a Random Function Supporting Parity Queries over Hypercubes. APPROX-RANDOM 2004: 298-309
3		Hoeteck Wee: On Pseudoentropy versus Compressibility. IEEE Conference on Computational Complexity 2004: 29-41
2		Byung-Gon Chun, Kamalika Chaudhuri, Hoeteck Wee, Marco Barreno, Christos H. Papadimitriou, John Kubiatowicz: Selfish caching in distributed systems: a game-theoretic analysis. PODC 2004: 21-30
	2003
1		Hoeteck Wee: Compressibility Lower Bounds in Oracle Settings Electronic Colloquium on Computational Complexity (ECCC)(065): (2003)

Coauthor Index

1	Marco Barreno	[2]
2	Andrej Bogdanov	[4] [8]
3	Ran Canetti	[14]
4	Kamalika Chaudhuri	[2]
5	Shuchi Chawla	[5]
6	Seung Geol Choi	[15] [18] [21]
7	Byung-Gon Chun	[2]
8	Dana Dachman-Soled	[15] [16] [18] [21]
9	Cynthia Dwork	[5] [10]
10	Iftach Haitner	[19]
11	John Kubiatowicz	[2]
12	Homin K. Lee	[16]
13	Henry C. Lin	[6]
14	Tal Malkin	[15] [16] [18] [21]
15	Frank McSherry	[5]
16	Moni Naor	[10]
17	Christos H. Papadimitriou	[2]
18	Rafael Pass	[17]
19	Omer Reingold	[19]
20	Ronald L. Rivest	[14]
21	Rocco A. Servedio	[16]
22	Adam Smith	[5]
23	Madhu Sudan	[14]
24	Luca Trevisan	[6] [14]
25	Salil P. Vadhan	[14] [19]
26	Andrew Wan	[16]