Hoeteck Wee

Carmit Hazay, Adriana López-Alt, Hoeteck Wee, Daniel Wichs: Leakage-Resilient Cryptography from Minimal Assumptions. EUROCRYPT 2013: 160-176

S. Dov Gordon, Tal Malkin, Mike Rosulek, Hoeteck Wee: Multi-party Computation of Polynomials and Branching Programs without Simultaneous Interaction. EUROCRYPT 2013: 575-591

Seung Geol Choi, Jonathan Katz, Hoeteck Wee, Hong-Sheng Zhou: Efficient, Adaptively Secure, and Composable Oblivious Transfer with a Single, Global CRS. Public Key Cryptography 2013: 73-88

Seung Geol Choi, Hoeteck Wee: Lossy trapdoor functions from homomorphic reproducible encryption. Inf. Process. Lett. 112(20): 794-798 (2012)

Sergey Gorbunov, Vinod Vaikuntanathan, Hoeteck Wee: Functional Encryption with Bounded Collusions via Multi-party Computation. CRYPTO 2012: 162-179

Hoeteck Wee: Dual Projective Hashing and Its Applications - Lossy Trapdoor Functions and More. EUROCRYPT 2012: 246-262

Jie Chen, Hoon Wei Lim, San Ling, Huaxiong Wang, Hoeteck Wee: Shorter IBE and Signatures via Asymmetric Pairings. Pairing 2012: 122-140

Hoeteck Wee: Public Key Encryption against Related Key Attacks. Public Key Cryptography 2012: 262-279

Shweta Agrawal, Xavier Boyen, Vinod Vaikuntanathan, Panagiotis Voulgaris, Hoeteck Wee: Functional Encryption for Threshold Functions (or Fuzzy IBE) from Lattices. Public Key Cryptography 2012: 280-297

Ran Canetti, Dana Dachman-Soled, Vinod Vaikuntanathan, Hoeteck Wee: Efficient Password Authenticated Key Exchange via Oblivious Transfer. Public Key Cryptography 2012: 449-466

Jie Chen, Hoon Wei Lim, San Ling, Huaxiong Wang, Hoeteck Wee: Shorter IBE and Signatures via Asymmetric Pairings. IACR Cryptology ePrint Archive 2012: 224 (2012)

Shweta Agrawal, Sergey Gorbunov, Vinod Vaikuntanathan, Hoeteck Wee: Functional Encryption: New Perspectives and Lower Bounds. IACR Cryptology ePrint Archive 2012: 468 (2012)

Sergey Gorbunov, Vinod Vaikuntanathan, Hoeteck Wee: Functional Encryption with Bounded Collusions via Multi-Party Computation. IACR Cryptology ePrint Archive 2012: 521 (2012)

Carmit Hazay, Adriana López-Alt, Hoeteck Wee, Daniel Wichs: Leakage-Resilient Cryptography from Minimal Assumptions. IACR Cryptology ePrint Archive 2012: 604 (2012)

Seung Geol Choi, Jonathan Katz, Hoeteck Wee, Hong-Sheng Zhou: Efficient, Adaptively Secure, and Composable Oblivious Transfer with a Single, Global CRS. IACR Cryptology ePrint Archive 2012: 700 (2012)

Hoeteck Wee: Threshold and Revocation Cryptosystems via Extractable Hash Proofs. EUROCRYPT 2011: 589-609

Shweta Agrawal, Xavier Boyen, Vinod Vaikuntanathan, Panagiotis Voulgaris, Hoeteck Wee: Fuzzy Identity Based Encryption from Lattices. IACR Cryptology ePrint Archive 2011: 414 (2011)

Hoeteck Wee: Efficient Chosen-Ciphertext Security via Extractable Hash Proofs. CRYPTO 2010: 314-332

Serge Fehr, Dennis Hofheinz, Eike Kiltz, Hoeteck Wee: Encryption Schemes Secure against Chosen-Ciphertext Selective Opening Attacks. EUROCRYPT 2010: 381-402

Iftach Haitner, Thomas Holenstein, Omer Reingold, Salil P. Vadhan, Hoeteck Wee: Universal One-Way Hash Functions via Inaccessible Entropy. EUROCRYPT 2010: 616-637

Rafael Pass, Hoeteck Wee: Constant-Round Non-malleable Commitments from Sub-exponential One-Way Functions. EUROCRYPT 2010: 638-655

Hoeteck Wee: Black-Box, Round-Efficient Secure Computation via Non-malleability Amplification. FOCS 2010: 531-540

S. Dov Gordon, Hoeteck Wee, David Xiao, Arkady Yerukhimovich: On the Round Complexity of Zero-Knowledge Proofs Based on One-Way Permutations. LATINCRYPT 2010: 189-204

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)

Dana Dachman-Soled, Homin K. Lee, Tal Malkin, Rocco A. Servedio, Andrew Wan, Hoeteck Wee: Optimal Cryptographic Hardness of Learning Monotone Functions. Theory of Computing 5(1): 257-282 (2009)

Seung Geol Choi, Dana Dachman-Soled, Tal Malkin, Hoeteck Wee: Improved Non-committing Encryption with Applications to Adaptively Secure Protocols. ASIACRYPT 2009: 287-302

Hoeteck Wee: Zero Knowledge in the Random Oracle Model, Revisited. ASIACRYPT 2009: 417-434

Iftach Haitner, Omer Reingold, Salil P. Vadhan, Hoeteck Wee: Inaccessible entropy. STOC 2009: 611-620

Seung Geol Choi, Dana Dachman-Soled, Tal Malkin, Hoeteck Wee: Simple, Black-Box Constructions of Adaptively Secure Protocols. TCC 2009: 387-402

Rafael Pass, Hoeteck Wee: Black-Box Constructions of Two-Party Protocols from One-Way Functions. TCC 2009: 403-418

Iftach Haitner, Omer Reingold, Salil P. Vadhan, Hoeteck Wee: Inaccessible Entropy. Electronic Colloquium on Computational Complexity (ECCC) 16: 45 (2009)

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

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

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

Hoeteck Wee: Lower Bounds for Non-interactive Zero-Knowledge. TCC 2007: 103-117

Hoeteck Wee: One-Way Permutations, Interactive Hashing and Statistically Hiding Commitments. TCC 2007: 419-433

Hoeteck Wee: Finding Pessiland. TCC 2006: 429-442

Andrej Bogdanov, Hoeteck Wee: More on Noncommutative Polynomial Identity Testing. IEEE Conference on Computational Complexity 2005: 92-99

Cynthia Dwork, Moni Naor, Hoeteck Wee: Pebbling and Proofs of Work. CRYPTO 2005: 37-54

Hoeteck Wee: On Round-Efficient Argument Systems. ICALP 2005: 140-152

Hoeteck Wee: On obfuscating point functions. STOC 2005: 523-532

Henry C. Lin, Luca Trevisan, Hoeteck Wee: On Hardness Amplification of One-Way Functions. TCC 2005: 34-49

Shuchi Chawla, Cynthia Dwork, Frank McSherry, Adam Smith, Hoeteck Wee: Toward Privacy in Public Databases. TCC 2005: 363-385

Hoeteck Wee: On Obfuscating Point Functions. IACR Cryptology ePrint Archive 2005: 1 (2005)

Andrej Bogdanov, Hoeteck Wee: A Stateful Implementation of a Random Function Supporting Parity Queries over Hypercubes. APPROX-RANDOM 2004: 298-309

Hoeteck Wee: On Pseudoentropy versus Compressibility. IEEE Conference on Computational Complexity 2004: 29-41

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

Hoeteck Wee: Compressibility Lower Bounds in Oracle Settings. Electronic Colloquium on Computational Complexity (ECCC)(065) (2003)