2009 |
18 | EE | Seung Geol Choi,
Dana Dachman-Soled,
Tal Malkin,
Hoeteck Wee:
Simple, Black-Box Constructions of Adaptively Secure Protocols.
TCC 2009: 387-402 |
17 | EE | Rafael Pass,
Hoeteck Wee:
Black-Box Constructions of Two-Party Protocols from One-Way Functions.
TCC 2009: 403-418 |
2008 |
16 | EE | 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 | EE | 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 | EE | 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 | EE | Hoeteck Wee:
Lower Bounds for Non-interactive Zero-Knowledge.
TCC 2007: 103-117 |
12 | EE | Hoeteck Wee:
One-Way Permutations, Interactive Hashing and Statistically Hiding Commitments.
TCC 2007: 419-433 |
2006 |
11 | EE | Hoeteck Wee:
Finding Pessiland.
TCC 2006: 429-442 |
2005 |
10 | EE | Cynthia Dwork,
Moni Naor,
Hoeteck Wee:
Pebbling and Proofs of Work.
CRYPTO 2005: 37-54 |
9 | EE | Hoeteck Wee:
On Round-Efficient Argument Systems.
ICALP 2005: 140-152 |
8 | EE | Andrej Bogdanov,
Hoeteck Wee:
More on Noncommutative Polynomial Identity Testing.
IEEE Conference on Computational Complexity 2005: 92-99 |
7 | EE | Hoeteck Wee:
On obfuscating point functions.
STOC 2005: 523-532 |
6 | EE | Henry Lin,
Luca Trevisan,
Hoeteck Wee:
On Hardness Amplification of One-Way Functions.
TCC 2005: 34-49 |
5 | EE | Shuchi Chawla,
Cynthia Dwork,
Frank McSherry,
Adam Smith,
Hoeteck Wee:
Toward Privacy in Public Databases.
TCC 2005: 363-385 |
2004 |
4 | EE | Andrej Bogdanov,
Hoeteck Wee:
A Stateful Implementation of a Random Function Supporting Parity Queries over Hypercubes.
APPROX-RANDOM 2004: 298-309 |
3 | EE | Hoeteck Wee:
On Pseudoentropy versus Compressibility.
IEEE Conference on Computational Complexity 2004: 29-41 |
2 | EE | 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 | EE | Hoeteck Wee:
Compressibility Lower Bounds in Oracle Settings
Electronic Colloquium on Computational Complexity (ECCC)(065): (2003) |